Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Chapter: 103
Q1521:
Which name is inserted last in the sorted list according to the example?
A. Carol
B. Byron
C. Diana
D. Alex
Correct Answer:
A
Chapter: 103
Q1522:
What is the purpose of sliding names down in the Insertion Sort process?
A. To make space for the new name
B. To reverse the order of names
C. To remove duplicate names
D. To sort the names in descending order
Correct Answer:
A
Chapter: 103
Q1523:
In the example provided, how many names are initially sorted by the end of the process?
A. All five names
B. The first three names
C. The first two names
D. The first four names
Correct Answer:
A
Chapter: 103
Q1524:
What is the characteristic of the list at each step of the Insertion Sort example?
A. The sublist from the top is sorted
B. The entire list is sorted
C. Only the last element is sorted
D. The list is reversed
Correct Answer:
A
Chapter: 103
Q1525:
What does the final sorted list Alex, Fred, Diana, Byron, Carol represent in the context of the example?
A. The result of the Insertion Sort process
B. The initial unsorted list
C. The list sorted by a different algorithm
D. The list in reverse order
Correct Answer:
A
Chapter: 103
Q1526:
During Insertion Sort, what does the insertion of Diana ensure?
A. The first three entries in the list are sorted
B. The entire list is sorted
C. Only the last three names are sorted
D. The list is reversed
Correct Answer:
A
Chapter: 103
Q1527:
What does the term "hole" refer to in the Insertion Sort process?
A. The position where the current name is placed
B. A gap in the list
C. An empty slot at the end of the list
D. The name that is being compared
Correct Answer:
A
Chapter: 104
Q1528:
What does recursion involve in algorithm design?
A. Repeating a set of instructions as a subtask of itself
B. Repeating a set of instructions in a loop
C. Executing instructions sequentially
D. Performing a task only once
Correct Answer:
A
Chapter: 104
Q1529:
How is the binary search algorithm similar to searching in a dictionary?
A. Both involve narrowing the search by considering the middle entry
B. Both involve scanning each entry sequentially
C. Both involve searching the entire list
D. Both involve sorting the list
Correct Answer:
A
Chapter: 104
Q1530:
What is the first step in the binary search algorithm?
A. Check if the list is empty
B. Look at the first entry in the list
C. Consider the last entry in the list
D. Divide the list into two equal parts
Correct Answer:
A
Chapter: 104
Q1531:
In the binary search algorithm, what happens if the middle entry is not the target value?
A. Search either the front half or the back half of the list
B. Continue searching sequentially through the list
C. Stop searching and declare failure
D. Repeat the search for the entire list
Correct Answer:
A
Chapter: 104
Q1532:
What is the termination condition for the binary search algorithm when the target value is not in the list?
A. The segment under consideration becomes empty
B. The target value is found
C. The entire list is searched
D. The search reaches the end of the list
Correct Answer:
A
Chapter: 104
Q1533:
In the binary search algorithm, what should you do if the target value is less than the middle entry?
A. Search the front half of the list
B. Search the back half of the list
C. Continue searching the entire list
D. Stop searching and declare failure
Correct Answer:
A
Chapter: 104
Q1534:
How does the binary search algorithm handle an even number of entries in the list?
A. It considers the first entry in the second half as the middle entry
B. It selects the exact middle entry
C. It ignores the middle entry
D. It splits the list into three parts
Correct Answer:
A
Chapter: 104
Q1535:
What does Figure 86 in the module illustrate?
A. The process of narrowing down the search by dividing the list
B. The process of sequentially searching each entry in the list
C. The process of sorting the list
D. The process of checking each entry's position
Correct Answer:
A
Chapter: 104
Q1536:
In the pseudocode for the binary search algorithm, what is the purpose of the Search function?
A. To perform secondary searches in the front or back half of the list
B. To sort the list before searching
C. To check if the list is empty
D. To print the search results
Correct Answer:
A
Chapter: 104
Q1537:
What is the expected outcome if the binary search algorithm successfully finds the target value?
A. Declare the search a success
B. Declare the search a failure
C. Continue searching the entire list
D. Stop and sort the list
Correct Answer:
A
Chapter: 104
Q1538:
What should be done when the binary search algorithm narrows down to an empty segment?
A. Report that the search is a failure
B. Continue searching in the remaining list
C. Restart the search from the beginning
D. Declare the target value found
Correct Answer:
A
Chapter: 104
Q1539:
How does recursion improve the binary search algorithm compared to iterative approaches?
A. It simplifies the search process by dividing the list into smaller segments
B. It makes the search process more complex
C. It eliminates the need for a middle entry
D. It speeds up the search by not using the middle entry
Correct Answer:
A
Chapter: 104
Q1540:
What role does the middle entry play in the binary search algorithm?
A. It helps in dividing the list into smaller segments for further searching
B. It is the last entry to be considered
C. It is ignored if the list is even
D. It is used to sort the list before searching
Correct Answer:
A