Gce Model Questions Vol1 2017 Computer Studies Question 46
Practice objective / multiple choice question 46 from the 2017 Gce Model Questions Vol1 Computer Studies examination.
Consider the following pseudocode: ``` count = 0 for i = 1 to n for j = i to n if (j mod i = 0) count = count + 1 ``` The variable **count** ends up equal to the number of ordered pairs \((i, j)\) with \(1 \le i \le j \le n\) such that \(i\) divides \(j\). Determine the final value of **count** when \(n = 12\).
Answer Options
About This Question
This is Gce Model Questions Vol1 2017 Computer Studies Question 46. It is one of the objective questions from the 2017 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.