Gce Model Questions Vol1 2017 Computer Studies Question 37

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

Gce Model Questions Vol1 2017 Computer Studies Objective / Multiple Choice Medium Difficulty

Question 37 GCE_MODEL_QUESTIONS_VOL1 • 2017 • COMPUTER_STUDIES • objective

Consider the following pseudo‑code:\n\n``` count = 0 for i = 1 to n: for j = 1 to i: for k = 1 to j: count = count + 1 ```\n\nExpress the final value of `count` as a function of \(n\) and give its Big‑O notation.

Answer Options

A. n(n+1)(n+2)/8, O(n^3)

B. n(n+1)(n+2)/3, O(n^2)

C. n(n+1)(n+2)/6, O(n^2)

Correct Answer D. n(n+1)(n+2)/6, O(n^3)

Correct Answer

Correct Option:

n(n+1)(n+2)/6, O(n^3)

About This Question

This is Gce Model Questions Vol1 2017 Computer Studies Question 37. It is one of the objective questions from the 2017 Gce Model Questions Vol1 Computer Studies examination.

Difficulty level: Medium .

View More Gce Model Questions Vol1 2017 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