GATE Overflow - Recent questions and answers in Revision
https://gateoverflow.in/qa/others/revision
Powered by Question2AnswerAnswered: Common Careless Mistakes
https://gateoverflow.in/299897/common-careless-mistakes?show=317717#a317717
being aware of the notations used. refer the question to justify what is that notation representing in the question.<br />
<br />
for eg :- |A| could mean determinant of A or it could also mean cardinality of A.Revisionhttps://gateoverflow.in/299897/common-careless-mistakes?show=317717#a317717Sun, 28 Jul 2019 12:18:58 +0000Answered: General Topic Revision Databases: Sql
https://gateoverflow.in/36957/general-topic-revision-databases-sql?show=305663#a305663
<p>Option a is right.</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9080596566368797152"></p>Revisionhttps://gateoverflow.in/36957/general-topic-revision-databases-sql?show=305663#a305663Sat, 09 Mar 2019 11:45:28 +0000What are the Algorithms which are (from all topics) important for GATE ?
https://gateoverflow.in/286459/what-are-the-algorithms-which-are-from-topics-important-gate
It would be great, if the time complexities associated with them are included.Revisionhttps://gateoverflow.in/286459/what-are-the-algorithms-which-are-from-topics-important-gateSun, 30 Dec 2018 05:15:27 +0000GATE exam preparation
https://gateoverflow.in/267263/gate-exam-preparation
what is the good plan for gate 2019 ?<br />
<br />
is this good taking 1 or 2 test every day and evolution properly ?Revisionhttps://gateoverflow.in/267263/gate-exam-preparationMon, 19 Nov 2018 04:36:36 +0000Answered: general
https://gateoverflow.in/260141/general?show=260265#a260265
<p>Why don't you follow a schedule? We have our <a rel="nofollow" href="http://schedule.gatecse.in">schedule</a> going on in <a rel="nofollow" href="http://classroom.gateoverflow.in">GO classroom</a> and OS, COA, Compilers and Calculus are left for the month of November. Once you have a schedule, it'll be easy to have focus. Then it is good to give full length exam even if you havent completed all subjects -- because the final GATE exam will be full length. In GO classroom we just had a full length exam - Mock Test 4 given by Bikram Ballav -- and it showed the aspirants where they stand as of now. After the subjects get over in GO classroom by this month end we will have more tests and discussions -- one wont have any time to even loose focus. </p>Revisionhttps://gateoverflow.in/260141/general?show=260265#a260265Thu, 01 Nov 2018 16:17:56 +0000Answered: GATE 2019 PREPARATION
https://gateoverflow.in/203297/gate-2019-preparation?show=218314#a218314
The best place for doing effective group study is at NATIONAL LIBRARY Kolkata<br />
<br />
Timings are 9am to 8pm<br />
<br />
I regularly visit it<br />
<br />
Interested people can also come<br />
<br />
Many gate aspirants from different branches come here to study<br />
<br />
Interested people WhatsApp me <br />
<br />
9681626935<br />
<br />
Membership is free of cost<br />
<br />
AC reading rooms with pin drop silence and free WiFi<br />
<br />
Laptops are also allowedRevisionhttps://gateoverflow.in/203297/gate-2019-preparation?show=218314#a218314Sun, 27 May 2018 09:33:39 +0000HIGHLY SLOW INITIAL DAYS OF PREPARATION
https://gateoverflow.in/217721/highly-slow-initial-days-of-preparation
I initially started with Sheldon Ross and tried to solve each and every problem in it and It took me 10 days to complete the 1st 2 Chapters. I have already completed solving all the Problems in GO Book. If I continue in this manner, I'm sure it will take another 4 years for me to complete my preparation. So, my question is what exactly is the strategy for practicing problems for GATE? I know most of the concepts. I just lack practice. What exactly is the correct way to increase the pace of preparation?Revisionhttps://gateoverflow.in/217721/highly-slow-initial-days-of-preparationThu, 24 May 2018 00:55:31 +0000Self doubt
https://gateoverflow.in/198291/self-doubt
This may seem trivial<br />
<br />
I'm scoring little less in Made-easy than what I'm scoring in other Test series.<br />
<br />
Is made-easy test closer to actual gate difficulty?Or they are just trying to make it difficult.<br />
<br />
Overall. I want to know so that I'm ready for tough paper too.<br />
<br />
I'd appreciate any experiences or suggestionRevisionhttps://gateoverflow.in/198291/self-doubtMon, 22 Jan 2018 04:50:58 +0000Plz Help
https://gateoverflow.in/197674/plz-help
Hello Friends,<br />
<br />
In past 20 days I have attempted 10-12 full length tests(ACE+******).But my marks are in the range 40-50.<br />
<br />
No matter how much I try, I can't score above 70(thats my aim).What should I do?<br />
<br />
Also I am not getting full marks in aptitude/verbal section.<br />
<br />
Please help.Revisionhttps://gateoverflow.in/197674/plz-helpSat, 20 Jan 2018 14:55:41 +0000Answered: do questions in the original gate exam appear in order or random ?
https://gateoverflow.in/192777/do-questions-in-the-original-gate-exam-appear-in-order-random?show=192779#a192779
<p>we can 1st start with maths or with technical part first , check this <a rel="nofollow" href="https://www.youtube.com/watch?v=O9eurclxNqg">https://www.youtube.com/watch?v=O9eurclxNqg</a></p>Revisionhttps://gateoverflow.in/192777/do-questions-in-the-original-gate-exam-appear-in-order-random?show=192779#a192779Wed, 10 Jan 2018 12:53:00 +0000I am getting a low score mocks even after preparing for 6 months
https://gateoverflow.in/189878/i-am-getting-low-score-mocks-even-after-preparing-for-months
I am getting low score in Made Easy test. I have taken five tests, did analysis but still my score is not improving.<br />
I am a dropper and due to that I feel more pressure by seeing my marks, please suggest a way how should I revise.Revisionhttps://gateoverflow.in/189878/i-am-getting-low-score-mocks-even-after-preparing-for-monthsThu, 04 Jan 2018 23:04:57 +0000Strategy
https://gateoverflow.in/182780/strategy
I have just completed with my CS syllabus. I have just gone through some maths videos earlier but what should I do to score atleast 10/15 in maths.Now what should be the strategy for the month of Jan? Is the test series imp if all prev year Gate que are covered?Revisionhttps://gateoverflow.in/182780/strategyTue, 19 Dec 2017 04:21:56 +0000Answered: DISCRETE
https://gateoverflow.in/154039/discrete?show=178047#a178047
<p>Let G=(V,E)G=(V,E) be a graph, let M⊆E(G)M⊆E(G) be a maximum matching of the graph GG, and let C⊆V(G)C⊆V(G) be the minimum vertex cover of GG. Since edges in MM are disjoint in the sense that no two share an endpoint, each vertex in v∈Cv∈C covers at most one edge in MM. Thus |C|≥|M||C|≥|M|.
<br>
<br>
<a rel="nofollow" href="https://math.stackexchange.com/questions/507605/the-size-of-the-maximum-matching-is-bounded-by-the-size-of-the-minimum-vertex-co">https://math.stackexchange.com/questions/507605/the-size-of-the-maximum-matching-is-bounded-by-the-size-of-the-minimum-vertex-co</a></p>Revisionhttps://gateoverflow.in/154039/discrete?show=178047#a178047Wed, 06 Dec 2017 14:18:29 +0000gate 2018
https://gateoverflow.in/171762/gate-2018
i completed 6 subject till now . (ds &c , daa,toc,cd,os,rdbms ) and 5 subject are remaining (co, dcld ,cn ,discrete mathematics)but till now i am not doing privous year gate question of these subject .. <br />
<br />
<br />
<br />
what will be the right dicision for me . doing remaing subject first or doing privous year gate question<br />
<br />
<br />
<br />
i am confused what to do .<br />
<br />
<br />
<br />
** can you please suggest me . some important topic of remaining subject like (co, dcld ,cn ,discrete mathematics ) which are more scoring. gate mostly ask from those topics .Revisionhttps://gateoverflow.in/171762/gate-2018Sat, 18 Nov 2017 19:52:12 +0000general gate preparation doubt.
https://gateoverflow.in/170860/general-gate-preparation-doubt
When should one stop preparing a subject?<br />
<br />
Gate has a huge syllabus. Even in a single subject a lot of topics are there. Obviously one must understand the basics of all topics. But my question is at what point should one be satisfied with a subject preparation and move on to the next subject?..in certain subjects like networking and algorithm no matter how much you prepare you might still find more questions to solve. This question is specially for people who had sat for gate before and secured a good rank.<br />
<br />
<br />
<br />
Thanks.Revisionhttps://gateoverflow.in/170860/general-gate-preparation-doubtThu, 16 Nov 2017 10:05:11 +0000#revision plan for last 3 months
https://gateoverflow.in/170630/%23revision-plan-for-last-3-months
what will be the best plan for revision in last 3 months ??Revisionhttps://gateoverflow.in/170630/%23revision-plan-for-last-3-monthsWed, 15 Nov 2017 19:09:34 +0000General
https://gateoverflow.in/170560/general
I just want a proper guide. What's the efficient way to revise a subject. My strategy i try to revise a subject per day as I have studied most of the subjects.<br />
<br />
Problem is I start always from the scratch so it really take lot of time even though I had studied it earlier.<br />
<br />
What is the efficient way to revise and how many daily hours to spend on revision?Revisionhttps://gateoverflow.in/170560/generalWed, 15 Nov 2017 10:02:53 +0000Discrete math and its applications
https://gateoverflow.in/168135/discrete-math-and-its-applications
<p>Hi,</p>
<p>So I'm studying discrete math and I have some questions:</p>
<p>1<strong>.For this question,in the answer we use inexclusive or,why is it wrong to use exclusive or?</strong></p>
<p>p: You can use wireless network in the Airport</p>
<p>q: You pay the daily fees</p>
<p>r: you are subscriber to service</p>
<p>Translate the following sentence into Propositional logic</p>
<p>To use the wireless network in the Airport you must pay the daily fees unless you are subscriber to the service</p>
<p>2.<strong>Help me figure out this question</strong> :translate Actors are not the only people who own an Iphone using propositional logic..</p>
<p>Thanks in advance.</p>Revisionhttps://gateoverflow.in/168135/discrete-math-and-its-applicationsThu, 09 Nov 2017 13:09:38 +0000discrete
https://gateoverflow.in/155684/discrete
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then<br />
<br />
∑(i=1 to m) eG(Ci−S) is<br />
<br />
(1) ≤m<br />
<br />
(2) ≥5m<br />
<br />
(3) ≥3mRevisionhttps://gateoverflow.in/155684/discreteWed, 27 Sep 2017 10:35:41 +0000discrete
https://gateoverflow.in/155682/discrete
Consider the preferences given in this Problem<br />
<br />
Student 1 2 3 4 University 1 2 3 4<br />
<br />
A d a b c a C D B A<br />
<br />
B c b a d b D C A B<br />
<br />
C c b a d c A C B D<br />
<br />
D d a b c d B D A C<br />
<br />
The University - oriented stable matching obtained using Gale-Shapely Algorithm is<br />
<br />
(1) {aD,bc,cA,dB}<br />
<br />
(2) {aC,bD,cA,dB}<br />
<br />
(3) None of the aboveRevisionhttps://gateoverflow.in/155682/discreteWed, 27 Sep 2017 10:32:27 +0000discrete
https://gateoverflow.in/155681/discrete
Student 1 2 3 4 University 1 2 3 4<br />
<br />
A d a b c a C D B A<br />
<br />
B c b a d b D C A B<br />
<br />
C c b a d c A C B D<br />
<br />
D d a b c d B D A C<br />
<br />
The Student - oriented stable matching obtained using Gale - Shapely Algorithm is<br />
<br />
(1) {Aa,Bb,Cc,Dd}<br />
<br />
(2) {Ac,Ba,Cb,Dd}<br />
<br />
(3) {Ac,Bd,Cb,Da}<br />
<br />
(4) None of the aboveRevisionhttps://gateoverflow.in/155681/discreteWed, 27 Sep 2017 10:29:58 +0000discrete
https://gateoverflow.in/155677/discrete
Consider the preferences<br />
<br />
Student 1 2 3 4 University 1 2 3 4<br />
<br />
A d a b c a C D B A<br />
<br />
B c b a d b D C A B<br />
<br />
C c b a d c A C B D<br />
<br />
D d a b c d B D A C<br />
<br />
Is the matching M= {Ab,Ba,Cc,Dd} stable?<br />
<br />
(A) Yes<br />
<br />
(B) NoRevisionhttps://gateoverflow.in/155677/discreteWed, 27 Sep 2017 10:25:43 +0000Answered: DISCRETE
https://gateoverflow.in/154054/discrete?show=154072#a154072
<p><strong>In perfect matching, every vertex is present exactly once. </strong>In the image below, as every vertex is present exactly once. It has a perfect matching.</p>
<p><strong><img alt="" height="400" src="https://gateoverflow.in/?qa=blob&qa_blobid=15586967192532082093" width="700"></strong></p>Revisionhttps://gateoverflow.in/154054/discrete?show=154072#a154072Thu, 21 Sep 2017 15:20:10 +0000Answered: Discrete
https://gateoverflow.in/154042/discrete?show=154070#a154070
<p><strong>In matching a vertex can be present at most once.</strong></p>
<p style="text-align:center"><img alt="" height="500" src="https://gateoverflow.in/?qa=blob&qa_blobid=7397965952119241274" width="250"></p>
<p>Among the vertex 1, 2, 3, 4, 5. We are going to miss the one vertex either it is 1, 3 or 5. In the image 3 is absent in matching.</p>
<p>Now, we are left with 5 more vertices, With 5 vertices we can't have 3 pairs of different vertices. We can only have 2 pairs of different vertices.</p>
<p><strong>Ans: $\left | M \right |$ = 4</strong></p>Revisionhttps://gateoverflow.in/154042/discrete?show=154070#a154070Thu, 21 Sep 2017 15:02:43 +0000DISCRETE
https://gateoverflow.in/154056/discrete
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then eG(Ci,S) is<br />
<br />
(A) Even<br />
<br />
(B) Odd<br />
<br />
(C) Cannot sayRevisionhttps://gateoverflow.in/154056/discreteThu, 21 Sep 2017 13:08:30 +0000DISCRETE
https://gateoverflow.in/154055/discrete
<p>Determine whether the graph below has a perfect matching:</p>
<p><img alt="" src="https://onlinecourses.nptel.ac.in/noc17_ma19/assets/img/Week5-g2.jpg"></p>
<p>(A) Yes</p>
<p>(B) No</p>Revisionhttps://gateoverflow.in/154055/discreteThu, 21 Sep 2017 13:06:59 +0000Discrete
https://gateoverflow.in/154043/discrete
<p>What is the size of minimum vertex cover for the graph G</p>
<p><img alt="" src="https://onlinecourses.nptel.ac.in/noc17_ma19/assets/img/Week4-q2.jpg"></p>Revisionhttps://gateoverflow.in/154043/discreteThu, 21 Sep 2017 12:17:16 +0000DISCRETE
https://gateoverflow.in/154041/discrete
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is<br />
<br />
(A) k<br />
<br />
(B) n−k<br />
<br />
(C) (n−1)/2Revisionhttps://gateoverflow.in/154041/discreteThu, 21 Sep 2017 12:13:05 +0000Answered: discrete
https://gateoverflow.in/154031/discrete?show=154037#a154037
<p>First of all we should know the terms "maximal matching" and "vertex cover"..</p>
<blockquote>
<p><em><strong>Maximal matching : </strong></em> It is the maximal set of edges possible such that no two edges of this set intersect at any vertex..</p>
<p><em><strong>Vertex Cover : It</strong></em> is a set of <strong>vertices</strong> such that each edge of the graph is incident to at least one <strong>vertex</strong> of the set. In other words all edges should be covered by this set of vertices..</p>
</blockquote>
<p>So consider a pentagon as graph in our example..</p>
<p>So for maximal matching we can have maximum of two edges as non intersecting...Now if we consider one endpoints of each edge , then we have two such vertices..</p>
<p>Now each of these vertices can cover only two edges and hence we can cover only 4 edges in total..Hence one edge will not be able to be covered using the given two vertices..Hence these two vertices wont constitute a vertex cover..</p>
<p><em><strong>Hence the given assertion is false ..</strong></em></p>
Revisionhttps://gateoverflow.in/154031/discrete?show=154037#a154037Thu, 21 Sep 2017 12:07:19 +0000DISCRETE
https://gateoverflow.in/154033/discrete
In a class of 4 students, four committees are formed ( see the table below). Is it possible to choose a president for each committee so that no student is a president of more than one committee?<br />
<br />
Committee Members<br />
<br />
C1 Amit, Bimal, Dipak<br />
<br />
C2 Bimal, Dipak<br />
<br />
C3 Bimal, Chandan<br />
<br />
C4 Amit, Bimal, Chandan <br />
<br />
Yes<br />
<br />
NoRevisionhttps://gateoverflow.in/154033/discreteThu, 21 Sep 2017 11:53:40 +0000discrete mathematics
https://gateoverflow.in/152228/discrete-mathematics
Let T be an n - vertex tree having one vertex of degree i for i=2,3,…,k and the remaining n−k+1 vertices are of degree 1 each. Determine n in terms of k.Revisionhttps://gateoverflow.in/152228/discrete-mathematicsThu, 14 Sep 2017 12:00:37 +0000Answered: Gate 2018 schedule
https://gateoverflow.in/134336/gate-2018-schedule?show=134536#a134536
<a href="https://gateoverflow.in/blog/1871/schedule-for-gate-cse-18" rel="nofollow" target="_blank">https://gateoverflow.in/blog/1871/schedule-for-gate-cse-18</a><br />
<br />
this oneRevisionhttps://gateoverflow.in/134336/gate-2018-schedule?show=134536#a134536Fri, 23 Jun 2017 13:50:35 +0000General
https://gateoverflow.in/112506/general
What is the best way to revise in these last days?(Mocks, Previous Year or Study Material)<br />
<br />
Coz I have heard that mocks do not help that muchRevisionhttps://gateoverflow.in/112506/generalSat, 28 Jan 2017 13:37:26 +0000Answered: Which approach is better and preferred ?1) Top-Down 2) Bottom Up 3) Hybrid
https://gateoverflow.in/89013/which-approach-better-and-preferred-top-down-bottom-hybrid?show=89142#a89142
I shall take a more general approach. Let's consider there's a cake. Yeah!!!. So when d whole big cake is cut into smaller pieces and until the extent d smaller pieces can be cut shud account for Top- Down Design or a modular approach. Hierarchial Approach cud be considered in this category. <br />
<br />
Let's say dat u want to put all d pieces together and then want dat cake back. Dat ain't practically possible. Isn't it? But for example sake consider it. This shall be the Bottom-Up Approach. Classes r a fine example of dis approach.<br />
<br />
And yes certainly when we mix these two approaches then it becomes a hybrid one. <br />
<br />
According to me it depends on d nature of the problem and not d approach. <br />
<br />
I hope this helps u!!. :)Revisionhttps://gateoverflow.in/89013/which-approach-better-and-preferred-top-down-bottom-hybrid?show=89142#a89142Sat, 03 Dec 2016 17:33:46 +0000Software Engineering
https://gateoverflow.in/81542/software-engineering
<p>Consider a program :</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1081726491006295619"></p>Revisionhttps://gateoverflow.in/81542/software-engineeringSat, 12 Nov 2016 12:31:09 +0000Answered: What is difference among :
https://gateoverflow.in/81534/what-is-difference-among?show=81538#a81538
Reverse Engineering is trying to re-create the source code from the compiled code. That is how a piece of s/w works given only d final system. Re-Engineering on d other hand is creating a new piece of s/w with similar functionality as an exisitng one. But you may be improving it the way it is built. <br />
<br />
Reverse Engineering means we know the output and we start from the end point and generate the need base code/stuff. For example, when we are working on any software development, and we know how different entities would interact with each other, and what are all intermediate things involved, then we can generate the needed classes and other stuff. If you are aware of UML diagrams, then once we have a diagram in place, we can generate the classes and methods from this diagram. there are different tools available to achieve this. This is called reverse engineering. we are starting from the output state and going back to input state.<br />
Re-engineering is totally different from this. when we are implementing something that has already been implemented, and also with the same desired output. we call it re-engineering. It can have two aspects. one is re-inventing the wheel, while other one is to reimplement something with desired output but to achieve something extra in between that can help us to hook something. If we are reimplementing the concatenation logic of string, then we are re-inventing the wheel since it is already implemented in java APIs. If are reimplementing the concatenation logic in order to provide hook points in between so that we can leverage something extra, we call it true re-engineering.<br />
<br />
Hope it helps u. :)Revisionhttps://gateoverflow.in/81534/what-is-difference-among?show=81538#a81538Sat, 12 Nov 2016 12:08:44 +0000Answered: #Gate2017
https://gateoverflow.in/77184/%23gate2017?show=77185#a77185
<p>It is more than enough</p>
<p><a rel="nofollow" href="https://youtu.be/C0UtIGUYS7U?list=PLEbnTDJUr_IdcuTS8hvOqnvh-nDSoJbRT">https://youtu.be/C0UtIGUYS7U?list=PLEbnTDJUr_IdcuTS8hvOqnvh-nDSoJbRT</a></p>
<div class="videodetector">
<input class="remove-videodetector" type="button" value="Remove video"></div>
Revisionhttps://gateoverflow.in/77184/%23gate2017?show=77185#a77185Thu, 27 Oct 2016 13:25:42 +0000Answered: Self - doubt | How to avoid committing mistakes in the paper?
https://gateoverflow.in/75930/self-doubt-how-to-avoid-committing-mistakes-in-the-paper?show=75946#a75946
<p>Same here also.I am going to share my experiences about the types of mistakes which I committed and their possible solutions in context of GATE 2016 wherever I can cite examples which I attempted and secured 332 rank due to some silly mistakes :</p>
<p><em><strong>Mistake type 1:</strong></em></p>
<p><em><strong>Misreading the question : </strong></em>Sometimes due to lack of concentration , what we do we misinterpret the question.The gate paper setters are very intelligent and they intentionally give such options such that the option corrresponding to misinterpretation will be there.As a result what happens we get wrong there.I used to do a lot of mistakes like that.</p>
<p>As an example , in a question it may say that "identify a false statement" .We do not read the entire question and understand that we have to pick the correct one thus leading to wrong result.</p>
<p><em><strong>Mistake type 2 :</strong></em></p>
<p><em><strong>Having the default mindset regarding a question : </strong></em>Sometimes what happens that we have a default mindset regarding a concept or a fact being used in the question.This default or trivial mindset often leads to error.As an example , in DBMS in normalisation , we may be asked weakest normal form of a table given the FDs of a relation.What is generally in our mind is that we have to choose the strongest i.e. the most appropriate and highest normal form which the FD set satisfies.But in question we are asked about the weakest so people may commit mistakes here.In fact this question came this year in gate,the link being:</p>
<p><a rel="nofollow" href="https://gateoverflow.in/39646/gate-2016-1-23">https://gateoverflow.in/39646/gate-2016-1-23</a></p>
<p>Similarly we know about Dining Philosopher's Problem solution which is deadlock free and satisfies the criteria for proper synchronisation construct.But in exam just for name's sake it may be used but code used may suffer from problem .So we have to examine the code properly.</p>
<p><em><strong>Mistake type 3</strong></em></p>
<p><strong><em>Like question solved earlier :</em></strong> </p>
<p>When we have similar or exact question which have solved earlier somewhere , beware of this.U have to think it as a new question and solve it properly.Some people gets overjoyed and hence commit mistakes.I did the same type of mistake on finding no of topological sort this year,</p>
<p>In all of the above scenarios , we should do the following :</p>
<p>a) We should read the whole question properly at least once , then ask to oneself what facts are given.Jot them in a piece of paper especially for numerical type questions.Else what happens is repeatedly we have to switch between paper and screen and hence time is also wasted and also one is not able to concentrate on the question.So all the important data should be mentioned like to calculate throughput in CN we have to note down distance between stations , data size etc.</p>
<p>b) Then we should solve the question systematically following procedure in a proper way</p>
<p>c) Following answering we should verify and recheck it at least once is it the thing that is asked for.</p>
<p>d) Option elimination also plays an important role in some cases.Make the best use of that as it saves time.</p>
<p>Now coming to the ambiguous issue :</p>
<p>First of all there are 2 types of questions :</p>
<p><em><strong>a) Conceptual and theoretical :</strong></em></p>
<p>For this clear hold on subject is required so that u can decide whether the question is ambiguous or not within a short span of time.</p>
<p><em><strong>b) Numerical :</strong></em></p>
<p>Here actually there is hardly anything we can do.We have to solve after all.If after solving we find that no option is matching or more than 2 options are correct.Then we cannot do anything.Actually it rarely happens in gate , but if at all it happens , then normally marks are given to all for that.So no need to worry about that.</p>
<p>Sometimes from the question solving point of view <em><strong>setting counter example</strong></em> also helps.For example in problems where are we are given some statements about MST or Graph Traversals etc.There if we are able to set counter examples , it is very helpful.</p>
<p>Hope the points mentioned by me will prove to be helpful for you as well as all other GATE 2017 aspirants.Thank you..</p>Revisionhttps://gateoverflow.in/75930/self-doubt-how-to-avoid-committing-mistakes-in-the-paper?show=75946#a75946Sat, 22 Oct 2016 15:04:09 +0000Answered: How do you compare associativity (in cache) to chaining in hash table?
https://gateoverflow.in/35187/how-do-you-compare-associativity-cache-chaining-hash-table?show=41878#a41878
In Associative Cache, all main memory blocks goes to same slot using function K mod N, same thing in chaining. K is main memory block no, N number of Cache Lines. If number of cache lines and number of slots in hash map are same, then there is direct relation ship between them.Revisionhttps://gateoverflow.in/35187/how-do-you-compare-associativity-cache-chaining-hash-table?show=41878#a41878Sat, 26 Mar 2016 20:58:37 +0000Answered: LRU policy
https://gateoverflow.in/35188/lru-policy?show=35211#a35211
No need for replacement initially as they are already empty. we see replacement when the memory is full. And the second one i think both are of same cost in implementation. just a guess.Revisionhttps://gateoverflow.in/35188/lru-policy?show=35211#a35211Mon, 11 Jan 2016 13:39:42 +0000