THE GATEBOOK Q&A - Recent questions and answers
http://thegatebook.in/qa/qa
Powered by Question2AnswerWhen will be GATE Mock Test 1 starting?
http://thegatebook.in/qa/1357/when-will-be-gate-mock-test-1-starting
There is no link available yet.Plzz Help!GATE Mock Test 1http://thegatebook.in/qa/1357/when-will-be-gate-mock-test-1-startingSat, 21 Jan 2017 12:25:19 +0000recursive and recursively enumerable
http://thegatebook.in/qa/1342/recursive-and-recursively-enumerable
<p>Define languages L0L0 and L1L1 as follows : <br>
<br>
L0={⟨M,w,0⟩∣M halts on w}L0={⟨M,w,0⟩∣M halts on w} <br>
<br>
L1={⟨M,w,1⟩∣M does not halts on w}L1={⟨M,w,1⟩∣M does not halts on w} <br>
<br>
Here ⟨M,w,i⟩⟨M,w,i⟩ is a triplet, whose first component MM is an encoding of a Turing <br>
Machine, second component ww is a string, and third component ii is a bit. <br>
<br>
Let L=L0∪L1L=L0∪L1. Which of the following is true?</p>
<ol>
<li>LL is recursively enumerable, but L′L′ is not</li>
<li>L′L′ is recursively enumerable, but LL is not</li>
<li>Both LL and L′L′ are recursive </li>
<li>Neither LL nor L′L′ is recursively enumerable</li>
</ol>TOChttp://thegatebook.in/qa/1342/recursive-and-recursively-enumerableFri, 20 Jan 2017 02:03:52 +0000lexicographic order
http://thegatebook.in/qa/1341/lexicographic-order
<p>If the strings of a language LL can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true?</p>
<ol>
<li>LL is necessarily finite</li>
<li>LL is regular but not necessarily finite</li>
<li>LL is context free but not necessarily regular</li>
<li>LL is recursive but not necessarily context-free</li>
</ol>TOChttp://thegatebook.in/qa/1341/lexicographic-orderFri, 20 Jan 2017 01:51:04 +0000Answered: TOC Grand Test 1 Question 26
http://thegatebook.in/qa/961/toc-grand-test-1-question-26?show=1340#a1340
#plz explain ????? sirTOChttp://thegatebook.in/qa/961/toc-grand-test-1-question-26?show=1340#a1340Thu, 19 Jan 2017 10:40:42 +0000Answered: TOC Grand Test 1 Question 25
http://thegatebook.in/qa/960/toc-grand-test-1-question-25?show=1339#a1339
@kiran sir plz explain???TOChttp://thegatebook.in/qa/960/toc-grand-test-1-question-25?show=1339#a1339Thu, 19 Jan 2017 10:39:04 +0000Answered: TOC Grand Test 1 Question 23
http://thegatebook.in/qa/958/toc-grand-test-1-question-23?show=1338#a1338
any one explain why (i) is decidable???TOChttp://thegatebook.in/qa/958/toc-grand-test-1-question-23?show=1338#a1338Thu, 19 Jan 2017 10:37:25 +0000Revision strategy
http://thegatebook.in/qa/1334/revision-strategy
Sir , Only 3 weeks left for the exam So just I wanna know how should we approach in these last few days ...<br />
which are topics which should be more focussed upon???<br />
Or what things we can do now to maximise our results??Aptitudehttp://thegatebook.in/qa/1334/revision-strategySun, 15 Jan 2017 08:18:52 +0000Answered: GATE2012_45 CN
http://thegatebook.in/qa/1316/gate2012_45-cn?show=1327#a1327
It would depend on how we define end of the transmission. If it is the time when the ack hits receiver then it is 7 MSS, otherwise if it is after getting ack then after that incrementing window size then answer would be 8 MSS.<br />
<br />
But first case is convincing right.Computer Networkshttp://thegatebook.in/qa/1316/gate2012_45-cn?show=1327#a1327Thu, 05 Jan 2017 12:00:08 +0000Answered: pipeline GATE 2015
http://thegatebook.in/qa/1325/pipeline-gate-2015?show=1326#a1326
Yes Mohit we have not discussed it in the pipeline Lectures as from this concept questions are asked rarely.Computer Organizationhttp://thegatebook.in/qa/1325/pipeline-gate-2015?show=1326#a1326Thu, 05 Jan 2017 11:03:26 +0000Answered: machine instructions
http://thegatebook.in/qa/1323/machine-instructions?show=1324#a1324
<p>Follow the picture<img alt="" src="http://thegatebook.in/qa/?qa=blob&qa_blobid=1305553902076511142" style="height:450px; width:600px"></p>Computer Organizationhttp://thegatebook.in/qa/1323/machine-instructions?show=1324#a1324Wed, 04 Jan 2017 09:17:14 +0000Time Complexity
http://thegatebook.in/qa/1322/time-complexity
<p>What is the worst case time complexity of the following recurrence relation?<br>
T(n)=T(n/2)+T(n/4)+T(n/8)+n</p>
<p>My question is if we use Recursion tree method then we get tree something like this</p>
<p><img alt="" src="http://thegatebook.in/qa/?qa=blob&qa_blobid=16295771742268111603" style="height:353px; width:600px"></p>
<p>the work done at every level is in the form of GP So we can write T(n) = n+(7/8)n +(7/8)n^2 ....... which will come out as theta(n) </p>
<p>Theta(n) would be the answer or we will have to multiply it with the height (LOG(n) base 2) of the tree (leftmost height as it will ne the first to terminate)???????</p>Data Structures Algorithms and C Programminghttp://thegatebook.in/qa/1322/time-complexityFri, 30 Dec 2016 05:47:30 +0000Answered: Memory Access
http://thegatebook.in/qa/1314/memory-access?show=1321#a1321
<h2 style="font-style:italic;">In the question it is itself mentioned 2 <strong>level</strong> which means only after checking first cache we will go to second. If level is not mentioned the we will take simultaneous.</h2>Computer Organizationhttp://thegatebook.in/qa/1314/memory-access?show=1321#a1321Thu, 29 Dec 2016 17:53:39 +0000GATE 2009 relational algebra, TLC
http://thegatebook.in/qa/1320/gate-2009-relational-algebra-tlc
<p>Let R and S be relational schemes such that R={a,b,c} and S={c}. Now consider the following queries on the database:</p>
<p>1. <em>π</em><em>R</em>−<em>S</em>(<em>r</em>)−<em>π</em><em>R</em>−<em>S</em>(<em>π</em><em>R</em>−<em>S</em>(<em>r</em>)×<em>s</em>−<em>π</em><em>R</em>−<em>S</em>,<em>S</em>(<em>r</em>))</p>
<p> </p>
<p>2. {<em>t</em>∣<em>t</em>∈<em>π</em><em>R</em>−<em>S</em>(<em>r</em>)∧∀<em>u</em>∈<em>s</em>(∃<em>v</em>∈<em>r</em>(<em>u</em>=<em>v</em>[<em>S</em>]∧<em>t</em>=<em>v</em>[<em>R</em>−<em>S</em>]))}</p>
<p> </p>
<p>3. {<em>t</em>∣<em>t</em>∈<em>π</em><em>R</em>−<em>S</em>(<em>r</em>)∧∀<em>v</em>∈<em>r</em>(∃<em>u</em>∈<em>s</em>(<em>u</em>=<em>v</em>[<em>S</em>]∧<em>t</em>=<em>v</em>[<em>R</em>−<em>S</em>]))}</p>
<p> </p>
<p>4. </p>
<pre>
Select R.a,R.b
From R,S
Where R.c = S.c</pre>
<p>Which of the above queries are equivalent?</p>
<ol>
<li>1 and 2</li>
<li>1 and 3</li>
<li>2 and 4</li>
<li>3 and 4</li>
</ol>
<p>sir pls explain with each option . i am not able to understand it properly.</p>DBMShttp://thegatebook.in/qa/1320/gate-2009-relational-algebra-tlcWed, 28 Dec 2016 15:00:55 +0000Answered: DIGITAL VIDEOS
http://thegatebook.in/qa/1317/digital-videos?show=1318#a1318
In january 1st weekDigitalhttp://thegatebook.in/qa/1317/digital-videos?show=1318#a1318Sun, 18 Dec 2016 10:43:42 +0000Answered: Addressing modes GATE2011_21
http://thegatebook.in/qa/1312/addressing-modes-gate2011_21?show=1313#a1313
It is base indexed addressingComputer Organizationhttp://thegatebook.in/qa/1312/addressing-modes-gate2011_21?show=1313#a1313Mon, 12 Dec 2016 07:14:40 +0000Answered: CheckSum calculation
http://thegatebook.in/qa/1226/checksum-calculation?show=1310#a1310
<p>A check sum is basically a value that is computed from data packet to check its integrity. Through integrity, we mean a check on whether the data received is error free or not. This is because while traveling on network a data packet can become corrupt and there has to be a way at the receiving end to know that data is corrupted or not. This is the reason the checksum field is added to the header. At the source side, the checksum is calculated and set in header as a field. At the destination side, the checksum is again calculated and crosschecked with the existing checksum value in header to see if the data packet is OK or not. This <a rel="nofollow" href="http://cheapessaywritingservice.us/">source</a> gives you complete idea on finding IP header checksum.</p>
<h3> </h3>Computer Networkshttp://thegatebook.in/qa/1226/checksum-calculation?show=1310#a1310Sat, 03 Dec 2016 10:18:25 +0000Answered: TOC Grand Test 1 Question 16
http://thegatebook.in/qa/951/toc-grand-test-1-question-16?show=1305#a1305
TM can act as a transducer which means it can take an input and can convert it into some other form.TOChttp://thegatebook.in/qa/951/toc-grand-test-1-question-16?show=1305#a1305Thu, 01 Dec 2016 03:20:36 +0000Answered: TRC query Relational calculus
http://thegatebook.in/qa/1302/trc-query-relational-calculus?show=1303#a1303
<p><strong>(∀d)(¬department(d) ∨ d.Dnumber ≠ e.Dno ∨ (d.Mgr_ssn ≠ e.ssn) ∨ (e.sex = ‘male’))}</strong></p>
<p>Let us take negation of it. ( and conditions are easier to understand than or)</p>
<p><img alt="\exists" src="http://latex.codecogs.com/gif.latex?%5Cexists">d (department(d) <img alt="\Lambda" src="http://latex.codecogs.com/gif.latex?%5CLambda"> d.Dnumber = e.Dno <img alt="\Lambda" src="http://latex.codecogs.com/gif.latex?%5CLambda" style="height:13px; width:12px"> d.Mgr_ssn = e.ssn)<img alt="\Lambda" src="http://latex.codecogs.com/gif.latex?%5CLambda" style="height:13px; width:12px">(e.sex = ‘female’))}</p>
<p>there is some d which is department and whose department number matches with e's department number and its manager is e and e is female</p>
<p>That means "there is some Department for which our e (e is also female) is a manager and also belongs to same department"</p>
<p>Since we interpreted negation of the statement.</p>
<p>So original statement would be " It is false that there is some Department for which our e (e is also female) is an employee working there and manager"</p>
<p> </p>
<p>Finally e (e is also female) is not a manager to any department where he works</p>
<p>Now we interpret all together</p>
<p>It prints e.name when e is an employee and female and not a manager to any department where he works</p>
<p> </p>DBMShttp://thegatebook.in/qa/1302/trc-query-relational-calculus?show=1303#a1303Sun, 27 Nov 2016 16:35:29 +0000What is the work of on update cascade over here? shouldnt it delete all entries with c3.???
http://thegatebook.in/qa/1301/what-update-cascade-over-here-shouldnt-delete-entries-with
DBMShttp://thegatebook.in/qa/1301/what-update-cascade-over-here-shouldnt-delete-entries-withSun, 27 Nov 2016 05:51:39 +0000Answered: decidability doubt
http://thegatebook.in/qa/1299/decidability-doubt?show=1300#a1300
To understand the answer you should know the answer for this question1<br />
<br />
Question 1: Given an n length string how many ways it can be splitted.<br />
<br />
Example: abcde<br />
<br />
ab/cd/e a/bcd/e ab/cd/e.....so on<br />
Try to answer this question and then read below solution.<br />
<br />
Given a recursive language We can construct turing machine for L* like this<br />
<br />
step 1: split the input W in all possible ways. (Using TM we can do it) the no of ways is solution to the question1<br />
step 2: for each split w1#w2#w3...simulate TM of L on all the strings w1,w2,w3... and if it accepts all the strings w1,w2,w3 then Accept W.<br />
Here you are accepting the string if it is concatenation of some strings which are all members of L.<br />
<br />
Otherwise RejectTOChttp://thegatebook.in/qa/1299/decidability-doubt?show=1300#a1300Sat, 26 Nov 2016 04:34:44 +0000Answered: SRTF_related question
http://thegatebook.in/qa/1295/srtf_related-question?show=1296#a1296
p is 15 and q is 6Operating Systemshttp://thegatebook.in/qa/1295/srtf_related-question?show=1296#a1296Wed, 23 Nov 2016 05:52:11 +0000Answered: DMGT1 - Question 35
http://thegatebook.in/qa/15/dmgt1-question-35?show=1292#a1292
1) Consider the predicates as follows:<br />
<br />
F: A person is fat<br />
<br />
G: A person eats too much<br />
<br />
Domain be {Vikram, Sonakshi} . Now, take values for F and G for each person of the domain and then check if you can get LHS false and RHS true or vice-versa. Not possible, right?<br />
<br />
So, S1 is true,<br />
<br />
2) <br />
<br />
Consider the predicates as follows:<br />
<br />
F: A person is tall<br />
<br />
G: A person can play good basketball<br />
<br />
Now, for S2 to be false, either LHS is false and RHS is true or vice-versa.<br />
<br />
If LHS shld be false then we should take F={true, true, true} and G={false,false,false}. But, using this RHS also become false.<br />
<br />
Check the other case as well where LHS is true and RHS false.<br />
<br />
So, there is no case where you can have either LHS is false and RHS is true or vice-versa<br />
<br />
So, S2 is also true.DiscreteMaths-GrandTest1http://thegatebook.in/qa/15/dmgt1-question-35?show=1292#a1292Mon, 21 Nov 2016 12:06:58 +0000Answered: TOC Grand Test 1 Question 13
http://thegatebook.in/qa/948/toc-grand-test-1-question-13?show=1291#a1291
Both B & C are not regular.TOChttp://thegatebook.in/qa/948/toc-grand-test-1-question-13?show=1291#a1291Mon, 21 Nov 2016 11:54:41 +0000counting problem in binary string
http://thegatebook.in/qa/1290/counting-problem-in-binary-string
Number of binary strings of length 10 that contain either three consecutive 0s or three consecutive 1s ?<br />
<br />
<br />
<br />
answer is 240 ..how to approach this kind of questionDiscrete Mathshttp://thegatebook.in/qa/1290/counting-problem-in-binary-stringMon, 21 Nov 2016 11:43:50 +0000Answered: TOC Grand Test 1 Question 7
http://thegatebook.in/qa/974/toc-grand-test-1-question-7?show=1288#a1288
As all TM acceps regular languages so it should be decidable. so, In my view ans. would be A because every trivial question asked by TM is decidable.TOChttp://thegatebook.in/qa/974/toc-grand-test-1-question-7?show=1288#a1288Mon, 21 Nov 2016 11:18:34 +0000Answered: GATE2003_15 CS
http://thegatebook.in/qa/1271/gate2003_15-cs?show=1278#a1278
When a language can lexicographically enumerated then it is said to be recursive. <br />
<br />
When a laguage is effectively enumerated then it is called R.ETOChttp://thegatebook.in/qa/1271/gate2003_15-cs?show=1278#a1278Sat, 19 Nov 2016 15:34:24 +0000Answered: CN (How the answer is 5.23?)
http://thegatebook.in/qa/1273/cn-how-the-answer-is-5-23?show=1276#a1276
Trasmission Time + Propagation TIme (For A->B) same for (B->C)<br />
<br />
I think simply substituting value will give the answerComputer Networkshttp://thegatebook.in/qa/1273/cn-how-the-answer-is-5-23?show=1276#a1276Sat, 19 Nov 2016 07:41:23 +0000Answered: DMGT1 - Question 60
http://thegatebook.in/qa/65/dmgt1-question-60?show=1263#a1263
Answer is (B) but it should be mentioned in the question that T(0)=1 but epsilon is not an english letter.<br />
but only T(0) = 1 we can get 76 as answer, following will be recurrence relation:<br />
T(n) = 25T(n-1) + T(n-2)DiscreteMaths-GrandTest1http://thegatebook.in/qa/65/dmgt1-question-60?show=1263#a1263Wed, 16 Nov 2016 16:24:39 +0000Answered: DMGT1 - Question 55
http://thegatebook.in/qa/56/dmgt1-question-55?show=1259#a1259
Answer B option. Number of vertices = number of subsets with 3 elements out of 10 elements = 10C3 = 120.. Now let us calculate degree of each vertex. Assume vertex v1 = {1,2,3}. this vertex will be connected to all the vertex formed from the numbers {4,5,6,7,8,9,10} . So number of vertices formed from these 7 numbers will be = 7C3 = 35. So each edge will have degree of 35. So sum of degree of the graph = 35 * 120 = 4200. As we know sum of degree of graph = 2 * sum of edges of the graph. So number of edges = 4200/2 = 2100.DiscreteMaths-GrandTest1http://thegatebook.in/qa/56/dmgt1-question-55?show=1259#a1259Tue, 15 Nov 2016 15:16:28 +0000Answered: RE for occurrence of 00 precedes by 11
http://thegatebook.in/qa/1250/re-for-occurrence-of-00-precedes-by-11?show=1258#a1258
Option D is the the answer<br />
<br />
(10+0)* will generate all strings that do not contain a pair of 1s, and (1+10)*, the strings that do not contain a pair of 0s. So, the concatenation will generate all strings in which every occurrence of 00 precedes every occurrence of 11.TOChttp://thegatebook.in/qa/1250/re-for-occurrence-of-00-precedes-by-11?show=1258#a1258Tue, 15 Nov 2016 14:54:10 +0000Answered: DMGT1 - Question 39
http://thegatebook.in/qa/20/dmgt1-question-39?show=1257#a1257
I think no option is correct. 50 odd, 50 even.. Even can be made by selecting either both numbers odd OR both numbers even.. Selecting 2 distinct odd from 50 odd = 50C2... Similarly selecting 2 distinct even from 50 even = 50C2. So total ways = 50C2 + 50C2 = 2450DiscreteMaths-GrandTest1http://thegatebook.in/qa/20/dmgt1-question-39?show=1257#a1257Tue, 15 Nov 2016 13:22:38 +0000Answered: DMGT1 - Question 23
http://thegatebook.in/qa/69/dmgt1-question-23?show=1255#a1255
every chain lattice is distributive lattice so even option C is also correct?DiscreteMaths-GrandTest1http://thegatebook.in/qa/69/dmgt1-question-23?show=1255#a1255Tue, 15 Nov 2016 07:59:15 +0000Answered: sir, pls provide a clear explanation to this question (sorting question)
http://thegatebook.in/qa/1252/provide-clear-explanation-this-question-sorting-question?show=1253#a1253
According to the problem <br />
<br />
In the given array first minimum is at most k distance from its position in the sorted array. So first element can be found by finding minimum in 1st k+1 elements. for that we can create heap of that k+1 elements and find min. But why heap creation? the reason is finding 2nd minimum and so on is easy if we order like the heap.<br />
<br />
The only difference between 1st min and 2nd min is 2nd minimum can be any where in first k+2 positions.<br />
<br />
So once we find 1st min we have to insert another element which is k+2 nd element in the array to be sorted.<br />
<br />
Same logic can be extended to sort the whole arrayData Structures Algorithms and C Programminghttp://thegatebook.in/qa/1252/provide-clear-explanation-this-question-sorting-question?show=1253#a1253Tue, 15 Nov 2016 04:57:06 +0000Answered: DSA Grand Test1 Question10
http://thegatebook.in/qa/281/dsa-grand-test1-question10?show=1251#a1251
<p>Let us suppose the unsorted array of 10 element A[10]={0,9,84,4,2, 76,4,1,5,3}</p>
<p>Now, to find the pair of same integer we have to use the <strong>stable sorting</strong> because there is at least 2 integer in the array which are same...so apply <strong><em>quick sort</em></strong> in this we get the results is {0,1,2,3,4,4,5,9,76,84} in <em><strong>(nlogn) time.</strong></em></p>
<p><em><strong>and now search the pair by using condition I.e, if a[I]=a[I+1]; printf(" pair is found "); this statement take only o(n-1)time total time complexity is O(nlogn+n)</strong></em></p>
<p> </p>Data Structures Algorithms and C Programminghttp://thegatebook.in/qa/281/dsa-grand-test1-question10?show=1251#a1251Mon, 14 Nov 2016 16:40:44 +0000Answered: DMGT1 - Question 37
http://thegatebook.in/qa/17/dmgt1-question-37?show=1249#a1249
answer is c??DiscreteMaths-GrandTest1http://thegatebook.in/qa/17/dmgt1-question-37?show=1249#a1249Sat, 12 Nov 2016 16:00:05 +0000Answered: DBMS Grand Test 1 Question11
http://thegatebook.in/qa/622/dbms-grand-test-1-question11?show=1247#a1247
Can anyone explain the answer ? why its C? I think it should be BDBMShttp://thegatebook.in/qa/622/dbms-grand-test-1-question11?show=1247#a1247Sat, 12 Nov 2016 12:03:29 +0000Answered: DBMS Grand Test 1 Question32
http://thegatebook.in/qa/643/dbms-grand-test-1-question32?show=1246#a1246
COnsider where |R1| > |R2|<br />
<br />
R1 = (1,2))(1,3)(1,4) R2=(1) .......................(1)<br />
<br />
<br />
<br />
COnsider where |R1| = |R2|<br />
<br />
R1 = (1,2))(2,3)(3,4) R2=(1)(2)(3) ...................(2)<br />
<br />
<br />
<br />
We cant have |R1| < |R2|<br />
<br />
<br />
<br />
So, all in all, |R1| >= |R2|<br />
<br />
So, D is the answer.DBMShttp://thegatebook.in/qa/643/dbms-grand-test-1-question32?show=1246#a1246Sat, 12 Nov 2016 09:49:45 +0000Answered: TOC Grand Test 1 Question 6
http://thegatebook.in/qa/973/toc-grand-test-1-question-6?show=1244#a1244
ans is (D)<br />
<br />
counter ex ,abbbbaabba is genereted by grammar.TOChttp://thegatebook.in/qa/973/toc-grand-test-1-question-6?show=1244#a1244Fri, 11 Nov 2016 12:28:12 +0000Answered: How to solve this kind of question, if we try to make each and every passes then it may take lots of time
http://thegatebook.in/qa/1240/solve-this-question-make-each-every-passes-then-take-lots-time?show=1243#a1243
if you see the options then one thing you can observe.<br />
<br />
That is about the 3rd position from right to left. Since no option gets 3rd highest number in 3rd position (from right) means 3rd pass hasn't been happened.<br />
So run just 2 passes and eliminate the wrong options.Data Structures Algorithms and C Programminghttp://thegatebook.in/qa/1240/solve-this-question-make-each-every-passes-then-take-lots-time?show=1243#a1243Thu, 10 Nov 2016 15:03:49 +0000Answered: Sir can you cover CO after the currently ongoing subjects
http://thegatebook.in/qa/1228/sir-can-you-cover-co-after-the-currently-ongoing-subjects?show=1233#a1233
I am going to cover CO immdeiately after decidability.Computer Organizationhttp://thegatebook.in/qa/1228/sir-can-you-cover-co-after-the-currently-ongoing-subjects?show=1233#a1233Thu, 10 Nov 2016 09:40:40 +0000Answered: GATE2007-IT_67
http://thegatebook.in/qa/906/gate2007-it_67?show=1230#a1230
Lets consider each statement 1 by 1.<br />
<br />
1) They say A->->B and A->->C, then A->BC<br />
<br />
which means if A->->B and A->->C then A->B and A->C. How both multivalued and single valued depndency be satisfied at the same time? So, wrong.<br />
<br />
2) They say if A->BC then A->->BC. This isnt possible.<br />
<br />
3) This also not true.<br />
<br />
4) This also not true.<br />
<br />
So, I think A is correctDBMShttp://thegatebook.in/qa/906/gate2007-it_67?show=1230#a1230Thu, 10 Nov 2016 06:39:02 +0000Answered: CN Grand Test 1 Question 15
http://thegatebook.in/qa/992/cn-grand-test-1-question-15?show=1225#a1225
4+X+Y(route that goes through A) < 4 + 2 + 2 (This is the other route which does not go through A)<br />
<br />
4+x+y<8 => x+y < 4 (Option C)Computer Networkshttp://thegatebook.in/qa/992/cn-grand-test-1-question-15?show=1225#a1225Wed, 09 Nov 2016 14:18:09 +0000Answered: Network layer
http://thegatebook.in/qa/1212/network-layer?show=1224#a1224
<p>Please do comment if you have any questions<img alt="" src="http://thegatebook.in/qa/?qa=blob&qa_blobid=5044855609287601308" style="height:450px; width:600px"></p>Computer Networkshttp://thegatebook.in/qa/1212/network-layer?show=1224#a1224Tue, 08 Nov 2016 16:32:19 +0000Answered: TOC Grand Test 1 Question 4
http://thegatebook.in/qa/971/toc-grand-test-1-question-4?show=1215#a1215
M---every a is being followed by exactly 2 b's<br />
<br />
So we can have as many as b's in the start then a and 2 bs.Like (b)*abbabb.But here no of a's != 2* no of b's<br />
<br />
N---all a's are followed by double no of a's<br />
<br />
Similarly here also we can have b's in the begining.<br />
<br />
like (b)*a^nb^2n.Here also no of a's != 2*no of b's<br />
<br />
So none of M or N is subset of L<br />
<br />
Please let me know if I m wrongTOChttp://thegatebook.in/qa/971/toc-grand-test-1-question-4?show=1215#a1215Mon, 07 Nov 2016 12:09:38 +0000Answered: CN Grand Test 1 Question 7
http://thegatebook.in/qa/984/cn-grand-test-1-question-7?show=1211#a1211
IPv6 allows data fragmentation at source only based on MTU path discovery method.So (A) false<br />
<br />
IPv6 does not have header checksum for Datagram its true<br />
<br />
Ans BComputer Networkshttp://thegatebook.in/qa/984/cn-grand-test-1-question-7?show=1211#a1211Mon, 07 Nov 2016 05:36:55 +0000Answered: TOC Grand Test 1 Question 21
http://thegatebook.in/qa/956/toc-grand-test-1-question-21?show=1205#a1205
S2 is same as the state reachability problem which is undecidable. So S2 is undecidable.<br />
<br />
Why is S1 undecidable?TOChttp://thegatebook.in/qa/956/toc-grand-test-1-question-21?show=1205#a1205Sat, 05 Nov 2016 18:07:23 +0000Answered: TOC Grand Test 1 Question 17
http://thegatebook.in/qa/952/toc-grand-test-1-question-17?show=1203#a1203
<p>The answer should be both <strong>A and C </strong>I guess. Why <strong>B???</strong></p>TOChttp://thegatebook.in/qa/952/toc-grand-test-1-question-17?show=1203#a1203Sat, 05 Nov 2016 17:55:39 +0000Answered: TOC Grand Test 1 Question 19
http://thegatebook.in/qa/954/toc-grand-test-1-question-19?show=1200#a1200
N is a language in which all a&rsquo;s are followed by double number of b's. <br />
<br />
explain plzz ??TOChttp://thegatebook.in/qa/954/toc-grand-test-1-question-19?show=1200#a1200Sat, 05 Nov 2016 11:21:21 +0000Answered: CN Grand Test 1 Question 10
http://thegatebook.in/qa/987/cn-grand-test-1-question-10?show=1194#a1194
PING uses ICMP packets, and the request/reply does not go above network layers. PING ensures that NL,DLL,PL are working fine, it says nothing about the upper layers. Application layer protocols like TELNET, HTTP test all the layers.Computer Networkshttp://thegatebook.in/qa/987/cn-grand-test-1-question-10?show=1194#a1194Sat, 05 Nov 2016 07:36:39 +0000Answered: CN Grand Test 1 Question 8
http://thegatebook.in/qa/985/cn-grand-test-1-question-8?show=1193#a1193
<p>3isalsofalse ,here is the extract fromwikipedia ; Reassembly is intended to happen in the receiving host but in practice it may be done by an intermediate router, for example, <a rel="nofollow" href="https://en.m.wikipedia.org/wiki/Network_address_translation">network address translation</a> (NAT) <em>may</em> need to re-assemble fragments in order to translate data streams</p>
<p>Link : <a href="https://en.m.wikipedia.org/wiki/IP_fragmentation" rel="nofollow">https://en.m.wikipedia.org/wiki/IP_fragmentation</a></p>
<p> </p>Computer Networkshttp://thegatebook.in/qa/985/cn-grand-test-1-question-8?show=1193#a1193Sat, 05 Nov 2016 07:31:40 +0000