Cs 101

Question 1

How many steps does it take to delete an item from a binary search tree (BST)? When in (Words)?

Answer 1

O(n)

Question 2

How many steps does it take to build a heap using the bottom up method?

Answer 2

O(n)

Question 3

How many steps does it take to perform an extract min from a min ordered heap?

Answer 3

O(log n)

Question 4

How many steps does it take to perform (-) operation on a que implemented as a linked list?

Answer 4

O(1)

Question 5

The worst case to insert (-) Hash table takes how many steps?

Answer 5

O(n)

Question 6

The goal of hashing is for (-) to take how many steps on average?

Answer 6

O(1)

Question 7

Heap sort using a heap to sort n elements takes how many steps?

Answer 7

(n log n)

Question 8

Which operation do hash tables NOT support:

Answer 8

Sorting

Question 9

Which operation do heaps NOT support efficiently?

Answer 9

Search

Question 10

After an exception is thrown and a catch block execute, execution resumes after the thrown statement.

Answer 10

False

Question 11

For a function that may contain a throw, the function’s statements must be surrounded by a try block.

Answer 11

False

Question 12

A key advantage of a class template is relieving the programmer from having to write redundant code that differs only by type.

Answer 12

True

Question 13

A good hashing function should:

Answer 13

Spread the input values over the range of integer outputs.

Question 14

Huffman Codes will provide the most benefit when:

Answer 14

There is a skewed distribution of the characters