GATE Overflow - Recent questions without answers
http://gateoverflow.in/unanswered
Powered by Question2Answerrosen graph theory
http://gateoverflow.in/134449/rosen-graph-theory
find the values (k tuple coloring )<br />
<br />
1)$X_{2}(K_{3}) 2. X_{3}(K_{5})$Graph Theoryhttp://gateoverflow.in/134449/rosen-graph-theoryFri, 23 Jun 2017 07:48:13 +0000confusion in program counter defiinition
http://gateoverflow.in/134447/confusion-in-program-counter-defiinition
<p>which of the following definition is correct ( current time or next instruction) if possible pls explain with some example</p>
<p>A <strong>program counter</strong> is a register in a computer processor that contains the address (location) of the instruction being executed at the current time</p>
<p> </p>
<p>A program counter (PC) is a CPU register in the computer processor which has the address of the next instruction to be executed from memory</p>
<p> </p>CO & Architecturehttp://gateoverflow.in/134447/confusion-in-program-counter-defiinitionFri, 23 Jun 2017 07:44:55 +0000Relational Algebra
http://gateoverflow.in/134426/relational-algebra
<p>Answer and explanation please .</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=14000965417785202397" style="float:left"></p>Databaseshttp://gateoverflow.in/134426/relational-algebraFri, 23 Jun 2017 05:59:55 +0000CLR 3rd edition , Page no. 49 , second para
http://gateoverflow.in/134396/clr-3rd-edition-page-no-49-second-para
"The running time of insertion sort is not omega(n2) , since there exists an input for which insertion sort runs in theta(n) . It is not contradictory , however , to say that the worst case running time of insertion sort is omega (n2) " .<br />
<br />
Could anyone explain this line ?Algorithmshttp://gateoverflow.in/134396/clr-3rd-edition-page-no-49-second-paraFri, 23 Jun 2017 02:01:36 +0000Tuple relational calculus
http://gateoverflow.in/134387/tuple-relational-calculus
can someone give me a explanation of how any divide query in relational algebra be written using tuple calculus(using implication) .<br />
<br />
thanks in advanceDatabaseshttp://gateoverflow.in/134387/tuple-relational-calculusThu, 22 Jun 2017 21:13:09 +0000Memory management
http://gateoverflow.in/134314/memory-management
If a virtual memory system has 4 pages in real memory and rest must be swapped to disk.which of the following is the hit ratio for the following page address stream? Assume that memory starts empty .use the first in first out(FIFO) algorithm.<br />
(a) 10%<br />
(b) 15%<br />
(C) 25%<br />
(d) 31%Operating Systemhttp://gateoverflow.in/134314/memory-managementThu, 22 Jun 2017 11:24:23 +0000AAI , JE (information technology) INTERVIEW
http://gateoverflow.in/134211/aai-je-information-technology-interview
is there anyone how has ever appeared for AAI JE (IT) interview ?<br />
<br />
please try to share your experience.Othershttp://gateoverflow.in/134211/aai-je-information-technology-interviewWed, 21 Jun 2017 15:12:05 +0000Doubt
http://gateoverflow.in/134206/doubt
CAn we build compiler without "syntax analyser" ?Compiler Designhttp://gateoverflow.in/134206/doubtWed, 21 Jun 2017 15:03:32 +0000P2NETdec2013(46)
http://gateoverflow.in/134143/p2netdec2013-46
Consider a preemptive priority based scheduling algorithm based on dynamically changing priority.<br />
Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue<br />
(but not yet started execution), its priority changes at a rate a = 2. When it starts running, its priority changes<br />
at a rate b = 1. All the processes are assigned priority value 0 when they enter ready queue. Assume that the<br />
following processes want to execute :<br />
Process<br />
ID Arrival Time Service Time<br />
P1 0 4<br />
P2 1 1<br />
P3 2 2<br />
P4 3 1<br />
The time quantum q = 1. When two processes want to join ready queue<br />
simultaneously, the process which has not executed recently is given<br />
priority. The finish time of processes P1, P2, P3 and P4 will respectively<br />
be<br />
<br />
(A) 4, 5, 7 and 8<br />
(B) 8, 2, 7 and 5<br />
(C) 2, 5, 7 and 8<br />
(D) 8, 2, 5 and 7Operating Systemhttp://gateoverflow.in/134143/p2netdec2013-46Wed, 21 Jun 2017 10:06:55 +0000gate 2013
http://gateoverflow.in/134122/gate-2013
<p><strong>1) What is the return value of f(p, p) if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value.</strong></p>
<pre>
int f(int &x, int c) {
c = c - 1;
if (c == 0) return 1;
x = x + 1;
return f(x, c) * x;
} </pre>
<p>(A) 3024
<br>
(B) 6561
<br>
(C) 55440
<br>
(D) 161051</p>Algorithmshttp://gateoverflow.in/134122/gate-2013Wed, 21 Jun 2017 06:48:34 +0000Demand Paging
http://gateoverflow.in/134057/demand-paging
<p>Can anyone pls explain what is the concept applied here</p>
<p><a rel="nofollow" href="http://www.cs.jhu.edu/~yairamir/cs418/os6/sld010.htm">http://www.cs.jhu.edu/~yairamir/cs418/os6/sld010.htm</a></p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=1197201890333319572"></p>Operating Systemhttp://gateoverflow.in/134057/demand-pagingTue, 20 Jun 2017 18:34:38 +0000ts set 2017
http://gateoverflow.in/134055/ts-set-2017
the main memory can store 32K words of 12 bits each. if the direct cache mapping is usedwith a cache capability of 512 words, what is the size of each location of cacheOperating Systemhttp://gateoverflow.in/134055/ts-set-2017Tue, 20 Jun 2017 18:06:49 +0000Comparator
http://gateoverflow.in/134051/comparator
<p><a rel="nofollow" href="#">#</a></p>Digital Logichttp://gateoverflow.in/134051/comparatorTue, 20 Jun 2017 17:32:47 +0000ace practice booklet
http://gateoverflow.in/134034/ace-practice-booklet
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=2659564943564576652"></p>Databaseshttp://gateoverflow.in/134034/ace-practice-bookletTue, 20 Jun 2017 15:18:18 +0000isro recruitment
http://gateoverflow.in/133994/isro-recruitment
I have a score of 157 in isro cs exam scientist.. is there any chance of getting shortlisted for interview?ISROhttp://gateoverflow.in/133994/isro-recruitmentTue, 20 Jun 2017 11:29:09 +0000Diameter of a graph and tree
http://gateoverflow.in/133949/diameter-of-a-graph-and-tree
Why there is a difference between diameter of a graph and tree?<br />
<br />
Diameter of a tree as i have read is the maximum path between two vertices(number of edges between two vertices)<br />
<br />
But for tree it says number of nodes on the longest path.<br />
<br />
But tree is a graph so why cant i find the diameter of tree in similar way?Mathematical Logichttp://gateoverflow.in/133949/diameter-of-a-graph-and-treeTue, 20 Jun 2017 01:43:39 +0000Mtech RA
http://gateoverflow.in/133897/mtech-ra
How to Prepair for Mtech RA interview???<br />
<br />
how it's differ then Mtech TA interview???<br />
<br />
plz share your experience who give RA interview in IITB,IITk &other IIT??GATEhttp://gateoverflow.in/133897/mtech-raMon, 19 Jun 2017 15:05:18 +0000[Discrete Maths] Generating functions
http://gateoverflow.in/133773/discrete-maths-generating-functions
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11849429701953093316"></p>Mathematical Logichttp://gateoverflow.in/133773/discrete-maths-generating-functionsMon, 19 Jun 2017 02:10:59 +0000Normal Forms
http://gateoverflow.in/133648/normal-forms
<p>While converting a grammar to Greibach Normal Form or Chomsky Normal Form, why do we do this - "<strong>If the start symbol S occurs on some right side, create a new start symbol S’ and a new production S’ → S</strong>."</p>Theory of Computationhttp://gateoverflow.in/133648/normal-formsSun, 18 Jun 2017 05:10:17 +0000MadeEasy material
http://gateoverflow.in/133616/madeeasy-material
How storage mapping is done by compilers ?<br />
<br />
Even though actual loading of program in memory is done by loader.<br />
<br />
PS: This is the exact question as given in book, but i think it is memory mapping ?Compiler Designhttp://gateoverflow.in/133616/madeeasy-materialSat, 17 Jun 2017 19:34:44 +0000M.tech placement
http://gateoverflow.in/133601/m-tech-placement
Looking for high paid jobs during my m.tech from iit ropar, what things should i do for getting into highly paid companies?Job Querieshttp://gateoverflow.in/133601/m-tech-placementSat, 17 Jun 2017 17:29:52 +0000Enrolling for OS course in GO classroom
http://gateoverflow.in/133584/enrolling-for-os-course-in-go-classroom
Hi,<br />
<br />
I am newbie here and trying to enroll for the OS course on GO classroom. I enrolled and it shows the course content in four categories titled, "Topic 1", "Topic 2", "Topic 3", and "Topic 4". I click on these, but nothing gets opened after that. Nothing changes on the page. <br />
<br />
Can somebody please help in here.<br />
<br />
ThanksOperating Systemhttp://gateoverflow.in/133584/enrolling-for-os-course-in-go-classroomSat, 17 Jun 2017 15:18:35 +0000What are the vision requirements at IISc,Bangalore?
http://gateoverflow.in/133538/what-are-the-vision-requirements-at-iisc-bangalore
I am provisionally admitted to IISc,Bangalore and require to do a medical checkup before admission.I have a 6/18 vision in both eyes. Will I be rejected?IISc/IITshttp://gateoverflow.in/133538/what-are-the-vision-requirements-at-iisc-bangaloreSat, 17 Jun 2017 08:05:39 +0000GATE for Data Scientists and machine learning engineer
http://gateoverflow.in/133537/gate-for-data-scientists-and-machine-learning-engineer
Hello everyone,<br />
<br />
I want to ask some questions related to data science and GATE.<br />
<br />
First, how to launch career in Data science field? What is role of GATE score in this career?<br />
<br />
Second, Which college/university has good data science / machine learning course? Suggest good college names (Not limited to IITs)<br />
<br />
Third, What is GATE cutoff in this course collge-wise?<br />
<br />
Fourth, core data science companies are visiting IITs/IISc? Means what is placements scenario at various premier colleges? Give idea on package information also.<br />
<br />
Fifth, Should I prepare for GATE and then start data science related work in one of the premier institute? or Should I directly learn data science from online certifications or take PG diploma courses at private universities like "MANIPAL" or any other college ?(Without GATE option) So which way will be having more returns, more practical approach and more value in data science industry? Please guide on this last question specifically and answer all doubts with detailed insights.<br />
<br />
Thanks for reading such post. Please do answer and help someone like me. <br />
<br />
Thanks in advance for your answer.Job Querieshttp://gateoverflow.in/133537/gate-for-data-scientists-and-machine-learning-engineerSat, 17 Jun 2017 08:03:32 +0000[Self doubt] Permutation
http://gateoverflow.in/133489/self-doubt-permutation
Default permutation is with repetition or not?I came across some questions and it was nothing mentioned like repetition and all.But if questions says how many passwords then it was assumed that they are distinct and repetition not allowed and some questions asks like how many licenses number possible where 1 letter followed by 4 digits etc. and in these question it was with repitiion.So how to differentiate between these two?Mathematical Logichttp://gateoverflow.in/133489/self-doubt-permutationSat, 17 Jun 2017 00:10:37 +0000Post Gate
http://gateoverflow.in/133399/post-gate
I am 2016 pass out.I attempted gate that year and got 603 marks.As i didn't get a good enough college i decided to drop and try again.I prepared for gate 2017 due to bad mistakes ends up scoring 633.As i am not going to get iiit's either.What should i do?prepare for gate again or cracking gate is not possible for meOthershttp://gateoverflow.in/133399/post-gateFri, 16 Jun 2017 12:02:20 +0000#trichy ms
http://gateoverflow.in/133373/%23trichy-ms
in 30student i m one of shortlisted candidate in nit trichy ms program due to my gate score is low and people said that they again consider gate score is it true?? and should i go plz help me seniorsOther Collegeshttp://gateoverflow.in/133373/%23trichy-msFri, 16 Jun 2017 10:16:59 +0000can any one solve this. I need help please solve this.
http://gateoverflow.in/133236/can-any-one-solve-this-i-need-help-please-solve-this
Booth's algorithm to find the value of 2 x -2CO & Architecturehttp://gateoverflow.in/133236/can-any-one-solve-this-i-need-help-please-solve-thisThu, 15 Jun 2017 13:41:52 +0000Booth's algorithms to find the value of 2 x -2 ?
http://gateoverflow.in/133232/booths-algorithms-to-find-the-value-of-2-x-2
CO & Architecturehttp://gateoverflow.in/133232/booths-algorithms-to-find-the-value-of-2-x-2Thu, 15 Jun 2017 13:35:59 +0000Programming
http://gateoverflow.in/133150/programming
Struct exam<br />
<br />
{<br />
<br />
int a;<br />
<br />
char *c;<br />
<br />
}<br />
<br />
st[]={4,"choice",5,"battle",6,"minute",8,"bookmark",7,"address"}<br />
<br />
main()<br />
<br />
{<br />
<br />
struct exam *p=st;<br />
<br />
printf("%s",p++->c);<br />
<br />
++p;<br />
<br />
printf("%s",++p->c);<br />
<br />
printf("%d",p[0].a);<br />
<br />
printf("%s",++p++->c);<br />
<br />
printf("%s",++p->c);<br />
<br />
}Programminghttp://gateoverflow.in/133150/programmingThu, 15 Jun 2017 06:21:44 +0000Hashing
http://gateoverflow.in/133144/hashing
Suppose we use hash function h(n) to hash n distinct elements(keys) into an array of length m.what is expected number of colliding pairs of elements,if we use simple uniform hashingDShttp://gateoverflow.in/133144/hashingThu, 15 Jun 2017 05:46:59 +0000pointers
http://gateoverflow.in/133137/pointers
not able to solve complex pointers question what to do , my friend said to join gate overflow , hope i get some good suggestions :(Algorithmshttp://gateoverflow.in/133137/pointersThu, 15 Jun 2017 04:49:45 +0000[Discrete Maths] First Order Logic
http://gateoverflow.in/133130/discrete-maths-first-order-logic
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=9721698226079299898"></p>Mathematical Logichttp://gateoverflow.in/133130/discrete-maths-first-order-logicThu, 15 Jun 2017 04:38:15 +0000Doubt
http://gateoverflow.in/133124/doubt
Number of formal parameters in the declaration of a function agrees with the number of actual parameters in a use of that function is L={a^nb^mc^nd^m∣n≥1,m≥1} ? how?Theory of Computationhttp://gateoverflow.in/133124/doubtThu, 15 Jun 2017 04:11:26 +0000Binary tree
http://gateoverflow.in/133018/binary-tree
A weight balanced tree is a binary tree in which for each node the number of nodes in LST ias at least half and almost twice the number of nodes in RST. Maximum possible height of such a tree on n nodes is best described by <br />
<br />
log n base 2<br />
<br />
log n base 4/3<br />
<br />
log n base 3<br />
<br />
log n base 3/2DShttp://gateoverflow.in/133018/binary-treeWed, 14 Jun 2017 12:32:21 +0000gate-98 question
http://gateoverflow.in/133008/gate-98-question
<p>Which of the following addressing modes permits relocation without any change whatsoever in the code?</p>
<ol>
<li>Indirect addressing</li>
<li>Indexed addressing</li>
<li>Base register addressing</li>
<li>PC relative addressing</li>
</ol>
<p>ans is given as base address and according to me both are 3 and 4 are correct plz tell what u think</p>CO & Architecturehttp://gateoverflow.in/133008/gate-98-questionWed, 14 Jun 2017 10:54:39 +0000gate 1994
http://gateoverflow.in/132983/gate-1994
Function what(x, n:integer): integer:<br />
Var<br />
value : integer<br />
begin<br />
value := 1<br />
if n > 0 then<br />
begin<br />
if n mod 2 =1 then<br />
value := value * x;<br />
value := value * what(x*x, n div 2);<br />
end;<br />
what := value;<br />
end;<br />
<br />
<br />
<br />
<br />
<br />
convert the code in cProgramminghttp://gateoverflow.in/132983/gate-1994Wed, 14 Jun 2017 07:14:51 +0000[Discrete maths ] Group theory
http://gateoverflow.in/132942/discrete-maths-group-theory
<p>Let G be abelian, H and K subgroups of G with orders n, m. Then G has subgroup of order lcm(n,m)</p>
<p>I have gone through prrof here:- <a rel="nofollow" href="https://math.stackexchange.com/questions/465742/let-g-be-abelian-h-and-k-subgroups-of-orders-n-m-then-g-has-subgrou">https://math.stackexchange.com/questions/465742/let-g-be-abelian-h-and-k-subgroups-of-orders-n-m-then-g-has-subgrou</a></p>
<p>But this uses assertion :- if G is abelian and n divides |G| then G has a subgroup of order n.How is this assertion true. there are some existing examples where n divides G but there is no subgroup with that order.Please clear with explanation.</p>
<p> </p>Mathematical Logichttp://gateoverflow.in/132942/discrete-maths-group-theoryTue, 13 Jun 2017 22:18:33 +0000DMA %CPU blocked equation
http://gateoverflow.in/132936/dma-%25cpu-blocked-equation
% CPU blocked or consumed = (x/y) (in case of cycle stealing)<br />
<br />
where x= data preparation time and y= data transfer time..<br />
<br />
I read questions and answers using this formula but i cant understand how this formula is formulated .. how we are calculating the % Cpu is blocked based on this x and y terms , I mean that in cycle stealing CPU is blocked while DMAC setup and during corresponding interrupt...CPU is not blocked during data preparation time ... also during data transfer time (y) CPU may be blocked or may not be ... Also how this percentage is calculated here.... Does it mean that out of ' data transfer time ' , CPU is blocked for a period equal 'data preparation time'?<br />
<br />
Please someone help me with equationCO & Architecturehttp://gateoverflow.in/132936/dma-%25cpu-blocked-equationTue, 13 Jun 2017 18:30:13 +0000Doubt
http://gateoverflow.in/132896/doubt
How<br />
<br />
Arithmetic expressions with matched pairs of parentheses is<br />
X→XbX∣XcX∣dXf∣g ???Theory of Computationhttp://gateoverflow.in/132896/doubtTue, 13 Jun 2017 11:04:50 +0000#ism dhanbad #nit kurukhetra
http://gateoverflow.in/132877/%23ism-dhanbad-%23nit-kurukhetra
Ism dhanbad (CS/IS) or NIT kurukhetra (cyber scerity)<br />
<br />
which one is best in tems of placementNITshttp://gateoverflow.in/132877/%23ism-dhanbad-%23nit-kurukhetraTue, 13 Jun 2017 07:07:52 +0000DSSB_2017
http://gateoverflow.in/132860/dssb_2017
A logical schema is a database <br />
<br />
1. is the entire database <br />
<br />
2.is the standard way of organizing information into accessible parts <br />
<br />
3.describes how data actually store in disk<br />
<br />
4.all of the aboveDatabaseshttp://gateoverflow.in/132860/dssb_2017Tue, 13 Jun 2017 05:06:10 +0000Where can buy phen375?
http://gateoverflow.in/132849/where-can-buy-phen375
Othershttp://gateoverflow.in/132849/where-can-buy-phen375Tue, 13 Jun 2017 03:21:32 +0000DSSB_2017
http://gateoverflow.in/132846/dssb_2017
The group of digits stored at each address in memory is generally referred as ???<br />
<br />
A.memory bit<br />
<br />
B.memory byte<br />
<br />
C.memory word<br />
<br />
D.memory block <br />
<br />
please explain it if you are answerintg.thankuCO & Architecturehttp://gateoverflow.in/132846/dssb_2017Tue, 13 Jun 2017 02:50:29 +0000[Discrete Maths] Hamilton Circuit,Rosen p-584,q47
http://gateoverflow.in/132840/discrete-maths-hamilton-circuit-rosen-p-584-q47
<p>How is the following graph is Hamilton?The answer says it has Hamilton circuit</p>
<p>.<img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=8250483095399749125"> </p>Mathematical Logichttp://gateoverflow.in/132840/discrete-maths-hamilton-circuit-rosen-p-584-q47Tue, 13 Jun 2017 02:12:09 +0000Discrete maths equivalence relation
http://gateoverflow.in/132834/discrete-maths-equivalence-relation
Consider the equivalence relation<br />
namely, R = (x, y) I x - y is an integer}.<br />
<br />
What is the equivalence class of R={ (x,y) | x-y in integer(Z)} equivalence<br />
relation?<br />
<br />
Given answer is :- (n + 1/2 I n E Z)<br />
<br />
My answer is :- (n*1/2 | n E Z)<br />
<br />
<br />
<br />
Is my answer correct also?Mathematical Logichttp://gateoverflow.in/132834/discrete-maths-equivalence-relationMon, 12 Jun 2017 20:41:16 +0000aptitude
http://gateoverflow.in/132802/aptitude
<h3>New public school have a circular layout.the school has teachers specializing in various subjects All classroom of the school are equally spaced apart and located along its perimeter.Each Teacher needs four classes in day.there is strange rule.the first and last class has to be in the same class room.the other two classes have to be at two other distinct class rooms.
<br>
<br>
<br>
<br>
Answer the following
<br>
<br>
a:) Bharti is a history teacher.in addition to above rule of the school she teaches exactly one pair of successive classes in adjacent classrooms.how many distinct trips to classes rooms are possible for Bharti if there are 12 classroom in school.
<br>
<br>
<br>
1;) 120
<br>
2:) 96
<br>
3:) 576
<br>
4:) 496
<br>
<br>
b:) Ram is a Math Teacher.he never teaches two successive classes in adjacent classrooms.how many distinct trip to classroom are possible for ram if there are 9 classroom in the school.
<br>
<br>
1:) 72
<br>
2:) 324
<br>
3:) 30
<br>
4:) 180</h3>Numerical Abilityhttp://gateoverflow.in/132802/aptitudeMon, 12 Jun 2017 16:14:49 +0000graph theory
http://gateoverflow.in/132779/graph-theory
Which of the following is true?<br />
<br />
(A) The size of the maximum Independent set of G is same as the size of the maximum Clique of G’ (complement of G)<br />
(B) The size of the minimum vertex cover of G is same as the size of the Maximum Independent Set of G’ (complement of G)<br />
(C) The size of the minimum vertex cover of G is same as the size of the maximum Clique of G’ (complement of G)<br />
(D) None of the aboveAlgorithmshttp://gateoverflow.in/132779/graph-theoryMon, 12 Jun 2017 14:07:32 +0000Carl Hamacher
http://gateoverflow.in/132736/carl-hamacher
Please someone explain booth's algorithm .CO & Architecturehttp://gateoverflow.in/132736/carl-hamacherMon, 12 Jun 2017 06:53:12 +0000ISI 2017 MMA
http://gateoverflow.in/132734/isi-2017-mma
The area lying in the first quadrant and bounded by the circle<br />
<br />
x^2 + y^2 = 4<br />
<br />
and lines <br />
<br />
x=0 and x=1<br />
<br />
is given by?Numerical Abilityhttp://gateoverflow.in/132734/isi-2017-mmaMon, 12 Jun 2017 06:46:09 +0000