Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
22 Cards in this Set
- Front
- Back
|
Exceptions should be thrown locally and handled in the callerT/F |
True |
|
|
When listing exceptions that are to be handled, you should list the most general exception first followed by the more specific ones T/F |
F |
|
|
Code after a throw is executed as a means to clean things up T/F |
F |
|
|
Nodes in a linked list are always implemented as classes T/F |
F |
|
|
Are insertions/deletions in a linked list more or less efficient than arrays? |
more |
|
|
To make insertions at the back more efficient linked lists often employ a __ pointer |
tail |
|
|
Each node in a linked list is statically allocated on the stack for efficiency purposes T/F |
F |
|
|
In a uni directional linked list transversals follow a head to tail direction T/F |
T |
|
|
Inserting at the front of a linked list that does not use a dummy head node, means that the head pointer must be adjusted T/F |
T |
|
|
A node in a uni directional linked list consists of two members a data item and a pointer to the previous node T/F |
F |
|
|
A node in a bi directional linked list consists of three members a data item and two pointers a previous and a next T/F |
T |
|
|
Using dummy head/tail nodes simplifies insertions/removals since it eliminates a lot of special case considerations that need to be made otherwise T/F |
T |
|
|
An empty linked list that makes use of dummy nodes at either end will consist of two nodes T/F |
T |
|
|
When using dummy nodes, the head and tail pointers will never have to be updated with insertions/removals T/F |
T |
|
|
Inserting at the end of a uni directional linked list that does not use a tail dummy node, necessitates a forward transveral in order to find the next to last node T/F |
F |
|
|
Inserting at the end of a uni directional linked list that does use a tail dummy node, necessitates a forward transveral in order to find the next to last node T/F |
T |
|
|
The Node class is usually nested within the LinkedList class, since they are so closely related T/F |
T |
|
|
Methods in the LinkedList class have public access to members of the Node class since this offers great flexibility and efficiency T/F |
T |
|
|
Doesthis code position iter on the last or next to last node? while (iter != tail) { iter = iter->next; } |
last |
|
|
[2pts] Does this code position iter on the last or next to last node? while (iter->next != tail) { iter = iter->next; } |
next to last |
|
|
The methods that accept an index and a value are used with position based lists T/F |
T
|
|
|
The methods that accept a value only are used with value based lists T/F |
T |
