Register
Filter

Answers by Habibkhan

4 votes
721
Madeeasy Test Series
consider a complete binary tree 'T' with key of root node be 'P'. It is given that the left and right subtree of 'P' satisfies the min-heap property. What is the time taken to convert the given tree 'T' to max-heap? a. O(log n) b. O(n) c. O(nlog n) d. O(n2)
consider a complete binary tree 'T' with key of root node be 'P'. It is given that the left and right subtree of 'P' satisfies the min-heap property. What is the time tak...
2 votes
722
IEEE-Single Precision
4 votes
723
Time Complexity
4 votes
725
Cfg doubt
1) Is the language L = { an+m bn+m cm | n,m>=0 } a Cfl????
1) Is the language L = { an+m bn+m cm | n,m>=0 } a Cfl????
8 votes
726
Doubts
$a^{2n}b^n$ $a^nb^m, m\leq n\leq 3m$ $a^nb^m , n=4m$ Which of the following is CFL ?
$a^{2n}b^n$$a^nb^m, m\leq n\leq 3m$$a^nb^m , n=4m$Which of the following is CFL ?
1 votes
728
Ace Page# 128, Q#48
I think the median can be found in O(n), because in O(n) we can merge the arrays into a single sorted array and in O(1) we can find the middle element of the array. Am I correct ??
I think the median can be found in O(n), because in O(n) we can merge the arrays into a single sorted array and in O(1) we can find the middle element of the array. Am I...
0 votes
732
B+ Tree insertion
I think it would be 7..please check
I think it would be 7..please check
0 votes
733
ER to Relational mapping
How can trainer id be p.key of Parts??
How can trainer id be p.key of Parts??
11 votes
734
Joining
2 votes
735
Ace exam
How to solve this type of questions..
How to solve this type of questions..
3 votes
736
Existence of small theta
Why doesn't the small $\theta$ notation exists ?
Why doesn't the small $\theta$ notation exists ?
4 votes
737
Graph Intersection
4 votes
738
context free language
Σ ={a,b} L={W| na(W)*nb(W) ≥ 5} Is the above language is REGULAR ??
Σ ={a,b}L={W| na(W)*nb(W) ≥ 5}Is the above language is REGULAR ??
1 votes
740
limit
0 votes
741
Doubt
I have a general doubt. If we have a wrong question in GATE paper then what we need to do? should we attempt it or leave it. because if question is wrong marks should be given to all the students who have attempted that question or gate people will simpy ignore that question and don't do any thing.
I have a general doubt. If we have a wrong question in GATE paper then what we need to do? should we attempt it or leave it.because if question is wrong marks should be g...
0 votes
743
Logic
Everyone has exactly one best friend Are all three below same? Let B(x, y) to be the statement “y is the best friend of x" $ ∀x∃y(B(x, y) ∧ ∀z((z = y)→¬B(x, z))) $ $ ∀x ∃!y (B(x, y) $ $ ∀x ∃y (B(x, y) ∧ ∀z (B(x, z) → (y = z))) $
Everyone has exactly one best friendAre all three below same?Let B(x, y) to be the statement “y is the best friend of x"$ ∀x∃y(B(x, y) ∧ ∀z((z = y)→¬B(x, z))...
1 votes
746
Operating System
Which of the scheduling alogorithm gives the best throughput for n tasks having r1,r2,...,rn as running time? a) RR b) ShortestJob First c) FCFS d) Hiighest-Response Ration Next
Which of the scheduling alogorithm gives the best throughput for n tasks having r1,r2,...,rn as running time?a) RRb) ShortestJob Firstc) FCFSd) Hiighest-Response Ration N...
6 votes
748
difference between asymptotically large and polynomially large
what is the difference between asymptotically large and polynomially large how to find which function is asymptotically large or polynomially large
what is the difference between asymptotically large and polynomially large how to find which function is asymptotically large or polynomially large
Page: