CS1201-Data Structures

KINGS COLLEGE OF ENGINEERING, PUNALKULAM

Department of Computer Science & Engineering
Question Bank
Subject Code / Name : CS 1201 / Data Structures
Year / Sem : II / III

UNIT – I FUNDAMENTALS OF ALGORITHMS

1. Define Algorithm.
2. Define space complexity.
3. Define time complexity.
4. Define efficiency of an algorithm.
5. How will calculate the space complexity of an algorithm?
6. How will calculate the time complexity of an algorithm?
7. Define Big “Oh” notation.
8. Define Big “Theta” notation.
9. Define Big Omega notation.
10. Define Amortized analysis.
11. List out the limitations of asymptotic notations.
12. What are the characteristics of an algorithm?
13. Define Potential method.
14. What are the methods available for amortized analysis?
15. Why we go for Amortized Analysis?
16. List out the uses of an algorithm.

PART – B
1. a. Explain the characteristics of an algorithm with an example (8)
b. Explain the worst case and average case analysis of insertion sort (8)
2. Explain about asymptotic notations in detail (16)
3. a. Derive time complexity for matrix addition algorithm (8)
b. Explain about time complexity of an algorithm (8)
4. Explain amortized analysis of an algorithm in detail. (16)
5. a. Discuss in detail about performance analysis of algorithm. (12)
b. Write an algorithm for swapping of two numbers. (4)

Kings College of Engineering 1

 CS1201-Data Structures

6. a. Calculate the time complexity for Fibonacci series algorithm (8)

b. Explain about space complexity of an algorithm (8)

UNIT – II FUNDAMENTALS OF DATA STRUCTURES

PART – A (2 Marks)
1. Define ADT.
2. Define Data Structures.
3. List out the operations of the list and stack.
4. What is deque?
5. Define push & pop in a stack.
6. Convert the infix expression a*b/c+d to its equivalent postfix expression.
7. List out the applications of stack.
8. Define circular queue.
9. What are the different types of Linked list?
10. List out the Variations of list and queue.
11. Define priority Queue.
12. List the advantages of circular linked list.
13. What is recursion?
14. Define List and Stack.
15. What is Dequeue?
16. What is Enqueue?
17. What are the applications of lists?
18. What is stack pointer?
19. List out the exception conditions in a stack?
20. Why we go for infix to postfix conversions?
21. Define Queue and list out its operations.
22. What are the applications of Queue?

PART – B
1. (a) Explain the algorithm for inserting and deleting an element in a list (8)
(b) Explain how stack is used to convert the following expression into
postfix form a * ( b + c ^ d ) – e ^ f * ( g / h ) (8)
2. (a) Explain how array is represented in memory as row major & column
major method (8)

Kings College of Engineering 2

 CS1201-Data Structures

(b) Explain the implementation of Structures with example. (8)

3. (a) Explain the algorithms for queue operations. (8)
(b) Explain the algorithm for conversion of infix to postfix expression (8)
4. Explain how queues can be implemented using Arrays. (16)
5. (a) Evaluate the given postfix expression using stack
4,5,4,^,+,*,2,2,^,9,3,/,*,−. (8)
(b) Explain the algorithm for inserting & deleting an element in a stack (8)
6. (a) Explain the algorithm for evaluation of a postfix expression. (8)
(b) Explain the operation of searching a node in a list with an algorithm (8)

UNIT – III TREES

PART – A (2 Marks)

1. Define tree.
2. List out the ways of representing a Tree.
3. Define Binary tree.
4. What are the types of binary tree?
5. How to declare a Binary Tree?
6. What are the different binary tree traversal techniques?
7. Differentiate General Tree with Binary Tree?
8. Differentiate Full Binary Tree and Complete Binary Tree?
9. Differentiate Binary Search Tree and Binary AVL Tree?
10. What is a root node?
11. What is a leaf node?
12. What is node?
13. Define path in a tree.
14. What are siblings?
15. What do you mean by Degree of a node?
16. Define length of the path in a tree.
17. Differentiate Depth and Height of a tree?
18. What is level of a tree?
19. What is Expression Tree?
20. What are the basic operations performed in a binary search tree?
21. Define sorting.

Kings College of Engineering 3

 CS1201-Data Structures

22. What are the factors to be considered while choosing a sorting technique?
23. List out some of the stable and unstable sorting techniques.
24. Mention the limitations of insertion sort.
25. Differentiate Internal Sorting and External Sorting.
26. Define hash function.
27. Define hashing.

PART – B
1. (a) Explain the storage representation for tree. (8)
(b) Explain the In order tree traversal algorithm with example (8)
2. (a) Explain the insertion sorting algorithm with example (8)
(b) Explain the quick sort algorithm with example (8)
3. (a) Explain how binary tree is represented using linked list (8)
(b) Explain post order tree traversal algorithm with example (8)
4. Explain with suitable example the binary search algorithm (16)
5. (a) Explain pre order tree traversal algorithm with example (8)
(b) Explain the merge sort algorithm with example (8)
6. (a) Explain the shell sort algorithm with example (8)
(b) Explain the bucket sort algorithm with example (8)
7. Construct an expression tree for the expression A+(B-C)*D+(E*F). (16)
8.

UNIT – IV GRAPHS AND THEIR APPLICATIONS

PART – A (2 Marks)
1. Define graph.
2. Define undirected graph.
3. Define directed graph.
4. Define weighted graph.
5. Differentiate Connected graph and complete graph.
6. Differentiate Strongly connected and weakly connected graph.
7. Define a path in a graph.
8. What is length of path in a graph?

Kings College of Engineering 4

 CS1201-Data Structures

9. Define cycle in a graph.

10. Differentiate cyclic and acyclic graph.
11. What is biconnected graph?
12. Define Minimum Spanning Tree.
13. What is Transitive Closure? How it is implemented?
14. What is a connected component?
15. Define Shortest Path Problem of a graph.
10. What is the use of modified Warshall’s Algorithm?
11. What is the use of Dijkstra’s Algorithm?
12. How can you minimum spanning trees from graphs?
13. State the different ways of traversing a graph.

PART – B
1. Explain the Dijikstra’s Algorithm for finding the shortest path and
find the shortest path from v1 to v6. (16)

2. (a) Explain the Warshall’s algorithm. (8)

(b) Explain shortest path algorithm. (8)
3. Explain depth-First traversal and breadth-first traversal (16)
4. Explain prim’s algorithm for finding minimum spanning tree for the
following graph. (16)

Kings College of Engineering 5

 CS1201-Data Structures

5. (a) Explain an Application of Scheduling. (8)

(b) Explain Kruskal’s Algorithm for finding minimum spanning tree

for the following graph. (8)

6. What is meant by flow problem? Explain with an example. (16)

UNIT –V STORAGE MANAGEMENT

PART – A (2 Marks)
1. What are types of automatic list management?
2. How the reference count method works?

Kings College of Engineering 6

 CS1201-Data Structures

3. What is mean by garbage collection?

4. Explain the term compaction.
5. Define first fit.
6. Define Breadth First Traversal.
7. How the garbage collection is done in automatic list management?
8. List the disadvantage of reference count method.
PART – B
1. Explain the linked list Representation of a list with an example. (16)
2. Explain Reference Count Method with an example. (16)
3. Explain Garbage collection with their variations. (16)
4. Explain the Dynamic Memory Management with necessary methods.(16)

********************************************************

Kings College of Engineering 7