0 answers
4
$L=a^mb^nc^pd^q | m+p=n+q, m,n,p,q>=0$is the language CFG or CFL?
0 answers
5
Consider the following transactions:T₁= w(A);w(B);r(C);CommitT₂= w(B);r(B);CommitThe number of schedules of T1 and T2 that are recoverable are_________?
1 answer
6
Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b}L = The number of final state(s) will be(A) 2(B) 1(C) 3(D) 6
1 answer
7
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 1 and x >= 0 }.
1 answer
8
T(n) = T(root(n)) + n where n>=2Time complexity ?
2 answers
9
An n-bit binary string is selected uniformly at random.For a k $\geq$ 1,what is the probability of selecting an n-bit string in which there is a substring of length at le...
2 answers
10
What are sequential access structures? Are arrays or linked list the sequential access structures?
3 answers
12
A supernet has first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses?