Neco 2023 Computer Studies Question 24

Practice objective / multiple choice question 24 from the 2023 Neco Computer Studies examination.

Neco 2023 Computer Studies Objective / Multiple Choice Medium Difficulty

Question 24 NECO • 2023 • COMPUTER_STUDIES • objective

Given the following pseudocode, where each statement inside the innermost loop takes constant time, determine the time‑complexity in Big‑O notation as a function of \(n\).\n\n``` for i = 1 to n: for j = 1 to i: for k = 1 to n step i: do constant‑time work ```

A. O(n^{2} \log n)

B. O(n^{3})

Correct Answer C. O(n^{2})

D. O(n \log n)

Correct Answer

Correct Option:

O(n^{2})

This is Neco 2023 Computer Studies Question 24. It is one of the objective questions from the 2023 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