Register
Filter

Questions by piyushkr

0 votes
4 answers
1
What is the meaning of wake up() operation in the up() binary operation, Definition is mentioned below.
Up(Semaphore S) { if (Suspended list() is empty) S.value=1; else { Select a process from the suspended list and WakeUp() } }
4 votes
4 answers
2
Can anyone explain the below question in a detailed way?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is the present(final) value of the binary semaphore mutex?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is t...
0 votes
1 answer
3
Difference between two below functions
What is the difference between $\log^m n$ and $(\log n)^m.$ Can anyone explain?
What is the difference between $\log^m n$ and $(\log n)^m.$ Can anyone explain?
1 votes
1 answer
4
Average code length using Huffman coding
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code length will be - a) 140/58 b) 146/58 c) 150/58 d) 174/58
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code leng...
3 votes
1 answer
5
Below is the question -
The time complexity of computing the transitive closure of a binary relation on a set of n elements is know to be a - 1) O(n) 2) O(nlogn) 3) O(n3/2) 4) O(n3)
The time complexity of computing the transitive closure of a binary relation on a set of n elements is know to be a -1) O(n) 2) O(nlogn)3) O(n3...
0 votes
3 answers
6
True/False
(logn)1/2=O(loglogn)
(logn)1/2=O(loglogn)
1 votes
1 answer
7
Below question asked in GATE 1993. In this 1<=k<=n mentioned however k not using anywhere in notation.
$\sum(range - 1<=k<=n) O(n)$, where O(n) stands for order n is -a) O(n) b) O(n2)c) O(m3) d) O(3n2)
0 votes
1 answer
8
What is the simplification of the below mentioned expression -
n^(1/(2^(log2log2n)))
n^(1/(2^(log2log2n)))
19 votes
8 answers
10
Minimum number of comparisons required to sort 5 elements is
The minimum number of comparisons required to sort 5 elements is - 4 5 6 7
The minimum number of comparisons required to sort 5 elements is -4567
0 votes
1 answer
13
What is perfect hashing technique?
0 votes
1 answer
15
What is time complexity of inserting an element in chaining(outside) hashing technique?
If we are inserting an element in chaining(outside) hashing technique, then what will be the time complexity in best case, average case and Worst case.
If we are inserting an element in chaining(outside) hashing technique, then what will be the time complexity in best case, average case and Worst case.