DIS_Quiz3

Question 1

Linked lists remove requirement that list elements be stored in consecutive memory locations.

Answer 1

True

Question 2

Linked lists have direct access to each element of the list

Answer 2

False

Question 3

Insertion is not possible at the beginning of a linked list

Answer 3

False

Question 4

Given the linked list above, what is the value first->next->data?

Answer 4

17

Question 5

Adding an element to the end of an array-based list is easier (requires less operation) than linked lists.

Answer 5

True

Question 6

The array-based implementation of a list works well for lists with many insertions and deletions.

Answer 6

False

Question 7

Since default assignment operator makes a shallow copy, assignment operator should be overloaded for a deep copy when there is dynamically allocated data members in a class.

Answer 7

True

Question 8

A linked list with 100 elements uses more memory than an array-based list with a capacity of 100 elements.

Answer 8

True

Question 9

Which of the following does not require shifting during insertion or deletion?

Answer 9

Linked List

Question 10

Which of the following accepts the capacity of the list as a parameter of the constructor (e.g., List aList (500))?

Answer 10

List with Dynamic Array