Question 1

A linked data structure contains nodes and links.

Accepted Answer

A) True 
 B)False

Question 2

Given the Node class created in number 6 above,write Java statements to insert a new node containing Chattanooga,23.7)into an empty list.

Accepted Answer

Node head=null;
Node current=n

Question 3

A binary tree has exactly _________ link instance variables.

Accepted Answer

A) zero 
B) one 
C) two 
D) three 
A) zero 
B) one 
C) two 
D) three

Question 4

Making the Node class a private inner class of a linked data structure is an example of:

Accepted Answer

A) polymorphism 
B) encapsulation 
C) inheritance 
D) all of the above 
A) polymorphism 
B) encapsulation 
C) inheritance 
D) all of the above

Question 5

The first node in a linked list is commonly referred to as the ________ node.

Accepted Answer

A) head 
B) tail 
C) predecessor 
D) successor 
A) head 
B) tail 
C) predecessor 
D) successor

Question 6

A deep copy of an object is a copy that has references in common with the original object.

Accepted Answer

A) True 
 B)False

Question 7

A _________________ maps a data value such as a String into a number:

Accepted Answer

A) recursive function 
B) key function 
C) hash function 
D) none of the above 
A) recursive function 
B) key function 
C) hash function 
D) none of the above

Question 8

Discuss the differences between a queue and a stack.

Accepted Answer

A stack is a last-in/first-out LIFO)data

Question 9

If you define a clone method,the class should implement the Cloneable interface.

Accepted Answer

A) True 
 B)False

Question 10

A queue is a last-in/first-out structure.

Accepted Answer

A) True 
 B)False

Question 11

Recursively visiting the root node,left subtree and then the right subtree describes:

Accepted Answer

A) preorder processing 
B) inorder processing 
C) postorder processing 
D) none of the above 
A) preorder processing 
B) inorder processing 
C) postorder processing 
D) none of the above

Question 12

Recursively visiting the left subtree,right subtree and then the root describes:

Accepted Answer

A) preordering processing 
B) inorder processing 
C) postorder processing 
D) none of the above 
A) preordering processing 
B) inorder processing 
C) postorder processing 
D) none of the above

Question 13

In Java,a node is a/an:

Accepted Answer

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

Question 14

In Java,you indicate the end of a linked list be setting the link instance variable of the last node in the linked list to __________.

Accepted Answer

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

Question 15

Redraw the diagram created in number 4 above after deleting the head node.

Accepted Answer

The answer of Redraw the diagram created in number 4...

Question 16

What is the result of an inorder traversal of the binary search tree created in question 12 above?

Accepted Answer

The answer of What is the result of an inorder...

Question 17

A copy constructor and a clone method should normally make a deep copy whenever possible.

Accepted Answer

A) True 
 B)False

Question 18

An iterator is any object that allows you to step through the list one item at a time.

Accepted Answer

A) True 
 B)False

Question 19

Linked lists introduce the possibility of a privacy leak occurring.

Accepted Answer

A) True 
 B)False

Question 20

Java does not come with a LinkedList library class.

Accepted Answer

A) True 
 B)False

A linked data structure contains nodes and links.

Given the Node class created in number 6 above,write Java statements to insert a new node containing Chattanooga,23.7)into an empty list.

A binary tree has exactly _________ link instance variables.

Making the Node class a private inner class of a linked data structure is an example of:

The first node in a linked list is commonly referred to as the ________ node.

A deep copy of an object is a copy that has references in common with the original object.

A _________________ maps a data value such as a String into a number:

Discuss the differences between a queue and a stack.

If you define a clone method,the class should implement the Cloneable interface.

A queue is a last-in/first-out structure.

Recursively visiting the root node,left subtree and then the right subtree describes:

Recursively visiting the left subtree,right subtree and then the root describes:

In Java,a node is a/an:

In Java,you indicate the end of a linked list be setting the link instance variable of the last node in the linked list to __________.

Redraw the diagram created in number 4 above after deleting the head node.

What is the result of an inorder traversal of the binary search tree created in question 12 above?

A copy constructor and a clone method should normally make a deep copy whenever possible.

An iterator is any object that allows you to step through the list one item at a time.

Linked lists introduce the possibility of a privacy leak occurring.

Java does not come with a LinkedList library class.

Getting Started

Console Input and Output

Flow of Control

Defining Classes I

Defining Classes II

Arrays

Inheritance

Polymorphism and Abstract Classes

Exception Handling

File IO

Recursion

Uml and Patterns

Interfaces and Inner Classes

Generics and the Arraylist Class

Collections,maps,and Iterators

Swing I

Swing II

Java Never Ends

Applets

Filters

Exam 15: Linked Data Structures

A linked data structure contains nodes and links.

Given the Node class created in number 6 above,write Java statements to insert a new node containing Chattanooga,23.7)into an empty list.

A binary tree has exactly _________ link instance variables.

Making the Node class a private inner class of a linked data structure is an example of:

The first node in a linked list is commonly referred to as the ________ node.

A deep copy of an object is a copy that has references in common with the original object.

A _________________ maps a data value such as a String into a number:

Discuss the differences between a queue and a stack.

If you define a clone method,the class should implement the Cloneable interface.

A queue is a last-in/first-out structure.

Recursively visiting the root node,left subtree and then the right subtree describes:

Recursively visiting the left subtree,right subtree and then the root describes:

In Java,a node is a/an:

In Java,you indicate the end of a linked list be setting the link instance variable of the last node in the linked list to __________.

Redraw the diagram created in number 4 above after deleting the head node.

What is the result of an inorder traversal of the binary search tree created in question 12 above?

A copy constructor and a clone method should normally make a deep copy whenever possible.

An iterator is any object that allows you to step through the list one item at a time.

Linked lists introduce the possibility of a privacy leak occurring.

Java does not come with a LinkedList library class.

Getting Started

Console Input and Output

Flow of Control

Defining Classes I

Defining Classes II

Arrays

Inheritance

Polymorphism and Abstract Classes

Exception Handling

File IO

Recursion

Uml and Patterns

Interfaces and Inner Classes

Generics and the Arraylist Class

Collections,maps,and Iterators

Swing I

Swing II

Java Never Ends

Applets

Filters