Question 1

Which statement is false?&#10;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.&#10;B)A node can be inserted at any point in a binary search tree.&#10;C)The process of creating a binary search tree actually sorts the data,and thus this process is called the binary tree sort.&#10;D)The binary search tree facilitates duplicate elimination.

Accepted Answer

A node in a binary search tree must be inserted according to specific rules: it is placed in a location that maintains the binary search tree property, where every node to the left of a parent node is less than the parent, and every node to the right is greater. You cannot insert a node "at any point" without following these rules.

Question 2

Which is not a typical application of queues?&#10;A)Routing packets in a computer network.&#10;B)File server handling file access requests from many clients.&#10;C)High-speed sorting.&#10;D)Print spooling.

Accepted Answer

Queues are commonly used in routing packets, file server handling requests, and print spooling. However, high-speed sorting is typically not an application of queues, as other data structures like arrays or linked lists are more efficient for sorting large amounts of data.

Question 3

Java performs automatic __________ of objects that are no longer referenced in a program.&#10;A)memory distribution.&#10;B)garbage collection.&#10;C)storage compression.&#10;D)trash aggregation.

Accepted Answer

Java performs automatic garbage collection of objects that are no longer referenced in a program. Garbage collection is the process of freeing up memory by removing objects that are no longer needed. This helps to prevent memory leaks and ensures efficient use of resources.

Question 4

If no memory is available,keyword new throws an __________.&#10;A)OutOfMemoryException.&#10;B)OutOfMemoryEvent.&#10;C)OutOfMemoryExhaustion.&#10;D)OutOfMemoryError.

Accepted Answer

In Java, when the `new` keyword is used and there is insufficient memory to allocate an object, an `OutOfMemoryError` is thrown.

Question 5

A queue is a __________ data structure.&#10;A)FOFI.&#10;B)FIFO.&#10;C)OFIF.&#10;D)IFOF.

Accepted Answer

A queue is a FIFO (First-In-First-Out) data structure, which means the element that is added first to the queue will be the first to be removed. Therefore, option B is the correct choice. The other options are not valid data structures.

Question 6

The technique of implementing each stack method as a call to a List method is called __________.&#10;A)delegation.&#10;B)delimiting.&#10;C)assigning.&#10;D)shifting responsibility.

Accepted Answer

The technique of implementing each stack method as a call to a List method is called delegation. This means that the implementation of the stack data structure is delegated to the implementation of a List data structure. Instead of implementing the stack methods separately, they are implemented by calling the corresponding List methods.

Question 7

Which statement about trees is false?&#10;A)A tree is a nonlinear,two-dimensional data structure.&#10;B)Each node in a tree contains two links.&#10;C)The children of a node are called siblings.&#10;D)A node with no children is called a leaf node.

Accepted Answer

Not all trees have nodes with exactly two links. This statement only applies to a specific type of tree called a binary tree. Other types of trees, such as ternary trees or n-ary trees, can have nodes with more than two links.

Question 8

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

Accepted Answer

The answer of Which statement is false?&#10;A)In a tightly packed...

Question 9

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

Accepted Answer

A linked list is not a fixed-size data structure; it can dynamically allocate memory as new nodes are added to the list. A linked list is appropriate when the number of data elements to be represented is unpredictable, and it consists of a linear collection of nodes connected by reference links. The link reference in the last node of a list is set to null to mark the end of the list.

Question 10

Which statement is false?&#10;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.&#10;B)Stacks support recursive method calls in the same manner as conventional,nonrecursive method calls.&#10;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.&#10;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.

Accepted Answer

The program execution stack contains the space for local variables of a method, not global variables. Therefore, statement C is false. A, B, and D are true statements about the program execution stack.

Question 11

A stack is a __________ data structure.&#10;A)FILO.&#10;B)FOLI.&#10;C)LOFI.&#10;D)LIFO.

Accepted Answer

The answer of A stack is a __________ data structure.&#10;A)FILO.&#10;B)FOLI.&#10;C)LOFI.&#10;D)LIFO....

Question 12

An isEmpty method you write to test whether a linked list is empty is called a __________ method.&#10;A)predefined.&#10;B)predicate.&#10;C)preemption.&#10;D)preorder.

Accepted Answer

The answer of An isEmpty method you write to test...

Question 13

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

Accepted Answer

The answer of Which statement is false?&#10;A)Linked lists are collections...

Question 14

List nodes normally are not necessarily stored in contiguous memory.Rather,they're ________ contiguous.&#10;A)physically&#10;B)approximately&#10;C)comparably&#10;D)logically

Accepted Answer

The answer of List nodes normally are not necessarily stored...

Question 15

Queue nodes are removed only from the __________ of the queue,and are inserted only at the __________ of the queue.&#10;A)tail,tail.&#10;B)tail,head.&#10;C)head,tail.&#10;D)head,head.

Accepted Answer

The answer of Queue nodes are removed only from the...

Question 16

A __________ class contains a reference member that refers to an object of the same class type.&#10;A)self-determining.&#10;B)self-pointing.&#10;C)self-linking.&#10;D)self-referential.

Accepted Answer

The answer of A __________ class contains a reference member...

Question 17

Usually a _________ in Java code indicates the end of a data structure.&#10;A)backslash character.&#10;B)forward slash character&#10;C)null reference.&#10;D)null pointer.

Accepted Answer

The answer of Usually a _________ in Java code indicates...

Deck 21: Custom Generic Data Structures