Register
Filter

Answers by goxul

48 votes
2
GATE CSE 2020 | Question: 47
Consider the array representation of a binary min-heap containing $1023$ elements. The minimum number of comparisons required to find the maximum in the heap is ___________.
Consider the array representation of a binary min-heap containing $1023$ elements. The minimum number of comparisons required to find the maximum in the heap is _________...
0 votes
8
Gateforum Test Series: Algorithms - Asymptotic Notations
Which of the following is not true in the function $f(n)=2^{n-4}$? $f(n)$=Θ($2^{n+3}$) $f(n)$=Ω($n^{1000}$) $f(n)$=Ο($2^{n-10}$) $f(n)$=$None$
Which of the following is not true in the function $f(n)=2^{n-4}$?$f(n)$=Θ($2^{n+3}$)$f(n)$=Ω($n^{1000}$)$f(n)$=Ο($2^{n-10}$)$f(n)$=$None$
2 votes
11
Doubt on probability
15 students among whom are A and B arranged randomly in a row. Obtain the probability that there will be 3 students between A and B?
15 students among whom are A and B arranged randomly in a row. Obtain the probability that there will be 3 students between A and B?
1 votes
12
Doubt : TC
How the limits are reduced. Please explain in simpler way.
How the limits are reduced. Please explain in simpler way.
1 votes
16
How to solve this series which is in both AP and GP?
how to solve this series:
how to solve this series:
0 votes
17
Turing machine
what is co-turing recognizable language?
what is co-turing recognizable language?
0 votes
20
Probability - Gravner-33.a
An urn contains 10 black and 10 white balls. Draw 3 a) without replacement
An urn contains 10 black and 10 white balls. Draw 3a) without replacement
4 votes
22
T(n) = sqrt(n) * T(sqrt(n)) + n
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n). 'wolframalpha'' shows the answer same as mine. You can find the solution here. Can anyone confirm the solution and provide an explantion?
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n).'wolframalpha'' shows the answer same as mine. You can find the solution...
1 votes
23
METest_Algo
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8. Please help me verify it.
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8.Please help me verify it.
1 votes
25
Self Doubt
A polygon has 12 edges , How many diagonals does it have? How to find the number of diagonals?
A polygon has 12 edges , How many diagonals does it have?How to find the number of diagonals?
0 votes
26
ibps2014
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is 1. o (n log n) 2. o (n) 3. o(sqrt(n)) 4. o (log n)
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is1. o (n log n)2. o (n)3. o(sqrt(n))4. o (log n)
1 votes
27
compiler design
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers. eleborate this ??
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers.eleborate this...
2 votes
28
Made easy test series
What is the difference between (ii) and (iv). I understood (ii) as "All the engineers like at least some doctor" What will be the translation for (iv) ?
What is the difference between (ii) and (iv). I understood (ii) as "All the engineers like at least some doctor"What will be the translation for (iv) ?
1 votes
29
CN-Doubt
Which classful subnet mask is useful for need of subnet a network that has 5 subnet each with at least 20 hosts. A.255.255.255.192 B.255.255.255.248 C.255.255.255.240 D.255.255.255.224
Which classful subnet mask is useful for need of subnet a network that has 5 subnet each with at least 20 hosts.A.255.255.255.192B.255.255.255.248C.255.255.255.240D.255.2...
Page: