Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.
Difficulty: Medium
About this MCQ
This Medium Algorithms MCQ checks one syllabus fact.
The question is: “Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.”
The accepted answer is D. Time complexity. “Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.” is answered by Time complexity (option D). Option A (“Dynamic programming”) does not match the stem; it is a near-miss used to catch incomplete recall of Time complexity. Option B (“Divide and conquer”) does not match the stem; it is a near-miss used to catch incomplete recall of Time complexity. Remaining alternatives (Dijkstra's algorithm) fall outside the same rule and should be eliminated once Time complexity is identified. Algorithms questions of this type reward precise definitions rather than approximate associations. Algorithms recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
- A. Dynamic programming
Why not A: “Dynamic programming” is not correct. The accepted answer is D. Time complexity. “Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.” is answered by Time complexity (option D). Optio
- B. Divide and conquer
Why not B: “Divide and conquer” is not correct. The accepted answer is D. Time complexity. “Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.” is answered by Time complexity (option D). Optio
- C. Dijkstra's algorithm
Why not C: “Dijkstra's algorithm” is not correct. The accepted answer is D. Time complexity. “Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.” is answered by Time complexity (option D). Optio
- D. Time complexity ✓
Correct answer
D. Time complexity
Explanation
“Identify the correct concept described as: a measure of the amount of time an algorithm takes to run as a function of input size.” is answered by Time complexity (option D). Option A (“Dynamic programming”) does not match the stem; it is a near-miss used to catch incomplete recall of Time complexity. Option B (“Divide and conquer”) does not match the stem; it is a near-miss used to catch incomplete recall of Time complexity. Remaining alternatives (Dijkstra's algorithm) fall outside the same rule and should be eliminated once Time complexity is identified. Algorithms questions of this type reward precise definitions rather than approximate associations. Algorithms recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
Source: Algorithms Official Reference Guide
Tags: computer science, algorithms, problem solving, complexity analysis
Submitted by: MCQsHub Editorial
Related MCQs
- What is the name for an algorithmic technique that incrementally builds candidates and abandons ones that fail...
- What does Divide and conquer refer to?
- Which term refers to an algorithm design paradigm that breaks a problem into smaller subproblems, solves them,...
- Select the accurate description of Dijkstra's algorithm.
- The following statement describes a specific concept. What is it called? an algorithm that finds the shortest...
- What is Breadth-first search (BFS) primarily used for?