1. Define the term “Algorithm.

”
2. What is a static data structure? Give one example.
3. How is a 2D array represented in memory?
4. What is a sparse matrix?
5. Describe the basic operation of linear search.
6. What is the main difference between selection sort and bubble sort?
7. Define hashing in the context of data structures.
8. What is the purpose of a hash function?
9. What does the term “collision resolution” refer to in hashing?
10. How does a singly linked list differ from a doubly linked list?
11. What is the main advantage of dynamic memory allocation over static memory allocation?
12. Describe the insertion operation in a singly linked list.
13. What is the main difference between a stack and a queue?
14. Define a circular queue.
15. Explain what is meant by a priority queue.
16. What is the difference between an adjacency matrix and an incidence matrix?
17. Describe one application of a stack.
18. What is a binary search tree?
19. Define the term “heap” in the context of data structures.
20. What is an AVL tree?
21. What is the significance of the root node in a tree data structure?
22. How is memory allocated for a 3D array?
23. What is a linear queue?
24. Describe a binary search algorithm.
25. What is the purpose of the merge sort algorithm?
26. What do you understand by the term “dynamic memory allocation”?
27. How does a header linked list differ from a regular singly linked list?
28. Explain the concept of tree traversal.
29. What is the advantage of using a circular linked list?
30. How is a heap tree different from a binary search tree?
31. Explain the attributes and design techniques used in algorithms.
32. Describe the process of address calculation for a 2D array.
33. Compare linear search and binary search in terms of efficiency.
34. Discuss the different types of sparse matrices and their representations.
35. Explain the difference between bubble sort and insertion sort with examples.
36. Describe how collision resolution is handled in a hash table.
37. Explain the operations involved in creating and deleting a node in a singly linked list.
38. Compare static and dynamic memory allocation with examples.
39. Discuss the various applications of stacks in computer science.
40. Explain the difference between linear queue and circular queue with examples.
41. Describe the process of merging two sorted linked lists.
42. Explain how the selection sort algorithm works and its time complexity.
43. Describe the structure and operations of a doubly linked list.
44. Discuss the differences between a stack and a queue in terms of their operations.
45. Explain the concept of priority queues and provide examples of their applications.
46. Compare and contrast the adjacency matrix and linked representation of graphs.
47. Describe the various types of binary trees and their characteristics.
48. Explain the concept of tree traversal and list the different types of traversals.
49. Discuss the creation and properties of AVL trees.
50. Describe the process of implementing a circular queue using arrays.
51. Explain the difference between a complete binary tree and a full binary tree.
52. Describe how dynamic memory allocation is implemented in a high-level programming language.
53. Discuss the different methods for resolving collisions in a hash table.
54. Explain how the merge sort algorithm works and its advantages over other sorting algorithms.
55. Describe the concept and implementation of a hash function.
56. Compare and contrast the various types of linked lists.
57. Explain the concept and implementation of a binary search tree.
58. Discuss the differences between a heap tree and a binary search tree.
59. Describe the process of converting an infix expression to postfix notation using stacks.
60. Explain the advantages and disadvantages of using a doubly linked list over a singly linked list.
61. Describe and implement the creation, insertion, and deletion operations in a doubly linked list.
62. Compare and contrast static and dynamic memory allocation with respect to their benefits and drawbacks in
different scenarios.
63. Explain the operations of stacks, including push, pop, and peek, and discuss their applications in evaluating
expressions and conversion between notations.
64. Provide a detailed explanation of queues, including their types (linear, circular, doubly-ended, priority),
operations, and applications.
65. Describe the graph representations including adjacency matrix, incidence matrix, and linked representation,
and discuss their applications.
66. Explain tree structures including binary trees, AVL trees, and B-trees, focusing on their properties, operations,
and use cases.
67. Provide a comprehensive explanation of tree traversal techniques, including inorder, preorder, and postorder
traversals, with examples.
68. Discuss the differences between various types of binary trees such as complete, full, and strict binary trees,
including their properties and use cases.
69. Describe the concept and implementation of a heap data structure and its applications in priority queues
and heap sort.
70. Explain the concept of merging two sorted arrays or linked lists and discuss its application in algorithms like
merge sort.