Data Structure and Algorithm (CSC 211) is a core Third Semester subject in Tribhuvan University’s BSc CSIT program (current / new course code). It builds foundations in ADTs, stacks, queues, linked lists, recursion, sorting, searching, hashing, trees, and graphs—with implementation labs in C.
On this page you’ll find the official CSC 211 syllabus and notes PDFs: Bhupendra Saud and Saroj Ghimire.
Note: Older batches may still see CSC 206 on past papers; the syllabus content is largely the same. CSC 211 is the current code under the revised grading system.
What you’ll learn
- Abstract data types, dynamic memory, and asymptotic notation
- Stacks, queues, recursion, and linked lists
- Sorting (bubble through heap) and searching/hashing
- Binary trees, BST, AVL, graphs, MST, and shortest paths
- Lab practice implementing core DSA algorithms in C
Course snapshot
- Code: CSC 211 (current) · formerly CSC 206
- Program: BSc CSIT · Third Semester
- Board: Tribhuvan University (IOST)
- Nature: Theory + Lab · Credit hours: 3
- Marks: 60 (theory) + 20 (practical) + 20 (internal)
Start with the syllabus for unit-wise hours, then pick a notes set for revision.