Lecture 16, 18, 20

 0    23 schede    kapi2304
inizia ad imparare

Scarica mp3 Stampa Gioca Testa il tuo livello
 
Domanda język polski Risposta język polski
Quick sort uses which of the following algorithm to implement sorting?
inizia ad imparare
divide and conquer
What is a randomized quick sort?
inizia ad imparare
quick sort with random choice of pivot
What is the auxiliary space complexity of randomized quick sort?
inizia ad imparare
O(log n)
What is the average time complexity of randomized quick sort?
inizia ad imparare
O(n log n)
Randomized quick sort is an in place sort.
inizia ad imparare
True
Randomized quick sort is a stable sort.
inizia ad imparare
False
What is the best case time complexity randomized quick sort?
inizia ad imparare
O(nlog n)
Which of the following is incorrect about randomized quicksort?
inizia ad imparare
it cannot have a time complexity of O(n^2) in any case
What is the worst case time complexity of randomized quicksort?
inizia ad imparare
O(n^2)
Using division method, in a given hash table of size 157, the key of value 172 be placed at position ____
inizia ad imparare
15
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
inizia ad imparare
True
What is the average retrieval time when n keys hash to the same slot?
inizia ad imparare
Theta(n)
What is a hash table?
inizia ad imparare
A data structure used to store key-value pairs
How does a hash table work?
inizia ad imparare
It uses a hash function to map keys to array indices
What is the time complexity of inserting an element in a hash table?
inizia ad imparare
O(1)
What is the worst-case time complexity of searching for an element in a hash table?
inizia ad imparare
O(n)
What happens if two keys hash to the same index in a hash table?
inizia ad imparare
A collision occurs
Depth First Search is equivalent to which of the traversal in the Binary Trees?
inizia ad imparare
Pre-order Traversal
Time Complexity of DFS is? (V – number of vertices, E – number of edges)
inizia ad imparare
O(V + E)
The Data structure used in standard implementation of Breadth First Search is?
inizia ad imparare
Queue
The Depth First Search traversal of a graph will result into?
inizia ad imparare
Tree
When the Depth First Search of a graph is unique?
inizia ad imparare
When the graph is a Linked List
In Depth First Search, how many times a node is visited?
inizia ad imparare
Equivalent to number of indegree of the node
Crea delle schede

Devi essere accedere per pubblicare un commento.