Question 1

Which statement is false?

Accepted Answer

A)  When a method call is made, the called method must know how to return to its caller, so the return address is pushed onto the program execution stack. 
B)  Stacks support recursive method calls in the same manner as conventional, nonrecursive method calls. 
C)  The program execution stack contains the space created for a method's global variables on each invocation of that method during a program's execution. 
D)  When a method returns to its caller, the memory for that method's local variables is popped off the stack and those variables are no longer known to the program. 
A)  When a method call is made, the called method must know how to return to its caller, so the return address is pushed onto the program execution stack. 
B)  Stacks support recursive method calls in the same manner as conventional, nonrecursive method calls. 
C)  The program execution stack contains the space created for a method's global variables on each invocation of that method during a program's execution. 
D)  When a method returns to its caller, the memory for that method's local variables is popped off the stack and those variables are no longer known to the program. C

Question 2

Which statement is false?

Accepted Answer

A)  A linked list is a linear collection of self-referential class objects called nodes connected by reference links. 
B)  A linked list is appropriate when the number of data elements to be represented in the data structure is unpredictable. 
C)  A linked list is a fixed-size data structure. 
D)  By convention, the link reference in the last node of a list is set to null to mark the end of the list. 
A)  A linked list is a linear collection of self-referential class objects called nodes connected by reference links. 
B)  A linked list is appropriate when the number of data elements to be represented in the data structure is unpredictable. 
C)  A linked list is a fixed-size data structure. 
D)  By convention, the link reference in the last node of a list is set to null to mark the end of the list. C

Question 3

Which statement about trees is false?

Accepted Answer

A)  A tree is a nonlinear, two-dimensional data structure. 
B)  Each node in a tree contains two links. 
C)  The children of a node are called siblings. 
D)  A node with no children is called a leaf node. 
A)  A tree is a nonlinear, two-dimensional data structure. 
B)  Each node in a tree contains two links. 
C)  The children of a node are called siblings. 
D)  A node with no children is called a leaf node. B

Question 4

An isEmpty method you write to test whether a linked list is empty is called a __________ method.

Accepted Answer

A)  predefined. 
B)  predicate. 
C)  preemption. 
D)  preorder. 
A)  predefined. 
B)  predicate. 
C)  preemption. 
D)  preorder.

Question 5

A stack is a __________ data structure.

Accepted Answer

A)  FILO. 
B)  FOLI. 
C)  LOFI. 
D)  LIFO. 
A)  FILO. 
B)  FOLI. 
C)  LOFI. 
D)  LIFO.

Question 6

Queue nodes are removed only from the __________ of the queue, and are inserted only at the __________ of the queue.

Accepted Answer

A)  tail, tail. 
B)  tail, head. 
C)  head, tail. 
D)  head, head. 
A)  tail, tail. 
B)  tail, head. 
C)  head, tail. 
D)  head, head.

Question 7

Usually a _________ in Java code indicates the end of a data structure.

Accepted Answer

A)  backslash character. 
B)  forward slash character 
C)  null reference. 
D)  null pointer. 
A)  backslash character. 
B)  forward slash character 
C)  null reference. 
D)  null pointer.

Question 8

Which statement is false?

Accepted Answer

A)  In a tightly packed binary tree, each level contains about twice as many elements as the previous level. 
B)  When searching a tightly packed 1,000,000-element binary search tree, approximately 20 comparisons need to be made. 
C)  The level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level. 
D)  Searching a binary tree for a value that matches a key value is slow for loosely packed trees. 
A)  In a tightly packed binary tree, each level contains about twice as many elements as the previous level. 
B)  When searching a tightly packed 1,000,000-element binary search tree, approximately 20 comparisons need to be made. 
C)  The level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level. 
D)  Searching a binary tree for a value that matches a key value is slow for loosely packed trees.

Question 9

Java performs automatic __________ of objects that are no longer referenced in a program.

Accepted Answer

A)  memory distribution. 
B)  garbage collection. 
C)  storage compression. 
D)  trash aggregation. 
A)  memory distribution. 
B)  garbage collection. 
C)  storage compression. 
D)  trash aggregation.

Question 10

A queue is a __________ data structure.

Accepted Answer

A)  FOFI. 
B)  FIFO. 
C)  OFIF. 
D)  IFOF. 
A)  FOFI. 
B)  FIFO. 
C)  OFIF. 
D)  IFOF.

Question 11

Which statement is false?

Accepted Answer

A)  Linked lists are collections of data items "lined up in a row"-- insertions and deletions can be made anywhere in a linked list. 
B)  Insertions and deletions are made only at one end of a stack, its top. 
C)  Insertions and deletions are made only at one end of a queue, its tail. 
D)  Binary trees facilitate high-speed searching and sorting of data. 
A)  Linked lists are collections of data items "lined up in a row"-- insertions and deletions can be made anywhere in a linked list. 
B)  Insertions and deletions are made only at one end of a stack, its top. 
C)  Insertions and deletions are made only at one end of a queue, its tail. 
D)  Binary trees facilitate high-speed searching and sorting of data.

Question 12

Which statement is false?

Accepted Answer

A)  The shape of a binary search tree that corresponds to a set of data can vary, depending on the order in which the values are inserted into the tree. 
B)  A node can be inserted at any point in a binary search tree. 
C)  The process of creating a binary search tree actually sorts the data, and thus this process is called the binary tree sort. 
D)  The binary search tree facilitates duplicate elimination. 
A)  The shape of a binary search tree that corresponds to a set of data can vary, depending on the order in which the values are inserted into the tree. 
B)  A node can be inserted at any point in a binary search tree. 
C)  The process of creating a binary search tree actually sorts the data, and thus this process is called the binary tree sort. 
D)  The binary search tree facilitates duplicate elimination.

Question 13

List nodes normally are not necessarily stored in contiguous memory. Rather, they're ________ contiguous.

Accepted Answer

A)  physically 
B)  approximately 
C)  comparably 
D)  logically 
A)  physically 
B)  approximately 
C)  comparably 
D)  logically

Question 14

A __________ class contains a reference member that refers to an object of the same class type.

Accepted Answer

A)  self-determining. 
B)  self-pointing. 
C)  self-linking. 
D)  self-referential. 
A)  self-determining. 
B)  self-pointing. 
C)  self-linking. 
D)  self-referential.

Question 15

The technique of implementing each stack method as a call to a List method is called __________.

Accepted Answer

A)  delegation. 
B)  delimiting. 
C)  assigning. 
D)  shifting responsibility. 
A)  delegation. 
B)  delimiting. 
C)  assigning. 
D)  shifting responsibility.

Question 16

If no memory is available, keyword new throws an __________.

Accepted Answer

A)  OutOfMemoryException. 
B)  OutOfMemoryEvent. 
C)  OutOfMemoryExhaustion. 
D)  OutOfMemoryError. 
A)  OutOfMemoryException. 
B)  OutOfMemoryEvent. 
C)  OutOfMemoryExhaustion. 
D)  OutOfMemoryError.

Question 17

Which is not a typical application of queues?

Accepted Answer

A)  Routing packets in a computer network. 
B)  File server handling file access requests from many clients. 
C)  High-speed sorting. 
D)  Print spooling. 
A)  Routing packets in a computer network. 
B)  File server handling file access requests from many clients. 
C)  High-speed sorting. 
D)  Print spooling.

Exam 21: Custom Generic Data Structures

Which statement is false?

Which statement is false?

Which statement about trees is false?

An isEmpty method you write to test whether a linked list is empty is called a __________ method.

A stack is a __________ data structure.

Queue nodes are removed only from the __________ of the queue, and are inserted only at the __________ of the queue.

Usually a _________ in Java code indicates the end of a data structure.

Which statement is false?

Java performs automatic __________ of objects that are no longer referenced in a program.

A queue is a __________ data structure.

Which statement is false?

Which statement is false?

List nodes normally are not necessarily stored in contiguous memory. Rather, they're ________ contiguous.

A __________ class contains a reference member that refers to an object of the same class type.

The technique of implementing each stack method as a call to a List method is called __________.

If no memory is available, keyword new throws an __________.

Which is not a typical application of queues?

Introduction to Computers and Java

Introduction to Java Applications

Control Statements

Control Statements

Methods

Arrays and Arraylists

Introduction to Classes and Objects

Classes and Objects: a Deeper Look

Object Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Exception Handling

Gui Components

Graphics and Java 2D

Fundamentals of Characters and Strings

Files, Streams and Object Serialization

Generic Collections

Lambdas

Recursion

Searching, Sorting and Big O

Generic Classes and Methods

GUI

Concurrency

Accessing Databases With JDBC

JavaFX

Filters

Queue nodes are removed only from the of the queue, and are inserted only at the of the queue.