Correct Answer
verified
Multiple Choice
A) hashes
B) keys
C) links
D) indexes
Correct Answer
verified
Multiple Choice
A) traversal
B) initialization
C) visit with removal
D) insertion
Correct Answer
verified
Multiple Choice
A) dynamic arrays
B) linked lists
C) data stacks
D) hash tables
Correct Answer
verified
Multiple Choice
A) probe.data = next.data
B) probe.next = targetItem.data
C) probe = probe.next
D) probe.head = probe.next
Correct Answer
verified
Multiple Choice
A) the tail pointer must be reset
B) the first item must be deleted
C) the head pointer must be reset
D) the last item must be deleted
Correct Answer
verified
True/False
Correct Answer
verified
True/False
Correct Answer
verified
True/False
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) twoDim[ 2 ][ 1 ]
B) twoDim[ 4 ][ 3 ]
C) twoDim[ 1 ][ 2 ]
D) twoDim[ 2 ][ 3 ]
Correct Answer
verified
Multiple Choice
A) by using the 0 index
B) with the first() method
C) by following a head link
D) by a call to getLink(1)
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) a collection of data points that represent an object
B) a list of values that are indexes to a database
C) a numeric value that points to a position in RAM where data can be found
D) a sequence of items that can be accessed at given index positions
Correct Answer
verified
True/False
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) list
B) array
C) linked list
D) dictionary
Correct Answer
verified
True/False
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) it is limited to storing numbers
B) it behaves much like a dictionary
C) it can only hold character values
D) you can define its size at run time
Correct Answer
verified
Showing 21 - 40 of 50
Related Exams