GATE Overflow - Recent activity
http://gateoverflow.in/activity
Powered by Question2AnswerCommented: GATE2017-1-49
http://gateoverflow.in/118332/gate2017-1-49?show=122866#c122866
that I understood<br />
<br />
I mean<br />
<br />
u r telling in address 2000- one instruction started<br />
<br />
in 2004-same instruction, 2008-same instruction,2012-same instruction.<br />
<br />
then in 2016 next instruction.<br />
<br />
<br />
<br />
but why it is not correct 2000-is one instruction and in 2004-next instruction?<br />
<br />
as it is given address 2000 contain instruction i and address 2004 contain instruction i+1<br />
<br />
So, should 2004 not contain next instruction?CO & Architecturehttp://gateoverflow.in/118332/gate2017-1-49?show=122866#c122866Wed, 29 Mar 2017 09:04:07 +0000Answered: What is the highest power of 18 contained
http://gateoverflow.in/122544/what-is-the-highest-power-of-18-contained?show=122865#a122865
<p>We can rewrite it as 50!/(25!*25!)</p>
<p>18= 3*3*2</p>
<p>So we must find number of 2's and 3's in 50! & 25!</p>
<p>2's in 50!</p>
<p>$\frac{50}{2}+\frac{50}{4}+\frac{50}{8}+\frac{50}{16}+\frac{50}{32}$</p>
<p>25+12+6+3+1=47</p>
<p>3's in 50!</p>
<p>$\frac{50}{3}+\frac{50}{9}+\frac{50}{27}$</p>
<p>16+5+1= 22</p>
<p>Similarly we find no of 2's and 3's in 25! which is 22 & 10 respectively</p>
<p>50!/25!*25! no of 2's= 47-44=3 no of 3's=22-20=3</p>
<p>so only 18<sup>1</sup> is possible </p>
<p>Hence highest power is 1</p>Combinatoryhttp://gateoverflow.in/122544/what-is-the-highest-power-of-18-contained?show=122865#a122865Wed, 29 Mar 2017 09:00:44 +0000Commented: Suppose a 6 digit number N is formed by rearranging the digits of the number 123456
http://gateoverflow.in/122634/suppose-digit-number-formed-rearranging-digits-number-123456?show=122864#c122864
Indian Statistical Institute.Combinatoryhttp://gateoverflow.in/122634/suppose-digit-number-formed-rearranging-digits-number-123456?show=122864#c122864Wed, 29 Mar 2017 08:41:46 +0000Commented: GATE2006-62, ISRO2016-50
http://gateoverflow.in/1840/gate2006-62-isro2016-50?show=122863#c122863
yes block size in TLB just correspond to one entry, so 128 entries corresponds to 128 blocks and 32 sets.Operating Systemhttp://gateoverflow.in/1840/gate2006-62-isro2016-50?show=122863#c122863Wed, 29 Mar 2017 08:41:33 +0000Recategorized: coal india MT
http://gateoverflow.in/122852/coal-india-mt?show=122852#q122852
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=11248747046428085004"></p>
<p>Which is the correct option?</p>Databaseshttp://gateoverflow.in/122852/coal-india-mt?show=122852#q122852Wed, 29 Mar 2017 08:33:20 +0000Recategorized: coal india
http://gateoverflow.in/122855/coal-india?show=122855#q122855
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=17685637516549570943"></p>Computer Networkshttp://gateoverflow.in/122855/coal-india?show=122855#q122855Wed, 29 Mar 2017 08:32:47 +0000Recategorized: coal india
http://gateoverflow.in/122856/coal-india?show=122856#q122856
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=18018095560764173923"></p>Databaseshttp://gateoverflow.in/122856/coal-india?show=122856#q122856Wed, 29 Mar 2017 08:32:22 +0000Recategorized: coal india
http://gateoverflow.in/122857/coal-india?show=122857#q122857
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=6363863656148239998"></p>
<p>which option is correct?</p>Operating Systemhttp://gateoverflow.in/122857/coal-india?show=122857#q122857Wed, 29 Mar 2017 08:31:40 +0000Recategorized: coal india
http://gateoverflow.in/122858/coal-india?show=122858#q122858
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=9117043579076089353"></p>
<p>which is correct option? does answer depends on the definition of levels?</p>DShttp://gateoverflow.in/122858/coal-india?show=122858#q122858Wed, 29 Mar 2017 08:31:14 +0000Recategorized: coal india
http://gateoverflow.in/122861/coal-india?show=122861#q122861
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=789775695514605765"></p>
<p>I know 2 cnf satifiability problem is not NPC 3 CNF is. Which of the above option will be correct?</p>Algorithmshttp://gateoverflow.in/122861/coal-india?show=122861#q122861Wed, 29 Mar 2017 08:30:31 +0000Recategorized: coal india
http://gateoverflow.in/122860/coal-india?show=122860#q122860
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=2735984565184721305"></p>
<p>which is correct?</p>Algorithmshttp://gateoverflow.in/122860/coal-india?show=122860#q122860Wed, 29 Mar 2017 08:29:55 +0000Recategorized: coal india
http://gateoverflow.in/122862/coal-india?show=122862#q122862
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=319535490541116451"></p>
<p>which option is correct?</p>Digital Logichttp://gateoverflow.in/122862/coal-india?show=122862#q122862Wed, 29 Mar 2017 08:29:19 +0000GATE admissions
http://gateoverflow.in/122859/gate-admissions
which colleges and psus i get?<br />
<br />
GATE AIR 777...score 692....CSE branch...General categoryIISc/IITshttp://gateoverflow.in/122859/gate-admissionsWed, 29 Mar 2017 08:11:56 +0000Commented: #gate2017
http://gateoverflow.in/122745/%23gate2017?show=122854#c122854
dont worry bro...I assure you....you just enjoyIISc/IITshttp://gateoverflow.in/122745/%23gate2017?show=122854#c122854Wed, 29 Mar 2017 07:54:23 +0000IISc Admission
http://gateoverflow.in/122850/iisc-admission
which one is better course programme or research programme for Mtech in IISc ?Written Examhttp://gateoverflow.in/122850/iisc-admissionWed, 29 Mar 2017 07:19:59 +0000Commented: GATE2015-3_54
http://gateoverflow.in/8563/gate2015-3_54?show=122849#c122849
<p>yes f3 will change the global value, means next time if someone uses global x, the value will be 100. check program here <a rel="nofollow" href="http://ideone.com/L5U3ao">http://ideone.com/L5U3ao</a></p>Programminghttp://gateoverflow.in/8563/gate2015-3_54?show=122849#c122849Wed, 29 Mar 2017 07:16:19 +0000Answered: having confusion in P ,Np ,NP hard and Np completness
http://gateoverflow.in/122641/having-confusion-in-p-np-np-hard-and-np-completness?show=122848#a122848
<h1>P</h1>
<p><em>P is a complexity class that represents the set of all decision problems that can be solved in polynomial time</em>. That is, given an instance of the problem, the answer yes or no can be decided in polynomial time.</p>
<p><strong>Example</strong></p>
<p>Given a graph connected <code>G</code>, can its vertices be colored using two colors so that no edge is monochromatic?</p>
<p>Algorithm: start with an arbitrary vertex, color it red and all of its neighbours blue and continue. Stop when you run out of vertices or you are forced to make an edge have both of its endpoints be the same color.</p>
<hr>
<h1>NP</h1>
<p><em>NP is a complexity class that represents the set of all decision problems for which the instances where the answer is "yes" have proofs that can be verified in polynomial time.</em></p>
<p>This means that if someone gives us an instance of the problem and a certificate (sometimes called a witness) to the answer being yes, we can check that it is correct in polynomial time.</p>
<p><strong>Example</strong></p>
<p><em>Integer factorisation</em> is in NP. This is the problem that given integers <code>n</code> and <code>m</code>, is there an integer <code>f</code> with <code>1 < f < m</code>, such that <code>f</code> divides <code>n</code> (<code>f</code> is a small factor of <code>n</code>)?</p>
<p>This is a decision problem because the answers are yes or no. If someone hands us an instance of the problem (so they hand us integers <code>n</code> and <code>m</code>) and an integer <code>f</code> with <code>1 < f < m</code>, and claim that <code>f</code> is a factor of <code>n</code> (the certificate), we can check the answer in <em>polynomial time</em> by performing the division <code>n / f</code>.</p>
<hr>
<h1>NP-Complete</h1>
<p><em>NP-Complete is a complexity class which represents the set of all problems <code>X</code> in NP for which it is possible to reduce any other NP problem <code>Y</code> to <code>X</code> in polynomial time.</em></p>
<p>Intuitively this means that we can solve <code>Y</code> quickly if we know how to solve <code>X</code> quickly. Precisely, <code>Y</code>is reducible to <code>X</code>, if there is a polynomial time algorithm <code>f</code> to transform instances <code>y</code> of <code>Y</code> to instances <code>x = f(y)</code> of <code>X</code> in polynomial time, with the property that the answer to <code>y</code> is yes, if and only if the answer to <code>f(y)</code> is yes.</p>
<p><strong>Example</strong></p>
<p><code>3-SAT</code>. This is the problem wherein we are given a conjunction (ANDs) of 3-clause disjunctions (ORs), statements of the form</p>
<pre>
<code>(x_v11 OR x_v21 OR x_v31) AND
(x_v12 OR x_v22 OR x_v32) AND
... AND
(x_v1n OR x_v2n OR x_v3n)
</code></pre>
<p>where each <code>x_vij</code> is a boolean variable or the negation of a variable from a finite predefined list <code>(x_1, x_2, ... x_n)</code>.</p>
<p>It can be shown that <em>every NP problem can be reduced to 3-SAT</em>. The proof of this is technical and requires use of the technical definition of NP (<em>based on non-deterministic Turing machines</em>). This is known as <em>Cook's theorem</em>.</p>
<p>What makes NP-complete problems important is that if a deterministic polynomial time algorithm can be found to solve one of them, every NP problem is solvable in polynomial time (one problem to rule them all).</p>
<hr>
<h1>NP-hard</h1>
<p>Intuitively, these are the problems that are <em>at least as hard as the NP-complete problems</em>. Note that NP-hard problems <em>do not have to be in NP</em>, and <em>they do not have to be decision problems</em>.</p>
<p>The precise definition here is that <em>a problem <code>X</code> is NP-hard, if there is an NP-complete problem <code>Y</code>, such that <code>Y</code> is reducible to <code>X</code> in polynomial time</em>.</p>
<p>But since any NP-complete problem can be reduced to any other NP-complete problem in polynomial time, all NP-complete problems can be reduced to any NP-hard problem in polynomial time. Then, if there is a solution to one NP-hard problem in polynomial time, there is a solution to all NP problems in polynomial time.</p>
<p><strong>Example</strong></p>
<p>The <em>halting problem</em> is an NP-hard problem. This is the problem that given a program <code>P</code> and input <code>I</code>, will it halt? This is a decision problem but it is not in NP. It is clear that any NP-complete problem can be reduced to this one. As another example, any NP-complete problem is NP-hard.</p>
<p>My favorite NP-complete problem is the <a rel="nofollow" href="http://web.mat.bham.ac.uk/R.W.Kaye/minesw/ordmsw.htm">Minesweeper problem</a>.</p>
<hr>
<h1>P = NP</h1>
<p>This one is the most famous problem in computer science, and one of the most important outstanding questions in the mathematical sciences. In fact, the <a rel="nofollow" href="http://www.claymath.org/millennium/P_vs_NP/">Clay Institute</a> is offering one million dollars for a solution to the problem (Stephen Cook's <a rel="nofollow" href="http://www.claymath.org/sites/default/files/pvsnp.pdf">writeup</a> on the Clay website is quite good).</p>
<p>It's clear that P is a subset of NP. The open question is whether or not NP problems have deterministic polynomial time solutions. It is largely believed that they do not. Here is an outstanding recent article on the latest (and the importance) of the P = NP problem: <a rel="nofollow" href="http://cacm.acm.org/magazines/2009/9/38904-the-status-of-the-p-versus-np-problem/fulltext">The Status of the P versus NP problem</a>.</p>
<p>The best book on the subject is <a rel="nofollow" href="http://rads.stackoverflow.com/amzn/click/0716710455">Computers and Intractability</a> by Garey and Johnson.</p>Algorithmshttp://gateoverflow.in/122641/having-confusion-in-p-np-np-hard-and-np-completness?show=122848#a122848Wed, 29 Mar 2017 07:08:59 +0000Answered: Which one of the following statements is correct regarding the elements and subsets of the set
http://gateoverflow.in/122631/following-statements-correct-regarding-elements-subsets?show=122846#a122846
<p>Option B is correct as per definition of subset.</p>
<p>Option A could be correct iff 1,2 ϵ {1,2{1,2,3}}</p>
<p>Option C could be correct iff {{1,2,3}} ϵ {1,2,{1,2,3}}</p>
<p>Option C could be correct iff {{3}} ϵ {1,2,{1,2,3}}</p>
<p><a rel="nofollow" href="https://en.wikipedia.org/wiki/Element_(mathematics)">https://en.wikipedia.org/wiki/Element_(mathematics)</a></p>Linear Algebrahttp://gateoverflow.in/122631/following-statements-correct-regarding-elements-subsets?show=122846#a122846Wed, 29 Mar 2017 06:52:43 +0000Answered: Minimum Number of tables for given ER-Diagram
http://gateoverflow.in/25525/minimum-number-of-tables-for-given-er-diagram?show=122845#a122845
I think the answer must be 4.<br />
<br />
For E1,E2,E3 we will defiantly need one table each.<br />
<br />
By putting primary key of E2 i,e G in E1's table we can specify the indentifing relationship R between them. Hence no need of table for R.<br />
<br />
But For P we will need a different table in which we will put primary key of E3 i,e E and Primary key of E1 i,e C as foreign keys and the primary key of the table for P will be the combination of E and C i,e EC<br />
<br />
Hence we need total 4 tables( for E1, E2 ,E3 and for P)Databaseshttp://gateoverflow.in/25525/minimum-number-of-tables-for-given-er-diagram?show=122845#a122845Wed, 29 Mar 2017 06:36:16 +0000Commented: ISRO2014-73
http://gateoverflow.in/17447/isro2014-73?show=122844#c122844
In complete graph total 6 edges but we need only 3 edges((n-1)edges,n is number of vertex) to make a tree, so 6C3 mean take 3 edges out of 6 edges minus 4 case due to make a circle (3 edges connect with 3 vertex) so final answer is 6C3-4=16Combinatoryhttp://gateoverflow.in/17447/isro2014-73?show=122844#c122844Wed, 29 Mar 2017 06:25:22 +0000Answered: JEST.
http://gateoverflow.in/122453/jest?show=122843#a122843
Rank -143 cse part A paper any chance of good collegesOthershttp://gateoverflow.in/122453/jest?show=122843#a122843Wed, 29 Mar 2017 06:01:18 +0000JEST EXAM
http://gateoverflow.in/122842/jest-exam
CSE- Jest exam rank-143 part -1 paper any chance of collegesOthershttp://gateoverflow.in/122842/jest-examWed, 29 Mar 2017 06:00:21 +0000Commented: Solve the Recurrence using any method which can solve it quickly in less steps
http://gateoverflow.in/122691/solve-recurrence-using-method-which-solve-quickly-less-steps?show=122841#c122841
So dear Sir now please tellAlgorithmshttp://gateoverflow.in/122691/solve-recurrence-using-method-which-solve-quickly-less-steps?show=122841#c122841Wed, 29 Mar 2017 05:39:53 +0000Commented: Career advice
http://gateoverflow.in/122825/career-advice?show=122840#c122840
good dude...Mr. rude.Written Examhttp://gateoverflow.in/122825/career-advice?show=122840#c122840Wed, 29 Mar 2017 05:08:48 +0000Commented: GATE2017-1-27
http://gateoverflow.in/118307/gate2017-1-27?show=122839#c122839
<p>@Bikram Sir</p>
<p>What ME says?</p>
<p>" A <strong>mutual exclusion</strong> (mutex) is a program object that prevents simultaneous access to a shared resource "</p>
<p>that doesnot mean lock already acquired.rt?</p>Operating Systemhttp://gateoverflow.in/118307/gate2017-1-27?show=122839#c122839Wed, 29 Mar 2017 04:56:55 +0000Commented: Paging
http://gateoverflow.in/83576/paging?show=122838#c122838
<p><span class="marker"><em><strong>in 2 level paging, how can outermost page table be 16KB whereas page size given is 8KB because outermost page table has to fit inside one page?? can someone resolve this doubt of mine. :(</strong></em></span></p>Operating Systemhttp://gateoverflow.in/83576/paging?show=122838#c122838Wed, 29 Mar 2017 04:52:59 +0000Commented: bsnl jto
http://gateoverflow.in/122773/bsnl-jto?show=122837#c122837
Can you suggest me which circle i have to choose?????Job Querieshttp://gateoverflow.in/122773/bsnl-jto?show=122837#c122837Wed, 29 Mar 2017 04:51:06 +0000Answered: GATE2017-2-27
http://gateoverflow.in/118494/gate2017-2-27?show=122834#a122834
<p>Let us try to simplify (minimize) the expression given in each option</p>
<p><strong>Option - A:</strong> $wx+w(x+y)+x(xy)=x+wy$</p>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">wx + wx + wy + xy
<br>
wx + wy + xy
<br>
wx + xy + wy
<br>
x + wy + wy (Distributive Property)
<br>
x + wy</div>
<p> </p>
<p><strong>Option - B: </strong> $\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + \bar{y}z$</p>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">$\overline{w\bar{x}} + \overline{(y+\bar{z})} + \bar{w}x$</div>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">$\bar{w} + x + \bar{y}z + \bar{w}x$</div>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">$\bar{w} + \bar{w}x + x + \bar{y}z$</div>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">$\bar{w} + x + \bar{y}z$</div>
<p> </p>
<p><strong>Option - D: </strong>$(w+y)(wxy+wyz)=wxy+wyz$</p>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">wxy + wyz + wxy + wyz</div>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">wxy + wyz</div>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;"> </div>
<p> </p>
<p>Option A, B, D are matching fine.</p>
<p>Hence, <strong>Option - C</strong> is the answer</p>Digital Logichttp://gateoverflow.in/118494/gate2017-2-27?show=122834#a122834Wed, 29 Mar 2017 04:33:46 +0000Commented: The number of terms independent of x in the binomial expansion of
http://gateoverflow.in/122635/the-number-of-terms-independent-of-in-the-binomial-expansion?show=122832#c122832
Seems an Incomplete questionCombinatoryhttp://gateoverflow.in/122635/the-number-of-terms-independent-of-in-the-binomial-expansion?show=122832#c122832Wed, 29 Mar 2017 04:27:57 +0000Answer selected: IIT Madras interview - what is the output of the C code?
http://gateoverflow.in/122813/iit-madras-interview-what-is-the-output-of-the-c-code?show=122823#a122823
<p>This program is made for 32 bit platform</p>
<p><strong>The output is used to detect whether the input number is odd or even.</strong></p>
<p>As we all know odd number contains 1 as LSB and even number contains 0 as LSB</p>
<p>eg. n = 5 (binary form 101)</p>
<p> k = 5<<31 //left sift 101 by 31 bit place</p>
<p> in 32 bit platform, integer can hold only 32 bit of information, therefore it will drop 10 and store 1 at MSB place. </p>
<p> (binary form 1000000000000000000000000000000)</p>
<p> therefore k = -2147483648 (in decimal form) which is non zero.</p>
<p> hence evaluated as true when evaluating through bitwise And operation and return output as 1. </p>Programminghttp://gateoverflow.in/122813/iit-madras-interview-what-is-the-output-of-the-c-code?show=122823#a122823Wed, 29 Mar 2017 03:51:13 +0000Answered: Gate Score-680, OBC-NCL, For which college should I go?
http://gateoverflow.in/122770/gate-score-680-obc-ncl-for-which-college-should-i-go?show=122824#a122824
you will definately get old iits................just enjoyIISc/IITshttp://gateoverflow.in/122770/gate-score-680-obc-ncl-for-which-college-should-i-go?show=122824#a122824Wed, 29 Mar 2017 03:39:37 +0000Answered: IISc Admission
http://gateoverflow.in/122736/iisc-admission?show=122822#a122822
100 %......you made it.....just enjoy.Written Examhttp://gateoverflow.in/122736/iisc-admission?show=122822#a122822Wed, 29 Mar 2017 03:37:52 +0000Edited: #gate2017
http://gateoverflow.in/122740/%23gate2017?show=122740#q122740
score 385 sc category ..any chance of iit..?...please suggest.IISc/IITshttp://gateoverflow.in/122740/%23gate2017?show=122740#q122740Wed, 29 Mar 2017 03:27:10 +0000Answer selected: homework nyu
http://gateoverflow.in/75009/homework-nyu?show=75068#a75068
Since the last 8 bits of the virtual address denote the page offset, we can find that page size is $2^{8}$ bytes.<br />
<br />
Total memory is 256KB. So number of pages is $\frac{2^{18}}{2^{8}}=2^{10}=1024$.<br />
<br />
The first 10 bits of virtual address means, we have $2^{10}=1024$ entries in the outer page table. Similarly, next 8 bits in the virtual address help us to find that there are $2^{8}=256$ entries in the second level page table, and next 6 bits in the virtual address shows us that there are $2^{6}=64$ entries in the third level page table.<br />
<br />
Size of a page table entry is 2 bytes for all levels.<br />
<br />
The outer page table points to 1024 entries in the second level page table each of whcih points to 256 entries in the third level page table each containing 64 pages. The process's address space consists of 1024 pages. So we need 16 third level page tables (Here, the third level page table has only 64 entries and we need to point to 1024 pages. That's why!). Thus the page table size can be calculated as:<br />
<br />
$(1024*2)+(256*2)+(16*64*2)=4608$ bytes.Operating Systemhttp://gateoverflow.in/75009/homework-nyu?show=75068#a75068Wed, 29 Mar 2017 03:01:16 +0000Commented: GATE2017-2-12
http://gateoverflow.in/118434/gate2017-2-12?show=122819#c122819
<p>How come Mantissa bits = 110110<strong>110</strong>10000000000000000 ??</p>
<p><strong>Bold part</strong> is not in question. It is 110 110 1</p>Digital Logichttp://gateoverflow.in/118434/gate2017-2-12?show=122819#c122819Wed, 29 Mar 2017 02:58:17 +0000Commented: GATE2017-2-29
http://gateoverflow.in/118371/gate2017-2-29?show=122818#c122818
Arjun Sir, is my answer technically fine or are any assumptions wrong, even though answer is right ?CO & Architecturehttp://gateoverflow.in/118371/gate2017-2-29?show=122818#c122818Wed, 29 Mar 2017 02:30:44 +0000Commented: GATE admission query
http://gateoverflow.in/122805/gate-admission-query?show=122816#c122816
Yes, if you are interested in research then apply there. For MTech IIITs would be good.IISc/IITshttp://gateoverflow.in/122805/gate-admission-query?show=122816#c122816Wed, 29 Mar 2017 02:09:01 +0000Commented: Department Preference
http://gateoverflow.in/122802/department-preference?show=122815#c122815
Sir, whether I select course programme or research programme .which one is better?IISc/IITshttp://gateoverflow.in/122802/department-preference?show=122815#c122815Wed, 29 Mar 2017 01:42:41 +0000Commented: Solve the following Recurrence using any method
http://gateoverflow.in/122698/solve-the-following-recurrence-using-any-method?show=122808#c122808
<p>hey @LavTheRawkstar I thought of the problem using recursion tree and it is coming O(n^n)<img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=10927751618924908885"></p>Algorithmshttp://gateoverflow.in/122698/solve-the-following-recurrence-using-any-method?show=122808#c122808Tue, 28 Mar 2017 18:53:54 +0000Answered: CDS programme
http://gateoverflow.in/122710/cds-programme?show=122803#a122803
<p>Follow this link it will give you a gist (it's for 2016 but valid this year as well): <a rel="nofollow" href="http://cds.iisc.ac.in/wp-content/uploads/CDS-CS-Aug2016.pdf">http://cds.iisc.ac.in/wp-content/uploads/CDS-CS-Aug2016.pdf</a></p>IISc/IITshttp://gateoverflow.in/122710/cds-programme?show=122803#a122803Tue, 28 Mar 2017 17:43:11 +0000Commented: #advice #gate17 #admission
http://gateoverflow.in/122652/%23advice-%23gate17-%23admission?show=122797#c122797
Thank you!!IISc/IITshttp://gateoverflow.in/122652/%23advice-%23gate17-%23admission?show=122797#c122797Tue, 28 Mar 2017 16:32:46 +0000Commented: rosen(sets relation function)
http://gateoverflow.in/122683/rosen-sets-relation-function?show=122791#c122791
i dun know how to solve this equation further as it two different AP.<br />
and i got this simply,sqrt(1)=1<br />
sqrt(2) =1 .41 and hence floor will be 1<br />
sqrt(3) =1.73 and hence floor will be 1<br />
sqrt(4) = 2 and hence floor will be 2<br />
sqrt(5) =2.23 and hence floor will be 2<br />
.<br />
.<br />
.<br />
sqrt(8)=2.82 and hence floor should be 2<br />
similarly solve like thisSet Theory & Algebrahttp://gateoverflow.in/122683/rosen-sets-relation-function?show=122791#c122791Tue, 28 Mar 2017 15:24:04 +0000Commented: Synchronization | Self-Doubt
http://gateoverflow.in/68510/synchronization-self-doubt?show=122786#c122786
oh yeah silly me. Thanx a lot. :)Operating Systemhttp://gateoverflow.in/68510/synchronization-self-doubt?show=122786#c122786Tue, 28 Mar 2017 14:42:51 +0000Comment edited: GATE2006-75
http://gateoverflow.in/43565/gate2006-75?show=122780#c122780
Mux will be required to select particular block to be read however in direct mapped cache only one comparator needed so no need to use mux no need to add mux latencyCO & Architecturehttp://gateoverflow.in/43565/gate2006-75?show=122780#c122780Tue, 28 Mar 2017 14:40:34 +0000Answered: Which circle should I choose for BSNL jto CSE OC AIR-1370 n.marks-50.29?
http://gateoverflow.in/122726/which-circle-should-choose-for-bsnl-jto-cse-oc-air-1370-marks?show=122777#a122777
I think you have remote chances for JTO. because almost all CS OC people >500 will apply, so have some other plans handy. If I were you I would choose a circle which is not very far from my home and more seats/population, and would not even think about metro city.<br />
<br />
All The BestJob Querieshttp://gateoverflow.in/122726/which-circle-should-choose-for-bsnl-jto-cse-oc-air-1370-marks?show=122777#a122777Tue, 28 Mar 2017 13:41:47 +0000Answered: Suppose there are n positive real numbers such that their sum is 20
http://gateoverflow.in/122636/suppose-there-are-positive-real-numbers-such-that-their-sum?show=122774#a122774
If x<1, then (1-x)(1+x)<1<br />
<br />
We will want to keep number as small as possible, but when choose a number less than 1 we have to choose another number much greater than 1 to compensate, ex. for 0.5 we have to choose >2, 0.1 we have choose >10. So for optimal solution we end up choosing 1.<br />
<br />
But all can not be 1, so we end up choosing 18 1s and 1 2.<br />
<br />
It needs more rigorous proof though.Combinatoryhttp://gateoverflow.in/122636/suppose-there-are-positive-real-numbers-such-that-their-sum?show=122774#a122774Tue, 28 Mar 2017 13:29:44 +0000Comment edited: IISC-CSA-Research-Test-9
http://gateoverflow.in/49070/iisc-csa-research-test-9?show=122765#c122765
See when u get a question like this question<br />
<br />
just take as many as value and check.<br />
<br />
No one could check infinite timesNumerical Abilityhttp://gateoverflow.in/49070/iisc-csa-research-test-9?show=122765#c122765Tue, 28 Mar 2017 10:50:38 +0000Answer edited: Is direct admit possible for Mtech at IIT Madras and IIT Kharagpur for AIR 332 (OBC category) ?
http://gateoverflow.in/41549/direct-admit-possible-mtech-iit-madras-kharagpur-category?show=122664#a122664
You will get IISC dude.IISc/IITshttp://gateoverflow.in/41549/direct-admit-possible-mtech-iit-madras-kharagpur-category?show=122664#a122664Tue, 28 Mar 2017 10:39:14 +0000Answered: GATE 2017 CSE, AIR 134, SCORE 836, GENERAL CATEGORY
http://gateoverflow.in/122751/gate-2017-cse-air-134-score-836-general-category?show=122760#a122760
Both IITM and IITKGP are equivalent but I think IITM campus is an absolute beauty.(Bit hot though, but rain helps).<br />
<br />
Also you have to lock seat when you are offered, for iitkgp you have to pay ~30k to lock seat, I don't remember clearly but they give a window in which you can leave that seat and fee will refunded.(But no worries, IITM and KGP don't waste seats because they have spot round).<br />
<br />
You've scored ~70 marks in GATE, if you keep studying I'm sure you can score >45-50 marks in IITK written.<br />
<br />
Good LuckIISc/IITshttp://gateoverflow.in/122751/gate-2017-cse-air-134-score-836-general-category?show=122760#a122760Tue, 28 Mar 2017 09:53:35 +0000Answered: NET -2011[ECE] C program
http://gateoverflow.in/121559/net-2011-ece-c-program?show=122755#a122755
<h3>Since it is a pointer to a structure so first we need to de reference it to refer to the variable date and then we need the dot operator to point to the appropriate member.</h3>
<h3><strong>(*pd)</strong> will point to the appropriate variable... Here they have not initialized the pointer to the address of any variable of type struct date. It should have been</h3>
<h3><strong>struct date d;</strong></h3>
<h3><strong>struct date *pd =&d;</strong></h3>
<h3> </h3>
<h3>Now (*pd) will refer to the variable and<strong> (*pd).year</strong> will refer to the year member.</h3>
<h3>So <strong>A </strong>is correct. <strong>D</strong> is also a simplified notion of first option so D is also coorect.</h3>
<h3>Finally A and D are correct</h3>
<h3> </h3>Programminghttp://gateoverflow.in/121559/net-2011-ece-c-program?show=122755#a122755Tue, 28 Mar 2017 09:40:59 +0000