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) The java.util package contains class LinkedList.
D) By convention,the link reference in the last node of a list is set to null to mark the end of the list.
Correct Answer
verified
Multiple Choice
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.
Correct Answer
verified
Multiple Choice
A) delegation.
B) delimiting.
C) assigning.
D) shifting responsibility.
Correct Answer
verified
Multiple Choice
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.
Correct Answer
verified
Multiple Choice
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.
Correct Answer
verified
Multiple Choice
A) self-determining.
B) self-pointing.
C) self-linking.
D) self-referential.
Correct Answer
verified
Multiple Choice
A) OutOfMemoryException.
B) OutOfMemoryEvent.
C) OutOfMemoryExhaustion.
D) OutOfMemoryError.
Correct Answer
verified
Multiple Choice
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.
Correct Answer
verified
Multiple Choice
A) backslash character.
B) forward slash character
C) null reference.
D) null pointer.
Correct Answer
verified
Multiple Choice
A) tail,tail.
B) tail,head.
C) head,tail.
D) head,head.
Correct Answer
verified
Multiple Choice
A) memory distribution.
B) garbage collection.
C) storage compression.
D) trash aggregation.
Correct Answer
verified
Multiple Choice
A) Routing packets in a computer network.
B) File server handling file access requests from many clients.
C) High-speed sorting.
D) Print spooling.
Correct Answer
verified
Multiple Choice
A) FOFI.
B) FIFO.
C) OFIF.
D) IFOF.
Correct Answer
verified
Multiple Choice
A) FILO.
B) FOLI.
C) LOFI.
D) LIFO.
Correct Answer
verified
Multiple Choice
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.
Correct Answer
verified
Multiple Choice
A) predefined.
B) predicate.
C) preemption.
D) preorder.
Correct Answer
verified
Showing 1 - 16 of 16
Related Exams