GATE Overflow for GATE CSE - Recent questions
https://gateoverflow.in/questions
Powered by Question2AnswerOS Self doubt Memory management
https://gateoverflow.in/389442/os-self-doubt-memory-management
Suppose that a machine has 42-bit virtual addresses and 32-bit physical addresses.<br />
<br />
{a} How much RAM can the machine support (each byte of RAM must be addressable)?<br />
<br />
{b} What is the largest virtual address space that can be supported for a process?<br />
<br />
{c} If pages are 2 KB, how many entries must be in a single-level page table?<br />
<br />
{d} If pages are 2 KB and we have a two-level page table where the first level is indexed by 15- bits, then how many entries does the first-level page table have?<br />
<br />
{e} With the same setup as part {d}, how many entries are in each second-level page table?<br />
<br />
{f} What is the advantage of using a two-level page table over single-level page table?Operating Systemhttps://gateoverflow.in/389442/os-self-doubt-memory-managementSat, 26 Nov 2022 22:17:26 +0000Autometa | PDA
https://gateoverflow.in/389429/autometa-pda
<p>Consider the following Language:</p>
<p>L= $a^{n}b^{n}c^{n}$ | $n \geq 0$</p>
<p>Consider the following Statement:</p>
<ul>
<li>A PDA can accept the given language. As we can insert 2 a’s for every entry of a, and pop one ‘a’ for every b and after all b’s, pop one ‘a’ for every entry of ‘c’</li>
</ul>
<p><br>
So the above language is a CFL.<br>
<br>
Prove the above statement WRONG</p>Theory of Computationhttps://gateoverflow.in/389429/autometa-pdaSat, 26 Nov 2022 15:39:19 +0000Provided by teacher, topic -arguments
https://gateoverflow.in/389396/provided-by-teacher-topic-arguments
Show that: (r → ~ q, r ∪ S, S → ~ q, p → q) ↔ ~ p<br />
<br />
are inconsistent.Mathematical Logichttps://gateoverflow.in/389396/provided-by-teacher-topic-argumentsSat, 26 Nov 2022 13:38:07 +0000Which one is right ? what will be the right answer assigning 0 to the left edges or right?
https://gateoverflow.in/389406/which-right-what-will-right-answer-assigning-left-edges-right
<p><img alt="" height="366" src="https://gateoverflow.in/?qa=blob&qa_blobid=2120370836692912521" width="351"></p>
<p><img alt="" height="320" src="https://gateoverflow.in/?qa=blob&qa_blobid=18091793764613243777" width="428"></p>Algorithmshttps://gateoverflow.in/389406/which-right-what-will-right-answer-assigning-left-edges-rightSat, 26 Nov 2022 07:39:12 +0000Operating System | Round Robin | Preemption & Context Switch
https://gateoverflow.in/389389/operating-system-round-robin-preemption-%26-context-switch
<p>Suppose only a process P1 is executing, using Round Robin scheduling. After the time slice expires, the same process comes back into execution. This could be considered as: (Time Slice of RR is smaller than burst of P1)</p>
<ol style="list-style-type:lower-alpha" type="a">
<li>Only preemption</li>
<li>Only context switch </li>
<li>Both preemption and context switch</li>
<li>None</li>
</ol>Operating Systemhttps://gateoverflow.in/389389/operating-system-round-robin-preemption-%26-context-switchFri, 25 Nov 2022 18:51:11 +0000Solve the simultaneous recurrence relations
https://gateoverflow.in/389383/solve-the-simultaneous-recurrence-relations
an = an−1 + bn−1<br />
bn = an−1 − bn−1<br />
with a0 = 1 and b0 = 2.Combinatoryhttps://gateoverflow.in/389383/solve-the-simultaneous-recurrence-relationsFri, 25 Nov 2022 17:44:20 +0000Quicksort
https://gateoverflow.in/389373/quicksort
In Quick sort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function ? Assume we are sorting in increasing order. 11, 15, 9, 13, 17, 7, 5, 12, 6, 18Algorithmshttps://gateoverflow.in/389373/quicksortFri, 25 Nov 2022 14:41:54 +0000Probability Distribution
https://gateoverflow.in/389366/probability-distribution
Let X have a Poisson distribution with parameter λ = 1. What is the probability that X ≥ 2 given that X ≤ 4?Probabilityhttps://gateoverflow.in/389366/probability-distributionFri, 25 Nov 2022 13:01:40 +0000Compiler Design self Doubt
https://gateoverflow.in/389340/compiler-design-self-doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)"<br />
<br />
What is meaning of this statement exactly and does it hold always?<br />
<br />
My Assumptions:<br />
<br />
If a grammar is right linear grammar then it can be parser by LL(1)<br />
<br />
->I am sure they are not left recursive.<br />
-->There definitely exist one unambiguous grammar for that right linear grammar.<br />
But this is not suffice to make grammar LL(1).<br />
<br />
Correct if I assumed anything wrong with some intutive answer.Compiler Designhttps://gateoverflow.in/389340/compiler-design-self-doubtFri, 25 Nov 2022 08:37:05 +0000Machine Learning
https://gateoverflow.in/389245/machine-learning
<p><strong>You are a designing a machine learning model for a binary classification problem. The model has three features: f1, f2, f3. Derive the objective and loss function for this problem.</strong></p>Artificial Intelligencehttps://gateoverflow.in/389245/machine-learningFri, 25 Nov 2022 00:03:16 +0000Toc-Self Doubt
https://gateoverflow.in/389298/toc-self-doubt
Can anyone explain what is the meaning of saying set of some languages is another language.<br />
<br />
Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which is set of languages . If i say L is regular Does it mean L1,l2,l3...Ln are regular.Theory of Computationhttps://gateoverflow.in/389298/toc-self-doubtThu, 24 Nov 2022 17:25:13 +0000Conditional Probability
https://gateoverflow.in/389295/conditional-probability
English and American spelling are rigour and rigor, respectively. A man staying at Al Rashid hotel writes this word, and a letter taken at random from his spelling is found to be a vowel. If 40 percent of the English-speaking men at the hotel are English and 60 percent are American, what is the probability that the writer is an Englishman?Probabilityhttps://gateoverflow.in/389295/conditional-probabilityThu, 24 Nov 2022 15:42:45 +0000Work and Time
https://gateoverflow.in/389293/work-and-time
<p>A is 20% less efficient than B. If B alone can do the work in 40 days then in how many days A and B can together complete the same work?</p>
<p>The above question is from made easy test series.</p>
<p><strong>Sol:</strong></p>
<p>Given B alone can do the work in <strong>40 days</strong></p>
<p>B’s one day work is <strong>1/40</strong></p>
<p>As A is <strong>20%</strong> less efficient </p>
<p>So, A’s work one day work is <strong>$\frac{1}{40}$x $\frac{80}{100}$ = $\frac{1}{50}$</strong></p>
<pre>
So A alone can do the same work in 50 days.</pre>
<p> </p>
<p>A’s and B’s one day combined work = <strong>$\frac{1}{40}$+ $\frac{1}{50}$ = $\frac{9}{200}$</strong></p>
<p>Hence A and B together can complete the work in <strong>22.22 days</strong></p>
<p> </p>
<p><strong>My Doubt:</strong></p>
<p>Here A is 20% less efficient than B therefore <strong>$\frac{Work \ done \ by\ B}{Work \ done \ by\ A}$= $\frac{100}{80}$ = $\frac{5}{4}$</strong></p>
<p>But why it can’t be like <strong>$\frac{Work \ done \ by\ B}{Work \ done \ by\ A}$= $\frac{120}{100}$ = $\frac{6}{5}$ </strong>as this also implies that A is 20% less efficient </p>
<p>Correct me if I am wrong.</p>
<p>Is there a way to decide when to use which method?</p>
<p> </p>Verbal Aptitudehttps://gateoverflow.in/389293/work-and-timeThu, 24 Nov 2022 15:31:56 +0000What are contention periods in CSMA? Why are they used?
https://gateoverflow.in/389271/what-are-contention-periods-in-csma-why-are-they-used
As far I know that, contention slots are required to avoid all channels from transmitting at the same time. But what happens when the contention slot is over? All stations will transmit together and it will lead to jamming of the channel then. What exactly is the role of contention slots and how does it avoid collisions?Computer Networkshttps://gateoverflow.in/389271/what-are-contention-periods-in-csma-why-are-they-usedThu, 24 Nov 2022 11:07:06 +0000#LinearAlgebra
https://gateoverflow.in/389262/%23linearalgebra
<ul>
<li>Is this correct?</li>
<li><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=8216766089028809665"></li>
</ul>Linear Algebrahttps://gateoverflow.in/389262/%23linearalgebraThu, 24 Nov 2022 07:02:21 +0000acacademy
https://gateoverflow.in/389248/acacademy
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1810069158301404256"></p>
<p>CFG is not closed under complementation , but REC is?</p>Theory of Computationhttps://gateoverflow.in/389248/acacademyThu, 24 Nov 2022 04:51:26 +0000CFL | TOC | Ace Academy Test Series
https://gateoverflow.in/389232/cfl-toc-ace-academy-test-series
<p>If L and $L^{c}$ both are CFL, the L <em><strong>must</strong></em> be DCFL</p>
<p> a. TRUE</p>
<p> b.FALSE</p>Theory of Computationhttps://gateoverflow.in/389232/cfl-toc-ace-academy-test-seriesWed, 23 Nov 2022 18:26:43 +0000Madeasy Test series
https://gateoverflow.in/389229/madeasy-test-series
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=14063753618820896109"></p>CO and Architecturehttps://gateoverflow.in/389229/madeasy-test-seriesWed, 23 Nov 2022 17:22:30 +0000#self_doubt
https://gateoverflow.in/389218/%23self_doubt
T(n)={<br />
<br />
0:if n<1<br />
<br />
1:if n==1<br />
<br />
T(n-1)+T(n-2):n>1<br />
<br />
}<br />
<br />
if the stack size is 48 bytes and one stack entry size =4 B then maximum n=?<br />
<br />
I thought it should be 13 but the answer is 12<br />
<br />
T(1) and T(<1) should not be stored they are already given so can we take n=13 so the last call which will be stored will be T(2)Algorithmshttps://gateoverflow.in/389218/%23self_doubtWed, 23 Nov 2022 13:55:41 +0000Made Esy Test Series 2022 | COA | Subject wise Q.no 17
https://gateoverflow.in/389202/made-esy-test-series-2022-coa-subject-wise-q-no-17
<p> </p>
<p> </p>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">** MSQ **</div>
<p><br>
Consider the following sequence of micro-operations (μO) on a system used for instruction fetch:</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=3973890774679244117"></p>
<p><br>
Where MAR is memory address register, PC is program counter, MBR is memory buffer register and IR is instruction register. And Mem[MAR] means reading data from memory location provided in MAR. Assume each μO takes 1 cycle. Which of the following μO’s can execute parallely without conflict.</p>
<ol style="list-style-type:lower-alpha" type="a">
<li>μO2 and μO3</li>
<li>μO1 and μO3</li>
<li>μO4 and μO3</li>
<li>μO2 and μO4</li>
</ol>
<p> </p>CO and Architecturehttps://gateoverflow.in/389202/made-esy-test-series-2022-coa-subject-wise-q-no-17Wed, 23 Nov 2022 10:26:53 +0000gateforum
https://gateoverflow.in/389164/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=8874228925347101735"></p>Compiler Designhttps://gateoverflow.in/389164/gateforumTue, 22 Nov 2022 20:13:14 +0000Digital image processing, Fourier kernel
https://gateoverflow.in/389158/digital-image-processing-fourier-kernel
The 2D Fourier kernels k(x,y,u,v) = e^(-j2π(ux/M + vy/N)) is -<br />
<br />
a)Separable and antisymmetric<br />
<br />
b)Symmetric but not separable<br />
<br />
c)Separable and symmetric<br />
<br />
d)Antisymmetric and not separableDigital Image Processinghttps://gateoverflow.in/389158/digital-image-processing-fourier-kernelTue, 22 Nov 2022 18:13:32 +0000Theory Of Computation
https://gateoverflow.in/389155/theory-of-computation
Can finite automata do addition, subtraction, and multiplication?<br />
<br />
Anyone, please explain in detail?Theory of Computationhttps://gateoverflow.in/389155/theory-of-computationTue, 22 Nov 2022 17:27:15 +0000TIFR System Science 2018 Question 1
https://gateoverflow.in/389133/tifr-system-science-2018-question-1
Consider a discrete-time system which in response to input sequence x[n] (n integer)<br />
outputs the sequence y[n] such that<br />
$y[n] = 0, n = −1, −2, −3,...$<br />
and $y[n]=2 (y[n − 1] + nx[n]), n = 0, 1, 2,...$. Find out if the system is linear and time-invariant.Digital Signal Processinghttps://gateoverflow.in/389133/tifr-system-science-2018-question-1Tue, 22 Nov 2022 14:24:56 +0000TIFR system Science 2017 question 7
https://gateoverflow.in/389135/tifr-system-science-2017-question-7
A circulant matrix is a square matrix whose each row is the preceding row rotated to the right by one element, e.g., the following is a 3 × 3 circulant matrix \begin{pmatrix}<br />
1 & 2 & 3\\<br />
3 & 1 & 2\\<br />
2 & 3 & 1<br />
\end{pmatrix}<br />
<br />
For any n × n circulant matrix (n > 5), which of the following n-length vectors is always an eigenvector?<br />
<br />
(a) A vector whose k-th element is k<br />
<br />
(b) A vector whose k-th element is nk<br />
<br />
(c) A vector whose k-th element is $\exp \left(j\dfrac{2π(n − 5)k}{ n}\right)$ where $j = \sqrt{−1}$<br />
<br />
(d) A vector whose k-th element is $\sin h (2πk/n)$<br />
<br />
(e) None of the aboveLinear Algebrahttps://gateoverflow.in/389135/tifr-system-science-2017-question-7Tue, 22 Nov 2022 14:24:49 +0000TIFR CS & SS 2018 SS part Question 12
https://gateoverflow.in/389114/tifr-cs-%26-ss-2018-ss-part-question-12
Suppose that Amitabh Bachchan has ten coins in his pocket. 3 coins have tails on both sides. 4 coins have heads on both sides. 3 coins have heads on one side and tails on the other and both the outcomes are equally likely when that coin is flipped. In a bet with Dharmendra, Amitabh picks up a coin at random (each coin is equally likely to be picked) from these ten coins, flips it and finds that the outcome is tails. What is the probability that the other side of this coin is heads?Probabilityhttps://gateoverflow.in/389114/tifr-cs-%26-ss-2018-ss-part-question-12Tue, 22 Nov 2022 09:46:36 +0000Concurrent program
https://gateoverflow.in/389110/concurrent-program
<p>Consider the concurrent program:</p>
<p>x:=1;</p>
<p><strong>cobegin</strong></p>
<p>x:= x + x + 1|| x:= x + 2</p>
<p><strong>coend;</strong></p>
<p>Reading and writing of a vairable is atomic, but evaluation of an expression is not atomic. The sum of possible values of variable x at the end of execution of the program is ___.</p>
<p> </p>
<p>The above question is from madeeasy test series.</p>
<p><strong>Solution:</strong></p>
<p><strong>1. </strong>x=1, run x = x + 2 then x = x + x + 1 finally x will be 7 </p>
<p><strong>2. </strong>x=1, run x = x + 2 then x = x + x + 1 parallely then x will be 3</p>
<p><strong>3. </strong> x=1, run x = x + x + 1 then x = x + 2 finally x = 5</p>
<p>Possible values of x would be 3, 5, 7 and <strong>Sum = 15</strong></p>
<p> </p>
<p><strong>My Doubt:</strong></p>
<p>Wont there be 1 more case where we run x = <u><strong>x</strong></u> + x + 1 but load only value of highlighted x i.e it becomes x = 1 + x + 1</p>
<p>and after it we will run x = x + 2 i.e x = 1 + 2 = 3</p>
<p>now again running x = 1+ x + 1 and now substituting the value of x as <strong>3</strong></p>
<p><strong>x = 1 + 3 + 1 = 5</strong></p>Operating Systemhttps://gateoverflow.in/389110/concurrent-programTue, 22 Nov 2022 07:04:12 +0000KMaps - Digital Logic (self doubt)
https://gateoverflow.in/389078/kmaps-digital-logic-self-doubt
<p>I’m taking for an example kmaps for 3 var</p>
<p> </p>
<table border="1" cellpadding="1" style="height:50px; width:293px">
<tbody>
<tr>
<td> </td>
<td>A’B’</td>
<td>A’B</td>
<td>AB</td>
<td>AB’</td>
</tr>
<tr>
<td>C’</td>
<td> 0</td>
<td>1</td>
<td>3</td>
<td>2</td>
</tr>
<tr>
<td style="height:1px">C</td>
<td style="height:1px">4</td>
<td style="height:1px">5</td>
<td style="height:1px">7</td>
<td style="height:1px">6</td>
</tr>
</tbody>
</table>
<p>(probably here we are taking CAB’ = 6</p>
<p>and below like AB’C =5 )</p>
<p> </p>
<table border="1" cellpadding="1" style="height:50px; width:293px">
<tbody>
<tr>
<td> </td>
<td>A’B’</td>
<td>A’B</td>
<td>AB</td>
<td>AB’</td>
</tr>
<tr>
<td>C’</td>
<td> 0</td>
<td>2</td>
<td>6</td>
<td>4</td>
</tr>
<tr>
<td style="height:1px">C</td>
<td style="height:1px">1</td>
<td style="height:1px">3</td>
<td style="height:1px">7</td>
<td style="height:1px">5</td>
</tr>
</tbody>
</table>
<p> </p>
<p><strong>But how do i know which one to use and when? </strong><br>
</p>Digital Logichttps://gateoverflow.in/389078/kmaps-digital-logic-self-doubtMon, 21 Nov 2022 16:22:06 +0000I want to start preparation of gate 2024 in this december. one mistake i did in JEE was i overwhelmed with content and misguided or self-misguided by youtube videoes and tutorials. i want some structured way of learning now and not want to repeat that mistake again. so, should i join Gate Wallah. if not then tell me just 2 or 3 youtube channel with i can stick with it. if that also not good idea the tell me any paid batch i can purchase under 10,000 INR
https://gateoverflow.in/389062/preparation-overwhelmed-misguided-tutorials-structured
Othershttps://gateoverflow.in/389062/preparation-overwhelmed-misguided-tutorials-structuredMon, 21 Nov 2022 15:54:56 +0000DRDO Scientist B exam suggestions
https://gateoverflow.in/389052/drdo-scientist-b-exam-suggestions
Does anyone have any experience of giving DRDO Scientist-B exam? The official site says its a descriptive examination but how to write answers in a better way(apart from mathematical questions)? I am asking this as I am sure this exam doesn’t need to be approached in the same way as college end semester exams. Any pointers about answer writing, expected topics, expected cutoff, links to question papers are apprciated. Thank you!Othershttps://gateoverflow.in/389052/drdo-scientist-b-exam-suggestionsMon, 21 Nov 2022 11:57:24 +0000Gate Wallah Study material
https://gateoverflow.in/389034/gate-wallah-study-material
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=11407362075823563875"></p>
<p>Please help with the minimum value. Problem is from the gate wallah study handout.</p>Operating Systemhttps://gateoverflow.in/389034/gate-wallah-study-materialMon, 21 Nov 2022 09:14:21 +0000A digital computer has a common path for a memory and 3 registers of 8 bits each.. How many registers can load data. from the path in the same clock cycle? a) 8 b) 2 d) 4
https://gateoverflow.in/389021/digital-computer-common-memory-registers-registers-clock
CO and Architecturehttps://gateoverflow.in/389021/digital-computer-common-memory-registers-registers-clockMon, 21 Nov 2022 09:14:10 +0000#strict_alteration #operating_system #process_synchronization
https://gateoverflow.in/388997/%23strict_alteration-%23operating_system-%23process_synchronization
<p>In a strict alteration , we use <strong>TURN </strong>variable and turn variable is shared variable .So,my doubt is that there's synchronisation problem as it is similar to producer consumer problem. While executing turn variable there might be preemption and it might cause inconsistency ? So how could strict alteration has this disadvantage?</p>Operating Systemhttps://gateoverflow.in/388997/%23strict_alteration-%23operating_system-%23process_synchronizationSun, 20 Nov 2022 14:41:41 +0000gate academy
https://gateoverflow.in/388989/gate-academy
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1510343174943296049"></p>
<p>I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack which will be absent in case of n=0. But solutions say S1 is true.</p>Theory of Computationhttps://gateoverflow.in/388989/gate-academySun, 20 Nov 2022 11:35:03 +0000gateforum
https://gateoverflow.in/388960/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13629443447555425843"></p>Compiler Designhttps://gateoverflow.in/388960/gateforumSat, 19 Nov 2022 20:02:08 +0000Safe State | Deadlock Avoidance | Bankers Algorithm | OS | MSQ
https://gateoverflow.in/388959/safe-state-deadlock-avoidance-bankers-algorithm-os-msq
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">MSQ</div>
<p> </p>
<p>Which of the following statements is/are <strong>TRUE</strong>?</p>
<ol>
<li>If safe state exists, deadlock can be avoided if resources are allocated properly</li>
<li>If safe state exists, deadlock is never possible in future</li>
<li>Unsafe state always leads to a deadlock</li>
<li>Even if safe state exists, deadlock is possible, if resources are poorly allocated</li>
<li>Unsafe state may lead to a deadlock</li>
</ol>Operating Systemhttps://gateoverflow.in/388959/safe-state-deadlock-avoidance-bankers-algorithm-os-msqSat, 19 Nov 2022 19:49:03 +0000GATE CSE 2017 Set 2 | Question: 33 (MSQ Version)
https://gateoverflow.in/388951/gate-cse-2017-set-2-question-33-msq-version
<h3 style="background: rgb(238, 238, 238); border: 1px solid rgb(204, 204, 204); padding: 5px 10px;"><em><strong>** MSQ **</strong></em></h3>
<p><br>
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=11486759945321459035"></p>
<p> </p>
<p>Which of the following best describes the system?</p>
<ol>
<li>
<p>Safe state P3 → P2 → P1 and P3 → P1 → P2 exists</p>
</li>
<li>
<p>Currently not in a deadlock</p>
</li>
<li>
<p>Deadlock never possible as safe states are present</p>
</li>
<li>
<p>Deadlock is possible in future, even tough we have safe state as of now</p>
</li>
</ol>
<p> </p>Operating Systemhttps://gateoverflow.in/388951/gate-cse-2017-set-2-question-33-msq-versionSat, 19 Nov 2022 16:45:55 +0000KSET 2015 computer science
https://gateoverflow.in/388944/kset-2015-computer-science
Let X and Y be two sets having n elements<br />
each. Then the total number of bijective<br />
functions from X and Y is<br />
(A) n (B) 2n<br />
(C) n! (D) 2nSet Theory & Algebrahttps://gateoverflow.in/388944/kset-2015-computer-scienceSat, 19 Nov 2022 15:21:00 +0000#GateAppliedCourse-DFA-EpsilonNFA
https://gateoverflow.in/388929/%23gateappliedcourse-dfa-epsilonnfa
<p><img alt="" src="https://gate.appliedroots.com/storage/images/img1634435084.PNG">can we solve it with a minimum of 4 states?</p>Theory of Computationhttps://gateoverflow.in/388929/%23gateappliedcourse-dfa-epsilonnfaSat, 19 Nov 2022 12:43:21 +0000gateforum
https://gateoverflow.in/388918/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=3503592563800676053"></p>Mathematical Logichttps://gateoverflow.in/388918/gateforumSat, 19 Nov 2022 12:42:34 +0000gateforum
https://gateoverflow.in/388917/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=3503592563800676053"></p>Mathematical Logichttps://gateoverflow.in/388917/gateforumSat, 19 Nov 2022 12:41:48 +0000Computer Network
https://gateoverflow.in/388927/computer-network
Anyone Explain What is meant by Hop with the help of diagram ?Computer Networkshttps://gateoverflow.in/388927/computer-networkSat, 19 Nov 2022 10:13:27 +0000gateforum
https://gateoverflow.in/388873/gateforum
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=7629188365977963863"></p>Theory of Computationhttps://gateoverflow.in/388873/gateforumFri, 18 Nov 2022 13:54:04 +0000Longest Remaining time first Process scheduling.
https://gateoverflow.in/388863/longest-remaining-time-first-process-scheduling
<p><strong>Why do we say that Longest Remaining time first is a starvation free algorithm?</strong><br>
<br>
Let me walk through my though process, same as LRTF is Shortest Remaining time first and it is given that (in multiple standard books) SRTF may lead to starvation as short process may keep on coming and long process will never get the processor the execution, i.e. long process might never be scheduled.<br>
Its find until now.<br>
<br>
Now if we apply the same logic to LRTF, as the longer process gets scheduled its true that eventually it will get shorter and the shorter process may be scheduled but there is also a chance that longer process may keep on coming and the most short process may never get the hold of the process.<br>
</p>
<p>What i think is the reason is longer burst time process and not so frequent to short burst time process so it is unlikely that longer burst time process will keep on coming, but still i don’t think it is never a possibility that longer process will never keep on coming.<br>
<br>
Please can anyone clarify me about the logic about why LRTF are considered starvation free algorithms.</p>Operating Systemhttps://gateoverflow.in/388863/longest-remaining-time-first-process-schedulingFri, 18 Nov 2022 12:54:10 +0000The total number of keys required for a set of n individuals to be able to communicate with each other using secret key and public key crypto-systems, respectively are: (A) n(n-1) and 2n (B) 2n and ((n(n – 1))/2) (C) ((n(n – 1))/2) and 2n (D) ((n(n – 1))/2) and n
https://gateoverflow.in/388861/required-individuals-communicate-public-systems-respectively
Computer Networkshttps://gateoverflow.in/388861/required-individuals-communicate-public-systems-respectivelyFri, 18 Nov 2022 12:20:17 +0000Computer Networks
https://gateoverflow.in/388858/computer-networks
<p> </p>
<p>Since 8 bit delimeter pattern = <strong>01111110. </strong></p>
<p><strong>So whenever 0111111( 6’s ones) is matched we will add one extra bit.</strong></p>
<p><strong>But in the solution extra bit is added just after 011111(5’s ones).</strong></p>
<p> </p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9647349991770920139"></p>Computer Networkshttps://gateoverflow.in/388858/computer-networksFri, 18 Nov 2022 11:56:18 +0000Computer Networks
https://gateoverflow.in/388854/computer-networks
<p>I am getting M1 as correct.<img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9995038433341190239"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13436617461824135414"></p>Computer Networkshttps://gateoverflow.in/388854/computer-networksFri, 18 Nov 2022 11:07:19 +0000Self-Doubt in Admissions
https://gateoverflow.in/388850/self-doubt-in-admissions
My qualifications are Bsc(h)CS and then I did my MCA. I passed out from MCA in 2022. I am looking to pursue Mtech at IIT Bombay or IISc. <br />
<br />
I went through their brochure to check eligibility. I found out that for MCA candidates, they must have physics and mathematics at undergraduate level. I had economics as elective subject in place of mathematics. But since my course was honours course, we had no option for studying Physics. <br />
<br />
I just want to confirm if I am ineligible at IIT Bombay or not. Or maybe there's some sort of workaround for this. Kindly help.IISc/IITshttps://gateoverflow.in/388850/self-doubt-in-admissionsFri, 18 Nov 2022 10:40:52 +0000How many distinct passwords are possible?
https://gateoverflow.in/388847/how-many-distinct-passwords-are-possible
An e-mail password must contain three characters. The password has to contain one numeral from 0 to 9, one upper case and one lower case character from the English alphabet. How many distinct passwords are possible?<br />
(A) 6,760 (B) 13,520 (C) 40,560 (D) 1,05,456Quantitative Aptitudehttps://gateoverflow.in/388847/how-many-distinct-passwords-are-possibleFri, 18 Nov 2022 08:21:14 +0000graph theory ,discrete math
https://gateoverflow.in/388839/graph-theory-discrete-math
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)Mathematical Logichttps://gateoverflow.in/388839/graph-theory-discrete-mathFri, 18 Nov 2022 05:49:47 +0000