Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
1gate_cracker
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by 1gate_cracker
1
answer
1
GateBook Mock Test_2(Compilers)
Consider these three grammars. Which of the following statements is not true? (A) If w can be generated by G1, then it can be generated by G2. (B) If w can be generated by G2, then it can be generated by G3. (C) If w can be generated by G3, then it can be generated by G1. (D) If w can be generated by G2, then it can be generated by G1.
Consider these three grammars.Which of the following statements is not true?(A) If w can be generated by G1, then it can be generated by G2.(B) If w can be generated by G...
887
views
commented
Jan 24, 2018
Compiler Design
gatebook-mt2
compiler-design
grammar
gatebook-test-series
+
–
0
answers
2
doubt
pls suggest me important topic to me which is very important in gate . I'm already completed I/O interfacing and memory interfacing and its numerical . pls reply as soon as possible .
pls suggest me important topic to me which is very important in gate .I'm already completed I/O interfacing and memory interfacing and its numerical . pls reply as soon a...
234
views
asked
Jan 11, 2018
5
answers
3
GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the over...
21.7k
views
commented
Jan 1, 2018
Operating System
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
+
–
4
answers
4
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.
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...
3.0k
views
answered
Dec 31, 2017
Operating System
gate1988
normal
descriptive
operating-system
resource-allocation
+
–
4
answers
5
Memory Management
A $1$TB Disk with $4$-KB blocks require $32$MB to store its bit map? Kindly explain how.
A $1$TB Disk with $4$-KB blocks require $32$MB to store its bit map?Kindly explain how.
3.9k
views
commented
Dec 31, 2017
Operating System
memory-management
operating-system
bitmap
+
–
4
answers
6
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
Consider the following intermediate program in three address codep = a - b q = p * c p = u * v q = p + qWhich one of the following corresponds to a static single assignme...
11.5k
views
answered
Dec 24, 2017
Compiler Design
gatecse-2017-set1
compiler-design
intermediate-code
normal
static-single-assignment
+
–
8
answers
7
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
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}$$\te...
7.7k
views
answered
Dec 24, 2017
Compiler Design
gatecse-2017-set2
compiler-design
parsing
+
–
7
answers
8
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$
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...
10.9k
views
answered
Dec 24, 2017
Compiler Design
gatecse-2017-set2
grammar
+
–
2
answers
9
Number of states
Find the number of states in minimal dfa, $w \in${0,1}, such that when interpreted in binary is divisible by $11$. I think answer would be $5$. log2(11)
Find the number of states in minimal dfa, $w \in${0,1}, such that when interpreted in binary is divisible by $11$.I think answer would be $5$. log2(11)
503
views
commented
Dec 22, 2017
Theory of Computation
theory-of-computation
number-of-states
+
–
9
answers
10
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 ______________ .
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 \righ...
16.4k
views
answered
Dec 22, 2017
Theory of Computation
theory-of-computation
gatecse-2017-set2
finite-automata
numerical-answers
minimal-state-automata
+
–
2
answers
11
GATE CSE 1990 | Question: 3-vi
Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...
16.7k
views
commented
Dec 22, 2017
Theory of Computation
gate1990
normal
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
multiple-selects
+
–
1
answer
12
workbook
If S={ab,ba} which of the following is true? a-S* contains finite no. of string of infinite length. b-S* has no string having 'aaa' and 'bbb' substring. c-S* has no string having 'aa' substring. d- If T={a,b}, then S* is not superset of T*.
If S={ab,ba} which of the following is true?a-S* contains finite no. of string of infinite length.b-S* has no string having 'aaa' and 'bbb' substring.c-S* has no strin...
626
views
asked
Dec 21, 2017
5
answers
13
GATE CSE 2001 | Question: 2.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which ... (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$.create table geq ( ib integer not null, ub integer not n...
10.5k
views
commented
Nov 28, 2017
Databases
gatecse-2001
databases
sql
normal
+
–
5
answers
14
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
Which of the following relational query languages have the same expressive power?Relational algebraTuple relational calculus restricted to safe expressionsDomain relation...
8.9k
views
answered
Nov 27, 2017
Databases
gateit-2006
databases
relational-algebra
relational-calculus
easy
+
–
6
answers
15
can cadidate key may be null?
13.6k
views
answered
Nov 27, 2017
Databases
http
gateoverflow
in
ask
+
–
8
answers
16
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 \}$
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 ...
21.5k
views
answered
Nov 11, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
11
answers
17
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 \}$
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$$...
18.3k
views
answered
Nov 11, 2017
Theory of Computation
gatecse-2017-set2
theory-of-computation
context-free-language
+
–
3
answers
18
GateBook Mock 2
According to me option B is correct.
According to me option B is correct.
707
views
answered
Nov 11, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
+
–
3
answers
19
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
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...
782
views
answered
Nov 11, 2017
Theory of Computation
gatebook-mt2
theory-of-computation
decidability
turing-machine
+
–
3
answers
20
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
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 i...
1.8k
views
answered
Nov 11, 2017
Theory of Computation
gatebook-toc
theory-of-computation
regular-language
+
–
2
answers
21
toc gatebook test Q 2
Let $R$ be a regular language and $L$ is a language which accepts only even length strings from $R$. Then $L$ is Always Regular Always Not Regular Sometimes Regular, but not always None
Let $R$ be a regular language and $L$ is a language which accepts only even length strings from $R$. Then $L$ isAlways RegularAlways Not RegularSometimes Regular, but not...
801
views
commented
Nov 11, 2017
Theory of Computation
regular-language
+
–
2
answers
22
GATE CSE 1988 | Question: 2ix
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
2.9k
views
commented
Nov 11, 2017
Theory of Computation
gate1988
normal
descriptive
theory-of-computation
identify-class-language
+
–
4
answers
23
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.
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 th...
18.3k
views
answered
Nov 11, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
decidability
difficult
+
–
1
answer
24
workbook
Which of the following pairs of regular expression are not equivalent? A. (a*+b)* and (a+b)* B. (ab)*a and a(ba)* C. (a+b)* and (a*b*)*b* D. none of the above
Which of the following pairs of regular expression are not equivalent?A. (a*+b)* and (a+b)*B. (ab)*a and a(ba)*C. (a+b)* and (a*b*)*b*D. none of the above
3.6k
views
asked
Nov 11, 2017
Theory of Computation
regular-expression
+
–
2
answers
25
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
Is a^nb^3^n is CsL or Recursive or Recursive enumerable?Please draw the state transition diagram alsoI think it is not any of them.because b^3^n I can't put in loop
889
views
answered
Nov 10, 2017
2
answers
26
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??
The numbers 1,2,4,8,…2n,…1,2,4,8,…2n,… written in unaryIs regular or not??if not please justify??
396
views
answered
Nov 10, 2017
Theory of Computation
theory-of-computation
finite-automata
gateoverflow
+
–
1
answer
27
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?
IF a number is divisible by say any integer X then what will be the minimum states required in DFA?
423
views
answered
Nov 9, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
made-easy-booklet
+
–
3
answers
28
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
Which of the following pairs have DIFFERENT expressive power?Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA)Deterministic push down automa...
9.4k
views
answered
Nov 9, 2017
Theory of Computation
gatecse-2011
theory-of-computation
easy
non-determinism
+
–
5
answers
29
GateBook Mock-Test-2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how m...
7.4k
views
commented
Nov 9, 2017
Computer Networks
computer-networks
gatebook-mt2
ip-packet
+
–
1
answer
30
Doubt on formula
in csma/cd which formula is right 1 .transmission delay >= 2 * propagation delay 2.transmission delay <= 2 * propagation delay
in csma/cdwhich formula is right1 .transmission delay >= 2 * propagation delay2.transmission delay <= 2 * propagation delay
482
views
answered
Oct 31, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register