Course
Data Structures & Algorithms
Pointer-driven memory structures, linear lists, stacks, queues and trees implemented in modern C++, with visual lecture decks and live code traces.
Welcome to Data Structures & Algorithms. Each section pairs a visual lecture deck with C++ implementations that trace pointer behaviour step by step — from the node blueprint up to complete operation walkthroughs.
Labs
Section 02
Section 2: Singly Linked List Implementation & Pointer OperationsComprehensive implementation of a singly linked list in C++ featuring head and tail pointers, dynamic heap allocation, insertion, deletion, linear traversal, and edge case handling.
Section 03
Queues, Circular Queues & the STLFIFO queues from first principles: array-backed queues and their dead space, circular queues via the modulo operator, queue implementations over linked lists, and the STL's std::queue and std::priority_queue.
Section 04
Stack Data Structure: Array & Linked List ImplementationsComplete study of Stacks and the LIFO principle: C++ built-in stack demonstration, array-based stack implementation with overflow and underflow tests, and generic linked-list stack implementation.
Section 06
Binary Search Trees: Traversals, Insertion & SearchFrom the shape of a binary tree to the ordering rule that makes it searchable: the node structure, the three depth-first traversals, a divide-and-conquer node count, recursive insertion and an iterative search.
REVISION · SECTIONS 1–6
Pre-Midterm RevisionA full active revision session across all six sections: arrays, linked lists, recursion, stacks, queues and binary search trees. Students recall, predict, debug, visualise and write the code — with every answer held back until the class has committed.