Important Question .

Important Questions –(DATA STRUCTURE -207)
UNIT-I
1. What is Data Structure and Types of Data Structure?

2. Why do we need Algorithms? Types of Algorithms.
3. What do you mean by Threaded Binary Tree?
4. Explain Binary Search Tree With Suitable Example.
5. Discuss AVL Search Tree with Suitable Example.
6. Describe Insertion and Deletion in AVL Tree.
7. Difference Between BST and AVL Tree.
8. What is Mway search tree? Discuss searching, insertion and deletion in an m way search
tree.
9. Discuss Huffman Algorithm.
10. Difference between General tree and Binary tree
11. Comparsion Between B-Tree and B+Tree.


UNIT-II
12. Explain the Type of graphs.
13. Difference Between Adjacency matrix and Adjacency list.
14. Discuss Floyd-Warshall Algorithm With suitable example.
15. Dijkstra algorithm for shortest path.
16. Why We need Graph traversal?
17. Difference between BFS and DFS.
18. Discuss Topological Sorting.




UNIT -III
19. What is Sorting. why sorting is important?
20. Explain the Quick sort. Write the complexity with suitable Examples.
21. What is Merge sort and write the complexity of merge sort with Examples.
22. Difference Between Quick sort and Radix sort.
23. Comparsion Between Binary and linear search.
24. Difference Between Searching and Sorting algorithms and Time complexity of
Algorithms.