As a Senior Lecturer at BRAC University, Bangladesh, I teach CSE220: Data Structures to sophomore undergraduate Computer Science students.
These lecture files are adapted from my undergraduate and master’s courses, as well as my teaching assistantship experience. They are enriched with simple examples and analogies to make complex topics—such as linked lists, trees, and graphs—easier to visualize and understand.
The course covers core data structures, including arrays, linked lists, hashing, stack, queue, trees, heaps, and graphs, along with selected algorithmic concepts such as complexity analysis and graph traversals. Together, these provide students with a solid foundation for advanced algorithm courses.
- 00: Array Basics & Operations (1D)
- L01: Introduction to Complexity Theory
- L02: Multidimensional Arrays
- L03–L04: Linked List (Non-Dummy Headed Singly Linear)
- L05: Linked List (Dummy Headed Doubly Linear)
- L06: Linked List (Dummy Headed Doubly Circular)
- L07: Hashing & Hash Tables
- L08: Stack
- L09: Queue
- L10: Recursion Basics
- L11–L12: Tree Terminologies & Binary Trees
- L13–L14: Binary Search Tree (BST)
- L15: Heap
- L16–L17: Graph Basics
- L18: Graph Traversals (BFS, DFS)