Data Structure, Databases

Question: In a complete binary tree, the parent of any node k can be determined by ________.
A
2k

B
2k+1

C
K/2

D
2K-1

Note: Not available
1. Report
Question: Consider a linked list of n elements which is pointed by an external pointer. What is the time taken to delete the element which is a successor of the pointed element by a given pointer?
A
O(1)

B
O(log2n)

C
O(n)

D
O(n*log2n)

Note: Not available
1. Report
Question: Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?
A
Any sibling of X is also a leaf

B
Any sibling of X contains at least 41 entries

C
The parent of X has exactly 42 entries

D
X has at least 41 siblings

Note: Not available
1. Report
Question: In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.
A
about log(n)

B
about 2*log(n)

C
about 3*log(n)

D
about 4*log(n)

Note: Not available
1. Report
Question: In a graph G, F is a spanning forest of G if (i)F is a subgraph of G containing all the nodes of G (ii)F is an order forest containing trees T1,T2,...Tn (iii)Ti contains all the nodes that are reachable in G from the root Ti and are contained in Tj for some j<i.. Which of the above conditions is/are true?
A
(i),(ii)

B
(ii),(iii)

C
(i),(iii)

D
(i),(ii) and (iii)

Note: Not available
1. Report
Question: Which information is not saved in the activation record when a function call is executed?
A
Current depth of recursion

B
Formal parameters

C
Location where the function should return when done

D
Local variables

Note: Not available
1. Report
Question: The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.
A
conceptually easier and completely dynamic

B
efficient if the sparse matrix is a band matrix

C
efficient in accessing an entry

D
all of these

Note: Not available
1. Report
Question: Which situation occurs frequently if the selected hash function is poor?
A
Overflow

B
Underflow

C
Collision

D
None of the above

Note: Not available
1. Report
Question: The post-order traversal of a binary tree starts with:
A
Post-order traversal of the left sub tree

B
Post-order traversal of the right sub tree

C
Post-order traversal of the root

D
Post-order traversal of the lowest node

Note: Not available
1. Report
Question: One difference between a queue and a stack is:
A
Queues require dynamic memory but stacks do not

B
Stacks require dynamic memory but queues do not

C
Queues use two ends of the structure but stacks use only one

D
Stacks use two ends of the structure but queues use only one

Note: Not available
1. Report

First Prev 2 3 4 5 6 Next Last

Question: In a complete binary tree, the parent of any node k can be determined by ________.

Question: Consider a linked list of n elements which is pointed by an external pointer. What is the time taken to delete the element which is a successor of the pointed element by a given pointer?

Question: Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?

Question: In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.

Question: Which information is not saved in the activation record when a function call is executed?

Question: The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.

Question: Which situation occurs frequently if the selected hash function is poor?

Question: The post-order traversal of a binary tree starts with:

Question: One difference between a queue and a stack is: