Skip to content
SmartFigureEdu

Anna University · Regulation 2021

CS 3301 Data Structures question papers

CS3301 Data Structures previous year question papers from Anna University (Regulation 2021), with the full syllabus. Read online or download the PDF.

Third semester · Core · L T P C: 3 0 0 3

Question papers

Syllabus

  1. Unit 1: Lists9 hours

    Abstract Data Types (ADTs) · List ADT · Array-based implementation · Linked list implementation · Singly linked lists · Circularly linked lists · Doubly-linked lists · Applications of lists · Polynomial ADT · Radix Sort · Multilists

  2. Unit 2: Stacks and Queues9 hours

    Stack ADT · Operations · Applications · Balancing Symbols · Evaluating arithmetic expressions · Infix to Postfix conversion · Function Calls · Queue ADT · Operations · Circular Queue · DeQueue · Applications of Queues

  3. Unit 3: Trees9 hours

    Tree ADT · Tree Traversals · Binary Tree ADT · Expression trees · Binary Search Tree ADT · AVL Trees · Priority Queue (Heaps) · Binary Heap

  4. Unit 4: Multiway Search Trees and Graphs9 hours

    B-Tree · B+ Tree · Graph Definition · Representation of Graphs · Types of Graph · Breadth-first traversal · Depth-first traversal · Bi-connectivity · Euler circuits · Topological Sort · Dijkstra's algorithm · Minimum Spanning Tree · Prim's algorithm · Kruskal's algorithm

  5. Unit 5: Searching, Sorting and Hashing Techniques9 hours

    Searching · Linear Search · Binary Search · Sorting · Bubble sort · Selection sort · Insertion sort · Shell sort · Merge Sort · Hashing · Hash Functions · Separate Chaining · Open Addressing · Rehashing · Extendible Hashing