Neco 2022 Computer Studies Question 45

Practice objective / multiple choice question 45 from the 2022 Neco Computer Studies examination.

Neco 2022 Computer Studies Objective / Multiple Choice Medium Difficulty
Question 45 NECO • 2022 • COMPUTER_STUDIES • objective

A program processes a list of \(n\) items. For each item it performs a linear search in a secondary list of size \(m\). After all items are processed, the primary list is sorted using merge sort. Derive the overall time complexity in Big‑O notation in terms of \(n\) and \(m\), and state the condition on \(m\) relative to \(n\) for which the linear‑search phase dominates the total runtime.

Answer Options

A. Overall: O(nm + n\\log n); linear search dominates when m > n
Correct Answer B. Overall: O(nm + n\log n); linear search dominates when m > \log n
C. Overall: O(n\\log n); linear search dominates when m > \\log n
D. Overall: O(nm); linear search dominates when m > \\log n
Correct Answer
B
Correct Option:
Overall: O(nm + n\log n); linear search dominates when m > \log n

About This Question

This is Neco 2022 Computer Studies Question 45. It is one of the objective questions from the 2022 Neco Computer Studies examination.

Difficulty level: Medium .

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