important quetions For Data Structures unit Wise

UNIT-I

• Algorithm analysis and complexities
• Design methodologies and implementation of recursion
• C programs using recursion( GCD,FACTORIAL,TOWERS OF HANOI)
• List Search( Binary and Linear)

UNIT-II

• Heap sort
• bubble sort
• quick sort
• merge sort.

UNIT-III

• Priority queue implementation
• applications of stack
•  representation of stack and queue using arrays and linked list
•  ADT operations of stack and queue

UNIT-V

• What is binary tree ? explain about representation of binary tree using arrays and linked list.
• Explain different operations of binary tree.
• Binary Tree travels( In-order,preorder,post order).

• Graph representation using adjacency matrix and linked list( adjacency list).
•  Depth first and Breadth first search algorithms and examples.
• Dijkstra's shortest path algorithm with an examples.Does the algorithm work for paths of negative values? explain.
• Prism algorithms for the following tree( following fig updated later)
• Warshall's algorithms and how do you find the minimum spanning tree for a tree