BS Computer Science Design & Analysis of Algorithms MCQs
Chapter-wise multiple choice questions with answers. 500 questions in 10 chapters.
Chapters
Algorithm Analysis50 questions
Divide and Conquer50 questions
Greedy Algorithms50 questions
Dynamic Programming50 questions
Graph Algorithms50 questions
Backtracking50 questions
Branch and Bound50 questions
String Algorithms50 questions
Complexity Theory50 questions
Advanced Design50 questions
About these Design & Analysis of Algorithms MCQs
These multiple choice questions cover BS Computer Science Design & Analysis of Algorithms in 10 chapters, with 500 questions in all. Every question has four options and a marked correct answer, and many have a short explanation.
The chapters are: Algorithm Analysis; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Graph Algorithms; Backtracking; Branch and Bound; String Algorithms; Complexity Theory; Advanced Design. The longest chapter is "Algorithm Analysis" with 50 questions.
Read a chapter with its answers to revise, then take its quiz to check yourself. The whole-subject quiz mixes questions from several chapters, which is closer to a real test.