GATE CSE Doubts  Recent questions and answers
https://csedoubts.gateoverflow.in/qa
Powered by Question2Answer

SelfDoubt syllabus
https://csedoubts.gateoverflow.in/16497/selfdoubtsyllabus
Multiplexing and spectrum spreading is in the syllabus of GATE 2021. if yes, how much should I read?
Computer Networks
https://csedoubts.gateoverflow.in/16497/selfdoubtsyllabus
Mon, 06 Apr 2020 02:29:48 +0000

Book name. Behrouz AForozun network layer
https://csedoubts.gateoverflow.in/16498/booknamebehrouzaforozunnetworklayer
Change each of the following mask to a prefix length?<br />
<br />
A 255.224 .0.0. B . 255.240.0.0 C 255.255.255.128
Computer Networks
https://csedoubts.gateoverflow.in/16498/booknamebehrouzaforozunnetworklayer
Mon, 06 Apr 2020 02:29:30 +0000

Book Name. Forozun. Chapter. Network layer
https://csedoubts.gateoverflow.in/16499/booknameforozunchapternetworklayer
What is the size of address space in each of the following system ?<br />
<br />
a A system in which address is only 16 bits<br />
<br />
b A system in which address is made of six hexadecimal digits<br />
<br />
C. A system in which each address is made of four octal digits<br />
<br />
Explain ?
Computer Networks
https://csedoubts.gateoverflow.in/16499/booknameforozunchapternetworklayer
Mon, 06 Apr 2020 02:29:28 +0000

Linked list self doubt
https://csedoubts.gateoverflow.in/16493/linkedlistselfdoubt
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=418382401853688709"></p>
Programming
https://csedoubts.gateoverflow.in/16493/linkedlistselfdoubt
Sun, 05 Apr 2020 03:14:16 +0000

GATE 2021 # compiler design
https://csedoubts.gateoverflow.in/16491/gate2021%23compilerdesign
Is dominance tree there in gate syllabus of 2021?
Compiler Design
https://csedoubts.gateoverflow.in/16491/gate2021%23compilerdesign
Sat, 04 Apr 2020 18:15:08 +0000

NIELIT Scientist B CSE
https://csedoubts.gateoverflow.in/16486/nielitscientistbcse
The number of unused pointers in a complete binary tree of depth 5 is :<br />
<br />
(A) 4<br />
<br />
(B) 8<br />
<br />
(C) 16<br />
<br />
(D) 32<br />
<br />
According to me answer should be option (D), as there are 16 leaf nodes and therefore 32 pointers are unused at depth 5.
DS
https://csedoubts.gateoverflow.in/16486/nielitscientistbcse
Sat, 04 Apr 2020 15:56:42 +0000

Answered: Consider the following grammar G.
https://csedoubts.gateoverflow.in/16420/considerthefollowinggrammarg?show=16488#a16488
<p>Option B both LL(1) & LR(0)</p>
<p>IF parsing table in case of LL (1) does not contain a more than one production in same cell then grammar can be LL(1)</p>
<p>In case of LR (0) if no state with SR/RR conflict in transition diagram then grammar can be LR (0)</p>
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=7654644016014192982"></p>
Compiler Design
https://csedoubts.gateoverflow.in/16420/considerthefollowinggrammarg?show=16488#a16488
Sat, 04 Apr 2020 09:22:51 +0000

Made easy database management system objective practice sets
https://csedoubts.gateoverflow.in/16475/madeeasydatabasemanagementsystemobjectivepracticesets
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=14629724994165838587">could you explain this matching question.</p>
Databases
https://csedoubts.gateoverflow.in/16475/madeeasydatabasemanagementsystemobjectivepracticesets
Sat, 04 Apr 2020 03:03:00 +0000

Anyone facing problems with IIT Kanpur admission portal
https://csedoubts.gateoverflow.in/16476/anyonefacingproblemswithiitkanpuradmissionportal
I am not able to proceed to the next screen after the “Academic details” tab in IITK’s admission portal Pingala. I have fiiled in all the mandatory details and there are no errors shown.
IISc/IITs
https://csedoubts.gateoverflow.in/16476/anyonefacingproblemswithiitkanpuradmissionportal
Sat, 04 Apr 2020 03:02:56 +0000

SELF DOUBT PREVIOUS YEAR ALGORITHM
https://csedoubts.gateoverflow.in/16480/selfdoubtpreviousyearalgorithm
<p><a rel="nofollow" href="https://gateoverflow.in/8501/gate2015342">https://gateoverflow.in/8501/gate2015342</a></p>
<p>CAN WE say f(n)=Θ(g(n))…..becz for n=0 both are equal.</p>
Algorithms
https://csedoubts.gateoverflow.in/16480/selfdoubtpreviousyearalgorithm
Sat, 04 Apr 2020 03:02:40 +0000

Made easy postal package, database management system, objective practice sets, pg9 ques34
https://csedoubts.gateoverflow.in/16483/postalpackagedatabasemanagementsystemobjectivepractice
<p>Consider the relation R(A,B,C,D,E) with following dependencies A<a rel="nofollow" href="https://gateoverflow.in/336698/nielit2016marscientistbsectionc43" title="">→→</a>BC and D<a rel="nofollow" href="https://gateoverflow.in/336698/nielit2016marscientistbsectionc43" title="">→</a>B of the following dependencies.</p>
<p>A<a rel="nofollow" href="https://gateoverflow.in/336698/nielit2016marscientistbsectionc43" title="">→</a>B</p>
<p>A<a rel="nofollow" href="https://gateoverflow.in/336698/nielit2016marscientistbsectionc43" title="">→→</a>C</p>
<p>A<a rel="nofollow" href="https://gateoverflow.in/336698/nielit2016marscientistbsectionc43" title="">→→</a>D</p>
<p>Which must necessarily hold in R?</p>
<p>(a) 1 only</p>
<p>(b) 2 only</p>
<p>© 2 and 3</p>
<p>(d) 1,2 and 3</p>
Databases
https://csedoubts.gateoverflow.in/16483/postalpackagedatabasemanagementsystemobjectivepractice
Sat, 04 Apr 2020 03:02:35 +0000

Self doubtDBMS(ER DIAGRAMS)
https://csedoubts.gateoverflow.in/16478/selfdoubtdbmserdiagrams
<p>For the given ER diagram I have drawn 2 Relational Models please tell me which one of it is correct?<br>
<strong>ER DIAGRAM:</strong><br>
<img alt="" height="381" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=11911048278368051747" width="381"></p>
<p><strong>RELATIONAL MODELS:</strong></p>
<p><strong><img alt="" height="321" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=2809195187725523095" width="321"></strong></p>
Databases
https://csedoubts.gateoverflow.in/16478/selfdoubtdbmserdiagrams
Fri, 03 Apr 2020 18:01:21 +0000

MADE EASY POSTAL PACKAGE DATABASE MANAGEMENT SYSTEM PG13 QUES07
https://csedoubts.gateoverflow.in/16472/madeeasypostalpackagedatabasemanagementsystempgques
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=14966392789066900578">I am not able to get the answer of ques 7</p>
Databases
https://csedoubts.gateoverflow.in/16472/madeeasypostalpackagedatabasemanagementsystempgques
Fri, 03 Apr 2020 02:31:16 +0000

Answered: Quantitative AptitudeArun Sharma ( Time and Work)
https://csedoubts.gateoverflow.in/16432/quantitativeaptitudearunsharmatimeandwork?show=16473#a16473
<p>Let capacity be $60L$</p>
<p>$A+B =6min=10L/min$</p>
<p>$A=xmin=\dfrac{60}{x}L/min$</p>
<p>$B=(x+5)min=\dfrac{60}{x+5}L/min$</p>
<p>$Now,$</p>
<p>$\dfrac{60}{x}+\dfrac{60}{x+5}=10$</p>
<p>$By\ solving:$</p>
<p>$x^27x30=0$</p>
<p>$(x10)(x+3)$</p>
<p>$x=10,x=3$</p>
<hr>
<p>$A=10min$</p>
<p>$B=15min$</p>
<hr>
<p>$Ans=C$</p>
Numerical Ability
https://csedoubts.gateoverflow.in/16432/quantitativeaptitudearunsharmatimeandwork?show=16473#a16473
Thu, 02 Apr 2020 17:59:45 +0000

NIELIT Scientist B 2016
https://csedoubts.gateoverflow.in/16458/nielitscientistb2016
Which of the following is wrong:<br />
A. Turing machine is a simple mathematical model of general purpose computer<br />
B. Turing machine is more powerful than finite automata<br />
C. Turing machine can be simulated by a general purpose computer<br />
D. All of the above<br />
<br />
In most of the sites I checked, I found the answer as option (D). But I did not get how all of the above are wrong. Turing machine is more powerful than finite automata is true, similarly option C and A also seems to be true.
Theory of Computation
https://csedoubts.gateoverflow.in/16458/nielitscientistb2016
Thu, 02 Apr 2020 15:50:42 +0000

Self doubt(DBMSER DIAGRAMS)
https://csedoubts.gateoverflow.in/16461/selfdoubtdbmserdiagrams
<p>Can <strong>onemany </strong><strong>recursive relation </strong>exist in which the one side is having partial participation and the many side is having total participation?</p>
Databases
https://csedoubts.gateoverflow.in/16461/selfdoubtdbmserdiagrams
Thu, 02 Apr 2020 15:50:05 +0000

Matrices Eigen Values
https://csedoubts.gateoverflow.in/16462/matriceseigenvalues
<p>The value of ‘x’ for which all the eigen values of the matrix given below are real is</p>
<p>10 5+j 4</p>
<p>x 20 2</p>
<p>4 2 10</p>
<ol style="liststyletype:loweralpha" type="a">
<li>5+j b. 5j c.15j d.1+5j</li>
</ol>
Mathematical Logic
https://csedoubts.gateoverflow.in/16462/matriceseigenvalues
Thu, 02 Apr 2020 06:35:04 +0000

Question on vector calculus
https://csedoubts.gateoverflow.in/16459/questiononvectorcalculus
<p>Which one of the following descries the relationship among the three vectors, i+j+k ,2i+3j+k ,5i+6j+4k ?</p>
<ol style="liststyletype:loweralpha" type="a">
<li>The vectors are mutually perpendicular</li>
<li>The vectors are linearly dependent</li>
<li>The vectors are linearly independent</li>
<li>The vectors are unit vectors</li>
</ol>
<p>Anyone please clarify.</p>
Mathematical Logic
https://csedoubts.gateoverflow.in/16459/questiononvectorcalculus
Thu, 02 Apr 2020 06:24:47 +0000

Fork () in for Loop
https://csedoubts.gateoverflow.in/16449/forkinforloop
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=17433098020970466800"></p>
<p>As it runs for i=0 to 10 except I=5 as continue is used. Therefore 10 times. Therefore 2^101 children.</p>
<p>But I couldn't get the concept as I am using formulae.</p>
<p>Please make a diagram just for overview to some iterations that his fork exactly calls.</p>
Operating System
https://csedoubts.gateoverflow.in/16449/forkinforloop
Thu, 02 Apr 2020 04:51:40 +0000

ISI 2019 PCB
https://csedoubts.gateoverflow.in/16454/isi2019pcb
Let R be a relation with functional dependencies F. For any subset of attributes $X ⊆ R$, the closure of $X$ is defined as the set<br />
<br />
$X^+$ = {$A ∈ R$  $X → A$ holds with respect to $F$ }.<br />
<br />
For two nonempty attribute sets $Y$ and $Z$ in $R$, prove or disprove each of the following statements:<br />
<br />
(a) $(Y^+Z)^+ = (Y Z)^+$<br />
<br />
(b) $(YZ)^+ = Y^+Z^+$
Databases
https://csedoubts.gateoverflow.in/16454/isi2019pcb
Thu, 02 Apr 2020 04:51:02 +0000

#discrete mathematics #exponential generating function
https://csedoubts.gateoverflow.in/16455/%23discretemathematics%23exponentialgeneratingfunction
Is exponential generating functions in gate syllabus?
Combinatory
https://csedoubts.gateoverflow.in/16455/%23discretemathematics%23exponentialgeneratingfunction
Thu, 02 Apr 2020 04:50:58 +0000

Fork () in for Loop
https://csedoubts.gateoverflow.in/16450/forkinforloop
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=17433098020970466800"></p>
<p>As it runs for i=0 to 10 except I=5 as continue is used. Therefore 10 times. Therefore 2^101 children.</p>
<p>But I couldn't get the concept as I am using formulae.</p>
<p>Please make a diagram just for overview to some iterations that how fork exactly calls.</p>
Operating System
https://csedoubts.gateoverflow.in/16450/forkinforloop
Wed, 01 Apr 2020 16:28:07 +0000

Anyone applied for BIS ? Please share your rank .
https://csedoubts.gateoverflow.in/16451/anyoneappliedforbispleaseshareyourrank
Job Queries
https://csedoubts.gateoverflow.in/16451/anyoneappliedforbispleaseshareyourrank
Wed, 01 Apr 2020 16:27:55 +0000

what is the Meaning of following in peter linz algortihm for Chapter 3 , Nfa to Rex?
https://csedoubts.gateoverflow.in/16446/whatthemeaningfollowingpeterlinzalgortihmforchapter
<p>Hello,</p>
<p>I am fairly new to TOC as I have IT background.</p>
<p>I am scratching my head from last 3 days now. Can anybody explain me the meaning of the fourth and fifth point in Peter Linz Alogrithm nfatorex. I mean what is meaning of line p=i,j , q = i,j in step 4. </p>
<p>If i and j are labels then what is p and q.</p>
<p>I have attached a screen shot for this.</p>
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=3402471285826477799"></p>
<p> </p>
<p>I read the following example from peter linz too which says Ree = Phi + aPhi^*a</p>
<p> </p>
<p>which i understand but i am unable to link the algo with this example Specially 4<sup>th</sup> and 5<sup>th</sup> point in algorithm.</p>
<p> </p>
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=6907934083641481347"></p>
<p>Thanks</p>
Theory of Computation
https://csedoubts.gateoverflow.in/16446/whatthemeaningfollowingpeterlinzalgortihmforchapter
Wed, 01 Apr 2020 11:53:38 +0000

Self Doubt 5:Peter Linz(exercise 1.2)
https://csedoubts.gateoverflow.in/16433/selfdoubt5peterlinzexercise12
<p><strong>$L1={a^{n} b^{m};n>=0,m<n}$<br>
$L2={a^{n} b^{(n2)};n>=3}$<br>
$L3=complement$ $of$ $L2.$</strong></p>
<p><em><strong>$L1L3$</strong></em> <strong><em> is?</em></strong><br>
According to me $L1L3$ is same as $L2$.<br>
Please verify. </p>
Theory of Computation
https://csedoubts.gateoverflow.in/16433/selfdoubt5peterlinzexercise12
Tue, 31 Mar 2020 22:01:32 +0000

TOCWhich of the following is true?
https://csedoubts.gateoverflow.in/16438/tocwhichofthefollowingistrue
<p><strong>L1={a^n b^m:n>=0,m<n}</strong></p>
<p><strong>L2={a^3n b^2n : n>2}<br>
L3={a^n b^m: m<=n3 or m=n1}</strong></p>
<p>i>L1 U L2 IS A DCFL<br>
ii>L1 L2 IS A DCFL<br>
iii>L3 is a DCFL.</p>
<p>Please verify which of the following is true?</p>
Theory of Computation
https://csedoubts.gateoverflow.in/16438/tocwhichofthefollowingistrue
Tue, 31 Mar 2020 22:01:08 +0000

STATISTICS  Probability
https://csedoubts.gateoverflow.in/16439/statisticsprobability
<ol>
<li>The Indian cricket team is visiting New Zealand to play a test series comprising five matches. In each match, assume that the Indian team has a 70% chance of winning. Further, assuming that the matches are independent of each other, what is the probability that:</li>
</ol>
<p> </p>
<ol style="liststyletype:loweralpha">
<li>The Indian team will win the series? </li>
</ol>
<p> b. The team will win all five matches, and that the team will lose all?</p>
Mathematical Logic
https://csedoubts.gateoverflow.in/16439/statisticsprobability
Tue, 31 Mar 2020 22:00:57 +0000

Answered: self doubt 2PDA
https://csedoubts.gateoverflow.in/16415/selfdoubt2pda?show=16441#a16441
<p>Yes that statement is always true</p>
<p>Its corresponding to a theorem which states that</p>
<blockquote>
<p>A languge L is said to CFL if and only there exist a PDA which accepts it</p>
</blockquote>
<p><a rel="nofollow" href="https://web.stanford.edu/class/archive/cs/cs103/cs103.1134/lectures/15/Small15.pdf">https://web.stanford.edu/class/archive/cs/cs103/cs103.1134/lectures/15/Small15.pdf</a></p>
<p>check slide 47</p>
<p>Note that the above theorem is a 2 way theorem i.e. it consist of biconditional implication as $\{(A \rightarrow B)$ and $(B \rightarrow A)\} $ which is same as $A \Longleftrightarrow B$</p>
Theory of Computation
https://csedoubts.gateoverflow.in/16415/selfdoubt2pda?show=16441#a16441
Tue, 31 Mar 2020 18:37:27 +0000

GATE CSE 2014 PREVIOUS YEAR QUESTIONS
https://csedoubts.gateoverflow.in/16424/gatecse2014previousyearquestions
<p>Consider a join (relation algebra) between relations r(R)r(R) and s(S)s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R))<size(s(S)) , the join will have fewer number of disk block accesses if</p>
<ol>
<li>relation r(R)r(R) is in the outer loop.</li>
<li>relation s(S)s(S) is in the outer loop.</li>
<li>join selection factor between r(R)r(R) and s(S)s(S) is more than 0.5.</li>
<li>join selection factor between r(R)r(R) and s(S)s(S) is less than 0.5</li>
</ol>
Databases
https://csedoubts.gateoverflow.in/16424/gatecse2014previousyearquestions
Tue, 31 Mar 2020 15:43:06 +0000

Answered: self doubt 4 Peter Linzchapter 7.
https://csedoubts.gateoverflow.in/16417/selfdoubt4peterlinzchapter7?show=16431#a16431
<p>$L_1 \cap L_2 \text{will always be closed under intersection}$</p>
<p><em><u>Below explanation is not a proof</u></em></p>
<p>Since $L_2$ is a regular language then we can design a $\text{Deterministic Finite Automaton for}$ $L_2.$ The definition of Deterministic PDA$\text{(DPDA)}$ states that every move must be deterministic will the 2 conditions </p>
<ol>
<li>$\text{There must be at most one move for any symbol from a state.}$</li>
<li>$\text{If } \delta(q, \lambda, x) \neq \phi \text{ then } \delta(q, a, x) \text{ must be empty for } \forall a \in \Sigma$</li>
</ol>
<p>which means that $\text{DPDA}$ at least a powerful as any $\text{FA}$ and any regular language can also be realized using $\text{DPDA}$. Now apart from this DFA also has capability of stack which outperform the capability of $\text{DPDA}$ than $\text{FA}$.</p>
<p>$\text{So }\textbf{DCFL}$$ \cap$ $\textbf{Regular Language } \text{will always be closed under intersection}$</p>
Theory of Computation
https://csedoubts.gateoverflow.in/16417/selfdoubt4peterlinzchapter7?show=16431#a16431
Tue, 31 Mar 2020 14:30:49 +0000

Answered: Programming Doubt on C
https://csedoubts.gateoverflow.in/16421/programmingdoubtonc?show=16429#a16429
<p>$x=1 \text{ and sum = }0 \text{ before loop iteration starts}$</p>
<hr>
<p>$1^{st} \text{ iteration}$</p>
<p>In the initialization fun has been called which will return the value 14 but post decrement will save $\text{X=13}$ in it. Then condition of loop will be evaluated which will first decrement $X$ value to 12 and then sum will be evaluated. Fun will called from statement</p>
<pre class="prettyprint linenums langc_cpp" datapbcklang="c_cpp" datapbcktabsize="4">
sum = 0 + 12;</pre>
<p>Here fun() will return the value 12 but $X$ will save value 11.</p>
<blockquote>
<p>That means every time fun() is being called which will return a value and save 1 less than the value returned</p>
</blockquote>
<p>So at the end of $1^{st}$ iteration $\text{X=11 and sum = 12}$</p>
<hr>
<p>$2^{nd} \text{ iteration}$</p>
<p>In the increment section of loop fun() will return value 11 but $\text{X will be 10}$. Then condition of loop will decrement $X$ to 9. Now sum will be evaluated as</p>
<pre class="prettyprint linenums langc_cpp" datapbcklang="c_cpp" datapbcktabsize="4">
sum = 12 + 9;</pre>
<p>and $\text{X will be changed to 8}$</p>
<p>So at the end of $2^{nd}$ iteration $\text{X=8 and sum = 21}$</p>
<hr>
<p>$3^{rd} \text{ iteration}$</p>
<p>In the increment section of loop fun() will return value 8 but $\text{X will be 7}$. Then condition of loop will decrement $X$ to 6. Now sum will be evaluated as</p>
<pre class="prettyprint linenums langc_cpp" datapbcklang="c_cpp" datapbcktabsize="4">
sum = 21 + 6;</pre>
<p>and $\text{X will be changed to 5}$</p>
<p>So at the end of $3^{rd}$ iteration $\text{X=5 and sum = 27}$</p>
<hr>
<p>$4^{th} \text{ iteration}$</p>
<p>In the increment section of loop fun() will return value 5 but $\text{X will be 4}$. Then condition of loop will decrement $X$ to 3. Now sum will be evaluated as</p>
<pre class="prettyprint linenums langc_cpp" datapbcklang="c_cpp" datapbcktabsize="4">
sum = 27 + 3;</pre>
<p>and $\text{X will be changed to 2}$</p>
<p>So at the end of $4^{th}$ iteration $\text{X=2 and sum = 30}$</p>
<hr>
<p>$5^{th} \text{ iteration}$</p>
<p>In the increment section of loop fun() will return value 2 but $\text{X will be 1}$. Then condition of loop will decrement $X$ to 0 and the loop will be terminated. So finally $\text{sum = 30 will be stored in the end}$</p>
Programming
https://csedoubts.gateoverflow.in/16421/programmingdoubtonc?show=16429#a16429
Tue, 31 Mar 2020 14:06:53 +0000

Answered: Quantitative AptitudeArun Sharma (Time & Work)
https://csedoubts.gateoverflow.in/16426/quantitativeaptitudearunsharmatime%26work?show=16427#a16427
<p>Let capacity be $100L$</p>
<p>$A 10 Hrs 10L/Hr$</p>
<p>$B20Hrs5L/Hr$</p>
<p>$C25Hrs\underline{4L/Hr}$</p>
<p> $19L/Hr$</p>
<hr>
<p>$\underbrace{A,B,C2Hrs}=38L$</p>
<p>$\underbrace{A,B2Hrs}=30L$</p>
<p>$Now\ A\ has\ to\ fill\ remaining\ 32L$</p>
<p>$1Hr\rightarrow 10L$</p>
<p>$\ ?\rightarrow 32 L$</p>
<p>$\ ?=3.2 Hrs$</p>
<blockquote>
<p>Find the percentage of work done by tap A by itself.</p>
</blockquote>
<p>$10\times 2+10\times 2+ 10\times 3.2=72L$</p>
<p>$\dfrac{72L}{100L}\times 100=72\%$</p>
<hr>
<p>$Ans: D$</p>
Numerical Ability
https://csedoubts.gateoverflow.in/16426/quantitativeaptitudearunsharmatime%26work?show=16427#a16427
Tue, 31 Mar 2020 13:00:28 +0000

Answered: Caluculate Gate 2020 Percentile
https://csedoubts.gateoverflow.in/16410/caluculategate2020percentile?show=16419#a16419
(numbers of candidatesrank)/numbers of candidates*100<br />
<br />
Suppose someone rank 222<br />
No of candidates= 97481<br />
<br />
Percentile= ((97481222)/97481)*100<br />
<br />
= 99.772
IISc/IITs
https://csedoubts.gateoverflow.in/16410/caluculategate2020percentile?show=16419#a16419
Mon, 30 Mar 2020 18:07:14 +0000

InterviewBit
https://csedoubts.gateoverflow.in/16418/interviewbit
<p>In the following C function, let $n >= m$.</p>
<pre class="prettyprint linenums lang" datapbcklang="" datapbcktabsize="">
int gcd(int n, int m) {
if (n%m ==0) return m;
if (n < m) swap(n, m);
while (m > 0) {
n = n%m;
swap(n, m);
}
return n;
}
</pre>
<p>What is the time complexity of the above function assuming <code>n > m</code>?</p>
Algorithms
https://csedoubts.gateoverflow.in/16418/interviewbit
Mon, 30 Mar 2020 17:57:32 +0000

BITS HD 2020  Apply for multiple programmes
https://csedoubts.gateoverflow.in/16413/bitshd2020applyformultipleprogrammes
<p>I plan to apply for BITS via both mediums (GATE + BITS HD) for the following programmes –</p>
<ol style="liststyletype:decimal" type="1">
<li>Computer Science</li>
<li>Software Systems</li>
<li>Embedded Systems</li>
</ol>
<p>So will I end up giving 3 different BITS HD test for each subject? What subject test will be applicable for Embedded systems in the BITS HD exam?</p>
<p>Or am I misunderstanding the process?</p>
Other Colleges
https://csedoubts.gateoverflow.in/16413/bitshd2020applyformultipleprogrammes
Mon, 30 Mar 2020 13:00:09 +0000

SELF DOUBT3(PDA)
https://csedoubts.gateoverflow.in/16416/selfdoubt3pda
<p>Can someone give me the PDA for this language?</p>
<p><u><strong>L={W BELONGS TO {a+b+c}*; (no. of a+no. of b) not equal to the number of c}</strong></u><br>
Actuallly I am getting a NPDA for this .does this language have a <strong>DPDA</strong>?</p>
<p><br>
</p>
Theory of Computation
https://csedoubts.gateoverflow.in/16416/selfdoubt3pda
Mon, 30 Mar 2020 12:59:42 +0000

synchronization problems
https://csedoubts.gateoverflow.in/16405/synchronizationproblems
#include <sys/types.h> #include <stdio.h> #include <unistd.h> int value = 10; int main() { pid_t pid; pid = fork(); if (pid == 0) { value = value + 100; } else if (pid > 0) { value = value 100; printf("PARENT: value= %d \n", value); //Line A wait (NULL); } } <br />
is there any synchronization problem in updating values
Operating System
https://csedoubts.gateoverflow.in/16405/synchronizationproblems
Sun, 29 Mar 2020 20:01:45 +0000

synchronization
https://csedoubts.gateoverflow.in/16406/synchronization
The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5, 8, .... Formally, it can be expressed as: f ib0 = 0 f ib1 = 1 f ibn = f ibn−1 + f ibn−2<br />
<br />
i. Write a C program using the fork() system call that that generates the Fibonacci sequence by the child process. <br />
ii. If the user input as 5 then the child process has to output up to the 5 that is output must be 0,1,1,2,3,5. iii. Parent has to print the child process id and child has to print the parent process id.<br />
<br />
iv. Parent has to finish only after the child terminates.<br />
<br />
v. Is there any process synchronization problem here? Justify your answer.<br />
<br />
vi. Modify the above program to create a zombie process. How do y ou identify the zombie process?<br />
<br />
vii. Modify the above program to create an orphan process.<br />
<br />
viii. Compare and contrast the process and threads.
Operating System
https://csedoubts.gateoverflow.in/16406/synchronization
Sun, 29 Mar 2020 20:01:33 +0000

techtud.com c & data structure quiz 2020
https://csedoubts.gateoverflow.in/16407/techtudcomc%26datastructurequiz2020
G is a graph on n vertices and 2n−2 edges. The edges of G can be partitioned into two edgedisjoint spanning trees. Which of the following is NOT true for G?<br />
<br />
(A)For every subset of k vertices, the induced subgraph has at most 2k−2 edges.<br />
(B)The minimum cut in G has at least 2 edges.<br />
(C)There are at least 2 edgedisjoint paths between every pair of vertices.<br />
(D)There are at least 2 vertexdisjoint paths between every pair of vertices.
Programming
https://csedoubts.gateoverflow.in/16407/techtudcomc%26datastructurequiz2020
Sun, 29 Mar 2020 20:01:26 +0000

#microprogrammed control unit
https://csedoubts.gateoverflow.in/16409/%23microprogrammedcontrolunit
In case of micro programmed control unit, why we have field reserved for control memory address as the micro program counter will automatically be incremented by clock and will point to the next micro instruction in sequence?
CO & Architecture
https://csedoubts.gateoverflow.in/16409/%23microprogrammedcontrolunit
Sun, 29 Mar 2020 20:01:17 +0000

REQUEST FOR SOLTION MANUAL FOR PETER LINZ
https://csedoubts.gateoverflow.in/16411/requestforsoltionmanualforpeterlinz
Can anyone provide me with the solution manual for 6TH EDITION OF PETERLINZ.(or if not available any edition you have)
Theory of Computation
https://csedoubts.gateoverflow.in/16411/requestforsoltionmanualforpeterlinz
Sun, 29 Mar 2020 20:00:37 +0000

#general aptitude
https://csedoubts.gateoverflow.in/16401/%23generalaptitude
The probabilities that a student passes in Mathematics,physics and chemistry are m,p,and c respectively.Of these 3 subjects ,the student has a 75% chance in passing in at least onc,50% chance in passing at least two and a 40% chance of passing exactly two.<br />
<br />
calculate p+m+C=?
Numerical Ability
https://csedoubts.gateoverflow.in/16401/%23generalaptitude
Sun, 29 Mar 2020 01:14:24 +0000

gate 2006 IT56
https://csedoubts.gateoverflow.in/16402/gate2006it56
<p>For each of the four processes P1,P2,P3,P1,P2,P3, and P4P4. The total size in kilobytes (KB)(KB) and the number of segments are given below.</p>
<p>ProcessP1P2P3P4Total size (in KB)19525445364Number of segments4538ProcessTotal size (in KB)Number of segmentsP11954P22545P3453P43648</p>
<p>The page size is 11 KBKB. The size of an entry in the page table is 44 bytesbytes. The size of an entry in the segment table is 88 bytesbytes. The maximum size of a segment is 256256 KBKB. The paging method for memory management uses twolevel paging, and its storage overhead is PP. The storage overhead for the segmentation method is SS. The storage overhead for the segmentation and paging method is TT. What is the relation among the overheads for the different methods of memory management in the concurrent execution of the above four processes?</p>
<ol>
<li>P < S < T</li>
<li>S < P < T</li>
<li>S < T < P</li>
<li>T < S < P</li>
</ol>
<p>Answer to this question is B or C ? and if possible can anyone provide the solution with explanation ; Thanks</p>
Operating System
https://csedoubts.gateoverflow.in/16402/gate2006it56
Sun, 29 Mar 2020 01:14:12 +0000

Answered: Geeks Algo Quiz
https://csedoubts.gateoverflow.in/16387/geeksalgoquiz?show=16403#a16403
<p>Answer is <strong>(C).</strong></p>
<p>Suppose we have to sort $n$ elements. </p>
<p>But, what do we mean by sorting? It's just an arrangement of those $n$ elements, i.e. a single permutation out of those $n!$ all possible permutations. </p>
<p>Two of these $n!$ permutations are specially important, one is the ascending order (where each element is larger than or equal to the previous element) and the other one is descending (where each element is smaller than or equal to the previous element). </p>
<p>Notice the word larger/smaller? This is the comparison function, which essentially defines the order of the elements. Luckily, for numbers, it can be done in $O(1)$ time.</p>
<pre class="prettyprint linenums langc_cpp" datapbcklang="c_cpp" datapbcktabsize="4">
// function that returns the greater of the two elements
// no loops/recursion, hence O(1)
int greater(int a, int b){
if(a >= b){
return a;
}else{
return b;
}
}</pre>
<p>Now, we know what a <em>sorted order</em> is, and how it can be determined this order by using a <em>comparison function, </em>like the one shown in the code above. </p>
<p>Now, what is a decision tree, and why is it relevant here?</p>
<p>Decision tree is, well, a graph, where each node represents a decision point, and based on the decision we take, we create a branch (edge) only if the resultant state differs from the current one, and repeat the process until we get to a dead end (a state where we can no longer get a distinct state).</p>
<p> So, now we define a decision tree for our case. How do we define it? We set up some rules. </p>
<p>1. We pick two elements, and compare them. </p>
<p>2. Let's say the elements are $a$ and $b$.</p>
<p>3. If $a < b$, we choose to go with left branch.</p>
<p>4. If $a \geq b$, we choose to go with right branch.</p>
<p>5. We always choose the elements such that the two chosen elements $a$ and $b$, always give some new information about the resultant order, since that will be the most efficient way, because we are not doing any unnecessary work here, which would be the case of any <em>optimal </em>algorithm.</p>
<p>6. when we detect that we have finished picking up all possible nodes, we terminate.</p>
<p>Due to point $5$, since each node gives some new information, by the time we are finished, we will have made every single choice. So, each path(step / comparison) from root to the leaf would give us a <em>distinct </em>permutation of those $n$ elements, i.e. there will be $n!$ such leaves for our decision tree.</p>
<p>We have another word for this path from root to leaf, we call it <em>height </em>of the tree. </p>
<p>Let's assume the height is $h$. </p>
<p>So, for a tree of $n!$ leaves, the height is $\log(n!)$.</p>
<p>$\therefore h \geq \log(n!) $</p>
<p>$ \therefore h \geq (n/2) \log (n/2)$</p>
<p>$\therefore h = \Omega(n \log n)$</p>
Algorithms
https://csedoubts.gateoverflow.in/16387/geeksalgoquiz?show=16403#a16403
Sat, 28 Mar 2020 16:00:55 +0000

#admission#application fees
https://csedoubts.gateoverflow.in/16397/%23admission%23applicationfees
Is there no application fees to apply for IIT Mandi's master programme?<br />
<br />
I have applied for a mtech programme but there is no payment option.
IISc/IITs
https://csedoubts.gateoverflow.in/16397/%23admission%23applicationfees
Sat, 28 Mar 2020 12:27:06 +0000

Answered: Quantitative AptitudeArun sharma
https://csedoubts.gateoverflow.in/16393/quantitativeaptitudearunsharma?show=16399#a16399
Answer C : 1400,10%<br />
First year 1400×110/100=1540<br />
<br />
Second year 1540×110/100=1694
Numerical Ability
https://csedoubts.gateoverflow.in/16393/quantitativeaptitudearunsharma?show=16399#a16399
Sat, 28 Mar 2020 11:48:54 +0000

Self Doubt: Cost Criteria
https://csedoubts.gateoverflow.in/16395/selfdoubtcostcriteria
I understand that gate input cost (G) is the number of inputs to the gates in the implementation corresponding exactly to the given equation or equations and it can be found by finding the sum of all literal appearances and the number of terms excluding single literal terms.<br />
<br />
In the case of F = x' (F is equal to NOT x), by adding the sum of all literal appearances and the number of terms excluding single literal terms, gate input cost should be 1.<br />
<br />
But I also heard another opinion that gate input cost of F=x' is 0 because the number of inputs to the gates in the implementation is 0.<br />
<br />
Which one is the correct gate input cost of F = x'? 1 or 0?
CO & Architecture
https://csedoubts.gateoverflow.in/16395/selfdoubtcostcriteria
Sat, 28 Mar 2020 05:59:01 +0000

Quantitative AptitudeArun sharma
https://csedoubts.gateoverflow.in/16394/quantitativeaptitudearunsharma
<h3>What is the simple interest for 9 years on a sum of Rs. 800 if the rate of interest for the first 4 years is 8% per annum and for the last 4 years is 6% per annum?</h3>
<p>A) 400</p>
<p>B) 392</p>
<p>C) 352</p>
<p>D) 382</p>
Numerical Ability
https://csedoubts.gateoverflow.in/16394/quantitativeaptitudearunsharma
Fri, 27 Mar 2020 19:33:48 +0000

Answered: TYPE OF THE LANGUAGEPeter Linz chapter 4
https://csedoubts.gateoverflow.in/16384/typeofthelanguagepeterlinzchapter4?show=16391#a16391
<p><strong>Yes it </strong>is regular.</p>
<p><u><em><strong>Reason for that:</strong></em></u> Every non prime number can be represented with the help of two or more prime numbers.Now, we start to think all non prime numbers are represented but what about prime.How can we represent them? No need for that because they are already given in the question.</p>
<p>$\therefore$ All strings can be generated and making this language as regular.</p>
Theory of Computation
https://csedoubts.gateoverflow.in/16384/typeofthelanguagepeterlinzchapter4?show=16391#a16391
Fri, 27 Mar 2020 18:31:20 +0000

Quantitative AptitudeR.S Aggrawal
https://csedoubts.gateoverflow.in/16390/quantitativeaptitudersaggrawal
<h3>10,000 is to be paid back by 4 equal annual installments. Rate 10% per annum. Find the value of each installments.?</h3>
Numerical Ability
https://csedoubts.gateoverflow.in/16390/quantitativeaptitudersaggrawal
Fri, 27 Mar 2020 18:24:10 +0000