1 votes
1 answer
1
3 votes
1 answer
3
Consider the following schedule:S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3Please explain how it is allowed in 2 PL
3 votes
3 answers
4
Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...
2 votes
1 answer
5
Consider the following schedule:S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B)How many serial schedules conflict equal to schedules (S)?
0 votes
3 answers
8
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per s...
0 votes
2 answers
9
What is the best architecture of the ‘Logic gate’?a 3-bit input AND gatea 2-input AND gatea NOT gatea wire connection (no logic gate needed)
0 votes
1 answer
10
Consider the following languages:L1={abna2n|n>=0}L2={aabna3n|n>=0}Why L1UL2 is DCFL please explain?
0 votes
0 answers
11
Consider the following statement:S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.Please explain as why this sentence ...
2 votes
1 answer
13
0 votes
0 answers
14
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B ar...
2 votes
3 answers
15
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
0 votes
0 answers
19
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be ...
3 votes
1 answer
20
Which of the following statements are correct and why.....?Every regular set has LR(1) grammarEvery regular grammar is LR(1).