9 answers
3
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...
0 answers
6
How to solve matching problem?How to solve counting problem?How to solve first order logic problem?Thanks. Do help if possible.
1 answer
7
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
1 answer
8
T(n) = 4T(sqrt(n)) + (logn)^5Find Time complexity.(n=2^k)Give detailed answer , how to derive it.
2 answers
9
R(ABCDEF)FD set{AB->CDE. CD->E, E->C}False statement?A. 2 NF decomposition possibleB.3 NF decomposition possibleC.BCNF decomposition possibleD. ALL
1 answer
11
L1 and L2 Are Decidable. then L1 union L2 is (a)______and L1 - L2 is(b) _________.a. Regular, cfl ,csl, rel. recb. decidable, undecidable
1 answer
12
1 answer
13
L={a^n b^k, n <= k <=2n}1.CFL2.Non CFL
1 answer
14
Which of following Is closed under Homomorphism?A. Computable Enumerable LanguageB. Decidable LanguageC. DCFLD. CSL Explain Neatly.
1 answer
15
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.
10 answers
16
8 answers
17
8 answers
25
Consider the following Pseudo codemain() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } }Find the total number of processes that will b...