Register
Filter

Recent activity by AakS

9 answers
4
GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...
0 answers
9
Non-Deterministic PDA
I'm getting its equaltion {anbn | n > 0} U {a} U {b} But given is {anbn | n >= 0} U {a} U {b} Whether epsilon is accepted or not??
I'm getting its equaltion {anbn | n 0} U {a} U {b}But given is {anbn | n >= 0} U {a} U {b}Whether epsilon is accepted or not??
12 answers
11
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree ...
5 answers
13
GATE CSE 1999 | Question: 1.3
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is $^{n-1}C_k$ $^nC_k$ $^nC_{k+1}$ None of the above
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
2 answers
17
Test by Bikram | Databases | Test 2 | Question: 4
A relation $R(P,Q,R,S)$ has $\{PQ, QR, RS, PS\}$ as candidate keys. The total number of superkeys possible for relation $R$ is ______
A relation $R(P,Q,R,S)$ has $\{PQ, QR, RS, PS\}$ as candidate keys. The total number of superkeys possible for relation $R$ is ______
6 answers
23
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...
1 answer
24
TOC :Regular Languages
Which of the following is not a regular language? a) $\{ w ( w_r )^* \mid w \in \{0,1\}^* \}$ b) $\{w^n w^m \mid 0\leq n\leq m, w \in \{0,1\} \}$
Which of the following is not a regular language?a) $\{ w ( w_r )^* \mid w \in \{0,1\}^* \}$b) $\{w^n w^m \mid 0\leq n\leq m, w \in \{0,1\} \}$
4 answers
26
Go back N (arq) protocol
Q. If maximum sequence number in Go back N ( arq) protocol is 'n' then window size (sender) is ? If your answer is 'n' or 'n'+1' then please design GBN for sender window 5 and 11 .
Q. If maximum sequence number in Go back N ( arq) protocol is 'n' then window size (sender) is ?If your answer is 'n' or 'n'+1' then please design GBN for sender windo...
6 answers
29
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
0 answers
30
Prefix property and DPDA
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.