Register
Filter

Recent activity by 2018

6 answers
1
GATE IT 2004 | Question: 77
Consider the following schedule $S$ of transactions $T1$ and $T2:$ ... only as $T2, T1$ $S$ is serializable both as $T1, T2$ and $T2, T1$ $S$ is not serializable either as $T1,T2$ or as $T2,T1$
Consider the following schedule $S$ of transactions $T1$ and $T2:$$${\begin{array}{l|l}\textbf{T1}& \textbf{T2} \\\hline\text{Read(A)} \\\text{A = A – 10}\\& \text...
3 answers
3
combinatorics
THERE ARE 10 PRIZES AND 4 STUDENTS. WE WANT ONLY TWO STUDENTS TO GET THE PRIZES. HOW MANY WAYS ARE THERE??
THERE ARE 10 PRIZES AND 4 STUDENTS. WE WANT ONLY TWO STUDENTS TO GET THE PRIZES. HOW MANY WAYS ARE THERE??
1 answer
5
theory of computation
Eliminate all Null -productions from S $\rightarrow$ AaB | aaB, A $\rightarrow$ Null B $\rightarrow$ bbA |Null.
Eliminate all Null -productions fromS $\rightarrow$ AaB | aaB,A $\rightarrow$ NullB $\rightarrow$ bbA |Null.
1 answer
6
#hpsc asst professor
A set of techniques that allow to execute a program which is not entirely in memory is? a-demand paging b-virtual memory c-auxilary memory d-secondary memory
A set of techniques that allow to execute a program which is not entirely in memory is?a-demand pagingb-virtual memoryc-auxilary memoryd-secondary memory
2 answers
7
theory of computation
I guess the Language , L = { } ...please verify ...
I guess the Language , L = { } ...please verify ...
3 answers
8
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
Find the sum of n terms of the series$log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
2 answers
9
theory of computation
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
3 answers
10
theory of computation
The language generated by the below grammar is S --> aSS / b
The language generated by the below grammar is S aSS / b
1 answer
11
theory of computation
The language L = {anbm : 2n ≤ m ≤ 3n} is a Non deterministic CFL but not a DCFL right ??? please correct me if i am wrong ...
The language L = {anbm : 2n ≤ m ≤ 3n} is a Non deterministic CFL but not a DCFL right ??? please correct me if i am wrong ...
2 answers
12
ISI 2004 MIII
The inequality $\frac{2-gx+x^{2}}{1-x+x^{2}}\leq 3$ is true for all the value of $x$ if and only if $1\leq g\leq 7$ $-1\leq g\leq 1$ $-6\leq g\leq 7$ $-1\leq g\leq 7$
The inequality $\frac{2-gx+x^{2}}{1-x+x^{2}}\leq 3$ is true for all the value of $x$ if and only if$1\leq g\leq 7$$-1\leq g\leq 1$$-6\leq g\leq 7$$-1\leq g\leq 7$
2 answers
15
ISI2004-MIII: 7
The equation $x^{6}-5x^{4}+16x^{2}-72x+9=0$ has exactly two distinct real roots exactly three distinct real roots exactly four distinct real roots six different real roots
The equation $x^{6}-5x^{4}+16x^{2}-72x+9=0$ hasexactly two distinct real rootsexactly three distinct real rootsexactly four distinct real rootssix different real roots
1 answer
16
ME test
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ? A) Ω(n2) B) O(n) C) θ(n) D) None
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ?A) Ω(n2)B) O(n)C) θ(n)D) None
2 answers
17
theory of computation
Let L = {anblak: n = l or l ≠ k}. The language is A) regular B) DCFL but not regular. C) NDCFL but not DCFL. D) context sensitive but not CFL. The Option is C) right ...??? Please verify ...
Let L = {anblak: n = l or l ≠ k}. The language is A) regular B) DCFL but not regular.C) NDCFL but not DCFL.D) context sensitive but not CFL.The Option is C) right ...??...
1 answer
20
theory of computation
L = {an: n is either prime or the product of two or more prime numbers}, This language is regular ...right ? Please verify ... The equivalent language is L = { an ; n >= 2 } ...right ?
L = {an: n is either prime or the product of two or more prime numbers},This language is regular ...right ? Please verify ...The equivalent language is L = { an ; n >= 2 ...
2 answers
21
ISI2004-MIII
The equation $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$ has exactly three solution in $[0.1]$ exactly one solution in $[0,1]$ exactly two solution in $[0,1]$ no solution in $[0,1]$
The equation $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$hasexactly three solution in $[0.1]$exactly one solution in $[0,1]$exactly two solution in $[0,1]$no solu...
1 answer
22
ISI 2004 MIII
$Q8$ If $\alpha_{1},\alpha_{2},\alpha_{3}, \dots , \alpha_{n}$ be the roots of $x^{n}+1=0$, then $\left ( 1-\alpha_{1} \right )\left ( 1-\alpha_{2} \right ) \dots \left ( 1-\alpha_{n} \right )$ is equal to $1$ $0$ $n$ $2$
$Q8$ If $\alpha_{1},\alpha_{2},\alpha_{3}, \dots , \alpha_{n}$ be the roots of $x^{n}+1=0$, then $\left ( 1-\alpha_{1} \right )\left ( 1-\alpha_{2} \right ) \dots \left (...
2 answers
24
deterministic and non deterministic push down automata
Which of the following is accepted by an NDPDM but not by DPDM a)All strings in which a given symbol is present at least twice b)Even length palindromes c)Strings ending with a particular terminal d)Odd length palindromes
Which of the following is accepted by an NDPDM but not by DPDMa)All strings in which a given symbol is present at least twiceb)Even length palindromesc)Strings ending w...
1 answer
26
CFG (Timothy WIlliams)
The following CFG S->aS| bS| a| b is equivalent to the regular expression a)(a*+b)* b)(a+b)+ c)(a+b)(a+b)* d)(a+b)* (a+b)
The following CFG S->aS| bS| a| bis equivalent to the regular expression a)(a*+b)* b)(a+b)+c)(a+b)(a+b)* d)(a+b)* (a+b)
1 answer
27
theory of computation
The number of prefixes and suffixes respectively in the string "abbab" are ___ and ___ .
The number of prefixes and suffixes respectively in the string "abbab" are ___ and ___ .
2 answers
30
C Programming (interview)
WAP where smallest subarrays with sum greater than x? Say an array={1,5,6,2,45,17}; Now, x=60 Now we have to find smallest subarray which is greater than x
WAP where smallest subarrays with sum greater than x?Say an array={1,5,6,2,45,17};Now, x=60Now we have to find smallest subarray which is greater than x