Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Chapter: 106
Q1561:
How does the binary search algorithm reduce the number of records to be searched?
A. By comparing the target value to the middle entry and halving the search space
B. By searching every entry sequentially
C. By sorting the list first
D. By skipping every other entry
Correct Answer:
A
Chapter: 106
Q1562:
What is the maximum number of entries that need to be checked in a binary search with 30,000 records?
A. 15
B. 30000
C. 7500
D. 1000
Correct Answer:
A
Chapter: 106
Q1563:
How many entries would the binary search algorithm at most check to find a record in a list of 30,000?
A. 15
B. 30000
C. 7500
D. 1000
Correct Answer:
A
Chapter: 106
Q1564:
What is the primary focus of algorithm analysis?
A. Evaluating time and space resources required by algorithms
B. Designing user interfaces
C. Hardware compatibility
D. Network efficiency
Correct Answer:
A
Chapter: 106
Q1565:
How does the binary search algorithm perform in the worst-case scenario?
A. It interrogates at most log2(n) entries
B. It checks every entry
C. It skips half of the list each time
D. It requires a linear number of checks
Correct Answer:
A
Chapter: 106
Q1566:
What is the time complexity of the sequential search algorithm in terms of the number of entries nnn?
A. O(n)
B. O(log2(n))
C. O(n^2)
D. O(1)
Correct Answer:
A
Chapter: 106
Q1567:
What is the time complexity of the binary search algorithm in terms of the number of entries nnn?
A. O(log2(n))
B. O(n)
C. O(n^2)
D. O(1)
Correct Answer:
A
Chapter: 106
Q1568:
Why does the binary search algorithm offer a significant improvement over the sequential search?
A. It reduces the search space by half with each step
B. It checks all entries sequentially
C. It performs fewer comparisons on average
D. It sorts the list first
Correct Answer:
A
Chapter: 106
Q1569:
How many records would the binary search algorithm need to examine if it is searching a list with 1,000,000 entries?
A. Approximately 20
B. 1000000
C. 10000
D. 1000
Correct Answer:
A
Chapter: 106
Q1570:
In the context of algorithm efficiency, what does log2(n) represent?
A. The base two logarithm of the number of entries
B. The total number of entries
C. The average number of comparisons
D. The time required for a search
Correct Answer:
A
Chapter: 106
Q1571:
What does an average-case analysis of an algorithm involve?
A. Estimating performance based on typical scenarios
B. Evaluating the best possible performance
C. Analyzing the most complex scenarios
D. Measuring worst-case performance
Correct Answer:
A
Chapter: 106
Q1572:
How does the sequential search algorithm handle a list of arbitrary length nnn?
A. It performs an average of n/2 comparisons
B. It performs at most log2(n) comparisons
C. It performs a fixed number of comparisons
D. It requires sorting the list first
Correct Answer:
A
Chapter: 107
Q1573:
What is the fourth phase in Polya's analysis of problem-solving?
A. Understanding the problem
B. Devising a plan
C. Carrying out the plan
D. Evaluating the solution
Correct Answer:
D
Chapter: 107
Q1574:
How many cuts are required in the optimal solution for the chain problem?
A. One
B. Two
C. Three
D. Four
Correct Answer:
A
Chapter: 107
Q1575:
What does the chain problem example illustrate in the context of software verification?
A. Efficiency of algorithms
B. Necessity of documentation
C. Difference between believed correctness and actual correctness
D. Complexity reduction
Correct Answer:
C
Chapter: 107
Q1576:
What is the purpose of the fourth phase in Polya's problem-solving approach?
A. To execute the plan
B. To verify the solution
C. To understand the problem
D. To optimize the solution
Correct Answer:
B
Chapter: 107
Q1577:
In the chain problem, how many links are freed after cutting only the third link?
A. One
B. Two
C. Three
D. Four
Correct Answer:
C
Chapter: 107
Q1578:
What happens on the second morning in the optimal chain problem solution?
A. Give the single link
B. Retrieve the single link and give the double-link piece
C. Retrieve all links and give the four-link piece
D. None of the above
Correct Answer:
B
Chapter: 107
Q1579:
Which of the following is NOT a correct step in the optimal chain problem solution?
A. Give the hotel the single link on the first morning
B. Retrieve the single link and give the hotel the double-link piece on the second morning
C. Retrieve the three links and give the four-link piece on the fourth morning
D. Give the hotel the triple-link piece on the fifth morning
Correct Answer:
D
Chapter: 107
Q1580:
What does the chain problem ultimately demonstrate about the initial solution?
A. It was the optimal solution
B. It was incorrect
C. It was partially correct
D. It was unnecessary
Correct Answer:
B