TA Tutorial · Summer 2026
Tutorial for Data Structure
Independent University, Bangladesh
Summary
Tutorial sessions on data representation and storage using elementary data structures — arrays, linked lists, stacks, queues, trees, heaps, and graphs — with implementation and problem solving in Python.
Learning outcome
Students can implement and use core data structures (linked lists, stacks, queues, BSTs, heaps, graphs, hash tables), analyze time/space complexity, apply recursion to algorithmic problem solving, and select appropriate data structures for engineering problems.
Weekly schedule
- Tutorial 01 Python review: loops, conditionals, functions, lists, tuples, sets, dicts, classes
- Tutorial 02 Pointers, nodes, and singly linked list
- Tutorial 03 Stack and queue using linked list
- Tutorial 04 Doubly linked list
- Tutorial 05 Recursion
- Tutorial 06 Midterm Exam week
- Tutorial 07 Recursion continued
- Tutorial 08 Binary search tree — operations and complexity
- Tutorial 09 Binary search tree — traversal and applications
- Tutorial 10 Heap and priority queue
- Tutorial 11 Heap and priority queue — applications
- Tutorial 12 Graph: directed, undirected, connectivity
- Tutorial 13 Review and exam preparation
Tutorial notebooks
#02 Pointers, nodes, and singly linked list coming soon
#03 Stack and queue using linked list coming soon
#04 Doubly linked list implementation coming soon
#05 Recursion: base cases, call stack, and recursive problem solving coming soon
#06 Binary search tree: insertion, deletion, search coming soon
#07 Heap and priority queue coming soon
#08 Graph: representation, BFS, and DFS coming soon