Review Quiz

What is a stack?

• a. a type of map

• b. a FIFO (First In, First Out) data structure

• c. a LIFO (Last In, First Out) data structure

• d. None of the above

Which function adds an element to the top of a stack?

• a. push()

• b. pop()

• c. top()

• d. insert()

What does 'count()' do in a map?

• a. Counts the number of maps

• b. Checks if a key exists

• c. Counts the number of values

• d. Returns the size of the map

Which of the following has the BEST time complexity for searching?

• a. Linear Search

• b. Binary Search

• c. Selection Sort

• d. Insertion Sort

In recursion, what is the base case?

• a. The case that repeats

• b. The case that calls itself

• c. The initial call to the function

• d. The case that ends the recursion

How do you access the value in a map using a key?

• map[key]

• map.value(key)

• map.get(key)

• map.find(key)

What is the Big O time complexity of a binary search?

• a. O(n)

• b. O(nlogn)

• c. O(n^2)

• d. O(2^n)

Which pointer operation is used to access the value at a memory address?

• &

• []

• *

• ->

What is the time complexity of selection sort?

• O(n)

• O(nlogn)

• O(n^2)

• O(2^n)

What does the keyword 'throw' do in C++?

• a. Declares an exception

• b. Catches an exception

• c. Raises an exception

• d. Non of the above