Dark Mode

Answers by 1gate_cracker

0 votes

1

GATE CSE 1988 | Question: 11
A number of processes could be in a deadlock state if none of them can execute due to non-availability of sufficient resources. Let $P_i, 0 \leq i \leq 4$ represent five processes and let there be four resources types $r_j, 0 \leq j \leq 3$. Suppose the following ... Is the system currently in a safe state? If yes, explain why.

answered in Operating System Dec 31, 2017

3.0k views

1 vote

2

GATE CSE 2017 Set 1 | Question: 12
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a - b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a - b q4 = p3 * c p4 = ... = a - b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a - b q1 = p * c p2 = u * v q2 = p + q

answered in Compiler Design Dec 24, 2017

11.5k views

1 vote

3

GATE CSE 2017 Set 2 | Question: 6
Which of the following statements about parser is/are CORRECT? $\text{Canonical LR}$ is more powerful than $\text{SLR}$ $\text{SLR}$ is more powerful than $\text{LALR}$ $\text{SLR}$ is more powerful than $\text{Canonical LR}$ I only II only III only II and III only

answered in Compiler Design Dec 24, 2017

7.7k views

0 votes

4

GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$

answered in Compiler Design Dec 24, 2017

10.9k views

1 vote

5

GATE CSE 2017 Set 2 | Question: 25
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3$} is ______________ .

answered in Theory of Computation Dec 22, 2017

16.5k views

0 votes

6

GATE IT 2006 | Question: 15
Which of the following relational query languages have the same expressive power? Relational algebra Tuple relational calculus restricted to safe expressions Domain relational calculus restricted to safe expressions II and III only I and II only I and III only I, II and III

answered in Databases Nov 27, 2017

9.0k views

0 votes

7

can cadidate key may be null?

answered in Databases Nov 27, 2017

13.6k views

–2 votes

8

GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$

answered in Theory of Computation Nov 11, 2017

21.7k views

0 votes

9

GATE CSE 2017 Set 2 | Question: 16
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$

answered in Theory of Computation Nov 11, 2017

18.4k views

0 votes

10

GateBook Mock 2
According to me option B is correct.

answered in Theory of Computation Nov 11, 2017

747 views

0 votes

11

GateBook Mock Test_2(TOC)
Given TMs and L = {x/Every halts on input x } which of the following is true about L? (A) L is recursively enumerable but not recursive (B) L is Recursive but not Context free (C) L is Not Recursively Enumerable (D) L is regular

answered in Theory of Computation Nov 11, 2017

811 views

0 votes

12

Gatebook
Consider languages L1 and L2 over {0,1) alphabet. L2= {w/w contains some x as a substring and x belongs to L1} Which of the following must be true? I. If L1 is regular, L2 is also regular II. If L1 is CFL, L2 is also CFL III. If L1 is recursive, L2 is also recursive (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only

answered in Theory of Computation Nov 11, 2017

1.9k views

4 votes

13

GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.

answered in Theory of Computation Nov 11, 2017

18.4k views

0 votes

14

CSL or Recursive
Is a^nb^3^n is CsL or Recursive or Recursive enumerable? Please draw the state transition diagram also I think it is not any of them.because b^3^n I can't put in loop

answered in Theory of Computation Nov 10, 2017

899 views

0 votes

15

TOC basic
The numbers 1,2,4,8,…2n,…1,2,4,8,…2n,… written in unary Is regular or not?? if not please justify??

answered in Theory of Computation Nov 10, 2017

413 views

0 votes

16

MadeEasy WorkBook: Theory of Computation - Minimum State Automata
IF a number is divisible by say any integer X then what will be the minimum states required in DFA?

answered in Theory of Computation Nov 9, 2017

452 views

3 votes

17

GATE CSE 2011 | Question: 8
Which of the following pairs have DIFFERENT expressive power? Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA) Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA) Deterministic ... Turing machine and Non-deterministic single tape Turing machine Single tape Turing machine and multi-tape Turing machine

answered in Theory of Computation Nov 9, 2017

9.5k views

0 votes

18

Doubt on formula
in csma/cd which formula is right 1 .transmission delay >= 2 * propagation delay 2.transmission delay <= 2 * propagation delay

answered in Computer Networks Oct 31, 2017

500 views

0 votes

19

MadeEasy Subject Test: Computer Networks - Network Addressing
Please Explain this

answered in Computer Networks Oct 29, 2017

421 views

0 votes

20

doubt
we find offset as data size/8 right? given offset is wrong, ..........am i right

answered in Computer Networks Oct 29, 2017

281 views

–2 votes

21

CN:Transport Layer: Data Transfer
What should be the value of Y, when P has no data to send to Q?

answered in Computer Networks Oct 29, 2017

1.3k views