Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Chapter: 104
Q1541:
What is the result of using the binary search algorithm on a list if the target value is not present?
A. The search will eventually narrow down to an empty segment
B. The search will find the target value
C. The search will return the position of the target value
D. The search will sort the list
Correct Answer:
A
Chapter: 104
Q1542:
How does the binary search algorithm apply to a sorted list?
A. It effectively narrows down the search range by dividing the list
B. It searches the list sequentially
C. It requires the list to be unsorted
D. It performs multiple searches simultaneously
Correct Answer:
A
Chapter: 105
Q1543:
How does recursion differ from loops in executing repetitive processes?
A. Recursion executes each stage as a subtask of the previous stage
B. Loops execute each stage as a subtask of the previous stage
C. Recursion executes tasks sequentially
D. Loops create multiple copies of tasks dynamically
Correct Answer:
A
Chapter: 105
Q1544:
What is created dynamically in a recursive function as it advances?
A. Activations of the function
B. Loops
C. Sequential stages
D. Variables
Correct Answer:
A
Chapter: 105
Q1545:
What happens to recursive activations when a function is actively progressing?
A. Only one activation is actively progressing while others are in limbo
B. All activations are actively progressing simultaneously
C. All activations terminate simultaneously
D. No activations are created
Correct Answer:
A
Chapter: 105
Q1546:
What is a key requirement for proper recursive control, similar to loop control?
A. Initialization, modification, and test for termination
B. Sequential execution and variable declaration
C. Dynamic memory allocation
D. User input validation
Correct Answer:
A
Chapter: 105
Q1547:
In recursive functions, what is the purpose of the base case?
A. To test for termination and stop creating additional activations
B. To initialize the function
C. To modify the task assigned to the function
D. To handle exceptions
Correct Answer:
A
Chapter: 105
Q1548:
What is the role of initialization in recursive control?
A. To provide the function with an initial configuration
B. To test for the termination condition
C. To create additional function activations
D. To modify the task assigned to the function
Correct Answer:
A
Chapter: 105
Q1549:
How does the modification phase function in recursive control?
A. It revises the problem to be closer to the termination condition
B. It initializes the function
C. It tests for termination
D. It terminates the function
Correct Answer:
A
Chapter: 105
Q1550:
What guarantees that a recursive process will eventually cease?
A. Each modification step reduces the problem size or searches an empty list
B. The function continuously creates activations
C. The function never tests for termination
D. The function performs a loop
Correct Answer:
A
Chapter: 105
Q1551:
What is the termination condition in recursive control?
A. The base case or degenerative case is met
B. The function is called repeatedly
C. The list size remains unchanged
D. The function modifies tasks
Correct Answer:
A
Chapter: 105
Q1552:
What does the recursive function in the binary search algorithm do if the target value is not found?
A. Creates a new activation to search a smaller segment of the list
B. Stops searching and declares failure
C. Searches the entire list again
D. Initializes a new list
Correct Answer:
A
Chapter: 105
Q1553:
What is the purpose of modification in the binary search recursive function?
A. To reduce the length of the list and get closer to the termination condition
B. To create additional activations
C. To initialize the search process
D. To perform sequential searches
Correct Answer:
A
Chapter: 105
Q1554:
How does the binary search function handle an empty list in recursion?
A. It recognizes the search as a failure
B. It continues searching
C. It initializes a new list
D. It modifies the list
Correct Answer:
A
Chapter: 105
Q1555:
What happens if the recursive function’s termination condition is met?
A. The current activation terminates without creating additional activations
B. Additional activations are created
C. The function continues indefinitely
D. The list is reinitialized
Correct Answer:
A
Chapter: 105
Q1556:
What ensures that the recursive search process will eventually complete?
A. The finite length of the original list and reduction of task size
B. Continuous creation of function activations
C. Repeated testing of all entries
D. Sequential searching of the entire list
Correct Answer:
A
Chapter: 105
Q1557:
How does the binary search algorithm ensure that the target value is eventually found or the list is empty?
A. By reducing the list size with each modification step
B. By searching the entire list
C. By creating additional activations
D. By initializing a new list
Correct Answer:
A
Chapter: 106
Q1558:
What is a major concern in algorithm design despite modern computational capabilities?
A. Efficiency
B. Complexity
C. User Interface
D. Hardware Compatibility
Correct Answer:
A
Chapter: 106
Q1559:
In the context of the registrar’s student record search, which algorithm is more efficient?
A. Binary search
B. Sequential search
C. Bubble sort
D. Merge sort
Correct Answer:
A
Chapter: 106
Q1560:
What is the average search time using the sequential search algorithm with 30,000 records if each retrieval takes 10 milliseconds?
A. 150 seconds
B. 15 seconds
C. 1.5 minutes
D. 5 minutes
Correct Answer:
A