Gce Model Questions Vol1 2025 Computer Studies Question 30
Practice objective / multiple choice question 30 from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Consider the following pseudocode:\n\n``\nfor i = 1 to n\n for j = 1 to i\n do constant‑time operation\nfor k = 1 to n\n perform binary search on a sorted array of size n\n```\nIf the binary search takes \(O(\log n)\) time, determine the overall time‑complexity of the algorithm using Big‑O notation.
Answer Options
About This Question
This is Gce Model Questions Vol1 2025 Computer Studies Question 30. It is one of the objective questions from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.