Databases - Upwork

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
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

First Prev 10 11 12 13 14 Next Last

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:

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 ______.