Register
Filter

Recent activity by TUSHAR_BHATT

10 answers
4
GATE CSE 2003 | Question: 16
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?Removing left recursion aloneFactoring the grammar aloneRemoving left recursion and factor...
2 answers
6
3D array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array. If the base address starts at 10, The location of A [20] [20] [30] in case of RMO and CMO are ________. (Assume the first element is stored at A[1][1][1] and each element take 1 memory location)
Consider 3 dimensional Array A[90] [30] [40] stored in linear array. If the base address starts at 10, The location of A [20] [20] [30] in case of RMO and CMO are _______...
0 answers
10
made easy mock 2
consider a disk having 10 platters with 2 recording surfaces each surface contains 80 tracks and each track contains 400 sectors with 1 sector capacity of 4KB.The capacity of 1 cylinder is ____? i was getting 400*4 KB = 1600 KB am i wrong ?
consider a disk having 10 platters with 2 recording surfaces each surface contains 80 tracks and each track contains 400 sectors with 1 sector capacity of 4KB.The capacit...
0 answers
14
Mathematics GATE 2018 EE: 43
Let $f(x) = 3x^{3} - 7x^{2} + 5x + 6$. The maximum value of $f(x)$ over the the interval $[ 0 , 2 ]$ is_________(Upto $1$ decimal place)
Let $f(x) = 3x^{3} - 7x^{2} + 5x + 6$. The maximum value of $f(x)$ over the the interval $[ 0 , 2 ]$ is_________(Upto $1$ decimal place)
1 answer
15
Activation Record
Activation Record can be known at A. Compile Time B. Run Time C. Loading Time D. None of these
Activation Record can be known atA. Compile TimeB. Run TimeC. Loading TimeD. None of these
9 answers
20
GATE IT 2008 | Question: 21
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ ... $[(\forall x, \alpha(x)) \rightarrow \beta] \rightarrow [\forall x, \alpha(x) \rightarrow \beta]$
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ is a first order formul...
2 answers
21
L(M) = Σ*
$L= \{\langle M \rangle\mid L(M) = \Sigma^*\} $ A. $L$ is RE but $L'$ is not RE B. Both $L$ and $L'$ are RE C. $L$ is not RE but $L'$ is RE D. Both $L$ and $L'$ are not RE
$L= \{\langle M \rangle\mid L(M) = \Sigma^*\} $A. $L$ is RE but $L'$ is not REB. Both $L$ and $L'$ are REC. $L$ is not RE but $L'$ is RED. Both $L$ and $L'$ are not RE...
0 answers
23
Doubt: gate2005 2015
https://gateoverflow.in/3784/gate2005-it-37 https://gateoverflow.in/8159/gate2015-2-35 (the second answer of this question) both these follow different diagramatic representations how should one go about making these diagrams
https://gateoverflow.in/3784/gate2005-it-37https://gateoverflow.in/8159/gate2015-2-35 (the second answer of this question)both these follow different diagramatic represen...
0 answers
24
Network Security
self doubt Drawback of Diffie Hellman Algo is MAN IN THE MIDDILE ATTACK. this is true or not ???
self doubtDrawback of Diffie Hellman Algo is MAN IN THE MIDDILE ATTACK.this is true or not ???
1 answer
25
MADE EASY -COA
consider a cache memory which is 30 times faster than the main memory and uses 90% of the total time. what is the speedup gain by the cache memory
consider a cache memory which is 30 times faster than the main memory and uses 90% of the total time.what is the speedup gain by the cache memory
3 answers
26
Doubt [Graph Theory]
Is it possible that a disconnected graph be an Euler graph ?
Is it possible that a disconnected graph be an Euler graph ?
1 answer
28
self doubt about dijkistra algorithm negative cycle
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????