Register
Filter

Questions by Kaluti

2 votes
0 answers
91
algorithm
give O(klogk) algorithm to find kth smallest element in a min heap
give O(klogk) algorithm to find kth smallest element in a min heap
2 votes
1 answer
92
algorithm
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
0 votes
0 answers
93
compiler design
2 votes
0 answers
94
complexity
1 votes
0 answers
95
c programming
int main() { int array[] = {3, 5, 1, 4, 6, 2}; int done = 0; int i; while (done == 0) { done = 1; for (i = 0; i <= 4; i++) { if (array[i] = 1; i--) { if (array[i] > array[i-1]) { swap(&array[i], &array[i-1]); done = 0; } } } printf("%d", array[3]); } The output of the program is _____.
int main() { int array[] = {3, 5, 1, 4, 6, 2}; int done = 0; int i; while (done == 0) { done = 1; for (i = 0; i <= 4; i++) { if (array[i] = 1; i ) { if (array[i] array[i...
1 votes
0 answers
96
digitallogic
The possible number of the boolean function of 3 variables x , y and z such that f(x,y,z) = f(x',y',z') generalize the formula
The possible number of the boolean function of 3 variables x , y and z such that f(x,y,z) = f(x',y',z')generalize the formula
0 votes
1 answer
97
time complexity
time taken to delete a node from min heap if you know the value but not position To find the position of the number in min heap should not be log(n) why is it so O(n)
time taken to delete a node from min heap if you know the value but not positionTo find the position of the number in min heap should not be log(n)why is it so O(n)
1 votes
1 answer
98
theory of computation
1 votes
2 answers
99
digital logic
0 votes
0 answers
100
time complexity
3 votes
1 answer
101
combinatory
Consider all possible permutations of eight distinct elements a, b, c, d, e, f, g, h. In how many of them, will d appear before b? Note that d and b may not necessarily be consecutive.
Consider all possible permutations of eight distinct elements a, b, c, d, e, f, g, h. In how many of them, will d appear before b? Note that d and b may not necessarily b...
0 votes
0 answers
102
digital logic
he Boolean expression corresponding to the circuit is A tautology An inconsistency Independent of A None of the above
he Boolean expression corresponding to the circuit is A tautology An inconsistency Independent of A None of the above
0 votes
1 answer
103
digital logic
f2(x2, x1, x0) will be Σm(2, 3, 4) Σm(1, 2, 6, 7) Σm(1, 2, 5, 6) None of these
f2(x2, x1, x0) will be Σm(2, 3, 4) Σm(1, 2, 6, 7) Σm(1, 2, 5, 6) None of these
0 votes
1 answer
104
digital logic
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately 1)50 2)75 3)60 4)70
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately1)502)753)604)70
0 votes
1 answer
105
digital logic
0 votes
1 answer
106
digital logic
how many two input multiplexers are required to construct a 2^(10) input multiplexer?
how many two input multiplexers are required to construct a 2^(10) input multiplexer?
0 votes
1 answer
107
digital logic
F = w'xz + w'yz + x'yz' + wxy'z d = wyz The minimum no of nand and nor gate required to implement the above function respectively are :
F = w'xz + w'yz + x'yz' + wxy'zd = wyzThe minimum no of nand and nor gate required to implement the above function respectively are :
3 votes
1 answer
108
generating function
Let p be an odd prime number. Find the number of subsets A of the set {1, 2, …, 2p} such that (i) A has exactly p elements, and (ii) the sum of all the elements in A is divisible by p.
Let p be an odd prime number. Find the number of subsets A of the set {1, 2, …, 2p} such that(i) A has exactly p elements, and(ii) the sum of all the elements in A is d...
0 votes
0 answers
109
database
0 votes
0 answers
110
database
Page: