City Guilds Model Questions Vol1 2018 Information Technology Question 7
Practice objective / multiple choice question 7 from the 2018 City Guilds Model Questions Vol1 Information Technology examination.
Consider the following pseudo‑code:\n\n``` count = 0 for i = 1 to n: for j = i to n: if (j mod i == 0): count = count + 1 ```\n\n(a) Express the total number of times the statement `count = count + 1` is executed as a summation involving \(n\).\n(b) Using that expression, determine the asymptotic order of growth of the algorithm (Big‑O notation).\n(c) Evaluate the exact number of executions when \(n = 12\).
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2018 Information Technology Question 7. It is one of the objective questions from the 2018 City Guilds Model Questions Vol1 Information Technology examination.
Difficulty level: Hard .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.