0 [{"id":535017,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:30:05","updated_at":"2018-08-16 09:30:05","questionName":"C++ has a sort function built in, so that you do not have to write your own every time you want to sort a list.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535010,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:26:18","updated_at":"2018-08-16 09:26:18","questionName":"What is the expected run time for inserting into a hash table?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535012,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:27:21","updated_at":"2018-08-16 09:27:21","questionName":"Suppose you want to traverse a hash table of names in alphabetical order. How would you do that?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535013,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:28:02","updated_at":"2018-08-16 09:28:02","questionName":"Which of the following can help to reduce collisions in a hash table?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535018,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:30:29","updated_at":"2018-08-16 09:30:29","questionName":"What is the difference between sort and stable_sort?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535011,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:26:55","updated_at":"2018-08-16 09:26:55","questionName":"When collisions are resolved using linear probing, ______.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535009,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:25:57","updated_at":"2018-08-16 09:25:57","questionName":"What kind of mapping is used in a map from keys to values?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535006,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:24:27","updated_at":"2018-08-16 09:24:27","questionName":"Suppose set A contains the strings \"apples\", \"oranges\", and \"pineapples\". Then the strings \"apples\" and \"grapes\" are inserted. How many items are in A after these two insertions?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535007,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:24:50","updated_at":"2018-08-16 09:24:50","questionName":"Unlink a vector, a set does not support the subscript operator (e.g. mySet[0]). If someone still wanted to iterate through each item in a set, they should __________.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535015,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:29:20","updated_at":"2018-08-16 09:29:20","questionName":"When using a map to implement a phone directory, the ______ should be the key and the ______ should be the value.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535020,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:32:22","updated_at":"2018-08-16 09:32:22","questionName":"The Big O of the number of exchanges of selection sort is ___. The Big O of the comparisons is ___.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535016,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:29:41","updated_at":"2018-08-16 09:29:41","questionName":"\"Big O\" for find, insert, and erase when hashing should be ___, ____, and ____, respectively.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535019,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:31:45","updated_at":"2018-08-16 09:31:45","questionName":"Which of the following most accurately describes the selection sort algorithm?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535008,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:25:15","updated_at":"2018-08-16 09:25:15","questionName":"A map consists of a set of keys, each with one or more values. Which typically is\/are unique?","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null},{"id":535014,"quiz_id":"26761","answer_id":null,"answerType_id":"0","created_at":"2018-08-16 09:28:52","updated_at":"2018-08-16 09:28:52","questionName":"Let H(value) be a function that returns the hash code of \"value\". If A == B, then ________.","questionTimeSeconds":"0","questionTimeMinutes":"3","questionImagePath":null,"position":null,"explanation":"","question_score_id":null,"lang":"","questionAudioPath":null}]

block

C++ has a sort function built in, so that you do not have to write your own every time you want to sort a list.

Select the correct answer(s).  

(0/0)

---

True

False

none

What is the expected run time for inserting into a hash table?

Select the correct answer(s).  

(0/0)

---

O(1)

O(n*log n)

O(log n)

O(n)

none

Suppose you want to traverse a hash table of names in alphabetical order. How would you do that?

Select the correct answer(s).  

(0/0)

---

Use the remove operator.

Use an iterator.

This cannot be done.

Use the subscript operator or the at() function.

none

Which of the following can help to reduce collisions in a hash table?

Select the correct answer(s).  

(0/0)

---

A. Expanding the table size.

B. Using quadratic probing instead of linear probing.

None of these.

A and B.

none

What is the difference between sort and stable_sort?

Select the correct answer(s).  

(0/0)

---

Stable_sort will preserve ordering of duplicate items.

Stable_sort is less likely to crash your program.

Stable_sort is slightly faster.

They are identical.

none

When collisions are resolved using linear probing, ______.

Select the correct answer(s).  

(0/0)

---

the insertion occurs at the first available slot, even it was previously occupied

probing terminates not later than the end of the hash table

the insertion occurs at the first available slot that was not previously occupied

infinite loops regularly result

none

What kind of mapping is used in a map from keys to values?

Select the correct answer(s).  

(0/0)

---

one-to-one

many-to-many

many-to-one

one-to-many

none

Suppose set A contains the strings "apples", "oranges", and "pineapples". Then the strings "apples" and "grapes" are inserted. How many items are in A after these two insertions?

Select the correct answer(s).  

(0/0)

---

3

5

4

No way to be sure

none

Unlink a vector, a set does not support the subscript operator (e.g. mySet[0]). If someone still wanted to iterate through each item in a set, they should __________.

Select the correct answer(s).  

(0/0)

---

Use an iterator

Use the at() function

Use the toString() function and read the resulting string

Use a vector instead, it cannot be done

none

When using a map to implement a phone directory, the ______ should be the key and the ______ should be the value.

Select the correct answer(s).  

(0/0)

---

Name, phone number

Phone number, name

Hash code, name

Hash code, phone number

none

The Big O of the number of exchanges of selection sort is ___. The Big O of the comparisons is ___.

Select the correct answer(s).  

(0/0)

---

O(n), O(n^2)

O(n), O(1)

O(n), O(n)

O(n2), O(n^2)

none

"Big O" for find, insert, and erase when hashing should be ___, ____, and ____, respectively.

Select the correct answer(s).  

(0/0)

---

log n, 1, 1

1, 1, 1

1, log n, log n

log n, log n, log n

none

Which of the following most accurately describes the selection sort algorithm?

Select the correct answer(s).  

(0/0)

---

Placing each item into the correct position in the list one at a time, like a hand of cards.

Finding the largest chunk of the sorted list, and then sorting afterward.

Gradually shifting larger items to the back of the array, and smaller items to the front.

Picking the smallest item and moving it to the front of the list until the list is sorted.

none

A map consists of a set of keys, each with one or more values. Which typically is/are unique?

Select the correct answer(s).  

(0/0)

---

Both

Neither

The values

The keys

none

Let H(value) be a function that returns the hash code of "value". If A == B, then ________.

Select the correct answer(s).  

(0/0)

---

H(A) == H(B)

There is no known relation between H(A) and H(B).

H(A) != H(B)

H(A) may be equal to H(B), but it is not likey because it is random