2.1 - Algorithms MCQ

Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.

• Merge
• Bubble
• Insertion
• None of the above

Which sorting algorithm is described by taking each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list?

• Merge
• Bubble
• Insertion
• None of the above

The following list is to be sorted using a bubble sort:
12  6  8  1  3
What will the list look like after the first iteration through the list?

• 6  8  1  3  12
• 6 12  1  8   3
• 1  3  6  8  12
• 6  8  1  12  3

Which sorting algorithm splits a list of items into individual lists?

• Merge
• Bubble
• Insertion
• None of them do

Which sorting algorithm takes an item from the list, and puts it in the correct place in a sorted list?

• Merge
• Bubble
• Insertion
• None of them do

Identify the purpose of the following flowchart symbol:

• Input/Output
• Sub-process
• Process
• Decision

How many arrows should come out of a decision symbol in a flowchart?

• 0
• 1
• 2
• 3

Which of the following is not a sorting algorithm?

• Bubble
• Insertion
• Binary
• Merge

Which sorting algorithm is described by moving through a list repeatedly, swapping elements that are in the wrong order?

• Merge
• Bubble
• Insertion
• None of the above

What is the first action in an insertion sort?

• Make an empty new list
• Make a new list with the first item of the original list as the ordered list
• Compare the first and second elements
• Put the first element in the correct place