Neco 2019 Computer Studies Question 28

Practice objective / multiple choice question 28 from the 2019 Neco Computer Studies examination.

Neco 2019 Computer Studies Objective / Multiple Choice Medium Difficulty
Question 28 NECO • 2019 • COMPUTER_STUDIES • objective

A sorting program A uses a quadratic algorithm with time complexity \(O(n^{2})\). For an input of \(n = 5{,}000\) elements, each elementary operation takes \(0.2\) microseconds. (a) Estimate the total execution time of program A in seconds. (b) A newer program B uses an \(O(n\log_{2} n)\) algorithm with the same elementary operation time. Estimate the execution time of program B for the same input size and determine the factor by which program B is faster than program A.

Answer Options

A. Program A: 5 s; Program B: 0.0061 s; Factor ≈ 819
Correct Answer B. Program A: 5 s; Program B: 0.0123 s; Factor ≈ 407
C. Program A: 10 s; Program B: 0.0123 s; Factor ≈ 813
D. Program A: 5 s; Program B: 0.025 s; Factor ≈ 200
Correct Answer
B
Correct Option:
Program A: 5 s; Program B: 0.0123 s; Factor ≈ 407

About This Question

This is Neco 2019 Computer Studies Question 28. It is one of the objective questions from the 2019 Neco Computer Studies examination.

Difficulty level: Medium .

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