# Data Structures and Algorithms - Unit Wise Questions

Unit 1: Background and Concept of Data Structures
1 Questions

5 marks | Asked in Model Question

Unit 2: Algorithms
0 Questions
Unit 3: Stack
1 Questions

1. Differentiate stack with queue? Trace an algorithm for converting infix expression to postfix for the following infix expression.

(A+B)*(C\$(D-E)+F)-G

10 marks | Asked in Model Question

Unit 4: Queue
1 Questions

5. Why circular queue is advantageous over linear queue? Write algorithm for enqueue and isfull operation for circular queue.

5 marks | Asked in Model Question

Unit 5: Recursion
1 Questions

6. Define recursive algorithm. Write recursive TOH algorithm?

5 marks | Asked in Model Question

Unit 6: List
2 Questions

2. What are the advantages and disadvantages of linked list over an array? Discuss algorithms for inserting a node at front position of the linked list and deleting its last item in singly linked list.

10 marks | Asked in Model Question

10. What is a circular linked list? How can you traverse all nodes in a singly linked list?

5 marks | Asked in Model Question

Unit 7: Tree
2 Questions

8. What is a Binary Search Tree? Write an algorithm for searching an item in a binary search tree.

5 marks | Asked in Model Question

9. What are the different traversing methods in a binary tree? Explain with a clear example

5 marks | Asked in Model Question

Unit 8: Sorting
1 Questions

3. Define sorting problem. Trace quick sort algorithm for the following given list of data and also discuss about its time complexity.

78   45   23  89  65   12   90   33

10 marks | Asked in Model Question

Unit 9: Searching
1 Questions

7. Is hashing better than binary search algorithm? Give reasons. Define any two collision resolution techniques.

5 marks | Asked in Model Question

Unit 10: Graph
2 Questions

11. Trace Prim’s Algorithm to find minimum spanning tree for the following graph.

5 marks | Asked in Model Question

12. Write short notes on: (2 × 2.5 = 5)

a. Analysis of Algorithm

b. Representation of Graph

5 marks | Asked in Model Question