Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
Q1521: Which name is inserted last in the sorted list according to the example?
- A: Carol
- B: Byron
- C: Diana
- D: Alex
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A