BIT Data Structures and Algorithms

Concepts of Data Types, Data Structure, Abstract Data Type and their uses. Background for Data Structure, Definition and use of ADT, Array as an ADT, Structure, Pointer.

Introduction to Algorithm and their properties, Concepts of Analysis of algorithm with asymptotic notations (Big Oh) and their properties, time and space complexities

Definition and Primitive Operations, Stack as an ADT. Stack Applications: Evaluation of Infix, Postfix and Prefix expressions, converting from infix to prefix and postfix.

Definition, Queue as an ADT and Primitive Operations of Linear and Circular Queue. Application and advantages of Linear, Circular Queue, and Priority Queue (Ascending and Descending Priority Queue).

Definition and Principle of Recursion, Application of Recursion, Recursion removal using stack, example of recursion for TOH. Factorial, Fibonacci Sequences, GCD, efficiency of above recursive algorithms.

List concepts, Definition and List as ADT, Static and Dynamic List Structure and implementation, Types of linked list, Operations on Linked List. Singly linked list, Circular Linked List, Doubly Linked List, Doubly Circular Linked List, Inserting, traversing and deleting nodes at beginning, end and specified positions in these linked lists. Linked implementation of a stack and queue in singly linked list.

Definition and basic terminologies of tree, Binary Tree: Introduction, Types of Binary Tree, Level and depth, height balance tree (AVL). Operations in Binary Search Tree (BST): Insertion, Deletion, Searching. Tree Traversal: Pre-order traversal, In-order traversal (sorted list of Nodes), Post-order traversal, Applications of Binary Tree (Huffman tree, expression tree).

Introduction and types of sorting. Algorithm and implementation of Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort. Comparison and Efficiency of sorting algorithms.

Introduction. Sequential Search, Binary Search and Tree Search. Comparison and Efficiency of Searching. Hashing: hash function, hash table and collision resolution techniques.

Definition, Representation of Graph, Types of Graph. Graph Traversal: Depth First Search, Breadth First Search. Spanning Tree, Prim's Algorithm, Kruskal's algorithm and Round Robin Algorithm. Shortest Path Algorithm, Greedy and Dijkstra's Algorithm.