Neco 2020 Computer Studies Question 38

Practice objective / multiple choice question 38 from the 2020 Neco Computer Studies examination.

Neco 2020 Computer Studies Objective / Multiple Choice Medium Difficulty

Question 38 NECO • 2020 • COMPUTER_STUDIES • objective

Given the following pseudocode:\n```\ncount = 0\nfor i = 1 to n\n for j = i to n\n if (j mod i = 0) then\n count = count + 1\n end if\n end for\nend for\n```\n(a) State the time‑complexity of the algorithm using Big‑O notation.\n(b) Determine the value of \(count\) when \(n = 12\).

A. O(n log n), 36

B. O(n^2), 30

Correct Answer C. O(n^2), 35

D. O(n^3), 35

Correct Answer

Correct Option:

O(n^2), 35

This is Neco 2020 Computer Studies Question 38. It is one of the objective questions from the 2020 Neco Computer Studies examination.

Difficulty level: Medium .

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows

Chat with Support