Ch. 24 Implementing Lists, Stacks, Queues, and Priority Queues

True

If the capacity of the array is exceeded, you need to create a new, larger array and copy all the elements from the current array to the new array.

B

Which data structure is appropriate to store customers in a clinic for taking flu shots? A. Stack B. Queue C. Priority Queue D. Array List E. Linked List

C

Which data structure is appropriate to store patients in an emergency room? A. Stack B. Queue C. Priority Queue D. Linked List

D

ArrayList is more efficient than LinkedList for the following operations: A. Insert/delete an element in the middle of the list. B. Insert/delete an element in the beginning of the list. C. Insert/delete an element at the end of the list. D. Retrieve an element given the index.

A, B, and D Explanation: (C) is not correct because capacity may equal to size.

In the implementation of MyArrayList, which of the following are true? A. size indicates the number of elements in the list. B. capacity is the length of the array used to store the elements in the list. C. capacity is always greater than size. D. size is reduced by 1 if an element is deleted from the list. E. capacity is reduced by 1 if an element is deleted from the list.

B, C, D and E

In the implementation of MyArrayList, which of the following are true? A. size never reduces. B. capacity never reduces. C. Inside MyArrayList, a regular array is used to store elements. D. size is not declared in MyArrayList, but declared in MyAbstractList as protected. E. If the current capacity equals to size, capacity is doubled when a new element is added to MyArrayList

A, B, C and D

In the implementation of MyLinkedList, which of the following are true? A. MyLinkedList contains all the methods defined in MyList. Additionally, MyLinkedList defines several new methods that are appropriate for processing a linked list. B. MyArrayList does not introduce new methods. All the methods in MyArrayList are defined in MyList. C. You can use a linked list to improve efficiency for adding and removing an element anywhere in a list. D. You should use an array list if your application does not require adding and removing an element anywhere in a list.

B, C and E Explanation: (D) is partially wrong, last and first points to the same node if a linked list contains one node.

In the implementation of MyLinkedList, which of the following are true? A. MyLinkedList has a capacity property. B. MyLinkedList has the properties named first and last to point to the nodes in a linked list. C. If a linked list is empty, first is null and last is null. D. If a linked list contains one element, first points to the node and last is null. E. last.next is always null.

A, B, C and D

In the implementation of MyLinkedList, which of the following are true? A. Node is defined as an inner class inside MyLinkedList. B. Node is defined as a static inner class inside MyLinkedList because it does not reference any instance data fields in MyLinkedList. C. Node has a property named next that links to the node after this node. D. Node has a property named element that stores an element.

C and D

In the implementation of MyStack and MyQueue, which of the following are true? A. MyStack contains all the methods defined in MyArrayList. B. MyQueue contains all the methods defined in MyLinkedList. C. MyStack contains an array list for storing elements. D. MyQueue contains a linked list for storing elements.

A and B

LinkedList is more efficient than ArrayList for the following operations: A. Insert/delete an element in the middle of the list. B. Insert/delete an element in the beginning of the listc. Insert/delete an element at the end of the list. C. Retrieve an element given the index.

True

MyLinkedList is more efficient if you need to insert elements into and delete elements from the beginning of the list.

True

One of two ways to implement a list is to use an array to store the elements. Array size is fixed.

True

The other way to implement a list is to use a linked structure. A linked structure consists of nodes. Each node is dynamically created to hold an element. All nodes are linked together to form a list.

A

Suppose list1 is a MyArrayList and list2 is a MyLinkedList. Both contains 1 million double values. Analyze the following code: A: for (int i = 0; i < list1.size(); i++) sum += list1.get(i); B: for (int i = 0; i < list2.size(); i++) sum += list2.get(i); A. Code fragment A is more efficient that code fragment B. B. Code fragment B is more efficient that code fragment A. C. Code fragment A is as efficient as code fragment B.

B

Suppose list1 is an MyArrayList and list2 is a MyLinkedList. Both contains 1 million double values. Analyze the following code: A: for (int i = 0; i < 100000; i++) list1.add(0, i); B: for (int i = 0; i < 100000; i++) list2.add(0, i); A. Code fragment A runs faster than code fragment B. B. Code fragment B runs faster than code fragment A. C. Code fragment A runs as fast as code fragment B.

C

Suppose list1 is an MyArrayList and list2 is a MyLinkedList. Both contains 1 million double values. Analyze the following code: A: for (int i = 0; i < 100000; i++) list1.add(i); B: for (int i = 0; i < 100000; i++) list2.add(i); A. Code fragment A runs faster than code fragment B. B. Code fragment B runs faster than code fragment A. C. Code fragment A runs as fast as code fragment B.

B

Suppose list1 is an MyArrayList and list2 is a MyLinkedList. Both contains 1 million double values. Analyze the following code: A: while (list1.size() > 0) list1.remove(0); B: while (list2.size() > 0) list2.remove(0); A. Code fragment A runs faster than code fragment B. B. Code fragment B runs faster than code fragment A. C. Code fragment A runs as fast as code fragment B.

C

Suppose list1 is an MyArrayList and list2 is a MyLinkedList. Both contains 1 million double values. Analyze the following code: A: while (list1.size() > 0) list1.remove(size() - 1); B: while (list2.size() > 0) list2.remove(size() - 1); A. Code fragment A runs faster than code fragment B. B. Code fragment B runs faster than code fragment A. C. Code fragment A runs as fast as code fragment B.

A

Suppose the rule of the party is that the participants who arrive later will leave earlier. Which data structure is appropriate to store the participants? A. Stack B. Queue C. Array List D. Linked List

A, B, C and D

Which of the following are true? A. A stack can be viewed as a special type of list, where the elements are accessed, inserted, and deleted only from the end, called the top, of the stack. B. A queue represents a waiting list. A queue can be viewed as a special type of list, where the elements are inserted into the end (tail) of the queue, and are accessed and deleted from the beginning (head) of the queue. C. Since the insertion and deletion operations on a stack are made only at the end of the stack, using an array list to implement a stack is more efficient than a linked list. D. Since deletions are made at the beginning of the list, it is more efficient to implement a queue using a linked list than an array list.

A, B, C, D, and E

Which of the following operations are supported by a list? A. Retrieve an element from this list. B. Insert a new element to this list. C. Delete an element from this list. D. Find how many elements are in this list. E. Find whether an element is in this list.

A, B, C, D, and E

Which of the following statements are true? A. MyArrayList and MyLinkedList are two concrete implementations of MyList. B. MyArrayList is implemented using an array. The array is dynamically created. If the capacity of the array is exceeded, create a new larger array and copy all the elements from the current array to the new array. C. MyLinkedList is implemented using a linked structure. D. A linked structure consists of nodes. Each node is dynamically created to hold an element. All the nodes are linked together to form a list. E. MyAbstractList partially implements MyList.

A. A list

________ is a data structure to store data in sequential order. A. A list B. A set C. A tree D. A stack E. A queue