Class 11 · Computer Science · Unit 3
Algorithms and Problem Solving
Characterising computational problems, generate-and-test, solvability and complexity classes (P, NP, NP-hard, NP-complete), Big O time/space analysis, design techniques (divide and conquer, greedy, dynamic programming, backtracking) and standard sorting, searching and graph traversal algorithms.
- Pages 65–86
- 8 figures and tables
Each topic opens in the reader, with its English and Roman Urdu lesson.
In your textbook
- Book pages
- 65–86
- Figures and tables
- 8
- End-of-chapter exercise
- 10 MCQs · 7 long questions · 8 short questions · 3 activities/projects
The chapter's topics and page numbers follow the official textbook. Lessons, lectures and practice are added after academic review.