Course Title: Data Structures and Algorithms
Course Codc: CACS201
 Class Load: 6 Hrs. / Week (Theory: 3 Hrs., Practical: 3 Hrs.)


Unit 1 Introduction to data structure 

Definition, Abstract Data Type. Importance of Data structure. 

Unit 2 The Stack

 Introduction, Stack as an ADT, POP and PUSH Operation, Stack Application: Evaluation of Infix, Postfix, and Prefix Expressions. Conversion of Expression. 

Unit 3 Queue

 Introduction, Queue as an ADT, Primitive Operations in Queue, Linear and Circular Queue and Their Application. Enqueue and Dequeue, Priority Queue 

Unit 4 List 

 Introduction. Static and Dynamic List Structure, Array Implementation of Lists. Queues as a List 
Unit 5 Linked Lists 5 Hrs. Introduction, Linked List as an ADT, Dynamic Implememation, Insertion & Deletion of Node 'fo and From a List, Insertion and Deletion After and Before Nodes. linked Stacks and Queues, Doubly Linked Lists and Its Advantages 

Unit 6 Recursion

 Introduction, Principle of Recursion. Recursion vs. Iteration, Recursion Example: TOI I and Fibonacci Series, Applications of Recursion, Search Tree 

Unit 7 Trees 

Introduction. Basic Operation in Binary. tree, Tree Search and Insertion/Deletion. Binary Tree Traversals (pre-order, post-Order and in-order), Tree Height, Level, and Depth, Balanced Trees: AVL Balanced Trees. Balancing Algorithm. The  Huffman Algorithm. Game tree, B-Tree 

Unit 8 Sorting 

 Introduction, Internal and External Sort. Insertion and Selection Sort, Exchange Sort, Bubble and Quick Sort, Merge and Radix Sort, Shell Sort, Binary Sort, Heap Sort as Priority Queue, Efficiency of Sorting, Big 'O' Notation 

Unit 9 Searching 

 Introduction to Search Technique; essential of search, Sequential search, Binary search, Tree search, General search tree, I lashing: Hash function and hash tables, Collision resolution technique. Efficiency comparisons of different search technique
 
Unit 10 Graphs

 Introduction. Graphs as an ADT, Transitive Closure, Warshall's Algorithm. Types of Graph. Graph Traversal and Spanning Forests, Kruskal's and Round-Robin Algorithms, Shortest-path Algorithm. Greedy Algorithm, Dijkstra's Algorithm 

Unit 11 Algorithms 

Deterministic and Non-deterministic Algorithm, Divide and Conquer Algorithm, Series and Parallel Algorithm, Heuristic and Approximate Algorithms