Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
Q1501: In Insertion Sort, what does the algorithm do with the card containing Alex in the example?
- A: Slides Fred down and places Alex at the top
- B: Moves Alex to the end of the list
- C: Places Alex in the middle of the list
- D: Swaps Alex and Fred
View Answer
A
Q1502: How does Insertion Sort handle the list Fred, Alex, Diana initially?
- A: The sublist of Fred is considered sorted
- B: The entire list is sorted
- C: The sublist of Fred and Alex is sorted
- D: The list is reversed
View Answer
A
Q1503: What constraint is mentioned in Module 102 regarding sorting?
- A: The list must be sorted in place
- B: Additional materials can be added
- C: The list can be moved to a new location
- D: The list must be sorted in reverse
View Answer
A
Q1504: What does the Insertion Sort Algorithm primarily focus on during each iteration?
- A: Inserting the current element into its correct position
- B: Removing duplicate elements
- C: Merging two sorted lists
- D: Finding the largest element in the list
View Answer
A
Q1505: What does the Insertion Sort Algorithm do with each element in the list during sorting?
- A: It compares and places it in the correct position
- B: It removes the element from the list
- C: It duplicates the element
- D: It moves the element to a new list
View Answer
A
Q1506: How is the list Fred, Alex, Diana sorted after inserting Alex?
- A: Alex, Fred, Diana
- B: Fred, Alex, Diana
- C: Diana, Alex, Fred
- D: Alex, Diana, Fred
View Answer
A
Q1507: Which sorting algorithm is demonstrated in Module 102?
- A: Insertion Sort
- B: Bubble Sort
- C: Selection Sort
- D: Merge Sort
View Answer
A
Q1508: In Insertion Sort, what happens to the list as each new element is considered?
- A: The list is partially sorted
- B: The list is reversed
- C: The list is left unchanged
- D: The list is duplicated
View Answer
A
Q1509: What is the purpose of the Insertion Sort Algorithm?
- A: To sort a list with minimal additional space
- B: To find the minimum element in a list
- C: To reverse the order of elements
- D: To merge multiple lists
View Answer
A
Q1510: What is an advantage of using Insertion Sort in practical applications?
- A: It sorts a list in place
- B: It requires additional space
- C: It sorts a list in linear time
- D: It is suitable for large data sets
View Answer
A