Neco 2017 Computer Studies Question 4

Practice objective / multiple choice question 4 from the 2017 Neco Computer Studies examination.

Neco 2017 Computer Studies Objective / Multiple Choice Medium Difficulty

Question 4 NECO • 2017 • COMPUTER_STUDIES • objective

A program contains a loop that runs \(i\) from 1 to \(n\), and inside it a nested loop that runs \(j\) from \(i\) to \(n\). Inside the inner loop, a constant‑time operation is performed. Derive the Big‑O time complexity of the program in terms of \(n\).

Correct Answer A. O(n^2)

B. O(n^3)

C. O(n log n)

D. O(n)

Correct Answer

Correct Option:

O(n^2)

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