Gce Model Questions Vol1 2022 Computer Studies Question 27

Practice objective / multiple choice question 27 from the 2022 Gce Model Questions Vol1 Computer Studies examination.

Gce Model Questions Vol1 2022 Computer Studies Objective / Multiple Choice Medium Difficulty
Question 27 GCE_MODEL_QUESTIONS_VOL1 • 2022 • COMPUTER_STUDIES • objective

The following pseudo‑code processes a list of \(n\) integers. ``` for i = 1 to n for j = i to n if (i + j) mod 3 = 0 count ← count + 1 ``` The statement inside the `if` is a constant‑time operation. Determine the asymptotic time‑complexity of the algorithm 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 Gce Model Questions Vol1 2022 Computer Studies Question 27. It is one of the objective questions from the 2022 Gce Model Questions Vol1 Computer Studies examination.

Difficulty level: Medium .

View More Gce Model Questions Vol1 2022 Computer Studies Questions More Gce Model Questions Vol1 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