CS1201-Data Structures KINGS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Question Bank Subject Code
/ Name Year / Sem : CS 1201 / Data Structures : II / III UNIT – I FUNDAMENTALS OF ALGORITHMS Part – A (2 Marks) 1. Define Algorithm. 2. Define efficiency of an algorithm. 3. How will calculate the space requirement of an algorithm? 4. How will calculate the time taken by a program? 5. Define Big “Oh” notation. 6. Define Big Theta notation 7. Define Amortized analysis. 8. List out the limitation of asymptotic notation. 9. List common running times for algorithms based on big-oh notations . 10. Define Potential method. 11. What are the methods available for amortized analysis ? 12. Define amortized test. 13. Define dynamic table. 14. What are the properties to be considered in table contraction? PART – B 1. a. Explain briefly about analysis of algorithm b. Derive worst case and average case analysis of insertion sort 2. Explain in detail about asymptotic notation 3. Derive time complexity for matrix addition 4. Explain amortized analysis along with their methods. 5. Explain Performance Analysis. UNIT – II FUNDAMENTALS OF DATA STRUCTURES PART – A (2 Marks) 1. Define ADT. Kings College of Engineering 1 (8) (8) (16) (16) (16) (16)
What are the types of binary tree? 4. Define Deque. Define Binary tree. Explain how queues can be implemented using Arrays. Define tree. (a) Explain the various types of arrays and their manipulation of data using c with example. 13. 5. 9. PART – B 1. 5. 2. List out the operations of the list ADT. (b) Write a C program to implement push operation in stack. List out the applications of stack. 7. What are the different types of Linked list? 10. List out the applications of queue. (b) Define structure and union and their implementation with example. 11. Define Structure. 3. 6. List the advantages of circular linked list. Define arrays. (16) (16) (16) (8) (8) (16) (8) (8) (16)
UNIT – III TREES PART – A (2 Marks) 1. Define circular queue. 4. What are the different binary tree traversal techniques? Kings College of Engineering 2
. Define priority Queue. Write a Program in C to create an empty stack and to push an element into it. Convert the infix expression a*b/c+d to its equivalent postfix expression. 2.CS1201-Data Structures 2. 3. 3. (a) Write a ‘C’ program to add two polynomials. 12. Define push & pop in a stack. 8. 4. 6. Explain the various applications of stacks. Write a program in C to return the position of an element X in a Linked List L.
7. Define a path in a graph. Define sorting. Define undirected graph. 13. (b) State & explain the algorithm to perform Insertion Sort. Define a binary search tree. 12. Construct an expression tree for the expression A+(B-C)*D+(E*F). Kings College of Engineering 3 (16) (16) (16) (16) (8) (8) (16) (16)
. What are the factors to be considered while choosing a sorting technique? 10. 3. UNIT – IV GRAPHS AND THEIR APPLICATIONS PART – A (2 Marks) 1. 2. What are the basic operations performed in a binary search tree? 8. Define a graph. 3. Write a recursive algorithm for binary tree traversal with an Example 6. Write a C program to perform Merge sort & analyze time complexity of the algorithm. Define Searching. 4. 14. 4. PART – B 1. (16) 2. Define directed graph. (a) Write a function to delete the minimum element from a binary heap.CS1201-Data Structures 5. Define hash function. Write a C program to perform Quick sort & analyze time complexity of the algorithm. Write a program in C to create an empty binary search tree & search for an element X in it. List out some of the stable and unstable sorting techniques. Define hashing. 5. Write an Huffman coding with example 7. 9. What are the tasks performed while traversing a binary tree? 6. Mention the limitations of insertion sort. 11. Explain in detail about Open Addressing. 8.
(8) (8) (16) (16)
Explain the Dijikstra’s Algorithm for finding the shortest path and find the shortest path from v1 to v6. 7. What is a connected component? 9. (16)
2. Define Minimum Spanning Tree.
Kings College of Engineering
. What is Transitive Closure? How it is implemented? 8. 10. 4. PART – B
1. (b) Explain shortest path algorithm. What is the use of modified Warshall’s Algorithm? 11. Explain depth-First traversal and breadth-first traversal Explain prim’s algorithm for finding minimum spanning tree for the following graph. Define Shortest Path Problem of a graph. What is the use of Dijkstra’s Algorithm? 12.
(a) Explain the Warshall’s algorithm. 6. How can you minimum spanning trees from graphs? 13. Define weighted graph.CS1201-Data Structures 5. State the different ways of traversing a graph.
What is meant by flow problem? Explain with an example.CS1201-Data Structures
5. What are types of automatic list management? 2. How the reference count method works?
Kings College of Engineering
. (b) Explain Kruskal’s Algorithm for finding minimum spanning tree for the following graph.
(a) Explain an Application of Scheduling.
6. UNIT –V STORAGE MANAGEMENT PART – A (2 Marks)
(16) (16) (16)
4. 6. What is mean by garbage collection? 4.(16) ********************************************************
Kings College of Engineering
. Explain the term compaction. How the garbage collection is done in automatic list management? 8. Define first fit. 5. Define Breadth First Traversal. Explain the linked list Representation of a list with an example. 7. Explain Reference Count Method with an example.CS1201-Data Structures 3. List the disadvantage of reference count method. 3. 2. Explain the Dynamic Memory Management with necessary methods. Explain Garbage collection with their variations. PART – B 1.