BCA Data Structures and Algorithms
Data Structures and Algorithms
Subject Code: CACS201
Course Title: Data Structures and Algorithms
Course No: CACS201
Nature of Course: Theory & Practical
Full Marks: 60+20+20
Pass Marks: 24+8+8
Credit Hours: 3
Course Description
Course Objective
Course Contents
Unit 1. Introduction to data structure 2 Hrs.
Definition, Abstract Data Type, Importance of Data structure
Unit 2. The Stack 3 Hrs.
Introduction, Stack as an ADT, POP and PUSH Operation, Stack Application: Evaluation of Infix, Postfix, and Prefix Expressions, Conversion of Expression
Unit 3. Queue 3 Hrs.
Introduction, Queue as an ADT, Primitive Operations in Queue, Linear and Circular Queue and Their Application, Enqueue and Dequeue, Priority Queue
Unit 4. List 2 Hrs.
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 Implementation, Insertion & Deletion of Node To and From a List, Insertion and Deletion After and Before Nodes, Linked Stacks and Queues, Doubly Linked Lists and Its Advantages
Unit 6. Recursion 4 Hrs.
Introduction, Principle of Recursion, Recursion vs. Iteration, Recursion Example: TOH and Fibonacci Series, Applications of Recursion, Search Tree
Unit 7. Trees 5 Hrs.
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 5 Hrs.
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 5 Hrs.
Introduction to Search Technique, essential of search, Sequential search, Binary search, Tree search, General search tree, Hashing: Hash function and hash tables, Collision resolution technique, Efficiency comparisons of different search technique
Unit 10. Graphs 5 Hrs.
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 5 Hrs.
Deterministic and Non-deterministic Algorithm, Divide and Conquer Algorithm, Series and Parallel Algorithm, Heuristic and Approximate Algorithms
Text Books
- Y. Langsam, M.J. Augenstein and A. M. Tenenbaum, "Data Structures using C and C++", PHI
Reference Books
- G. W. Rowe, "Introduction to Data Structure and Algorithms with C and C++", PHI
- Robert Lafore, Data Structures and Algorithms in Java (2nd Edition), Sams Publishing.
Lab Works
There shall be 10 lab exercises based on C or Java
1. Implementations of different operations related to Stack
2. Implementations of different operations related to linear and circular queues
3. Solutions of TOH and Fibonacci Series using Recursion
4. Implementations of different operations related to linked list: singly and doubly linked
5. Implementation of trees: AVL trees, Balancing of AVL
6. Implementation of Merge sort
7. Implementation of different searching technique: sequential, Tree and Binary
8. Implementation of Graphs: Graph traversals
9. Implementation of Hashing
10. Implementations of Heap