Data Structure, Databases

Question: What is the best definition of a collision in a hash table?
A
Two entries are identical except for their keys

B
Two entries with different data have exactly the same key

C
Two entries with different keys have exactly the same hash value

D
Two entries with exactly the same key have different hash values

Note: Not available
1. Report
Question: What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+g-h)]
A
abc-+de-fg+h-/*

B
*+a-bc/-de-+fgh

C
a+*b-/c-d-e+fgh

D
*+a-bc-/d+e-fgh

Note: Not available
1. Report
Question: A sparse matrix can be a lower-triangular matrix when____.
A
all the non-zero elements lie only on the leading diagonal

B
all the non-zero elements lie above the leading diagonal

C
all the non-zero elements lie below the leading diagonal

D
None of the above

Note: Not available
1. Report
Question: A graph in which all nodes are of an equal degree is known as:
A
Multigraph

B
Non - regular graph

C
Regular graph

D
Complete graph

Note: Not available
1. Report
Question: What is the maximum number of statements that may be recursive calls in a single function declaration?
A
1

B
2

C
n (n is the argument)

D
There is no fixed maximum

Note: Not available
1. Report
Question: Which additional requirement is placed on an array so that binary search may be used to locate an entry?
A
The array elements must form a heap

B
The array must have at least 2 entries

C
The array must be sorted

D
The array's size must be a power of two

Note: Not available
1. Report
Question: What is the worst-case scenario for heapsort to sort an array of n elements?
A
O(log n)

B
O(n)

C
O(n log n)

D
O(n2)

Note: Not available
1. Report
Question: The recurrence relation T(n)=mT(n/2)+an2 is satisfied by___
A
T(n)=O(nm)

B
T(n)=O(m*log(m))

C
T(n)=O(n*log(m))

D
T(n)=O(m*log(n))

Note: Not available
1. Report
Question: If 'data' is a circular array of CAPACITY elements and 'last' is an index in that array, what is the formula for the index after 'last'?
A
(last % 1) + CAPACITY

B
last % (1 + CAPACITY)

C
(last + 1) % CAPACITY

D
last + (1 % CAPACITY)

Note: Not available
1. Report
Question: Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child's value be stored (the array's first index is 0)?
A
data[i+1]

B
data[i+2]

C
data[2*i + 1]

D
data[2*i + 2]

Note: Not available
1. Report

First Prev 1 2 3 4 5 Next Last

Question: What is the best definition of a collision in a hash table?

Question: What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+g-h)]

Question: A sparse matrix can be a lower-triangular matrix when____.

Question: A graph in which all nodes are of an equal degree is known as:

Question: What is the maximum number of statements that may be recursive calls in a single function declaration?

Question: Which additional requirement is placed on an array so that binary search may be used to locate an entry?

Question: What is the worst-case scenario for heapsort to sort an array of n elements?

Question: The recurrence relation T(n)=mT(n/2)+an2 is satisfied by___

Question: If 'data' is a circular array of CAPACITY elements and 'last' is an index in that array, what is the formula for the index after 'last'?

Question: Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child's value be stored (the array's first index is 0)?