Deck 5: Linked Lists

Question 1

In the following code segment: final int SIZE = 20;// line 1
Int groupSize;// line 2
GroupSize = SIZE;// line 3
GroupSize = groupSize * 2;// line 4
What is the value of groupSize in line 2?

A)0
B)null
C)20
D)40

Answer 1

B

Question 2

An array-based implementation of an ADT list ______.

A)requires less memory to store an item than a reference-based implementation
B)is not a good choice for a small list
C)has a variable size
D)has items which explicitly reference the next items

Answer 2

A

Question 3

In a linear linked list,______.

A)the next reference of each node has the value null
B)the last node references the first node
C)the precede reference of the dummy head node references the last node
D)the next reference of the last node has the value null

Answer 3

D

Question 4

The last node of a linear linked list ______.

A)has the value null
B)has a next reference whose value is null
C)has a next reference which references the first node of the list
D)cannot store any data

Question 5

A linked list contains components,called ______,which are linked to one another.

A)nodes
B)arrays
C)vectors
D)references

Question 6

In the following code segment: Integer maxNum;
MaxNum = new Integer (15);
______ is a reference variable.

A)Integer
B)maxNum
C)new
D)15

Question 7

If you attempt to use a reference variable before it is instantiated,a(n)______ will be thrown.

A)IndexOutOfBoundsException
B)InstantiationException
C)IllegalAccessException
D)NullPointerException

Question 8

Which of the following statements is used to insert a new node,referenced by newNode,at the end of a linear linked list?

A)newNode.setNext(curr);
Prev.setNext(newNode);
B)newNode.setNext(head);
Head = newNode;
C)prev.setNext(newNode);
D)prev.setNext(curr);
NewNode.setNext(curr);

Question 9

Which of the following exceptions can be thrown if an object cannot be instantiated?

A)IllegalAccessException
B)ArithmeticException
C)IndexOutOfBoundsException
D)NoSuchMethodException

Question 10

To delete a node N from a linear linked list,you will need to ______.

A)set the reference next in the node that precedes N to reference the node that follows N
B)set the reference next in the node that precedes N to reference N
C)set the reference next in the node that follows N to reference the node that precedes N
D)set the reference next in N to reference the node that follows N

Question 11

A reference variable declared as a data field within a class has the default value ______.

A)0
B)-1
C)null
D)empty

Question 12

If a linked list is empty,the statement head.getNext()will throw a(n)______.

A)IllegalAccessException
B)ArithmeticException
C)IndexOutOfBoundsException
D)NullPointerException

Question 13

When you declare a variable that refers to an object of a given class,you are creating a(n)______ to the object.

A)interface
B)reference
C)method
D)ADT

Question 14

Which of the following statements deletes the node that curr references?

A)prev.setNext(curr);
B)curr.setNext(prev);
C)curr.setNext(curr.getNext());
D)prev.setNext(curr.getNext());

Question 15

In Java,every class is ultimately derived from the class _____ through inheritance.

A)String
B)Object
C)Math
D)Exception

Question 16

Which of the following will be true when the reference variable curr references the last node in a linear linked list?

A)curr == null
B)head == null
C)curr.getNext()== null
D)head.getNext()== null

Question 17

According to the principle of information hiding,the data fields of a class must be declared as ______.

A)public
B)protected
C)private
D)abstract

Question 18

Which of the following statements deletes the first node of a linear linked list that has 10 nodes?

A)head.setNext(curr.getNext());
B)prev.setNext(curr.getNext());
C)head = head.getNext();
D)head = null;

Question 19

A reference variable whose sole purpose is to locate the first node in a linked list is called ______.

A)top
B)front
C)head
D)first

Question 20

In a reference-based implementation of an ADT list ______.

A)increasing the size of the list can waste storage and time
B)less memory is required to store an item than in an array-based implementation
C)an item explicitly references the next item
D)the location of the item after a particular item is implied

Question 21

A local reference variable has a default value of null.

Question 22

Insertion at the end of a linear linked list is a special case.

Question 23

Which of the following is NOT true about all circular linked lists?

A)every node references a successor
B)the last node references the first node
C)the precede reference of each node references the node that precedes it
D)no node contains null in its next reference

Question 24

Which of the following is true about all doubly linked lists?

A)each node references both its predecessor and its successor
B)the precede reference of the last node has the value null
C)the last node references the first node
D)the precede reference of the first node references the last node

Question 25

A dummy head node ______.

A)facilitates adding nodes at the end the linked list
B)is used to store the first item in the linked list
C)is the second node in the linked list
D)is always present,even when the linked list is empty

Question 26

When a linked list is empty,the value of the head reference is null.

Question 27

Which of the following is true about a circular doubly linked list?

A)inserting into the first position of the list is a special case
B)deleting from the last position of the list is not a special case
C)the precede reference of the last node has the value null
D)the next reference of the last node has the value null

Question 28

In a circular doubly linked list,inserting into the first position of the list is a special case.

Question 29

No node in a circular linked list contains the value null in its next reference.

Question 30

Each node in a linear linked list references both its predecessor and its successor.

Question 31

A ______ can be used to store global information about a linked list.

A)head record
B)tail reference
C)precede reference
D)dummy head node

Question 32

_______ is a process that transforms an object into a stream of bytes that can be saved to and restored from a file.

A)Information hiding
B)Object serialization
C)Encapsulation
D)Inheritance

Question 33

Which of the following CANNOT be used in a linear linked list?

A)a head node
B)a dummy head node
C)a precede reference
D)a tail reference

Question 34

A _______ can be used to facilitate adding nodes to the end of a linear linked list.

A)head record
B)dummy head node
C)tail reference
D)precede reference

Question 35

The constant null can be used as the value of a reference to any type of object.

Question 36

In Java,the programmer must explicitly deallocate memory.

Question 37

Every node in a circular linked list has a successor.

Question 38

In all circular linked lists,______.

A)every node references a predecessor
B)every node references a successor
C)the next reference of the last node has the value null
D)each node references both its predecessor and its successor

Question 39

A ______ allows the deletion of a node from a linked list without the need to traverse the list to establish a trailing reference.

A)head record
B)dummy head node
C)tail reference
D)precede reference

Question 40

The ADT list can have an arbitrary length.

Question 41

In Java,when is an object marked for garbage collection?

Question 42

What is a dummy head node?

Question 43

What is the difference between a linked list and an array in terms of their capacity to store data?

Question 44

What does a traversal operation do?

Question 45

What is the difference between a linear linked list and a circular linked list?

Question 46

Write the code segment that is used to insert a new node,referenced by the reference variable newNode,at the beginning of a linear linked list.

Question 47

Name two advantages of implementing the ADT list as a linked list (reference based)instead of an array.

Question 48

Write the code fragment to delete the node that the reference variable curr references in a circular doubly linked list?

Question 49

Name two advantages of implementing the ADT list as an array instead of using a linked list (reference based).

Question 50

Why is a loop necessary to find an arbitrary node in a linked list?

Question 51

Write the code segment which is used to insert a new node,referenced by the reference variable newNode,between the nodes referenced by the reference variables prev and curr in a linear linked list.

Question 52

If the implementation of a linked list maintains information about only one node,the head of the list,how is it able to be a collection of more than one node? In other words,how can we have a linked list of 20 nodes,if the list implementation only stores information about the head node?

Question 53

What does a node of a linear linked list contain?

Question 54

Suppose we want to write a loop that traverses a doubly-linked circular linked list.Assume that each node has a prev and a next reference,and the list itself maintains a reference to a head node.What is wrong with this loop header?
for (Node curr = head;curr != head.prev;curr = curr.next)

Question 55

Write the code fragment to insert a new node that the reference variable newNode references before the node referenced by the reference variable curr in a doubly linked list.

Question 56

What are the three high-level steps to delete a node from a linear linked list?

Question 57

What are two advantages of using a reference-based implementation of the ADT list instead of an array-based implementation?

Question 58

What is a head record?

Question 59

What are the three high-level steps to insert a new node into a linear linked list?

Question 60

What information is stored in a reference to an object?