Register
Filter

Recent activity by jugnu1337

2 answers
2
GATE CSE 2024 | Set 1 | Question: 33
Consider a binary min-heap containing $105$ distinct elements. Let $k$ be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of $k$ is $53$ $52$ $27$ $1$
Consider a binary min-heap containing $105$ distinct elements. Let $k$ be the index (in the underlying array) of the maximum element stored in the heap. The number of pos...
0 answers
5
made easy test series
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 12 edges and 9 nodes. Then how many columns of A are independent? what this question want to ask can someone help me {hint}
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 12 edges and 9 nodes. Then how many columns of A are independent?what this question want...
0 answers
7
MADE EASY TS
here option PRIME is recursive , but why FACTOR is not regular, my approach is { here n,a,b all are distinct and n has the range bew [a,b] and we know if range is defined then regularity is possible. PRIME AND REGULAR ARE FACTOR NAME.
here option PRIME is recursive , but why FACTOR is not regular,my approach is { here n,a,b all are distinct and n has the range bew [a,b] and we know if range is defi...
1 answer
8
made easy test series
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$ give the number of edges into each node. Then, what is the sum of those diagonal entries ________.
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$give the number of edges into eac...
4 answers
9
GATE CSE 2001 | Question: 2.20
Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure
Which of the following does not interrupt a running process?A deviceTimerScheduler processPower failure
2 answers
10
MADE EASY test series
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
1 answer
11
c made easy test series
if X and Y denote the no of 0,1 then the value of 2X + y is
if X and Y denote the no of 0,1 then the value of 2X + y is
1 answer
12
maths probability
expected no of time a fair coin need to be tossed so that three consecutive head are obtained equal to …..
expected no of time a fair coin need to be tossed so that three consecutive head are obtained equal to …..
0 answers
13
How to solve the following recurrence relation? I get confused when decimals are used in the expression.
$T\left ( n \right )= 8T\left ( \frac{n}{2} \right )+\left ( n\cdot logn \right )^{2.99}$Also can $\mathcal{O}(n^{3})$ be an upper bound to above recurrence relation?
1 answer
20
Ace Test Series | DBMS
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other lock is allowed. I S I X S SIX X
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other ...
0 answers
23
#ntro
Is anyone preparing for NTRO scientific assessment for the interview which will held on 14th july? I could not find any resources about interview of scientist B in NTRO. So kindly help me in this regard.
Is anyone preparing for NTRO scientific assessment for the interview which will held on 14th july? I could not find any resources about interview of scientist B in NTRO. ...
0 answers
24
testbook question
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
1 answer
25
data structure tree
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
0 answers
27
Exam eligibility related query
What will be the qualifying degree for a Student who has done bsc and MCA, i plan on doing MTECH, all IITs,NITs,IIIT ask for minimum 60% in qualification degree. Is it bsc or MCA for me? I have scored 58% in bsc and 76% in MCA
What will be the qualifying degree for a Student who has done bsc and MCA, i plan on doing MTECH, all IITs,NITs,IIIT ask for minimum 60% in qualification degree.Is it bsc...
2 answers
28
GATE IT 2006 | Question: 29
Consider the regular grammar below $S \rightarrow bS \mid aA \mid \epsilon $ $A \rightarrow aS \mid bA$ ... $\{\epsilon\},\{wa \mid w \in (a + b)^* \text{and} \{wb \mid w \in (a + b)^*\}$
Consider the regular grammar below$S \rightarrow bS \mid aA \mid \epsilon $$A \rightarrow aS \mid bA$ The Myhill-Nerode equivalence classes for the language generated by ...
1 answer
29
toc
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
3 answers
30
NTRO exam 2023
the solution of the linear congruence 4x = 5(mod9)? 6 (mod 9) 8 (mod 9) 9(mod 9) 10 (mod 9)
the solution of the linear congruence 4x = 5(mod9)? 6 (mod 9)8 (mod 9)9(mod 9)10 (mod 9)