Data Structure, Databases

Question: What is the minimum number of nodes in a full binary tree with depth 3?
A
4

B
8

C
11

D
15

Note: Not available
1. Report
Question: Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?
A
Pre-order traversal

B
Post-order traversal

C
In order traversal

D
Top-down traversal

Note: Not available
1. Report
Question: Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?
A
At the head

B
At the tail

C
After all other entries that are greater than the new entry

D
After all other entries that are smaller than the new entry

Note: Not available
1. Report
Question: Which term is used to describe an O(n) algorithm?
A
Constant

B
Linear

C
Logarithmic

D
Quadratic

Note: Not available
1. Report
Question: What is the minimum number of nodes in a complete binary tree with depth 3?
A
4

B
8

C
11

D
15

Note: Not available
1. Report
Question: What is true of the complete bipartite graphs K(3,3) and K(2,4)?
A
Both are planar

B
Neither is a planar

C
Both are isomorphic

D
None of these

Note: Not available
1. Report
Question: If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.
A
all zeros

B
all ones

C
both zeros and ones

D
different

Note: Not available
1. Report
Question: What is the worst-case scenario for mergesort 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: Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:
A
4

B
5

C
8

D
2

Note: Not available
1. Report
Question: In which data structure is the concept of rotation used?
A
Binary search tree

B
Circular queue

C
AVL tree

D
Circular linked list

Note: Not available
1. Report

First Prev 3 4 5 6 7 Next Last

Question: What is the minimum number of nodes in a full binary tree with depth 3?

Question: Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?

Question: Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?

Question: Which term is used to describe an O(n) algorithm?

Question: What is the minimum number of nodes in a complete binary tree with depth 3?

Question: What is true of the complete bipartite graphs K(3,3) and K(2,4)?

Question: If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

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

Question: Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

Question: In which data structure is the concept of rotation used?