Class 11 · Computer Science · Unit 4
Computational Structures
Lists, stacks (LIFO), queues (FIFO), trees (properties, traversals, binary/AVL) and graphs (types, BFS/DFS) with Python implementations and applications; choosing the right structure; combining structures (expression evaluation, DFS with stack, BFS with queue, list reversal with stack).
- Pages 87–122
- 27 figures and tables
Each topic opens in the reader, with its English and Roman Urdu lesson.
In your textbook
- Book pages
- 87–122
- Figures and tables
- 27
- End-of-chapter exercise
- 10 MCQs · 8 long questions · 8 short questions · 1 activities/projects · 1 diagram-based
The chapter's topics and page numbers follow the official textbook. Lessons, lectures and practice are added after academic review.