CSC-211
BS
Data Structures
(DC) Domain Core
Theory: 3 Cr. Hrs
Lab: 1 Cr. Hr
Total: 4 Cr. Hrs
Objectives: Main objectives of the course is to understand different types of data structures (stacks, queues, lists, trees, graphs) and their applications. Students will be able to select and use appropriate data structure(s) for different types of problems.
Contents: Introduction to the course; linear data structures: stacks, queues, lists; non-linear data structures: trees, binary search tree (BST), search in BST, self-balancing BST (red-black or AVL), heaps, priority queues, graphs, graph traversal techniques (BFS, DFS), shortest path in graphs (Dijkstra, Bellman Ford); hashing: probing methods (open addressing, chaining), hash functions for numbers and strings; Applications of data structures: searching algorithms (linear, randomized and binary search), sorting techniques (insertion sort, selection sort, bubble sort, heap sort, quick sort, merge sort), linear time sorting techniques (counting, bucket and radix sort).
Prerequisites
In Programmes
BS
BS (Computer Science)
Semester 3 —
Core
(Fall 2026 onwards)
Taught By