Data Structures

---

UNIT I

• Introduction- Introduction to Algorithmic Complexity, 
• Introduction to various data structures, 
• Arrays and Strings operations, 
• Stacks and Queues, Operations on Stacks and Queues, 
• Stacks : Array representation of Stacks, 
• Applications of Stacks- Recursion,  (Demo)
• Polish expression and their compilation conversion of infix expression to prefix and postfix expression, 
• Operations of Queues, 

• Representations of Queues Applications of Queues, Priority queues, 
• Overview of the list, set, tuples, and dictionary data structures.

UNIT II

• Searching and Sorting- Linear Search, Binary search, 
• Insertion Sort, Quick sort, 
• Merge sort, Radix Sort, Heap sort. 
• Linked Lists- Types , Singly linked lists, Representation of linked list, 
• Operations of the Linked list such as Traversing, Insertion, and Deletion, Searching, 
• Applications of Linked List. 
• Concepts of Circular linked list 
• Doubly linked list and their applications. 
• Stacks as a linked list.
• Queues as a linked list.

UNIT III

• Trees- Basic Terminology, 
• Binary Trees and their representation, 
• Binary search trees

• Operations on Binary search trees like traversing, searching, insertion and deletion, 
• Applications of Binary search Trees, 
• Complete Binary trees, Extended binary trees. General trees, 
• AVL trees, 
• Threaded trees, 
• B- trees, 2-3 trees, 2-3-4 trees, 
• B* and B+ trees.

UNIT IV

• File Structure- File Organization, Indexing & Hashing, 
• Hash Functions, Application Dictionary-Telephone Directory. 
• Graphs- Terminology and Representations, 
• Graphs & Multi-graphs, 
• Directed Graphs, 
• Representation of graphs and their Transversal, 
• Euler and Hamiltonian paths, 
• Spanning trees, shortest path and Transitive Closure, 
• Activity Networks, Topological Sort, and Critical Paths. 
• Applications of list, set, tuples, and dictionary data structures.

---