Algorithm questions

Consider this list of numbers: 9 3 6 8 4 7. An algorithm compares 9 and 3 followed by 9 and 6 followed by 9 and 8. Which algorithm is being described?

• Bubble sort
• Insertion sort
• Merge sort
• Binary search

Comparing a bubble sort to the insertion sort, which is the better algorithm in terms of time complexity on average?

• They are both similar
• Bubble sort
• Insertion sort
• It is not possible to determine

Consider this list of numbers: 3 4 6 7 8 9. If the number 9 was to be found using a linear search, how many comparisons need to be made?

• 6
• 3
• 8
• 4

What is the main disadvantage of a binary search compared to a linear search?

• It requires the data to be in order
• It requires more memory
• It does not execute as quickly with larger data sets
• Not all CPUs are capable of executing the algorithm

An advantage of pseudocode is that:

• It is a convenient way of designing algorithms to aid thinking logically
• Algorithms are represented graphically
• There are standards for representing syntax
• It is easier to see where there are logic errors in a program

The recursive algorithm to perform a post-order traversal of a binary tree can be described simply as:

• Left pointer, right pointer, node
• Node, left pointer, right pointer
• Left pointer, node, right pointer
• Right pointer, left pointer, node

The recursive algorithm to perform a pre-order traversal of a binary tree can be described simply as:

• Node, left pointer, right pointer
• Left pointer, node, right pointer
• Left pointer, right pointer, node
• Right pointer, left pointer, node

Consider this list of numbers L: 3 4 5 6 7 8 9. Which number would be checked first in a binary search?

• 6
• 3
• 9
• 4

Consider this list of numbers: 9 3 6 8 4 7. A bubble sort algorithm starts from the first item in the list (9) and orders the list from lowest to highest number. What is the order of the numbers after one pass through all the numbers of the bubble sort algorithm on this list?

• 3 6 8 4 7 9
• 9 3 6 8 4 7
• 3 4 6 7 8 9
• 3 6 8 9 4 7

O(1) describes which type of algorithm complexity?

• Constant
• Logarithmic
• Linear
• Polynomial