Register

#madeeasy test series

383 views
1 votes
1 votes

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.8k
views
0 answers
0 votes
Prateek Raghuvanshi asked Dec 6, 2018
1,816 views
self doubt #madeeasy-test-series
given a degree sequence for n vertices i.e.$d_1,d_2, .d_v$.what is worst time complexity to determine if a simple graph is possible with the given degree sequence?answer given as: ... n-1 pass O(n) =O($n^2$.correct me if i m wrong.thank you
User Avatar
149
views
0 answers
1 votes
shefali1 asked Dec 28, 2017
149 views
#madeeasy test series
User Avatar
217
views
0 answers
0 votes
shefali1 asked Dec 28, 2017
217 views
#madeeasy
User Avatar
207
views
0 answers
0 votes
shefali1 asked Feb 1, 2017
207 views
#madeeasy
Consider a hash table using uniform hashing with number of slots as m = 6 and number of keys, k = 8. Collisions resolved by chaining. Assuming direct hashing ... number of slots that ends not being empty is _________ (upto 2 decimal point).
User Avatar
Link Copied!