Syllabus
Course outline, marks distribution, and weekly lesson plan for Data Structures and Algorithms.
Course Information
| Course Code | Credit |
|---|---|
| CSE 2215-0613 | 3.0 |
Marks Distribution
| Component | Weight |
|---|---|
| Attendance | 10% |
| Class Test (CT) | 10% |
| Mid Term | 30% |
| Assignment and Presentation | 10% |
| Final | 40% |
Lesson Plan
| Week | Lectures | Topic |
|---|---|---|
| 1 | 1 + 2 | Array, array operations |
| 2 | 3 + 4 | Time complexity |
| 3 | 5 + 6 | Time complexity practice on code snippets |
| 4 | 7 + 8 | Linear search, binary search |
| 5 | 9 + 10 | Sorting algorithms (insertion sort, selection sort) |
| 6 | 11 + 12 | Merge sort, quick sort |
| 7 | 13 + 14 | Stack, queue |
| 8 | 15 + 16 | Linked list, insertion, deletion, doubly linked list |
| 9 | 17 + 18 | Doubly linked list, circular linked list, graph |
| 10 | 19 + 20 | BFS, DFS |
| 11 | 21 + 22 | Binary tree and traversal, building a binary search tree |
| 12 | 23 + 24 | Heap, spanning tree, minimum spanning tree |
| 13 | 25 + 26 | Kruskal's algorithm, Prim's algorithm, shortest path (Dijkstra, Bellman-Ford), adjacency matrix and adjacency list |
| 14 | 27 + 28 | Knapsack algorithm, coin change problem |
| 15 | 29 + 30 | Hashing (linear probing, quadratic probing) |
| 16 | 31 + 32 | Chaining (open hashing, double hashing) |
| 17 | 33 + 34 | Revision |
| 18 | 35 + 36 | Revision |
Teaching mode for each topic: slides, notes, and video.
Official Course Outline
Official course outline with the marks distribution and the 18-week lecture plan.
Loading PDF viewer…