search
Log In
1 vote
76 views

in Operating System 76 views

1 Answer

0 votes
someone please provide solution.

Related questions

0 votes
0 answers
1
107 views asked Nov 8, 2017 in Operating System shefali1 107 views
0 votes
0 answers
2
97 views
If G = (V,E) is a directed graph, then length of adjacency list is ______ and it requires ______ amount of memory. 1 2|E|, θ(V) 2 |E|, θ(V+E) Correct Answer 3 |E|, θ(E) 4 2|E|, θ(V+E) Shouldnt the ans be 2|E| for the length of the adjacency list as every edge would be stored twice?
asked Dec 19, 2018 in Algorithms anjali007 97 views
0 votes
1 answer
3
57 views
The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash function h(x) = (ord(x) - ord(A) +1) If linear probing is used to resolve collisions, then the following insertion causes collision 1:Y 2:C 3:M 4:P The given ans is 3.. but what is the approach and what do we mean by ord?
asked Dec 17, 2018 in Algorithms anjali007 57 views
1 vote
0 answers
4
158 views
Assume there are 1024 men, each with distinct arm strength, in an arm wrestling match stronger arm always wins. Number of arm wrestling matches required to find men with strongest and second strongest arm in worst case is_____ Plz also tell how to find the nth strongest in this case?
asked Dec 17, 2018 in Algorithms anjali007 158 views
...