Register
Filter

Recent activity by prayas

0 answers
3
Type of Language
Hi Guys, What is the type of $L_{1}$ and $L_{2}$ ? If they are REC then How could it be proved ?
Hi Guys, What is the type of $L_{1}$ and $L_{2}$ ? If they are REC then How could it be proved ?
1 answer
4
Identify class of the language
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
6 answers
5
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ buffers each of size equal to disk block size, out of w...
4 answers
10
GATE CSE 1991 | Question: 03,iii
The total size of address space in a virtual memory system is limited by: the length of MAR the available secondary storage the available main memory all of the above none of the above
The total size of address space in a virtual memory system is limited by:the length of MARthe available secondary storagethe available main memoryall of the abovenone of ...
2 answers
13
CPU utilization
If the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by, a. $\frac{p}{n}$ b. $p^{n}$ c. $1-p^{n}$ d. $n-p^{n}$
If the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by,a. $\frac{p}{n}$b. $p^{n}$c. $1-p^{n}$d. $n-p^{n}$
2 answers
14
Push down automata - Theory of computation. Gate CSE
How to draw the diagram for language = {am bxcmdx} accepted by non deterministic PDA?
How to draw the diagram for language = {am bxcmdx} accepted by non deterministic PDA?
0 answers
15
Online Test Series
L1 = {an bm | n ≤ m ≤ 2n} L2 = {an bm│m≠n & m≠2n} Which of the following is true? A. Only L1 is CFG B. Only L2 is CFG C. Both are CFG D. None of them is CFG
L1 = {an bm | n ≤ m ≤ 2n}L2 = {an bm│m≠n & m≠2n}Which of the following is true?A. Only L1 is CFGB. Only L2 is CFGC. Both are CFGD. None of them is CFG
3 answers
16
GATE CSE 2015 Set 3 | Question: GA-8
Choose the most appropriate equation for the function drawn as thick line, in the plot below. $x=y-|y|$ $x=-(y-|y|)$ $x=y+|y|$ $x=-(y+|y|)$
Choose the most appropriate equation for the function drawn as thick line, in the plot below.$x=y-|y|$$x=-(y-|y|)$$x=y+|y|$$x=-(y+|y|)$
1 answer
18
Turing Computatbe Function
Which of the following functions are Turing Machine computable? $1) \ n \times (n-1) \times (n-2) ......1$ $2)\{log_2n\}$ $3)\Large2^{2^n}$
Which of the following functions are Turing Machine computable?$1) \ n \times (n-1) \times (n-2) ......1$$2)\{log_2n\}$$3)\Large2^{2^n}$
7 answers
22
GATE CSE 2014 Set 3 | Question: 11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ____...