CS3301 Data Structures Previous Year Question Papers - Anna University

UNIT I: LISTS

Part A (2 Marks)

• Define Abstract Data Type (ADT) with an example.
• Differentiate between Linear and Non-linear data structures.
• Compare Arrays and Linked Lists.
• What are the applications of Linked Lists?
• Define Singly and Doubly Linked List.

Part B (13/15 Marks)

• Explain Singly Linked List operations (insertion, deletion, traversal) with algorithms.
• Describe Doubly Linked List and Circular Linked List with advantages.
• Write an algorithm for Polynomial Addition using Linked Lists.
• Compare Array vs Linked List with suitable examples.

UNIT II: STACKS AND QUEUES

Part A (2 Marks)

• Define Stack and its operations (Push, Pop).
• What is Queue? Mention its types.
• Define Circular Queue and its advantage.
• What is Deque?
• List applications of Stack.

Part B (13/15 Marks)

• Explain Infix to Postfix conversion using Stack with example.
• Evaluate a Postfix expression using Stack.
• Explain Queue implementation using Arrays and Linked Lists.
• Describe applications of Stack (Recursion, Expression Evaluation).

UNIT III: TREES

Part A (2 Marks)

• Define Binary Tree and its types.
• What is Binary Search Tree (BST)?
• Define AVL Tree and Balance Factor.
• List tree traversal methods.
• What is a Binary Heap?

Part B (13/15 Marks)

• Explain BST operations (Insertion, Deletion, Searching) with algorithms.
• Describe AVL Tree rotations (LL, RR, LR, RL) with example.
• Explain Tree Traversals with examples.
• Describe Binary Heap and Priority Queue implementation.

UNIT IV: GRAPHS AND MULTIWAY TREES

Part A (2 Marks)

• Define Graph and its representations.
• What is BFS and DFS?
• Define Minimum Spanning Tree (MST).
• What is Dijkstra's Algorithm?
• Define B-Tree and B+ Tree.

Part B (13/15 Marks)

• Explain BFS and DFS algorithms with example.
• Describe Dijkstra's Algorithm for shortest path.
• Compare Prim's and Kruskal's algorithms.
• Explain B-Tree and B+ Tree structure and operations.
• Explain Topological Sorting with example.

UNIT V: SEARCHING, SORTING AND HASHING

Part A (2 Marks)

• Define Linear Search and Binary Search.
• What is Hashing?
• Define Collision and Rehashing.
• Compare Internal and External Sorting.
• What is Load Factor in Hashing?

Part B (13/15 Marks)

• Explain Sorting Algorithms: Bubble, Selection, Insertion.
• Describe Merge Sort and Quick Sort using Divide and Conquer.
• Explain Binary Search with algorithm.
• Discuss Hashing techniques and Collision Resolution methods.
• Compare different sorting techniques with time complexity.

Most Repeated / High-Weight Questions

Linked list operations, infix to postfix conversion, BST operations and AVL rotations, tree traversals, BFS/DFS algorithms, sorting algorithms with time complexity, hashing collision resolution.