GATE Overflow - Recent questions tagged 2019
https://gateoverflow.in/tag/2019
Powered by Question2AnswerIIT Madras MS written test 2019 - TOC - 1
https://gateoverflow.in/311167/iit-madras-ms-written-test-2019-toc-1
<p>Let L1 and L2 be 2 languages which are not regular. Which of these is true?</p>
<ol style="list-style-type:upper-roman" type="I">
<li>The union of L1 and L2 is not regular.</li>
<li>The intersection of L1 and L2 is not regular.</li>
</ol>
<ol style="list-style-type:upper-alpha" type="A">
<li>Both I and II are true</li>
<li>I is true, II is false</li>
<li>I is false, II is true</li>
<li>Both I and II are false</li>
</ol>Theory of Computationhttps://gateoverflow.in/311167/iit-madras-ms-written-test-2019-toc-1Thu, 02 May 2019 11:38:37 +0000IIT Madras MS written test 2019 - Algorithms - 1
https://gateoverflow.in/311166/iit-madras-ms-written-test-2019-algorithms-1
<p>Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true?</p>
<ol style="list-style-type:upper-alpha" type="A">
<li>SP is NP-hard, LP is not</li>
<li>LP is NP-hard, SP is not</li>
<li>Both are NP-hard</li>
<li>Neither SP nor LP is NP-hard</li>
</ol>Algorithmshttps://gateoverflow.in/311166/iit-madras-ms-written-test-2019-algorithms-1Thu, 02 May 2019 11:33:54 +0000IIT Madras MS written test 2019 - OS - 1
https://gateoverflow.in/311164/iit-madras-ms-written-test-2019-os-1
<p>A scheduler – such as an OS scheduler – can suffer from the priority inversion problem, in which a lower priority process indirectly pre-empts a higher priority process, and this can happen due to the usage of shared resources and mutual exclusion. Which of the solutions below can be used to deal with the priority inversion problem?</p>
<p>S1. If a process holds a shared resource, then assign it the highest priority.</p>
<p>S2. If a process holds a shared resource, then gradually increase its priority after certain intervals, so that it has the highest priority by the time it exits the CS.</p>
<ol style="list-style-type:upper-alpha" type="A">
<li>S1 alone</li>
<li>S2 alone</li>
<li>Neither S1 nor S2</li>
<li>Either S1 or S2</li>
</ol>Operating Systemhttps://gateoverflow.in/311164/iit-madras-ms-written-test-2019-os-1Thu, 02 May 2019 11:22:49 +0000IIT Madras MS written test 2019 - DBMS
https://gateoverflow.in/311163/iit-madras-ms-written-test-2019-dbms
<p>Which of the following statements about SQL queries is true?</p>
<ol style="list-style-type:upper-roman" type="I">
<li>The GROUP BY clause has nothing to do with Aggregate functions.</li>
<li>The GROUP BY clause can only be used when Aggregate functions are used.</li>
<li>Aggregate functions can only be used when the GROUP BY clause has been used.</li>
<li>The GROUP BY clause can be used even when Aggregate functions are not used.</li>
</ol>Databaseshttps://gateoverflow.in/311163/iit-madras-ms-written-test-2019-dbmsThu, 02 May 2019 11:09:47 +0000IIT Madras MS written test 2019 - C prog.
https://gateoverflow.in/311147/iit-madras-ms-written-test-2019-c-prog
<pre class="prettyprint linenums lang-c_cpp" data-pbcklang="c_cpp" data-pbcktabsize="4">
for(; i != 0; --i)
{
printf("\nIITM");
--i;
}</pre>
<ol style="list-style-type:upper-roman" type="I">
<li>If i is initialized to 100, then IITM will be printed 50 times</li>
<li>If i is initialized to 101, then IITM will be printed 51 times</li>
</ol>
<ol style="list-style-type:upper-alpha" type="A">
<li>Both I and II are true</li>
<li>I is true, II is false</li>
<li>I is false, II is true</li>
<li>Both I and II are false</li>
</ol>Programminghttps://gateoverflow.in/311147/iit-madras-ms-written-test-2019-c-progThu, 02 May 2019 07:21:24 +0000IIT Madras MS written test 2019
https://gateoverflow.in/311146/iit-madras-ms-written-test-2019
<p>Which of the following infinite sets have the same cardinality?
<br>
$\mathbb{N}$ : Set of Natural numbers</p>
<p>$\mathbb{E}$ : Set of Even numbers</p>
<p>$\mathbb{Q}$ : Set of Rational numbers</p>
<p>$\mathbb{R}$ : Set of Real numbers</p>
<p> </p>
<ol style="list-style-type:upper-alpha" type="A">
<li>$\mathbb{N}$ and $\mathbb{E}$</li>
<li>$\mathbb{Q}$ and $\mathbb{R}$</li>
<li>$\mathbb{R}$ and $\mathbb{N}$</li>
<li>None of the above</li>
</ol>Set Theory & Algebrahttps://gateoverflow.in/311146/iit-madras-ms-written-test-2019Thu, 02 May 2019 07:07:29 +0000JEST 2019
https://gateoverflow.in/304323/jest-2019
<p>Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1 </p>
<ol style="list-style-type:upper-alpha" type="A">
<li>For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint</li>
</ol>
<p>couldn't remember rest of the options.</p>
<p> </p>Set Theory & Algebrahttps://gateoverflow.in/304323/jest-2019Sun, 17 Feb 2019 13:21:48 +0000JEST 2019
https://gateoverflow.in/304320/jest-2019
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0 <br />
<br />
What is the time complexity?Algorithmshttps://gateoverflow.in/304320/jest-2019Sun, 17 Feb 2019 12:59:32 +0000JEST 2019 Descriptive Q4 (8 Marks)
https://gateoverflow.in/304306/jest-2019-descriptive-q4-8-marks
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)]<br />
<br />
(Memory based – Original question had a lot of added details)Algorithmshttps://gateoverflow.in/304306/jest-2019-descriptive-q4-8-marksSun, 17 Feb 2019 09:56:46 +0000JEST 2019 Descriptive Q2 (8 Marks)
https://gateoverflow.in/304302/jest-2019-descriptive-q2-8-marks
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.Graph Theoryhttps://gateoverflow.in/304302/jest-2019-descriptive-q2-8-marksSun, 17 Feb 2019 09:42:20 +0000JEST 2019 Descriptive Q1 (8 Marks)
https://gateoverflow.in/304294/jest-2019-descriptive-q1-8-marks
Suppose that G contains a cycle C, and a path of length at least k between some two<br />
vertices of C. Show that G contains a cycle of length at least √k.Graph Theoryhttps://gateoverflow.in/304294/jest-2019-descriptive-q1-8-marksSun, 17 Feb 2019 08:53:25 +0000