Register
Filter

Answers by Prashant.

1 votes
562
memory
1 votes
563
memory
25 votes
565
GATE CSE 2003 | Question: 11
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is $\Theta(1)$ $\Theta(\log n)$ $\Theta(n)$ $\Theta(n^2)$
Consider an array multiplier for multiplying two $n$ bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is$\Theta(1)$$\Theta(\lo...
2 votes
567
what is diifff in this?
diiff b/w complet graph and connected graph???? with eg....
diiff b/w complet graph and connected graph???? with eg....
1 votes
568
Sorting
A machine took 200 sec to sort 200 names,using bubble sort.In 800 sec,it can approximately sort ? a. 400 names b. 800 names c. 750 names d. 850 names
A machine took 200 sec to sort 200 names,using bubble sort.In 800 sec,it can approximately sort ?a. 400 names b. 800 names c. 750 names d. 850 names
1 votes
569
db
How many view eloquent serial schedule are possible? S:w1(a)r2(a)w3(a)r4(a)w5(a)r6(a)
How many view eloquent serial schedule are possible?S:w1(a)r2(a)w3(a)r4(a)w5(a)r6(a)
0 votes
570
show L is re but not rec
let L be language consisting of pair of tm codes and an integer (M1,M2,k) such that L(M1) intersect L(M2)contains atleast k strings show L is RE but not recursive
let L be language consisting of pair of tm codes and an integer (M1,M2,k) such that L(M1) intersect L(M2)contains atleast k strings show L is RE but not recursive
1 votes
572
Space utilization of B + tree and B tree
What is the minimum and maximum space utilization of b+ tree and b tree?
What is the minimum and maximum space utilization of b+ tree and b tree?
1 votes
573
recursive enumerable or not
Tell whether language is re or non re 1)Does L(M) contain atleast two strings? 2)Is L(M) infinite? 3)Is L(M) context free language? 4)is L(M) =(L(M))^R
Tell whether language is re or non re1)Does L(M) contain atleast two strings?2)Is L(M) infinite?3)Is L(M) context free language?4)is L(M) =(L(M))^R
4 votes
577
DBMS
prime attribute appears in some candidate key???pls explain how??
prime attribute appears in some candidate key???pls explain how??
2 votes
578
Counting number of lexemes
The number of lexemes in the statement in FORTRAN DO 10 I = 100 is __________ .
The number of lexemes in the statement in FORTRANDO 10 I = 100is __________ .
12 votes
580
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \p...
2 votes
582
Maximum depth of recursion tree
Given answer: C Please explain
Given answer: CPlease explain
5 votes
583
Question on C programming lanuage
Why 'count' variable value doesn't set to 0 on every call to 'incr' function?
Why 'count' variable value doesn't set to 0 on every call to 'incr' function?
3 votes
587
Problem on DFS
Answer given: C Please explain
Answer given: CPlease explain
4 votes
588
Number of moves of smallest disc in tower of Hanoi
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16) Answer given: $2^{16}$ = 65536 Please explain
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16)Answer given: $2^{16}$ ...
6 votes
589
GATE CSE 2007 | Question: 30
The language $L=\left\{0^i21^i \mid i \geq 0\right\}$ over the alphabet $\left\{0, 1, 2\right\}$ is: not recursive is recursive and is a deterministic CFL is a regular language is not a deterministic CFL but a CFL
The language $L=\left\{0^i21^i \mid i \geq 0\right\}$ over the alphabet $\left\{0, 1, 2\right\}$ is:not recursiveis recursive and is a deterministic CFLis a regular langu...
3 votes
590
Theory of computation question
http://geeksquiz.com/gate-gate-cs-2015-set-1-question-60/ please give explanation to this question.
http://geeksquiz.com/gate-gate-cs-2015-set-1-question-60/please give explanation to this question.
Page: