Syllabus
Lab outline, marks distribution, and weekly lab plan for Data Structures and Algorithms Lab.
Course Information
| Course Code | Credit |
|---|---|
| CSE 2216-0613 | 1.0 |
Marks Distribution
| Component | Weight |
|---|---|
| Attendance | 10% |
| Report and Performance | 30% |
| Final | 60% |
Mid Lab Scope
The mid lab is held in week 9 and follows labs 1 to 8.
Array operationsLinear and binary searchInsertion and selection sortMerge and quick sortStack and queueSingly and doubly linked listCircular linked listStack and queue using linked list
Lab Plan
| Week | Topic |
|---|---|
| 1 | Array, array operations |
| 2 | Linear search, binary search |
| 3 | Sorting algorithms (insertion sort, selection sort) |
| 4 | Merge sort, quick sort |
| 5 | Stack, queue |
| 6 | Linked list, insertion, deletion, doubly linked list |
| 7 | Circular linked list, using linked list in stack and queue |
| 8 | Revision |
| 9 | Mid lab |
| 10 | BFS, DFS |
| 11 | Binary tree and traversal, building a binary search tree |
| 12 | Heap, spanning tree, minimum spanning tree |
| 13 | Kruskal's algorithm, Prim's algorithm |
| 14 | Dijkstra, Bellman-Ford, adjacency matrix and adjacency list |
| 15 | Knapsack algorithm, coin change problem |
| 16 | Revision |
| 17 | Revision |
| 18 | Final lab |
Official Course Outline
Official lab outline with the marks distribution and the 18-week lab plan.
Loading PDF viewer…