(3) Fundamentals of Algorithms

Question 1

What is meant by recursively-defined?

Answer 1

A procedure/ subroutine that can call itself

Question 2

What must each node contain in a binary tree?

Answer 2

Data

Left abs right pointers

Question 3

What is the big O notation for Bubble Sort, Merge Sort, Binary Search and Linear Search?

Answer 3

O(log n): Binary Search - GOOD
O(n): Linear - DECENT
O(n^2) : Bubble Sort - POOR
O(nlog n): Merge Sort

Question 4

Which search algorithm is this?

Answer 4

Linear Search

Question 5

Which search algorithm is this?

Answer 5

Binary Search

Question 6

Which sorting algorithm is this?

Answer 6

Bubble Sort

Question 7

Which sorting algorithm is this?

Answer 7

Merge Sort

Question 8

What is the big O notation for bubble sort?

Answer 8

O(n^2) : Bubble Sort - POOR

Question 9

What is the big O notation for merge sort?

Answer 9

O(nlog n): Merge Sort

Question 10

What is the big O notation for Binary Search?

Answer 10

O(log n): Binary Search - GOOD

Question 11

What is the big O notation for Linear Search?

Answer 11

O(n): Linear - DECENT