U6CS - Algorithms Quiz

Question 1

What programming concepts does a depth first traversal use?

Accepted Answer

List and Stack

Question 2

Which of these is the POST order list of nodes for the tree in the image?

Accepted Answer

2 3 + 4 x

Question 3

What is the BIG O notation for a bubble sort?

Accepted Answer

O(n squared)

Question 4

A call stack and a stack frame is used in recursion. Which of these are NOT stored in the frame

Accepted Answer

Return value

Question 5

What of these is NOT an essential characteristic of a recursive subroutine?

Accepted Answer

The routine loops

Question 6

What has the BIG O notation O(n log n)

Accepted Answer

Merge Sort

Question 7

Start at A: Which of these is a correct depth-first search?

Accepted Answer

ABDGCDGGSG

Question 8

What is the (potential) BIG O notation for a hash algorithm?

Accepted Answer

O(1)

Question 9

How many comparisons will need to be made with 129 items in a binary search?

Accepted Answer

8

Question 10

What can be used to create a binary tree in code?

Accepted Answer

User defined data structure

Question 11

What is the Halting problem?

Accepted Answer

Seeing if a program will finish running or continue forever?

Question 12

What is the point of the Dijkstra's algorithm?

Accepted Answer

Finding the shortest path from a start to all nodes

Questions 12