Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
Q1507:
Which sorting algorithm is demonstrated in Module 102?
A. Insertion Sort
B. Bubble Sort
C. Selection Sort
D. Merge Sort
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
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
Correct Answer:
A
Chapter: 102
Q1511:
How does Insertion Sort handle the elements of the list after inserting each element?
A. It shifts elements to make space for the new element
B. It removes elements from the list
C. It duplicates elements
D. It ignores elements
Correct Answer:
A
Chapter: 102
Q1512:
What is the role of the "hole" in the Insertion Sort example provided?
A. It is where the current element is placed
B. It is where the list is stored
C. It is where the list is reversed
D. It is where elements are compared
Correct Answer:
A
Chapter: 103
Q1513:
In the Insertion Sort example, what is the initial state of the list?
A. Fred, Alex, Diana, Byron, Carol
B. Carol, Diana, Byron, Fred, Alex
C. Alex, Fred, Diana, Byron, Carol
D. Byron, Diana, Carol, Alex, Fred
Correct Answer:
C
Chapter: 103
Q1514:
What is the first step when sorting the list Fred, Alex, Diana, Byron, Carol using Insertion Sort?
A. Insert Alex before Fred
B. Insert Diana before Fred
C. Insert Byron before Fred
D. Insert Carol before Fred
Correct Answer:
A
Chapter: 103
Q1515:
After the first iteration of Insertion Sort with Fred, Alex, what does the list look like?
A. Alex, Fred, Diana, Byron, Carol
B. Fred, Alex, Diana, Byron, Carol
C. Diana, Alex, Fred, Byron, Carol
D. Carol, Diana, Alex, Fred, Byron
Correct Answer:
A
Chapter: 103
Q1516:
How does Insertion Sort handle the list Fred, Alex, Diana after inserting Alex?
A. It creates a sorted list of Alex, Fred, Diana
B. It leaves the list unchanged
C. It sorts the list as Fred, Alex, Diana
D. It reverses the order of the list
Correct Answer:
A
Chapter: 103
Q1517:
What action is taken with the name Diana in the Insertion Sort process?
A. It is inserted into the correct position, moving Fred down
B. It is placed at the end of the list
C. It is swapped with Fred
D. It is removed from the list
Correct Answer:
A
Chapter: 103
Q1518:
In the sorting process, how does Byron get placed in the list?
A. It is inserted into the hole after moving Fred and Diana
B. It is added to the end of the list
C. It is swapped with Diana
D. It is ignored
Correct Answer:
A
Chapter: 103
Q1519:
What is the final state of the list after completing the Insertion Sort process?
A. Alex, Fred, Diana, Byron, Carol
B. Fred, Alex, Diana, Byron, Carol
C. Carol, Diana, Byron, Alex, Fred
D. Diana, Carol, Alex, Fred, Byron
Correct Answer:
A
Chapter: 103
Q1520:
How does Insertion Sort work with Carol in the final step?
A. Carol is inserted in the remaining hole after moving Fred and Diana
B. Carol is added to the beginning of the list
C. Carol is swapped with Diana
D. Carol is placed at the end of the list
Correct Answer:
A