Register
Filter

Recent activity by gatesjt

2 answers
3
SQL <=ALL Query
select studentid, studentname from student where birthyear <=ALL( select birthyear from student); Returns detail of the youngest student Returns detail of oldest student Should not the answer be 2) ?
select studentid, studentname from student where birthyear <=ALL( select birthyear from student);Returns detail of the youngest studentReturns detail of oldest studentSho...
2 answers
7
time required to fins the unknowm integer
as we already know the range,so can we use counting sort??and complexity of counting sort is O(n+k) what other method is there to know the missing number??
as we already know the range,so can we use counting sort??and complexity of counting sort is O(n+k)what other method is there to know the missing number??
3 answers
9
GATE IT 2008 | Question: 24
The exponent of $11$ in the prime factorization of $300!$ is $27$ $28$ $29$ $30$
The exponent of $11$ in the prime factorization of $300!$ is$27$$28$$29$$30$
2 answers
10
probability
two independent random variables X and Y are uniformly distributed in[-1,1] probability that max(X,Y) is less than 1/2 1)3/4 2) 9/16 3)1/4 4)2/3
two independent random variables X and Y are uniformly distributed in[-1,1] probability that max(X,Y) is less than 1/21)3/42) 9/163)1/44)2/3
2 answers
12
Self doubt
REF: https://gateoverflow.in/76419/decidability Consider the language: 1) L = {<M>| L(M) = $\epsilon$ ... Also, other question is if we can have finite automata that accepts $\epsilon$, then we can also have TM that accepts $\epsilon$, right?
REF: https://gateoverflow.in/76419/decidabilityConsider the language:1) L = {<M>| L(M) = $\epsilon$ } 2) L = {<M>| M accepts epsilon }Now, lets consider the 1st language:...
0 answers
13
Discrete Maths
I have solved it by some legacy method ! i want to know how to solve using combinatorics ??
I have solved it by some legacy method ! i want to know how to solve using combinatorics ??
2 answers
14
LL(k) grammars
1. LL(k) grammars have one to one correspondance with DCFL's 2. LR(k) grammars have one to one correspondance with CFL's Which of them is True and explain it bit clearly?
1. LL(k) grammars have one to one correspondance with DCFL's2. LR(k) grammars have one to one correspondance with CFL'sWhich of them is True and explain it bit clearly?
4 answers
15
solve
How many view equal serial schedules possible for the following schedule? S : w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A
How many view equal serial schedules possible for the followingschedule?S : w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A
1 answer
16
necessarily Context free ??
Suppose that L is Context free and R is Regular. $A$) $L – R$ is necessarily Context free $B$) $R – L$ is necessarily Context free Which of the above statement/s is/are true?
Suppose that L is Context free and R is Regular.$A$) $L – R$ is necessarily Context free$B$) $R – L$ is necessarily Context freeWhich of the above statement/s is/ar...
1 answer
17
GF MT 4
Is the answer and explaination given correct ?
Is the answer and explaination given correct ?
1 answer
20
poisson distribution
2 answers
21
Combinatorics Doubt
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective? Answer given as 7c2/10C2 my question is ,as its given With Replacement. So why not it is (7/10)*(7/10)
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective?Answer given as...
0 answers
25
Gateforum MT 3
4 answers
28
GATE CSE 2004 | Question: 71
How many solutions does the following system of linear equations have? $-x + 5y = -1$ $x - y = 2$ $x + 3y = 3$ infinitely many two distinct solutions unique none
How many solutions does the following system of linear equations have?$-x + 5y = -1$$x - y = 2$$x + 3y = 3$infinitely manytwo distinct solutionsuniquenone