City Guilds Model Questions Vol1 2019 Information Technology Question 34

Practice objective / multiple choice question 34 from the 2019 City Guilds Model Questions Vol1 Information Technology examination.

City Guilds Model Questions Vol1 2019 Information Technology Objective / Multiple Choice Hard Difficulty
Question 34 CITY_GUILDS_MODEL_QUESTIONS_VOL1 • 2019 • INFORMATION_TECHNOLOGY • objective

Consider the following pseudocode:\n\n``` S ← 0\nFOR i ← 1 TO N DO\n j ← 2*i - 1\n S ← S + j*j\nEND FOR\n```\n\nThe variable \(S\) stores the sum of the squares of the first \(N\) odd positive integers.\n(a) Compute the value of \(S\) when \(N = 10\).\n(b) State the time‑complexity of this algorithm in Big‑O notation.

Answer Options

A. 1330, O(N^2)
B. 1240, O(N)
Correct Answer C. 1330, O(N)
D. 1320, O(N)
Correct Answer
C
Correct Option:
1330, O(N)

About This Question

This is City Guilds Model Questions Vol1 2019 Information Technology Question 34. It is one of the objective questions from the 2019 City Guilds Model Questions Vol1 Information Technology examination.

Difficulty level: Hard .

View More City Guilds Model Questions Vol1 2019 Information Technology Questions More City Guilds 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