Databases - Upwork

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
Question: You have implemented a queue with a circular array keeping track of the first, the last, and the count (the number of items in the array). Suppose the first is zero, and 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: A procedure that calls itself in a program is called _______.
A
Repeat

B
Loop

C
Recursion

D
Tree

Note: Not available
1. Report
Question: State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.
A
True

B
False

Note: Not available
1. Report
Question: If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?
A
data[0]

B
data[n-1]

C
data[n]

D
data[2*n + 1]

Note: Not available
1. Report
Question: What is the worst-case scenario for quicksort 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: Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.
A
LINK[X]:=LINK[LINK[X]]

B
X:=LINK[LINK[X]]

C
LINK[LINK[X]]:=X

D
LINK[X]:=LINK[LINK[LINK[X]]]

Note: Not available
1. Report
Question: A non- planar graph with the minimum number of vertices has:
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

First Prev 11 12 13 14 15 Next Last

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?

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

Question: A procedure that calls itself in a program is called _______.

Question: State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.

Question: If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

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

Question: Which of the following lines of the code will delete two successive nodes of a single linked linear list(with more than two nodes)? Here 'LINK[X]' denotes the address field of node X.

Question: A non- planar graph with the minimum number of vertices has: