Data Structure, Databases

Question: You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?
A
The count must be zero

B
The count must be CAPACITY

C
The count can be zero or CAPACITY, but no other value can occur

D
None of the above

Note: Not available
1. Report
Question: What is the worst-case scenario for the binary search for finding a single item in an array?
A
Constant time

B
Logarithmic time

C
Linear time

D
Quadratic time

Note: Not available
1. Report
Question: A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:
A
Full binary tree

B
2-Tree

C
Threaded tree

D
Complete binary tree

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+f-gh

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

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

Note: Not available
1. Report
Question: In the linked representation of a sparse matrix, the head node for a column list stores_____
A
a pointer to the next column head node

B
a pointer to the first node in the column list

C
column number

D
All of the above

Note: Not available
1. Report
Question: The hashing function which dynamically adapts to changes in the table being accessed is called ________.
A
Real

B
Linear

C
Partial

D
Virtual

Note: Not available
1. Report
Question: What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?
A
Overflow

B
Underflow

C
Null

D
Garbage collection

Note: Not available
1. Report
Question: If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?
A
2h + 1 - 1

B
2h + 1

C
2h

D
2h + 1 + 1

Note: Not available
1. Report
Question: What is the minimum number of edges and vertices possible in a non- planar graph?
A
10 edges, 5 vertices

B
9 edges, 6 vertices

C
6 edges, 4 vertices

D
9 edges, 5 vertices

Note: Not available
1. Report
Question: Which of the following is the worst-case scenario for operations on heaps?
A
Neither insertion nor removal is better than linear

B
Insertion is better than linear, but removal is not

C
Removal is better than linear, but insertion is not

D
Both insertion and removal are better than linear

Note: Not available
1. Report

First Prev 7 8 9 10 Next Last

Question: You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

Question: What is the worst-case scenario for the binary search for finding a single item in an array?

Question: A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

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

Question: In the linked representation of a sparse matrix, the head node for a column list stores_____

Question: The hashing function which dynamically adapts to changes in the table being accessed is called ________.

Question: What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

Question: If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

Question: What is the minimum number of edges and vertices possible in a non- planar graph?

Question: Which of the following is the worst-case scenario for operations on heaps?