Course Plan

Name : Ajay Khunteta July-Dec. 2008 III Semester CE-1 : Data Structure & Algorithms 1. Data structure by Tanenbaum 2. DSA by Trembley & Sercenson 3. DSA By Horowitz and Sawhni Topic DSA definition, Implementation, Operation Representation of array, address calculation using column and row major ordering Stack definition, Implementation Application of Stack Tower of Hanoi Function call and return Parentheses Matching Infix, Postfix and Prefix and their conversions Expression Evaluation Queues simple and circular Deque Enque, Priority Queue Bounded Queue Linked List Implementation Doubly Linked List Circular linked List Unrolled Linked List Skip Lists Splices, Sentinel Nodes Sparse Matrix, Associative array Algorithms writing and convention Analysis of algorithm Complexity Measures and Notations Sorting: Bubble Sort Selection Sort, Insertion Sort Quick Sort, Radix Sort Merge and Bucket Sort Heap Sort Simple search and Binary Search Hashing Lecturer Required 1 2 1 1 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 2 2 1 1 1

Session : Class & Branch: Subject References :

S. No. Unit 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 1 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 V V V V V V V

30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

V III III III III III III III III III III III IV IV IV IV IV

Symbol Table Definition of elements in tree, Binary tree Binary Search Tree Traversal in-order, preorder, post-order Indexed Binary Tree Threaded Binary Tree AVL Tree Multi-way Tree B Tree B+ Tree Forest Trie and Dictionary Graphs: Definition Representation Traversal BFS and DFS Spanning Tree Dijkstra Algorithms Shortest Path Algorithms

1 1 1 2 1 1 1 1 2 2 2 1 2 2 2 1 1

Total lectures required: 59

Signature (Ajay Khunteta) Date: