Neco 2022 Computer Studies Question 4

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

Neco 2022 Computer Studies Objective / Multiple Choice Medium Difficulty
Question 4 NECO • 2022 • COMPUTER_STUDIES • objective

Consider the following pseudo‑code: ``` total = 0 for i = 1 to n for j = i to n if (i + j) mod 3 = 0 total = total + 1 end if end for end for ``` What is the worst‑case time complexity of this algorithm, expressed in Big‑O notation as a function of n?

Answer Options

Correct Answer A. O(n^2)
B. O(n^3)
C. O(n log n)
D. O(n)
Correct Answer
A
Correct Option:
O(n^2)

About This Question

This is Neco 2022 Computer Studies Question 4. It is one of the objective questions from the 2022 Neco Computer Studies examination.

Difficulty level: Medium .

View More Neco 2022 Computer Studies Questions More Neco Practice Questions Back to Questions

Master the Exam!

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