Lecture 1 : Motivation, Objective of studying the subject, overview of Syllabus
Lecture 2 : Module I : Introduction to Data & file structures.
Lecture 3 : Linear data Structures - Linked list and applicatio ns
Lecture 4 : Stack and Queue
Lecture 5 : Module II : Introduction to Non- Linear data structures
Lecture 6 : General Trees , Binary Trees, Conversion of general tree to binary
Lecture 7 : Binary Search Tree
Lecture 8 : Red-Black trees
Lecture 9 : Multi linked structures
Lecture 10 : Heaps
Lecture 11: Spanning Trees, Application of trees
Lecture 12 : Module III Introduction to Sorting
Lecture 13, 14 : Growth of function , 'O' notation, Complexity of al gorithms,
Lecture 15 : Internal sorting, Insertion sorting, Selection Sort
Lecture 16 : Bubble Sort, Quick sort, Heap sort
Lecture 17 : Radix sort, External sort, Multi way merge
Lecture 18 : Module IV : Introduction to Searching, Sequential Search, Binary Search
Lecture 19 : Search trees traversal
Lecture 20 : Threaded Binary search trees
Lecture 21 : AVL Tree - concept and construction
Lecture 22 : Balancing AVL trees - RR, LL, LR and RL Rotations
Lecture 23 : Module V : Introduction to Hashing
Lecture 24 : Hashing techniques, Hash function
Lecture 25 : Address calculation techniques- common hashing functions
Lecture 26 : Collision resolution
Lecture 27 : Linear probing, quadratic probing
Lecture 28 : Double hashing
Lecture 29 : Bucket addressing
Lecture 30 : Module VI- Introduction to file Structures
Lecture 31 : External storage devices
Lecture 32 : Records - Concepts and organization
Lecture 33 : Sequential file - structures and processing
Lecture 34 : Indexed sequential files - strictures and processi ng
Lecture 35 : Direct files
Lecture 36 : Multi Key access
