Recent questions without answers

0 votes
0 answers
15331
0 votes
0 answers
15332
0 votes
0 answers
15333
How will I find SLR(1) for such a big CFG?I could find error in LL(1) and conflict in LR(0)?But finding SLR(1) is time-consuming if using item generation approach?
0 votes
0 answers
15336
What is the correct answer?? is option a is correct?
0 votes
0 answers
15339
0 votes
0 answers
15340
Which of the following R.E. over Ʃ = {0, 1} denotes set of all strings not containing as sub-string.(a) 0* (0 + 1)* (b) 0* 1 0 1 0*(c) 0* 1* 0 1 (d) 0* (1 0 + 1)*
1 votes
0 answers
15341
0 votes
0 answers
15342
3 votes
0 answers
15343
i have read from made easy coaching that DFS cant be used to verify given graph is bipartite or not...but there are some refernces i have found on some site where DFS ca...
0 votes
0 answers
15345
0 votes
0 answers
15346
32-bit [ripple carry] adder, there are 32 full adders, so the critical path (worst case) delay is 31 * 2(for carry propagation) + 3(for sum) = 65 gate delays. how ? note ...
0 votes
0 answers
15347
0 votes
0 answers
15348
0 votes
0 answers
15349
0 votes
0 answers
15350
https://gateoverflow.in/29098/gate2003-47why z goes down ,, it is k to up but why it goes down?
1 votes
0 answers
15352
How many new nodes will be formed if we insert a key “i” into below B tree of order “3”? 1 2 3 4
0 votes
0 answers
15353
0 votes
0 answers
15356
0 votes
0 answers
15357
Suggest me some good book for problem solving in COA like Memory management and virtual memory, pipelining, etc....other than hamacher
1 votes
0 answers
15358
0 votes
0 answers
15359
0 votes
0 answers
15360