4 votes
0 answers
1
How many three-digit numbers are there such that no two adjacent digits of the number are consecutive ?
2 votes
2 answers
2
$L_{1}=\left\{a^{n}b^{n}c^{n}|n>=0\right\}\\L_{2}=\left\{b^{i}c^{j}|i,j>=0\right\}\\Find \ out\ L_{1}/L_{2}$
1 votes
1 answer
3
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$b)$O(Logn)$c)$O(2^n)$d)$\Omega(n)$
4 votes
1 answer
4
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
2 votes
3 answers
5
Solve the following $\int_{0}^{\infty}e^{-x^2}x^4dx$
1 votes
1 answer
6
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
5 votes
1 answer
7
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ?r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
6 votes
3 answers
8
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
0 votes
0 answers
15
Which of the following are true about TCP/UDP ?a)UDP handles congestion control but not Flow control.b)Slow start mechanism deals with Congestion control and Flow Control...
2 votes
1 answer
17
Find each of the following cases with detailed explanation by an example schedule.d