Data structures
Unit 1: Introduction to Data Structures and Arrays
1. Define data structure. Explain types with examples.
2. Discuss the advantages and disadvantages of arrays.
3. Write a program to find the largest and smallest element in an array.
4. Explain sparse matrices and their representation.
5. What is the difference between static and dynamic data structures?
Unit 2: Linked Lists
1. Explain types of linked lists (singly, doubly, circular).
2. Write an algorithm to insert and delete a node from a singly linked list.
3. What are the advantages of using a linked list over an array?
4. Implement a circular linked list and explain with an example.
5. Write a program to reverse a linked list.
Unit 3: Stacks and Queues
1. Write algorithms for stack operations (Push, Pop, Peek).
2. Convert an infix expression to postfix notation.
3. Write a program to implement a queue using an array.
4. Explain the differences between a queue and a deque.
5. What is a priority queue? Explain with an example.
Unit 4: Trees
1. Define binary tree. Explain tree traversal techniques (inorder, preorder, postorder).
2. What is a binary search tree (BST)? Write algorithms for insertion and deletion.
3. Explain the concept of an AVL tree with rotations.
4. Write a program to find the height of a binary tree.
5. Compare general trees and binary trees.
Unit 5: Graphs and Hashing
1. Explain DFS and BFS algorithms with examples.
2. Write the adjacency list and adjacency matrix representation of a graph.
3. Discuss applications of graphs in real life.
4. What is hashing? Explain any one collision resolution technique.
5. Compare open hashing and closed hashing.
Unit 1: Introduction to Data Structures
1. Define Data Structures. Classify them into different types.
2. Explain the difference between linear and non-linear data structures with examples.
3. What is a sparse matrix? Write its representation using arrays.
Unit 2: Arrays and Linked Lists
1. Explain the operations of a singly linked list with algorithms. (Frequently repeated)
2. Differentiate between singly linked list and doubly linked list. Write a program for insertion in a
doubly linked list.
3. What is a circular linked list? Write a program for traversal.
4. Discuss advantages and disadvantages of linked lists over arrays.
Unit 3: Stacks and Queues
1. What are stacks? Explain their applications in expression conversion and evaluation.
(Frequently asked)
2. Write an algorithm to convert infix expression to postfix expression. (Repeated multiple times)
3. What is a circular queue? Write an algorithm to implement insertion and deletion.
4. Differentiate between stack and queue.
Unit 4: Trees and Graphs
1. What is a binary search tree (BST)? Write an algorithm for insertion and deletion in a BST.
(Highly repeated)
2. Explain tree traversals (Inorder, Preorder, Postorder) with examples. (Frequently asked)
3. Define a graph. Explain DFS and BFS with their applications.
4. Differentiate between binary tree and binary search tree.
Unit 5: Sorting, Searching, and Hashing
1. Explain the working of Quick Sort with an example. Derive its time complexity. (Frequently
repeated)
2. What is Hashing? Explain collision resolution techniques. (Commonly asked)
3. Write algorithms for Merge Sort and Bubble Sort. Compare their time complexities.
4. Explain Linear and Binary Search with examples.
Key Focus Areas (Frequently Repeated Topics)
Linked Lists (all types, especially Singly and Doubly)
Stack Applications (Expression Conversion and Evaluation)
Binary Search Tree (Insertion, Deletion, Traversals)
Graph Traversals (DFS and BFS)
Sorting Algorithms (Quick Sort, Merge Sort)
Hashing Techniques
Unit 1: Introduction to Data Structures and Algorithms
1. Define Data Structures and explain its types.
2. Differentiate between static and dynamic data structures.
3. Explain time complexity and space complexity with examples.
4. Write an algorithm to reverse an array.
5. What is a sparse matrix? Write a program to represent it using arrays.
Unit 2: Arrays, Stacks, and Queues
1. Write a program to implement stack operations (Push, Pop, Peek).
2. Explain applications of stacks with examples (e.g., parenthesis matching).
3. What is a circular queue? How is it different from a linear queue? Write algorithms for
insertion and deletion in a circular queue.
4. Convert the infix expression A+B*(C^D-E) to postfix.
5. Discuss the limitations of arrays. How do linked lists overcome them?
Unit 3: Linked Lists
1. What is a doubly linked list? Write algorithms to insert and delete a node.
2. Differentiate between singly linked list and circular linked list.
3. Explain how a linked list can be used to implement stacks and queues.
4. Write a program to reverse a linked list.
5. What is the time complexity of searching in a linked list? Justify.
Unit 4: Trees and Binary Search Trees
1. Define a binary tree. Write algorithms for preorder, inorder, and postorder traversals.
2. What are AVL trees? Explain how to perform rotations in AVL trees.
3. Differentiate between binary trees and binary search trees (BST).
4. Insert the following keys into a BST: 15, 10, 20, 8, 12, 17, 25. Draw the resulting tree.
5. What is a heap? Explain Max-Heap and Min-Heap with examples.
Unit 5: Graphs, Sorting, and Hashing
1. Differentiate between DFS and BFS with examples.
2. Write algorithms for Bubble Sort and Quick Sort. Compare their time complexities.
3. What is hashing? Explain collision resolution techniques like chaining and open addressing.
4. Implement adjacency matrix representation of a graph.
5. Explain Dijkstra’s algorithm with an example.
Frequently Repeated Questions
Unit 2 & Unit 4 dominate the exam with linked lists, stacks, and tree-related questions being
repeated frequently.
Practical Questions:
Implementing sorting techniques, stack/queue operations, and tree traversals are highly likely.
