Data Structures and Algorithms
0%
Course Title: Data Structures and Algorithms
Course No: CACS201
Nature of the Course: Theory + Lab
Semester: 3
Full Marks: 20 + 20 + 60
Pass Marks: 8 + 8 + 24
Credit Hours: 3
Course Description
Course Objectives
Course Contents
2. Unit 2 The Stack
3 hrs
3. Unit 3 Queue
3 hrs
4. Unit 4 List
2 hrs
6. Unit 6 Recursion
4 hrs
7. Unit 7 Trees
5 hrs
8. Unit 8 Sorting
5 hrs
9. Unit 9 Searching
5 hrs
10. Unit 10 Graphs
5 hrs
Laboratory Works
- 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
Text Books
- 1.Y. Langsam, M.J. Augenstein and A. M. Tenenbaum, "Data Structures using C and C++", PHI
Reference Books
- 1.G. W. Rowe, "Introduction to Data Structure and Algorithms with C and C++", PHI
- 2.Robert Lafore, Data Structures and Algorithms in Java (2nd Edition), Sams Publishing