Fråga  |
Svar |
Quick sort uses which of the following algorithm to implement sorting? börja lära sig
|
|
|
|
|
What is a randomized quick sort? börja lära sig
|
|
quick sort with random choice of pivot
|
|
|
What is the auxiliary space complexity of randomized quick sort? börja lära sig
|
|
|
|
|
What is the average time complexity of randomized quick sort? börja lära sig
|
|
|
|
|
Randomized quick sort is an in place sort. börja lära sig
|
|
|
|
|
Randomized quick sort is a stable sort. börja lära sig
|
|
|
|
|
What is the best case time complexity randomized quick sort? börja lära sig
|
|
|
|
|
Which of the following is incorrect about randomized quicksort? börja lära sig
|
|
it cannot have a time complexity of O(n^2) in any case
|
|
|
What is the worst case time complexity of randomized quicksort? börja lära sig
|
|
|
|
|
Using division method, in a given hash table of size 157, the key of value 172 be placed at position ____ börja lära sig
|
|
|
|
|
Collisions can be reduced by choosing a hash function randomly in a way that is independent of the keys that are actually to be stored börja lära sig
|
|
|
|
|
What is the average retrieval time when n keys hash to the same slot? börja lära sig
|
|
|
|
|
|
börja lära sig
|
|
A data structure used to store key-value pairs
|
|
|
How does a hash table work? börja lära sig
|
|
It uses a hash function to map keys to array indices
|
|
|
What is the time complexity of inserting an element in a hash table? börja lära sig
|
|
|
|
|
What is the worst-case time complexity of searching for an element in a hash table? börja lära sig
|
|
|
|
|
What happens if two keys hash to the same index in a hash table? börja lära sig
|
|
|
|
|
Depth First Search is equivalent to which of the traversal in the Binary Trees? börja lära sig
|
|
|
|
|
Time Complexity of DFS is? (V – number of vertices, E – number of edges) börja lära sig
|
|
|
|
|
The Data structure used in standard implementation of Breadth First Search is? börja lära sig
|
|
|
|
|
The Depth First Search traversal of a graph will result into? börja lära sig
|
|
|
|
|
When the Depth First Search of a graph is unique? börja lära sig
|
|
When the graph is a Linked List
|
|
|
In Depth First Search, how many times a node is visited? börja lära sig
|
|
Equivalent to number of indegree of the node
|
|
|
