Scribd
Upload
26 views

Comprehensive Assignment Questions (2019-20) Subject Code:19MCA2202 Subject Title: Data Structures

The document contains 18 questions related to data structures. Each question has 3 parts related to different data structures concepts like linked lists, stacks, queues, trees, graphs, hashing etc. Students are asked to write algorithms, explain concepts and develop C programs for operations on various data structures like linked lists, trees, stacks, queues etc. The questions aim to evaluate students' understanding of key data structures and their implementation through programming.

Uploaded by

Rajesh Kurapati
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

Comprehensive Assignment Questions (2019-20) Subject Code:19MCA2202 Subject Title: Data Structures

The document contains 18 questions related to data structures. Each question has 3 parts related to different data structures concepts like linked lists, stacks, queues, trees, graphs, hashing etc. Students are asked to write algorithms, explain concepts and develop C programs for operations on various data structures like linked lists, trees, stacks, queues etc. The questions aim to evaluate students' understanding of key data structures and their implementation through programming.

Uploaded by

Rajesh Kurapati
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Comprehensive Assignment Questions(2019-20)

Subject Code :19MCA2202


Subject Title : Data Structures

1. a) Discuss Performance Analysis in detail with examples.


b) Demonstrate with an example how elements of a single list can be reversed and
develop C program to reverse single linked list. 1,38,57

2. a)Explain about single linked list and double linked list. Also discuss about advantages
and disadvantages of double linked list over single linked list.
b) Illustrate how two polynomials can be added and multiplied using linked list.
Develop C program to perform the following operations on two polynomials using
linked list. i) Addition ii)Multiplication 2, 36, 56

3. a)Differentiate single linked list, double linked list and circular linked list.
b)Explain the concept of sparse matrices in detail and write a C program to print
sparse matrix using linked list.
c) Develop a C program to sort the elements of single linked list using functions.
3, 34, 55

4. a) Explain Towers of Hanoi problem by implementing stacks and write a C program


for Towers of Hanoi problem.
b) Write an algorithm for postfix expression and evaluate following postfix expression
43*67+5-+
c) Write a program to construct an expression tree. 4, 33, 54

5. a) Discuss about single linked list in detail and write a C program to concatenate 2
linked lists.
b) Discuss about circular linked list. Also discuss about any two applications of
circular linked list. 5, 32, 52

6. a)Write non-recursive algorithms for pre-order, post-order and inorder traversals of


binary tree.
b)Explain Quick Sort algorithm and demonstrate with example. 6, 31, 51

7. a)Discuss about different types of Queues and explain with examples.


b) Discuss and demonstrate any two applications of Queues. 7, 27, 50
8.a)What is Deque?Explain in detail about the characteristics and operations of Deque.
b) Develop the algorithms for the insertion and deletion operations at various end of
Deque.
c) Explain the working of Selection sort algorithm by demonstrating with example.
8, 26, 49

9. a)Write about Deques and write a C program to perform operations on deques


using arrays and linked lists.
b)What is insertion sort ?Explain how insertion sort works with a list of
elements.Analyze various cases of time complexities. 9, 25, 48

10. a)Write a C program to implement operations on Double Linked List.


b) Discuss about priority queues and demonstrate any two applications of priority
queues 10, 24, 47

11. a)Write about Priority Queues and write a C program to perform operations on
Priority Queues using arrays and linked lists.
b) Compare and contrast the efficiency of Quick sort and Merge Sort algorithms by
demonstrating with example. 11, 23, 46

12. a.)Discuss about AVL-trees in detail.


b) Explain Quick Sort algorithm by demonstratation and analyze various cases of time
complexities. 12, 22, 45

13. a)Explain and demonstrate the following trees with examples in detail
i) AVL Tree ii)Red-Black Tree iii) Spanning Tree
b) Explain about properties and representations of binary tree. 13, 21, 44

14. a)Explain about Prim’s algorithm and write a C program to implement Prim’s
algorithm..
b)What is a B-Tree? What are the rules and reasons for using a B-Tree?Explain the
insertion and deletions operations of B-Tree. 14, 20, 43

15. a)Explain the concept of hashing and also various collision resolution techniques.
b)Discuss about various applications of graph. 15, 19, 42
16.a) Write a program to create binary tree using arrays. 6, 41, 59
b) Explain how Heap sort works by demonstrating with example.

17.a) What is an Expression Tree? Explain the construction of an expression tree with an
example.
b) What is a Priority Queue? Explain its operations by illustrating with example.
17, 40, 60

18. a)Explain about Kruskal’s algorithm and write a C program to implement Kruskal’s
algorithm.
b)Discuss about applications of Stacks. 18, 39, 61, 62

You might also like