Data Structure, Databases

Question: Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?
A
1.6

B
2.9

C
4.2

D
5.5

Note: Not available
1. Report
Question: Which operations require linear time for their worst-case behavior in the linked-list version of a queue?
A
front

B
push

C
empty

D
None of these operations require linear time

Note: Not available
1. Report
Question: Which of the following statements about binary trees is false?
A
Every Node must have at least two children

B
Every non-empty tree has exactly one root node

C
Every node has at the most two children

D
None of the above

Note: Not available
1. Report
Question: How many real links are required for a sparse matrix having 10 rows, 10 columns and 15 non-zero elements? (Pick the nearest answer)
A
15

B
20

C
50

D
100

Note: Not available
1. Report
Question: In a graph G having the cut set matrix C(G) and an incidence matrix A(G), the rank of C(G) would be____
A
The same as that of A(G)

B
More than that of A(G)

C
Less than that of A(G)

D
Independent of the rank of A(G)

Note: Not available
1. Report
Question: Which of the operations is simpler in the doubly linked list than it is in the simple linked list?
A
Insertion

B
Deletion

C
Both a and b

D
None of the above

Note: Not available
1. Report
Question: Which of the following formulae in big-Oh notation best represents the expression n2+35n+6?
A
O(n3)

B
O(n2)

C
O(n)

D
O(42)

Note: Not available
1. Report
Question: The operation for removing an entry from a stack is traditionally called _______.
A
delete

B
peek

C
pop

D
remove

Note: Not available
1. Report
Question: Which queue allows insertion and deletion at both ends?
A
Simple queue

B
Circular queue

C
Dequeue

D
Special queue

Note: Not available
1. Report
Question: What kind of initialization needs to be done for a chained hash table?
A
None

B
The key at each array location must be initialized

C
The head pointer of each chain must be set to NULL

D
Both B and C must be carried out

Note: Not available
1. Report

First Prev 5 6 7 8 9 Next Last

Question: Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

Question: Which operations require linear time for their worst-case behavior in the linked-list version of a queue?

Question: Which of the following statements about binary trees is false?

Question: How many real links are required for a sparse matrix having 10 rows, 10 columns and 15 non-zero elements? (Pick the nearest answer)

Question: In a graph G having the cut set matrix C(G) and an incidence matrix A(G), the rank of C(G) would be____

Question: Which of the operations is simpler in the doubly linked list than it is in the simple linked list?

Question: Which of the following formulae in big-Oh notation best represents the expression n2+35n+6?

Question: The operation for removing an entry from a stack is traditionally called _______.

Question: Which queue allows insertion and deletion at both ends?

Question: What kind of initialization needs to be done for a chained hash table?