GATE Overflow - Recent questions without answers
https://gateoverflow.in/unanswered
Powered by Question2AnswerDoubt regarding Turing Machine
https://gateoverflow.in/160850/doubt-regarding-turing-machine
<h3>I have read that T.M does not accept <strong>ε</strong> , but then in questions I have read T.M taking input ε ?</h3>
<p>Well, if T.M can't accept ε then why we are giving T.M the input ε ?</p>
<p>Thank you!</p>Theory of Computationhttps://gateoverflow.in/160850/doubt-regarding-turing-machineTue, 17 Oct 2017 16:00:13 +0000B+ tree
https://gateoverflow.in/160742/b-tree
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=14953778024252264431"></p>Databaseshttps://gateoverflow.in/160742/b-treeTue, 17 Oct 2017 09:22:04 +0000A* algorithm Heuristic cost # confused
https://gateoverflow.in/160737/a-algorithm-heuristic-cost-%23-confused
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=17748334147614721262"></p>Knowledge Representationhttps://gateoverflow.in/160737/a-algorithm-heuristic-cost-%23-confusedTue, 17 Oct 2017 09:17:17 +0000View Serializable schedules
https://gateoverflow.in/160734/view-serializable-schedules
Consider the following schedule:<br />
<br />
S: r1(A), r3(D), w1(B), r2(B), r4(B), w2(C), r5(C), w4(E), r5(E), w5(B)<br />
<br />
The number of serial schedules which are view equal to schedule S ?Databaseshttps://gateoverflow.in/160734/view-serializable-schedulesTue, 17 Oct 2017 09:09:03 +0000gatebook
https://gateoverflow.in/160714/gatebook
<p>Consider the following functional dependency set F.</p>
<p>F: AB<img alt="\rightarrow" src="http://latex.codecogs.com/gif.latex?%5Crightarrow">C, C<img alt="\rightarrow" src="http://latex.codecogs.com/gif.latex?%5Crightarrow">B, B<img alt="\rightarrow" src="http://latex.codecogs.com/gif.latex?%5Crightarrow">A</p>
<p>The number of minimal covers possible for F?</p>
<p>(A) 1</p>
<p>(B) 2</p>
<p>(C) 3</p>
<p>(D) 4</p>Databaseshttps://gateoverflow.in/160714/gatebookTue, 17 Oct 2017 08:13:33 +0000Zeal coaching
https://gateoverflow.in/160703/zeal-coaching
Consider the array A[4,7,11] of integers of size 4 bytes per elements how many elements of array are strictly stored between the element ofA[ 2, 3, 9] and the element A[ 3, 1, 6] assume the index start from A[ 1, 1, 1]Compiler Designhttps://gateoverflow.in/160703/zeal-coachingTue, 17 Oct 2017 07:18:24 +0000Coaching
https://gateoverflow.in/160693/coaching
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=10155579922920766305"></p>Compiler Designhttps://gateoverflow.in/160693/coachingTue, 17 Oct 2017 06:55:54 +0000test series
https://gateoverflow.in/160672/test-series
If directed broadcast address of a subnet is 220.101.92.31. Which of the following will be subnet mask ?<br />
<br />
a)255.255.255.224<br />
<br />
b)255.255.255.192<br />
<br />
c) 255.255.255.198<br />
<br />
<br />
<br />
what will be the answer /? and is this question even valid ? since DBA should have all 1's in the last octet ..Computer Networkshttps://gateoverflow.in/160672/test-seriesTue, 17 Oct 2017 05:42:35 +0000#DOUbt
https://gateoverflow.in/160630/%23doubt
(please draw small diagram for this question)<br />
<br />
An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead generator).<br />
The minimum addition time using the best architecture for this adder is .........?Digital Logichttps://gateoverflow.in/160630/%23doubtMon, 16 Oct 2017 18:24:34 +0000Is Go2017 enough?
https://gateoverflow.in/160556/is-go2017-enough
I am reading standard books of each subjects as much as I can and solving questions from GO2017 PDFs. I am able to do almost all of the questions from the subjects I have read from those 3 PDFs except for having difficulty in mathematics.<br />
<br />
I still have to study:<br />
<br />
1. OS<br />
<br />
2. DBMS<br />
<br />
3. CA & O.<br />
<br />
4. Aptitude.<br />
<br />
<br />
<br />
I will be having 20 days in November after which semester exams. And then perhaps half of December. And then full January.<br />
<br />
I want to know how to manage the time at this point?<br />
<br />
Also, I am having difficulty scoring in testbook series tests even though I can easily solve go PDFs. Is this bad?<br />
<br />
<br />
<br />
Thanks in advance for answering.GATEhttps://gateoverflow.in/160556/is-go2017-enoughMon, 16 Oct 2017 13:48:55 +0000Shift Registor
https://gateoverflow.in/160509/shift-registor
How many clock pulses are required for giving input and taking the output of n bit Serial-in-serial-out-shift-register?Digital Logichttps://gateoverflow.in/160509/shift-registorMon, 16 Oct 2017 09:38:06 +0000time complexity
https://gateoverflow.in/160479/time-complexity
<p>A) T(n) = 2T(root(n)) + 1 ; n>2</p>
<p> T(n) =1 ; 0 < n <= 2</p>
<p> </p>
<p>B) f(n) =n</p>
<p>g(n) = n<sup>(1+sin n)</sup></p>
<p>where n is positive integer</p>
<p>which is true?</p>
<p>1.f(n) = O(g(n))</p>
<p>2.f(n) = $\Omega$(g(n))</p>
<p> </p>
<p> </p>Algorithmshttps://gateoverflow.in/160479/time-complexityMon, 16 Oct 2017 08:19:06 +0000Os doubt fork related
https://gateoverflow.in/160471/os-doubt-fork-related
the output of the following program is<br />
<br />
Void main()<br />
<br />
{<br />
<br />
Int a= 10;<br />
<br />
If (fork()==0)<br />
<br />
a++;<br />
<br />
Print("%d", a);<br />
<br />
}<br />
<br />
<br />
<br />
0,10<br />
<br />
10,10<br />
<br />
11,10<br />
<br />
11,11Operating Systemhttps://gateoverflow.in/160471/os-doubt-fork-relatedMon, 16 Oct 2017 07:40:10 +0000Regular expresssion
https://gateoverflow.in/160452/regular-expresssion
<p>My Lafter Machin (MLM) recognizes the following strings :</p>
<p>(i) a</p>
<p>(ii) aba</p>
<p>(iii) abaabaaba</p>
<p>(iv) abaabaabaabaabaabaabaabaaba</p>
<p>Using this as an information, how would you compare the following regular expressions?</p>
<p>(i) (aba)3<em>x</em></p>
<p>(ii) a.(baa)3<em>x</em>–1. ba</p>
<p>(iii) ab.(aab).3<em>x</em>–1.a</p>
<p>(A) (ii) and (iii) are same, (i) is different.</p>
<p>(B) (ii) and (iii) are not same.</p>
<p>(C) (i), (ii) and (iii) are different.</p>
<p>(D) (i), (ii) and (iii) are same.</p>Theory of Computationhttps://gateoverflow.in/160452/regular-expresssionMon, 16 Oct 2017 05:41:17 +0000IIT JAM Admission Procedure
https://gateoverflow.in/160451/iit-jam-admission-procedure
<p>Candidates who want to get admission in IITs or IISc through IIT JAM (Joint Admission Test for M.Sc.), must know about the procedure to take admission in these institute.</p>
<ul>
<li>Only those applicants will be eligible for the IIT JAM admission procedure who will qualify in the JAM exam.</li>
<li>Candidates can apply for admission through the official website of JAM.</li>
<li>It’s essential for the aspirants that they should submit Rs. 600/- as their application fee.</li>
<li>Aspirants should have to submit all the required documents before the given date of submission.</li>
<li>Candidates not satisfied with the allotment of seats or failed to appear in the first round of counselling can apply in the second round.</li>
</ul>
<p>Get the complete procedure of admission from here – <a rel="nofollow" href="https://scoop.eduncle.com/iit-jam-admission-procedure">IIT JAM 2018 Admission Procedure.</a></p>IISc/IITshttps://gateoverflow.in/160451/iit-jam-admission-procedureMon, 16 Oct 2017 05:26:18 +0000Precedence and Associativity of Logical AND and OR
https://gateoverflow.in/160441/precedence-and-associativity-of-logical-and-and-or
<p>Consider the following Program:-</p>
<pre class="prettyprint lang-c_cpp">
#include <stdio.h>
int main()
{
short a = 1, b = 1, c = 1, d;
d = ((a++ || b++ && c++) || 1);
printf("a= %d, b = %d, c= %d, d= %d", a,b,c,d);
return 0;
}
</pre>
<p>Output:-</p>
<p>a = 2, b = 1, c = 1, d = 1;</p>
<p>Even though the precedence of AND is greater than that of OR, which means && should be executed before ||, but it is not happening. Why??</p>Programminghttps://gateoverflow.in/160441/precedence-and-associativity-of-logical-and-and-orMon, 16 Oct 2017 03:11:59 +0000Self Doubt ( Decrease key operation )
https://gateoverflow.in/160369/self-doubt-decrease-key-operation
While going through dijkstra's algorithm, there is a term "decrease key". I am not getting the meaning when it says "we do decrease key operation". What exactly we do and what is the meaning of decrease key ?Algorithmshttps://gateoverflow.in/160369/self-doubt-decrease-key-operationSun, 15 Oct 2017 16:49:25 +0000Pipeline
https://gateoverflow.in/160285/pipeline
<p>Give answer for question no. 12</p>
<p>please! provide detailed answer.<img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=2894399998408371017"></p>CO & Architecturehttps://gateoverflow.in/160285/pipelineSun, 15 Oct 2017 12:48:30 +0000Algo doubt
https://gateoverflow.in/160280/algo-doubt
<p>Assume f(n) and g(n) are two functions such that f (n)=O(g(n))</p>
<p>which of the following always hold</p>
<p>F(n) = O (f(n)<sup>2</sup>)</p>
<p>F(n) = Ω (f(n)<sup>2</sup>)</p>
<p>G(n) = O (f(n)<sup>2</sup>)</p>
<p>G(n) = Ω (g(n))</p>
<p> </p>
<p> </p>
<p> </p>Algorithmshttps://gateoverflow.in/160280/algo-doubtSun, 15 Oct 2017 12:37:23 +0000#Testbook
https://gateoverflow.in/160278/%23testbook
<p><img alt="" height="57" src="https://gateoverflow.in/?qa=blob&qa_blobid=8536776803355392928" width="685"></p>Operating Systemhttps://gateoverflow.in/160278/%23testbookSun, 15 Oct 2017 12:34:31 +0000Pipeline
https://gateoverflow.in/160242/pipeline
<p>What is the mean of pipeline in steady state under ideal conditions??</p>
<p>What's its effect if it would have not given?</p>
<p>Example below question</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=12794230975065225697"></p>CO & Architecturehttps://gateoverflow.in/160242/pipelineSun, 15 Oct 2017 11:40:02 +0000programming
https://gateoverflow.in/160163/programming
int fun(int n)<br />
<br />
{<br />
<br />
int table={0,1,2,1,2,2,3,1,2,2,3,2,3,3,4};<br />
<br />
int count =0;<br />
<br />
for(;n;n>>4)<br />
<br />
count=count + table[n & oxf];<br />
<br />
return(count);<br />
<br />
}<br />
<br />
what will fun() return?<br />
<br />
1.returns no.of 0's in the number<br />
<br />
2.returns no.of 1's in the number<br />
<br />
3.returns no.of 0's and 1's in the number<br />
<br />
4.noneProgramminghttps://gateoverflow.in/160163/programmingSun, 15 Oct 2017 07:45:02 +0000Keys of Relationship set
https://gateoverflow.in/160092/keys-of-relationship-set
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13544246071813368689"></p>
<p>Suppose the key of entity set A is attribute A, the key of B is B , the key of C is C, the key
<br>
of D is D. If we translate relationship set R into a relation R (A,B, C,D), what are the
<br>
keys of R?
<br>
a) {A}
<br>
b) {B,C} AND {C,D}
<br>
c) {A,C}
<br>
d) {ABC,ACD}</p>Databaseshttps://gateoverflow.in/160092/keys-of-relationship-setSun, 15 Oct 2017 02:29:42 +0000regular language
https://gateoverflow.in/160091/regular-language
which of the following is regular grammar?<br />
<br />
a) L1 = { XcY | X,Y belongs to (a,b)* and c is constant }.<br />
<br />
b) L2 = { WcW^r | W belongs to (a,b)* and W^r is the reverse of W }.<br />
<br />
<br />
<br />
Please answer with explanation.Theory of Computationhttps://gateoverflow.in/160091/regular-languageSun, 15 Oct 2017 02:07:14 +0000Decidablity problem.
https://gateoverflow.in/160087/decidablity-problem
Is L(G) subset of L(R) decidable ? Where G is CFG and R is regular grammar.<br />
<br />
Problem can be reduced to checking if L(G) $\cap$ ( L(R))' = phi.<br />
<br />
Now L(R)' is regular, so it also CFL and determining whether<br />
<br />
L(G1) $\cap$ L(G2) = phi is known to be undecidable where L(G1) and L(G2) are CFL's . So above problem should also be undecidable.<br />
<br />
Where am I going wrong ?Theory of Computationhttps://gateoverflow.in/160087/decidablity-problemSat, 14 Oct 2017 22:52:40 +0000Recursion Tree
https://gateoverflow.in/160082/recursion-tree
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=17967665117726523365">Is this code running fine ?if yes what is the output I am getting 2 here.</p>Algorithmshttps://gateoverflow.in/160082/recursion-treeSat, 14 Oct 2017 21:36:03 +0000SELF DOUBT
https://gateoverflow.in/160076/self-doubt
PLEASE SUGGEST ME THE PROCEDURE TO DRAW AN DAG FOR INTERMEDIATE CODE AND SOME RESOURCES TO STUDY REGISTER ALLOCATION AND SPILLING FROMCompiler Designhttps://gateoverflow.in/160076/self-doubtSat, 14 Oct 2017 20:03:17 +0000coreman
https://gateoverflow.in/160044/coreman
As stated, in dynamic programming we first solve the<br />
subproblems and then choose which of them to use in an<br />
optimal solution to the problem. Professor Capulet claims that<br />
it is not always necessary to solve all the subproblems in order<br />
to find an optimal solution. She suggests that an optimal<br />
solution to the matrix-chain multiplication problem can be<br />
found by always choosing the matrix Ak at which to split the<br />
subproduct Ai Ai+1 … Aj ( by selecting k to minimize the quantity<br />
pi-1 pk pj) before soling the subproblems. Find an instance of the<br />
matrix-chain multiplication problem for which this greedy<br />
approach yields a suboptimal solution.<br />
<br />
i dont understand this question please explain.Algorithmshttps://gateoverflow.in/160044/coremanSat, 14 Oct 2017 17:44:27 +0000Closure Properties
https://gateoverflow.in/160019/closure-properties
Which of the following are closed/ not closed under infinite Union?<br />
<br />
a.DCFL<br />
<br />
b.CFL<br />
<br />
c.CSL<br />
<br />
d.Recursive Languages<br />
<br />
e.Recursively enumerable languagesTheory of Computationhttps://gateoverflow.in/160019/closure-propertiesSat, 14 Oct 2017 15:35:46 +0000Memory Interfacing problem in Computer Organisation and Architecture
https://gateoverflow.in/159973/interfacing-problem-computer-organisation-architecture
Hi All,<br />
<br />
I have one doubt regarding avg access time in various levels of memory. There are 2 ways in which the processor is connected to various levels of memory.<br />
<br />
2 levels<br />
<br />
Case 1:<br />
<br />
(parallel access)<br />
<br />
T avg = H1 * T1 + (1- H1) * T2;<br />
<br />
Case 2:<br />
<br />
(sequential access)<br />
<br />
T avg = H1 * T1 + (1- H1) * (T1+T2);<br />
<br />
In maximum Gate previous years problem, they are using case 1 only.<br />
<br />
Consider this Gate 2004 problem,: You solved this via case 1.<br />
<br />
Problem:<br />
<br />
========<br />
<br />
Consider a system with 2 level cache. The access time of L1, L2 cache and memory are 1ns,10ns,500 ns. Hit rates of L1 and and L2 cache are 0.8 and 0.9, What is the avg access time of the system ignoring the search time within the cache?<br />
<br />
===> Ans is 12.6, nothing is mentioned solved via case 1 only.<br />
<br />
Can anyone please let me know which one should I use. Thank you.CO & Architecturehttps://gateoverflow.in/159973/interfacing-problem-computer-organisation-architectureSat, 14 Oct 2017 13:43:08 +0000Compiler Design:- Number of conflicts in LR(0)
https://gateoverflow.in/159956/compiler-design-number-of-conflicts-in-lr-0
Consider the following grammer:-<br />
<br />
Stmts -> Stmt | Stmts;Stmt<br />
<br />
Stmt -> Var =E<br />
<br />
Var ->id[E] | id<br />
<br />
E-> id | (E)<br />
<br />
Find the number of conflicts in LR(0)?Compiler Designhttps://gateoverflow.in/159956/compiler-design-number-of-conflicts-in-lr-0Sat, 14 Oct 2017 12:44:51 +0000Testbook Test Series - Linked Lists
https://gateoverflow.in/159955/testbook-test-series-linked-lists
<p>Consider the following code which is used to detect the loop in the linked list. Find the missing statement A?</p>
<pre class="prettyprint lang-c_cpp">
p = head;
q = head->next;
while(A)
{
if(p == q) exit(0) //loop detected
p = p->next;
q = (q->next)?(q->next->next) : q->next;
}</pre>
<p>Answer: (p!=NULL) && (q!=NULL)</p>
<p><strong>My question is</strong>: Why we are using (p!=NULL). I don't think it is even required. only q is sufficient. As it is running faster as compared to p, it will reach first to the end of the linked list. my answer is q!=NULL and it is in one of the options. Please correct me if I am wrong.</p>DShttps://gateoverflow.in/159955/testbook-test-series-linked-listsSat, 14 Oct 2017 12:37:58 +0000Compiler design: Number of rows in parsing table
https://gateoverflow.in/159952/compiler-design-number-of-rows-in-parsing-table
<p>Consider the following augmented grammar G which is used to build LR (0) parsing table.</p>
<p>E<sup>' __</sup>> E</p>
<p>E <sup>__</sup>> E+T/T</p>
<p>T <sup>__</sup>> T*F/F</p>
<p>F -->(E)/id</p>
<p>How many rows are there in the parsing rable ?</p>
<p> </p>
<p>a)11</p>
<p>b)12</p>
<p>c)13</p>
<p>d)14</p>
<p> </p>Compiler Designhttps://gateoverflow.in/159952/compiler-design-number-of-rows-in-parsing-tableSat, 14 Oct 2017 12:19:39 +0000self doubt
https://gateoverflow.in/159951/self-doubt
is there any problem which can be solved by top down approach of dynamic programming but can not solve by bottom up approach or vice versa?Algorithmshttps://gateoverflow.in/159951/self-doubtSat, 14 Oct 2017 12:18:26 +0000time complexity
https://gateoverflow.in/159925/time-complexity
<p><img alt="" src="https://gateoverflow.in/ask?cat=15"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=15562990142816669134"><img alt="" src="https://www.facebook.com/photo.php?fbid=1981462328804049&set=gm.847695778744113&type=3&theater&ifg=1"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=3036783159679886934"></p>Algorithmshttps://gateoverflow.in/159925/time-complexitySat, 14 Oct 2017 10:20:05 +0000signed magnitude notation
https://gateoverflow.in/159898/signed-magnitude-notation
<p>In a floating point number representation, size of mantissa is 20bit and it is signed magnitude notatioon . Range of mntissa(in explixit normalised ) form is </p>
<p>1. +/- o to (1 - 2<sup>-20</sup>)</p>
<p>2.+/- 0.5 to(1-2<sup>-20</sup>)</p>
<p>3.+/- o to (1 - 2<sup>-19</sup>)</p>
<p>4.+/- 0.5 to(1-2<sup>-19</sup>)</p>
<p> </p>
<p>By <strong>+/- </strong> i mean it can be +o to (1-2<sup>-20</sup>) or -0 to (1-2<sup>-20</sup>)</p>Digital Logichttps://gateoverflow.in/159898/signed-magnitude-notationSat, 14 Oct 2017 07:53:53 +0000Turing Machine Decidability Question
https://gateoverflow.in/159881/turing-machine-decidability-question
<h3><strong>L1= {⟨M⟩| M is a TM and |L(M)| = 5 }. </strong></h3>
<p>we know about at least and at most case, but someone explain equal to case.</p>
<p>Furthermore, I'll complie more questions in same thread only.</p>
<h3><strong>L2= {⟨M⟩| M is a TM and M does not accept all even numbers}. </strong></h3>
<h3><strong>L3 = {⟨M⟩| M is a TM and M reject all even numbers}. </strong></h3>Theory of Computationhttps://gateoverflow.in/159881/turing-machine-decidability-questionSat, 14 Oct 2017 07:12:09 +0000Binary tree
https://gateoverflow.in/159872/binary-tree
In a binary tree, the time complexity of best upper and lower bound time required to get number of subtrees having exactly 8 nodes?DShttps://gateoverflow.in/159872/binary-treeSat, 14 Oct 2017 06:50:10 +0000self doubt
https://gateoverflow.in/159866/self-doubt
is implementation of LBA for CSL not possible ??????<br />
<br />
is Context sensitive grammer used for type checking ??Theory of Computationhttps://gateoverflow.in/159866/self-doubtSat, 14 Oct 2017 06:10:07 +0000NPTEL
https://gateoverflow.in/159846/nptel
Your friend wants to design synchronization primitives and tells you that he would be better off by strictly ensuring that the processes alternate the critical section. Your response would be:<br />
<br />
1. That might not satisfy the “progress” requirement<br />
<br />
2. That might not satisfy the “mutual exclusion” requirement<br />
<br />
3. That might not satisfy the “bounded wait” requirement<br />
<br />
4. I guess that would sufficeOperating Systemhttps://gateoverflow.in/159846/nptelSat, 14 Oct 2017 05:22:23 +0000NPTEL
https://gateoverflow.in/159842/nptel
Consider the following statements:<br />
<br />
i) if(count==0)<br />
<br />
ii) add %eax,%ebx<br />
<br />
1. i is atomic, ii is non-atomic<br />
<br />
2. i is non-atomic, ii is non-atomic<br />
<br />
3. i is non-atomic, ii is atomic<br />
<br />
4. Both are atomicOperating Systemhttps://gateoverflow.in/159842/nptelSat, 14 Oct 2017 05:18:31 +0000Automata: Conversion from CFG to CNF
https://gateoverflow.in/159814/automata-conversion-from-cfg-to-cnf
<p>Convert the following context free grammar into Chomsky Normal Form:</p>
<p>$S \rightarrow ASA | aB$</p>
<p>$A \rightarrow B | S$</p>
<p>$B \rightarrow b | \epsilon$</p>
<p><strong>Does the appearance of starting symbol S at RHS impacts the conversion from CFG to CNF?</strong></p>Theory of Computationhttps://gateoverflow.in/159814/automata-conversion-from-cfg-to-cnfSat, 14 Oct 2017 01:58:13 +0000Doubt
https://gateoverflow.in/159811/doubt
<p>Suppose we did a cross product of two DFAs:</p>
<p>Let the two DFAs be M<sub>1</sub> and M<sub>2</sub> accepting regular languages L<sub>1</sub> and L<sub>2</sub> </p>
<p>M1 = (Q<sub>1</sub>, Σ, δ<sub>1</sub>, q<sub>0</sub><sup>1</sup> , F<sub>1</sub>) </p>
<p>M2 = (Q<sub>2</sub>, Σ, δ<sub>2</sub>, q<sub>0</sub><sup>2</sup> , F<sub>2</sub>)</p>
<p>We want to construct DFA M = (Q, Σ, δ, q0, F) that recognize</p>
<p>L<sub>1</sub> ∪ L<sub>2</sub> then final states set will be F = {(q<sub>1</sub>, q<sub>2</sub>)|q<sub>1</sub> ∈ F<sub>1</sub> or q<sub>2</sub> ∈ F<sub>2</sub>}</p>
<p>L<sub>1</sub> Θ L<sub>2</sub> (Symmetric Difference) What will be the final states for this?</p>Theory of Computationhttps://gateoverflow.in/159811/doubtSat, 14 Oct 2017 01:37:24 +0000Compiler:- Find error in C statement
https://gateoverflow.in/159801/compiler-find-error-in-c-statement
<p>Find the C statement which has a syntax error.</p>
<ol>
<li>fi(z);</li>
<li>for(a, b, c);</li>
<li>whil(a, b);</li>
<li>fi (z);</li>
<li>for (a, b, c);</li>
<li>whil (a, b);</li>
<li>None of these.</li>
</ol>
<p>This is a modification of <a rel="nofollow" href="https://gateoverflow.in/33320/identify-syntax-error">https://gateoverflow.in/33320/identify-syntax-error</a></p>Compiler Designhttps://gateoverflow.in/159801/compiler-find-error-in-c-statementFri, 13 Oct 2017 20:06:30 +0000Automata: Number of Productions in the CFG
https://gateoverflow.in/159776/automata-number-of-productions-in-the-cfg
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=5976614442561293389"></p>
<p>Consider the following context free grammar:</p>
<p>$S \rightarrow ASA | aB$</p>
<p>$A \rightarrow B | S$</p>
<p>$B \rightarrow b | \epsilon$</p>
<p>How many productions will be there in the modified grammar if we remove null-productions and unit-productions from this grammar? </p>
<p>My Solution:
<br>
<strong>Step 1</strong>: Remove epsilon transitions
<br>
Nullable variables = $ \big\{A,B\big\} $</p>
<p>Modified grammar after removal of null productions:
<br>
$S \rightarrow ASA | aB | a | AS | SA | S$
<br>
$A \rightarrow B | S $
<br>
$B \rightarrow b$
<br>
<br>
<strong>Step 2</strong>: Remove Unit Productions
<br>
$S \rightarrow ASA |aB |a | AS | SA | \mathbf{S}$
<br>
$A \rightarrow \mathbf {B} | \mathbf{S}$
<br>
$B \rightarrow b$</p>
<p>Modified grammar after the removal of the unit productions:
<br>
$S \rightarrow ASA |aB |a | AS | SA$
<br>
$A \rightarrow b | ASA |aB |a | AS | SA$
<br>
$B \rightarrow b$</p>
<p>I am getting 12 productions. can someone please confirm if it's correct?
<br>
</p>Theory of Computationhttps://gateoverflow.in/159776/automata-number-of-productions-in-the-cfgFri, 13 Oct 2017 17:31:39 +0000self doubt
https://gateoverflow.in/159728/self-doubt
can anyone tell me the features of LR(K) grammers ? how is it different from LL(K)Compiler Designhttps://gateoverflow.in/159728/self-doubtFri, 13 Oct 2017 14:14:44 +0000digital logic
https://gateoverflow.in/159716/digital-logic
<p>f1= <img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=9352711655792468855"></p>Digital Logichttps://gateoverflow.in/159716/digital-logicFri, 13 Oct 2017 13:06:18 +0000Finding Essential Prime Implicants
https://gateoverflow.in/159682/finding-essential-prime-implicants
<p>Consider the Boolean function, F(w, x, y, z) = wy + xy + w̅xyz + w̅ x̅ y + xz + x̅y̅z̅.
<br>
Which one of the following is the complete set of essential prime implicants?
<br>
(A) w,y,xz,x̅z̅
<br>
(B) w,y,xz
<br>
(C) y,x̅y̅z̅
<br>
(D) y,xz,x̅z</p>
<p>After constructing the KMAP by finding out minterms, the circled terms contribute to Essential prime implicants, but i dont' see any such options, the Answer is given <em><strong>D</strong></em></p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=1278908614779098503"></p>Digital Logichttps://gateoverflow.in/159682/finding-essential-prime-implicantsFri, 13 Oct 2017 10:13:25 +0000File System - Unix Inode
https://gateoverflow.in/159666/file-system-unix-inode
<p style="text-align:center"><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11286694013623641169"></p>
<p> </p>Operating Systemhttps://gateoverflow.in/159666/file-system-unix-inodeFri, 13 Oct 2017 08:43:53 +0000self doubt
https://gateoverflow.in/159655/self-doubt
A) Does C-Scan , Look and C-Look suffer from starvation?<br />
<br />
<br />
<br />
<br />
<br />
B) is TLB miss and no page fault possible?<br />
<br />
<br />
<br />
<br />
<br />
C)hardware access to devices is usually unavailable in user mode - true or falseOperating Systemhttps://gateoverflow.in/159655/self-doubtFri, 13 Oct 2017 07:54:18 +0000