Databases - Upwork

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
Question: Which of these are standard operations of Stack Data Structure?
A
Push, delete

B
Insert, pop

C
Put, extract

D
Push, pop

Note: Not available
1. Report
Question: Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?
A
data[1]

B
data[2]

C
data[11]

D
data[12]

Note: Not available
1. Report
Question: A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?
A
(4,7)

B
(7,4)

C
(8,3)

D
(3,8)

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

B
Logarithmic time

C
Linear time

D
Quadratic time

Note: Not available
1. Report
Question: What is the maximum depth of recursive calls a function may make?
A
1

B
2

C
n (where n is the argument)

D
There is no fixed maximum

Note: Not available
1. Report
Question: Consider this binary search tree. Which will be the new root if you remove the root and replace it with something from the left subtree?
A
1

B
2

C
4

D
5

Note: Not available
1. Report
Question: The number of distinct simple graphs with up to three nodes is _______.
A
15

B
10

C
7

D
9

Note: Not available
1. Report

First Prev 15 16 17 18 19 Next Last

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?

Question: Which of these are standard operations of Stack Data Structure?

Question: Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

Question: A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

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

Question: What is the maximum depth of recursive calls a function may make?

Question: Consider this binary search tree. Which will be the new root if you remove the root and replace it with something from the left subtree?

Question: The number of distinct simple graphs with up to three nodes is _______.