GATE Overflow - Recent activity
http://gateoverflow.in/activity
Powered by Question2AnswerAnswered: TCP-Fast Retransmit and Fast Recovery Technique
http://gateoverflow.in/91497/tcp-fast-retransmit-and-fast-recovery-technique?show=119820#a119820
Sir , Please Share the answer<br />
<br />
suppose sender transmit packet at <br />
<br />
0 sec<br />
<br />
after 100 sec 2nd packet generated<br />
<br />
after 500 sec receiver come to know 1st packet is lost and it ACK<br />
<br />
to generate 3 ACK it require 300 ms ,but it reaches sender after 400 ms (500ms+400ms=900ms)<br />
<br />
when sender receives 3ACK it generate a lost packet at rate 100 ms and sends after it (900+100)=1000<br />
<br />
after 900(400+100+400) sec it confirms about the packet successfully reached<br />
<br />
1000+900=1900<br />
<br />
lost= total time required - expected at initial<br />
<br />
1900-900=1000ms<br />
<br />
please correct me if i am wrongComputer Networkshttp://gateoverflow.in/91497/tcp-fast-retransmit-and-fast-recovery-technique?show=119820#a119820Sun, 26 Feb 2017 07:38:49 +0000Answer edited: Manipulation of sum
http://gateoverflow.in/119787/manipulation-of-sum?show=119819#a119819
$\sum_{i=0}^{n}\sum_{j=0}^{i} a_ia_j = $<br />
<br />
=$\sum_{i=0}^{n}a_{i}\sum_{j=0}^{i}a_{j}$<br />
<br />
=$\sum_{i=0}^{n}a_{i}\frac{i(i+1)}{2}$<br />
<br />
$=\sum_{i=0}^{n}i\frac{i(i+1)}{2}$<br />
<br />
$=\frac{1}{2}\sum_{i=0}^{n}(i^{3}+i^{2})$<br />
<br />
$=1^{3}+2^{3}+3^{3}+.................+n^{3}+1^{2}+2^{2}+.................+n^{2}$<br />
<br />
$=\left (\frac{n(n+1)}{2} \right) ^{2}$+$\left (\frac{n(n+1)(2n+1)}{6} \right)$<br />
<br />
$ = \frac{1}{2}\left ( \left ( \sum_{i=0}^{n}a_i \right )^2 + \left ( \sum_{i=0}^{n}a_i^2 \right )\right ) $Combinatoryhttp://gateoverflow.in/119787/manipulation-of-sum?show=119819#a119819Sun, 26 Feb 2017 06:19:18 +0000Recategorized: operator overloading
http://gateoverflow.in/119748/operator-overloading?show=119748#q119748
which of the following statements are true for operator overloading in C++?<br />
<br />
a. The * operator can be overloaded to perform division<br />
b. The * operator can be overloaded to perform assignment<br />
c. ** can be overloaded to perform "to the power of"<br />
d. Operators can be overloaded only inside classesObject Oriented Programminghttp://gateoverflow.in/119748/operator-overloading?show=119748#q119748Sun, 26 Feb 2017 05:47:47 +0000Commented: GATE2013_10
http://gateoverflow.in/1419/gate2013_10?show=119818#c119818
here D is wrong bcz in srtf depends upon burst time of process and it can be varying but here they given fix time as T . this is only indication of time quantumOperating Systemhttp://gateoverflow.in/1419/gate2013_10?show=119818#c119818Sun, 26 Feb 2017 05:42:32 +0000Answered: No. of DFA's Possible
http://gateoverflow.in/115952/no-of-dfas-possible?show=119817#a119817
<p>Answer : 256</p>
<p>Explanation</p>
<p>no. of possible combinations for final states --> 4</p>
<p>no. of possible combinations for transactions from x --> 8 (2<sup>3</sup>)</p>
<p>no. of possible combinations for transactions from y --> 8 (2<sup>3</sup>)</p>
<p>thus the total possible combinations are --> 4 * 8 * 8 = 256</p>Theory of Computationhttp://gateoverflow.in/115952/no-of-dfas-possible?show=119817#a119817Sun, 26 Feb 2017 05:27:34 +0000Commented: TIFR2013-A-1
http://gateoverflow.in/25382/tifr2013-a-1?show=119816#c119816
every laddoo is shared by 6 mouse ....there are 6 triangles surrounding a laddooNumerical Abilityhttp://gateoverflow.in/25382/tifr2013-a-1?show=119816#c119816Sun, 26 Feb 2017 05:14:16 +0000Answered: The language given is L = { w | w contains an equal no of occurrences of substring 'ab' and 'ba' }. L is regular?
http://gateoverflow.in/90739/language-given-contains-equal-occurrences-substring-regular?show=119815#a119815
answer : language is regular<br />
<br />
Explanation :<br />
<br />
if you observe the language, once u get 'ab' then on the next string u could get am 'a' or 'b' making 'ba' or waiting for 'a' because on the input 'b' again. So at any point of time u can have the difference of 'ab' and 'ba' to be at most 1, not more than that. thus reducing the power of the language of a regular language.<br />
<br />
Please comment below if further clarification is needed. i will explain u with a DFA .Theory of Computationhttp://gateoverflow.in/90739/language-given-contains-equal-occurrences-substring-regular?show=119815#a119815Sun, 26 Feb 2017 05:05:37 +0000Commented: regular language
http://gateoverflow.in/116183/regular-language?show=119814#c119814
<p><a rel="nofollow" href="http://gateoverflow.in/user/Lucky+sunda">Lucky sunda</a> please explain in detail. i didn't get ur explanation</p>
<p>Why did u put 1 in place on M ?</p>Theory of Computationhttp://gateoverflow.in/116183/regular-language?show=119814#c119814Sun, 26 Feb 2017 04:49:17 +0000Answered: GATE2017-1-22
http://gateoverflow.in/118302/gate2017-1-22?show=119813#a119813
<p>Answer : 4 states</p>
<p>Explanation :</p>
<p>the given regular expression is for the language "2nd symbol from the right is b"</p>
<p>in such cases where the kth symbol from the right is asked, the no. of states in the dfa will always be 2<sup>k </sup>as we got to calculate/ keep memory of all possible strings ending combinations (2<sup>k</sup>)</p>
<p>Thus in our question, all possible strings from the right will give the answer 2<sup>2</sup>=4 states</p>Theory of Computationhttp://gateoverflow.in/118302/gate2017-1-22?show=119813#a119813Sun, 26 Feb 2017 04:37:08 +0000bubble sort
http://gateoverflow.in/119812/bubble-sort
A machine takes 200 second to sort 200 names, using bubble sort . In 800 seconds , it can approximately sort how many names?Algorithmshttp://gateoverflow.in/119812/bubble-sortSun, 26 Feb 2017 04:35:55 +0000Answered: RegulaR Expression
http://gateoverflow.in/119363/regular-expression?show=119811#a119811
(a+€) (ba) * (b+€) + a+b+ab+€<br />
<br />
Explanation :<br />
<br />
The only possible strings is a followed by b and b followed by a tht is bababa..... <br />
<br />
So we get (ba) *<br />
<br />
But strings could also start with a and could also end with b<br />
<br />
So we add (€+a) and (b+€) at the start and the end <br />
<br />
But the minimum possible string in our regular expression is ba which means we have left some strings <br />
<br />
So we add ab+a+b+€ in the end to cover all possible stringsTheory of Computationhttp://gateoverflow.in/119363/regular-expression?show=119811#a119811Sun, 26 Feb 2017 04:11:40 +0000Commented: Psus question
http://gateoverflow.in/119603/psus-question?show=119810#c119810
Strings tht get accepted by the finite automata tht is they end in final state are legal strings <br />
<br />
Those who don't, are not legal stringsTheory of Computationhttp://gateoverflow.in/119603/psus-question?show=119810#c119810Sun, 26 Feb 2017 03:49:08 +0000Answered: ISRO 2015-EC Finte State Machine
http://gateoverflow.in/119640/isro-2015-ec-finte-state-machine?show=119809#a119809
Option B<br />
<br />
Explanation :<br />
<br />
Looking at the automata, the only way to get 1 as the output is when the transaction is from s3 state to s1 state for the input symbol 1<br />
<br />
Now analyze how to reach s3, it's via the input 11 followed by 0<br />
<br />
i.e. We r looking for the pattern 1101 <br />
<br />
Only option b has this pattern twice<br />
<br />
So only option b will give 1 as output twiceTheory of Computationhttp://gateoverflow.in/119640/isro-2015-ec-finte-state-machine?show=119809#a119809Sun, 26 Feb 2017 03:43:36 +0000Commented: Madeeasy workbook
http://gateoverflow.in/57520/madeeasy-workbook?show=119808#c119808
Does this question and questions based on shannon and nyquist formula and the concept are in GATE SYllabus????<br />
<br />
pls reply as soon as possibleComputer Networkshttp://gateoverflow.in/57520/madeeasy-workbook?show=119808#c119808Sun, 26 Feb 2017 01:32:50 +0000Commented: Made easy test series
http://gateoverflow.in/116271/made-easy-test-series?show=119807#c119807
it should be reverse- starvation free implies no deadlock. Or starvation free is a stronger requirement.Databaseshttp://gateoverflow.in/116271/made-easy-test-series?show=119807#c119807Sat, 25 Feb 2017 23:14:59 +0000Commented: E R model
http://gateoverflow.in/117305/e-r-model?show=119806#c119806
i have one doubt,as Parts and TRainer has M:1 relationship,so should'nt Trainer -id also be the part of key for Parts Entity??Databaseshttp://gateoverflow.in/117305/e-r-model?show=119806#c119806Sat, 25 Feb 2017 19:38:52 +0000Commented: Discrete Math
http://gateoverflow.in/119774/discrete-math?show=119804#c119804
$\log _{y}x=\frac{1}{\log _{x}y}$Set Theory & Algebrahttp://gateoverflow.in/119774/discrete-math?show=119804#c119804Sat, 25 Feb 2017 19:09:41 +0000Answered: The number of ways of seating three gentlemen
http://gateoverflow.in/119747/the-number-of-ways-of-seating-three-gentlemen?show=119803#a119803
In four places among girls boys can be placed and arranged in 4P3 ways where P refers to permutation and girls can be arranged among themselves in 3! Ways so total number of ways is 4P3*3!ways that comes out to be 144Combinatoryhttp://gateoverflow.in/119747/the-number-of-ways-of-seating-three-gentlemen?show=119803#a119803Sat, 25 Feb 2017 18:38:07 +0000Answered: the number of ways in which 4 distinct balls
http://gateoverflow.in/119753/the-number-of-ways-in-which-4-distinct-balls?show=119802#a119802
Is answer 14?Combinatoryhttp://gateoverflow.in/119753/the-number-of-ways-in-which-4-distinct-balls?show=119802#a119802Sat, 25 Feb 2017 17:45:18 +0000Commented: Admission doubt
http://gateoverflow.in/119136/admission-doubt?show=119801#c119801
You would get many nits apart frm top 4,5 .IIITs are also option fr u.And yes stipend fr sureWritten Examhttp://gateoverflow.in/119136/admission-doubt?show=119801#c119801Sat, 25 Feb 2017 17:45:11 +0000Answer edited: ISRO2014-ECE Digital logic
http://gateoverflow.in/119650/isro2014-ece-digital-logic?show=119663#a119663
<p><span class="marker"><strong>Mux 4x1 o/p:</strong></span> 0.A<sup>c</sup>B<sup>c </sup>+ 1.A<sup>c</sup>B + 0.AB<sup>c</sup> + A .AB (assume as X)</p>
<p>or, X = 1.A<sup>c</sup>B+ A .AB</p>
<p>or, X = A<sup>c</sup>B+AB</p>
<p>or, X = B</p>
<p><strong><span class="marker">Mux 2x1 o/p:</span> Y=X. C</strong><sup>c </sup> + <strong> B. C (since X=B)</strong></p>
<p>OR,<span class="marker"> <strong>Y = BC<sup>c </sup> + B. C = <em>B</em> (OPTION D~~~~~ANSWER)</strong></span></p>
<p> </p>
<p> </p>
<p> </p>Digital Logichttp://gateoverflow.in/119650/isro2014-ece-digital-logic?show=119663#a119663Sat, 25 Feb 2017 17:44:14 +0000Commented: is JNU worth it for doing mtech in cse??
http://gateoverflow.in/119701/is-jnu-worth-it-for-doing-mtech-in-cse?show=119798#c119798
Good fr UPSC only,otherwise lots of politics less studyWritten Examhttp://gateoverflow.in/119701/is-jnu-worth-it-for-doing-mtech-in-cse?show=119798#c119798Sat, 25 Feb 2017 17:42:29 +0000Commented: which of the following is true..??
http://gateoverflow.in/117148/which-of-the-following-is-true?show=119796#c119796
why is S1 false??it is mentioned that sometimes,page fault may increaseOperating Systemhttp://gateoverflow.in/117148/which-of-the-following-is-true?show=119796#c119796Sat, 25 Feb 2017 17:35:34 +0000Commented: GATE2006-57
http://gateoverflow.in/1835/gate2006-57?show=119795#c119795
@Digvijay, How segmentation fault occurs??Programminghttp://gateoverflow.in/1835/gate2006-57?show=119795#c119795Sat, 25 Feb 2017 17:24:47 +0000Comment edited: GATE2008-IT-51
http://gateoverflow.in/3361/gate2008-it-51?show=119793#c119793
see that variable named i is created in two places.one is in main() function and other in for loop block.This way you will find that you are wrongProgramminghttp://gateoverflow.in/3361/gate2008-it-51?show=119793#c119793Sat, 25 Feb 2017 15:52:15 +0000Commented: ISI 2016 PCB C3
http://gateoverflow.in/119710/isi-2016-pcb-c3?show=119792#c119792
I mean to say there are 65536 elements in 1 column and rite I have nt used LRU and in your answer u have replaced 8th frame should nt we replace 1frameOperating Systemhttp://gateoverflow.in/119710/isi-2016-pcb-c3?show=119792#c119792Sat, 25 Feb 2017 13:58:19 +0000Commented: Demand Paging
http://gateoverflow.in/110724/demand-paging?show=119791#c119791
First I will calculate average memory access time 0.80*(20+75)+.20*(20+4*75) that will come out to be 140ns now after that average instructions execution time .15*(.75*(75+2*5*10^(5))+.25*(75+1*5*10^(5))+(1-1.5)*140 that will come out to be 131191 ns approx here page fault service time not given so I have indirectly calculated to be page swap time plus writing it to disk if it is dirty read lus updating page table if it is nt dirty read then only swaping and udating page table and it is right swap space is part of disk plz correct if it is wrongOperating Systemhttp://gateoverflow.in/110724/demand-paging?show=119791#c119791Sat, 25 Feb 2017 13:42:31 +0000Comment edited: C. L. Liu 3.38(b)
http://gateoverflow.in/119745/c-l-liu-3-38-b?show=119789#c119789
@Akriti<br />
<br />
I first partitioned $3n+1$ objects into two disjoint sets, one having all $n$ identical objects (A) and other having rest of them (B).<br />
<br />
Now to choose $n$ objects from $3n+1$, $k$ will be from set A. As they all are identical there is just one way to make this selection, rest of the $n - k$ will be chosen from B, using $\binom{2n+1}{n - k}$, where $k$ ranges from 0 to n.Combinatoryhttp://gateoverflow.in/119745/c-l-liu-3-38-b?show=119789#c119789Sat, 25 Feb 2017 11:47:58 +0000Commented: LEARNING LINUX--- Beginner's Guide to linux
http://gateoverflow.in/119324/learning-linux-beginners-guide-to-linux?show=119788#c119788
@shikar You can definitely use Kali Linux. Coz d commands of Unix r irrespective of its Flavors. By Flavor I meant various types of Unix Based Operating System. It's not just d case with Ubuntu. If u r fine with d basics then you should definitely advance towards higher system level programming. Yeah. :). I worked on ubuntu earlier. D commands and d basic shell scripts don't change though at all. However, there's a difference. As regards d inbuilt shell in different flavors is different. And d type of prompt tells d type of inbuilt shell supported by dat type of Unix Based Operating System. Please go ahead and use it. Encounter any difficulties share it here. It'll be really helpful if individual doubts r discussed. Okay. :)Othershttp://gateoverflow.in/119324/learning-linux-beginners-guide-to-linux?show=119788#c119788Sat, 25 Feb 2017 11:39:34 +0000Commented: GATE2017-1-48
http://gateoverflow.in/118331/gate2017-1-48?show=119784#c119784
the meaning of probe ? is it ok ?Algorithmshttp://gateoverflow.in/118331/gate2017-1-48?show=119784#c119784Sat, 25 Feb 2017 09:57:47 +0000Answer selected: Is it possible to have a function call on the left hand side of the equality operator?
http://gateoverflow.in/119756/possible-have-function-call-left-hand-side-equality-operator?show=119769#a119769
<pre class="prettyprint lang-c_cpp">
#include<stdio.h>
int gA = 5;
int* fun()
{
return &gA;
}
int main()
{
*(fun()) = 5;
printf("%d", gA);
}</pre>
<p>So, answer is C? No, because we used a '*' operator and only after it (getting lvalue) we could use "=" operator. But in C++ language we can use</p>
<pre class="prettyprint lang-c_cpp">
#include<stdio.h>
int gA = 5;
int& fun()
{
return gA;
}
int main()
{
fun() = 5;
printf("%d", gA);
}</pre>
<p>So, answer is D</p>Object Oriented Programminghttp://gateoverflow.in/119756/possible-have-function-call-left-hand-side-equality-operator?show=119769#a119769Sat, 25 Feb 2017 09:49:27 +0000Commented: #probability_doubt_in_basic_concept
http://gateoverflow.in/119694/%23probability_doubt_in_basic_concept?show=119781#c119781
free time..use as many colours as possible :)Numerical Abilityhttp://gateoverflow.in/119694/%23probability_doubt_in_basic_concept?show=119781#c119781Sat, 25 Feb 2017 09:33:38 +0000Answered: Probability
http://gateoverflow.in/119765/probability?show=119777#a119777
We have 15 balls out of which 9 balls have not been previously used, so the remaining 6 balls are already used.<br />
<br />
Let E1 be the first event when the 3 balls are randomly chosen and played with.<br />
<br />
Now when choosing 3 balls, the combination can be <br />
<br />
choosing all 3 unused, 2 unused and 1 used, 1 unused and 2 used & all 3 used.<br />
<br />
So P(E1) = $\sum_{n=0}^{3} \binom{9}{n}*\binom{6}{3-n} / \binom{15}{3}$<br />
<br />
Here n is the no of unused balls. For eg:- when n is 1, we can choose 1 unused ball from 9 unused in (9c1) ways and remaining 2 from 6 used balls in (6c2) ways .<br />
<br />
Now let E2 be event of picking 3 unused balls after E1. <br />
<br />
Then P(E2) = $\sum_{n=0}^{3} \binom{9-n}{3} / \binom{15}{3}$. Here n is the no of unused balls chosen after event E1. If suppose in E1, 1 unused and 2 used balls were chosen then P(E2) =((9-1)c3 /15c3) [9-1 because out of 9 unused balls, 1 ball is chosen]<br />
<br />
Now total probability =P(E1)*P(E2)<br />
<br />
=$\sum_{n=0}^{3} \binom{9}{n}*\binom{6}{3-n} /\binom{15}{3} * \binom{9-n}{3}/\binom{15}{3}$<br />
<br />
=0.089Numerical Abilityhttp://gateoverflow.in/119765/probability?show=119777#a119777Sat, 25 Feb 2017 08:45:03 +0000Commented: GATE2017-2-17
http://gateoverflow.in/118157/gate2017-2-17?show=119770#c119770
I am still confused between One to Many and Many to One... Any Good Comparisions available?Databaseshttp://gateoverflow.in/118157/gate2017-2-17?show=119770#c119770Sat, 25 Feb 2017 07:39:16 +0000Answered: probability
http://gateoverflow.in/119705/probability?show=119768#a119768
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=5693252449516876165"></p>
<p> </p>
<ul>
<li>$\begin{align*} \frac{2}{7}*\frac{1}{4} + \frac{2}{7}*\frac{1}{6} + \frac{2}{7}*\frac{1}{6} + \frac{1}{7}*\frac{1}{9} = \frac{23}{126} \\ \end{align*}$</li>
</ul>
<p> </p>Numerical Abilityhttp://gateoverflow.in/119705/probability?show=119768#a119768Sat, 25 Feb 2017 06:57:51 +0000Commented: Unix INODE
http://gateoverflow.in/20440/unix-inode?show=119767#c119767
<p>For q2) Max possible size of file system <img alt="" src="http://latex.codecogs.com/gif.latex?%5Cinline%20%3D2%5E%7B64%7D%5Ctimes%202%5E%7B17%7D%3D2%5E%7B81%7D%5Ctext%7BB%7D"> (8 byte address = 64 bit)</p>
<p>But for q2, its explicitly given as 300GB. So 300GB is the final answer, right? Since 300GB < $2^{81}$ B</p>Operating Systemhttp://gateoverflow.in/20440/unix-inode?show=119767#c119767Sat, 25 Feb 2017 06:27:40 +0000Answered: A closet has 5 pair of shoes.
http://gateoverflow.in/119749/a-closet-has-5-pair-of-shoes?show=119763#a119763
<p><a rel="nofollow" href="http://math.stackexchange.com/questions/204864/number-of-ways-to-choose-shoes-so-that-there-will-be-no-complete-pair">http://math.stackexchange.com/questions/204864/number-of-ways-to-choose-shoes-so-that-there-will-be-no-complete-pair</a></p>
<p>5c4*2<sup>4</sup></p>Combinatoryhttp://gateoverflow.in/119749/a-closet-has-5-pair-of-shoes?show=119763#a119763Sat, 25 Feb 2017 02:31:54 +0000Answered: ISRO2016-ECE Digital logic
http://gateoverflow.in/119513/isro2016-ece-digital-logic?show=119762#a119762
As far as i know Ripple counter may require maximum decoding ckt. <br />
<br />
A johnson counter divides the clk by the factor of 2N where N is no. Of ff required.<br />
<br />
A ring counter can also be worked out be a simple shift register. And work synchronously.<br />
<br />
A ripple counter however requires maximum propagation delay for counting therefore increasing the number of ckt for every count exceeded.Digital Logichttp://gateoverflow.in/119513/isro2016-ece-digital-logic?show=119762#a119762Sat, 25 Feb 2017 01:48:22 +0000Edited: GATE2017-2-13
http://gateoverflow.in/118253/gate2017-2-13?show=118253#q118253
<p>A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers <strong>FRONT </strong>and <strong>REAR </strong>pointing to the front node and the rear node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in $O(1)$ time?</p>
<p>(I) Next pointer of front node points to the rear node.</p>
<p>(II) Next pointer of rear node points to the front node.</p>
<p>(A) (I) only.</p>
<p>(B) (II) only.</p>
<p>(C) Both (I) and (II).</p>
<p>(D) Neither (I) nor (II).</p>DShttp://gateoverflow.in/118253/gate2017-2-13?show=118253#q118253Fri, 24 Feb 2017 19:01:09 +0000Edited: Sequential Circuit
http://gateoverflow.in/116877/sequential-circuit?show=116877#q116877
<p>The following sequential circuit has initial state Q<sub>A</sub>Q<sub>B</sub> = 00 with one input X and one output Z.</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=5308560153302113626"></p>
<p>What is the minimum input sequence which takes the machine to state 11?</p>
<p>(A) 00</p>
<p>(B) 10</p>
<p>(C) 11</p>
<p>(D) State 11 is not reachable</p>Digital Logichttp://gateoverflow.in/116877/sequential-circuit?show=116877#q116877Fri, 24 Feb 2017 18:40:31 +0000Answer selected: ISRO2015-EC Pipelining
http://gateoverflow.in/119643/isro2015-ec-pipelining?show=119722#a119722
I think answer should be d becoz maximum clock frequency means minimum clock timeCO & Architecturehttp://gateoverflow.in/119643/isro2015-ec-pipelining?show=119722#a119722Fri, 24 Feb 2017 17:19:50 +0000Closed: segmentation fault or compilation error ?
http://gateoverflow.in/119758/segmentation-fault-or-compilation-error?show=119758#q119758
<div style="margin-left:21.3pt;">Consider this C code to swap two integers and these five statements :</div>
<div style="margin-left:21.3pt;">void swap (int * px, int * py)</div>
<div style="margin-left:21.3pt;">{</div>
<div style="margin-left:21.3pt;"> * px = *px – *py ;</div>
<div style="margin-left:21.3pt;"> *py = *px + *py;</div>
<div style="margin-left:21.3pt;"> *px = *py – *px;</div>
<div style="margin-left:21.3pt;">}</div>
<div style="margin-left:21.3pt;">S1 : Will generate a compilation error</div>
<div style="margin-left:21.3pt;">S2 : May generate a segmentation fault at runtime depending on the arguments passed</div>
<div style="margin-left:21.3pt;">S3 : Correctly implement the swap procedure for all input pointers referring to integers stored in memory locations accessible to the process</div>
<div style="margin-left:21.3pt;">S4 : Implements the swap procedure correctly for some but not all valid input pointers.</div>
<div style="margin-left:21.3pt;">S5 : May add or subtract integers and pointers.</div>
<div style="margin-left:21.3pt;">(A) S1 (B) S2 and S3 <strong> </strong>(C) S2 and S4 (D) S2 and S5</div>Programminghttp://gateoverflow.in/119758/segmentation-fault-or-compilation-error?show=119758#q119758Fri, 24 Feb 2017 17:11:27 +0000Interest
http://gateoverflow.in/119755/interest
Has anybody tried their hands in Raspberry Pi? Or have an experience with Arduino?? I meant in terms of practical exposure. If yes, kindly share your valuable insights and thoughts as well.Compilers, Architecture, HPChttp://gateoverflow.in/119755/interestFri, 24 Feb 2017 15:55:59 +0000Answer selected: The number of functions f from
http://gateoverflow.in/119739/the-number-of-functions-f-from?show=119742#a119742
<p>there are 5 elements which are multiple of 4 . There are 6 elements which are multiple of 3 .</p>
<p>so the elements which are multiple of 4 are <strong>only mapped to</strong> one in the elements which are multiple of 3.</p>
<p>for remaining 15 elements we can map to any one of 20 elements.</p>
<p> 6<sup>5</sup> * 20<sup>15</sup></p>Combinatoryhttp://gateoverflow.in/119739/the-number-of-functions-f-from?show=119742#a119742Fri, 24 Feb 2017 15:22:40 +0000Commented: GATE2013_36
http://gateoverflow.in/1547/gate2013_36?show=119754#c119754
@Amar, Why you've multiplied 2 with the propagation time??Computer Networkshttp://gateoverflow.in/1547/gate2013_36?show=119754#c119754Fri, 24 Feb 2017 15:11:46 +0000Commented: TesT series question
http://gateoverflow.in/114007/test-series-question?show=119752#c119752
Yes, it is binomial.Numerical Abilityhttp://gateoverflow.in/114007/test-series-question?show=119752#c119752Fri, 24 Feb 2017 14:45:28 +0000Answer selected: let S={1,2,...,100}.
http://gateoverflow.in/119740/let-s-1-2-100?show=119744#a119744
<p>total no.of subsets= 2<sup>100</sup></p>
<p>no.of subsets, the products of elements in that set is odd= 2<sup>50</sup> (including empty set)</p>
<p>so no.of subsets, the products of elements in that set is even =2<sup>100</sup> - 2<sup>50</sup></p>Combinatoryhttp://gateoverflow.in/119740/let-s-1-2-100?show=119744#a119744Fri, 24 Feb 2017 13:35:06 +0000Answered: consider the quadratic equation of the form x2+bx+c=0
http://gateoverflow.in/119738/consider-the-quadratic-equation-of-the-form-x2-bx-c-0?show=119743#a119743
<p>a....<img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=14271587722302102303"></p>Combinatoryhttp://gateoverflow.in/119738/consider-the-quadratic-equation-of-the-form-x2-bx-c-0?show=119743#a119743Fri, 24 Feb 2017 13:15:52 +0000Let X={a1,a2,...,a7} be a set of seven elements and Y={b1,b2,b3} a set of three elements.
http://gateoverflow.in/119741/let-a2-be-set-of-seven-elements-and-b1-b2-b3-set-three-elements
<p>Let X={a1,a2,...,a7} be a set of seven elements and Y={b1,b2,b3} a set of three elements. The number of functions f from X to Y such that {i} f is onto and {ii}there are exactly three statements x in X such that f(x)=b<sub>1</sub>,is </p>Combinatoryhttp://gateoverflow.in/119741/let-a2-be-set-of-seven-elements-and-b1-b2-b3-set-three-elementsFri, 24 Feb 2017 13:02:47 +0000lets A1,A2,A3 be three points on a straight line
http://gateoverflow.in/119737/lets-a1-a2-a3-be-three-points-on-a-straight-line
lets A1,A2,A3 be three points on a straight line. Lets B1,B2,B3,B4,B5 be five points on a straight line parallel to first one. Each of the three points on the first line is joined by a straight line to each of the five points on the second line. Further,no three or more of these joining lines met at a point except possibly at the A's or B's. Then the number of point of intersection of the joining lines lying between the two given straight lineCombinatoryhttp://gateoverflow.in/119737/lets-a1-a2-a3-be-three-points-on-a-straight-lineFri, 24 Feb 2017 12:20:34 +0000