Neco 2020 Computer Studies Question 4

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

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

Given the following pseudocode:\n```\nfor i = 1 to n\n for j = 1 to i\n if j mod 3 == 0\n for k = 1 to n\n print "*"\n```\nWhat is the time‑complexity of this algorithm in Big‑O notation?

Answer Options

A. O(n²)
B. O(n⁴)
Correct Answer C. O(n³)
D. O(n log n)
Correct Answer
C
Correct Option:
O(n³)

About This Question

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

Difficulty level: Medium .

View More Neco 2020 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