Skip to Content
PrepPath logoPrepPath

Syllabus

Course outline, marks distribution, and weekly lesson plan for Data Structures and Algorithms.

Course Information

Course CodeCredit
CSE 2215-06133.0

Marks Distribution

ComponentWeight
Attendance10%
Class Test (CT)10%
Mid Term30%
Assignment and Presentation10%
Final40%

Lesson Plan

WeekLecturesTopic
11 + 2Array, array operations
23 + 4Time complexity
35 + 6Time complexity practice on code snippets
47 + 8Linear search, binary search
59 + 10Sorting algorithms (insertion sort, selection sort)
611 + 12Merge sort, quick sort
713 + 14Stack, queue
815 + 16Linked list, insertion, deletion, doubly linked list
917 + 18Doubly linked list, circular linked list, graph
1019 + 20BFS, DFS
1121 + 22Binary tree and traversal, building a binary search tree
1223 + 24Heap, spanning tree, minimum spanning tree
1325 + 26Kruskal's algorithm, Prim's algorithm, shortest path (Dijkstra, Bellman-Ford), adjacency matrix and adjacency list
1427 + 28Knapsack algorithm, coin change problem
1529 + 30Hashing (linear probing, quadratic probing)
1631 + 32Chaining (open hashing, double hashing)
1733 + 34Revision
1835 + 36Revision

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…

On this page