Course Details:
Basic concepts and notations, Mathematical background, Revision of arrays and pointers, Recursion and implementation of Recursion
Stacks and Queues: Sequential representation of stacks and queues
Lists: List representation techniques, Dynamics Storage allocation, Representation of stacks and queues using linked list, operations on linked list, Introduction to Doubly linked list.
Sorting Algorithms: Insertion sort, Bubble sort, Quick sort, Merge sort, Heap sort, Shell sort, Time and Space complexity of sorting algorithms
Tables: Searching sequential tables, Index sequential searching, Hash tables, Heaps.
Trees: Definition and basic concepts, Linked tree representations, Binary tree traversal algorithms,(Preorder, Inorder, Postorder), Binary search tree, Insertion and Deletion in Binary search tree, Multiway search trees, B trees, B+ tree and their applications, Digital search trees and Trie structure.
Graphs: Introduction to Graphs, Implementation of Graphs, Depth first search, Breadth first search.
Introduction to External Sorting
- Teacher: Kamal Kant