0 answers
1
Why search option is not working?
9 answers
2
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation$T(n) = √(2) T(n/2) + √n$, $T(1) = 1$evaluates to :$√(n) (\log n + 1)$$√(n) \log n$$√(n) \log...
1 answer
3
Sign bit-1 exponent-8 mantissa- 23
1 answer
4
1 answer
5
1 answer
6
how to solve this?
0 answers
7
0 answers
8
1 answer
9
How to solve this?
0 answers
10
0 answers
11
2 answers
12
1 answer
13
0 answers
14
0 answers
15
explain?
0 answers
16
How to solve this question?
1 answer
17
How to solve this question ?
1 answer
18
Why in this I6 and I7 are not in same state??
1 answer
19
If the graph G(V,E) is represented using adjacency matrix then to find universal sink (in degree is V-1 and out degree is 0)
1 answer
21
consider the following grammar productionS->XXX->0X|1In the canonical LR method if [X->0•X,0] is an item then which of the following is the viable prefix of the item?a)...
0 answers
22
Stmts- Stmt| Stmts; StmtStmt- Var= EVar- id[E]|idE- id|(E)find number of conflicts in LR(0).
1 answer
23
Convert the grammar to reduced form ?S->AB S->CA B->BC B->AB A->a C->aB |b
0 answers
24
Plz explainhttps://gateoverflow.in/?qa=blob&qa_blobid=17006947629127972543
3 answers
25
There are 4 sorted lists of n/4 elements each. If we merge these lists into a single sorted list of n elements , for the n=400 number of key comparison in the worst case ...