Data Structures - Short, Long, and Very Long Answer Questions
Short Answer Questions:
1. Define abstract data types.
2. What is a sparse matrix?
3. Differentiate between stack and queue.
4. What is a binary search tree?
5. Explain path matrix in graph theory.
6. What is a hash function?
7. Define asymptotic notations.
8. Mention any two string pattern matching techniques.
9. What is the purpose of B-Trees?
10. List any two external sorting techniques.
Long Answer Questions:
1. Explain the classification of data structures with examples.
2. Discuss the operations on circular linked lists.
3. Explain the operations of a stack with examples.
4. Describe the searching operations in a Binary Search Tree (BST).
5. Explain the different types of sorting techniques with examples.
6. Describe the representation and traversal methods of graphs.
7. What are the applications of stack and queue in data structures?
8. Explain the concept and operations of B+ Trees.
9. Describe the difference between linear and binary search with examples.
10. Explain the different hashing techniques used in data structures.
Very Long Answer Questions:
1. Discuss in detail the various types of linked lists with suitable diagrams and examples.
2. Explain the various tree traversal techniques and their implementation in C.
3. Describe the shortest path problem in graphs and explain Dijkstra's algorithm with an example.
4. Explain in detail the various sorting techniques and compare their time complexities.
5. Discuss hashing in detail. Explain different hashing functions and collision resolution techniques.
6. Describe the structure and operations of M-way trees and their significance in searching.
7. Write a detailed note on general trees and binary trees. How are they represented in memory?
8. Explain heap and heap sort in detail with an example.
9. Explain the applications of graphs in real-life scenarios.
10. Discuss the importance of time and space complexity in algorithm analysis with examples.