GATE Overflow - Recent questions without answers
http://gateoverflow.in/unanswered
Powered by Question2AnswerGraph Explanation-Somebody please kindly explain this graph.
http://gateoverflow.in/127263/graph-explanation-somebody-please-kindly-explain-this-graph
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=14252718235649527488"></p>Algorithmshttp://gateoverflow.in/127263/graph-explanation-somebody-please-kindly-explain-this-graphFri, 28 Apr 2017 16:40:43 +0000How to find address of an element in array in Binary
http://gateoverflow.in/127224/how-to-find-address-of-an-element-in-array-in-binary
<p>Let's say we have an array of 5 elements.</p>
<p>Array index starts from 0 </p>
<p>Base address of Array = 100 </p>
<p>size of each element is 2 ie it's an int array</p>
<p>Now we want to find the 2nd element ie A[2]. </p>
<p>So, the procedure is like - </p>
<p> </p>
<p>A[2] = Base address + (index*size of each element in memory)</p>
<p>A[2] = <strong>100+(2*2)</strong></p>
<p>Now how to find the BOLD text ie address of 2nd element in BINARY?!</p>
<p> </p>
<p>Thanks</p>Programminghttp://gateoverflow.in/127224/how-to-find-address-of-an-element-in-array-in-binaryFri, 28 Apr 2017 07:21:34 +0000Doubt
http://gateoverflow.in/127223/doubt
<p>Is it possible to prove number of b's=2k+1 and any number of a's is regular using <a rel="nofollow" href="https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&ved=0ahUKEwi4yNjRzcbTAhXLuI8KHVAzB1oQFggiMAA&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FMyhill%25E2%2580%2593Nerode_theorem&usg=AFQjCNEazMnCEMzeY1FyffwRlchDbg7ZeA&sig2=YLVrtNqzKv3n0igJP5IFfw">Myhill–Nerode theorem</a> ?</p>Theory of Computationhttp://gateoverflow.in/127223/doubtFri, 28 Apr 2017 07:17:16 +0000Rosen discrete mathematics
http://gateoverflow.in/127187/rosen-discrete-mathematics
The number of paths of length 5 between two different<br />
vertices in K4 (complete graph)?Graph Theoryhttp://gateoverflow.in/127187/rosen-discrete-mathematicsFri, 28 Apr 2017 01:24:07 +0000Rosen discrete mathematics
http://gateoverflow.in/127186/rosen-discrete-mathematics
a)The number of paths of length 4 between any two<br />
adjacent vertices in K3,3 (bipartite graph)?<br />
<br />
b) The number of paths of length 4 between any two<br />
nonadjacent vertices in K3,3 (bipartite graph)?Graph Theoryhttp://gateoverflow.in/127186/rosen-discrete-mathematicsFri, 28 Apr 2017 01:23:43 +0000Computer Networks
http://gateoverflow.in/127185/computer-networks
<p>I have confusion between the following terms:</p>
<ul>
<li>process to process delivery</li>
<li>node to node delivery </li>
<li>host to host delivery</li>
<li>end to end delivery</li>
</ul>
<p>which layer provides which service and the major confusion is in the difference between them?</p>Computer Networkshttp://gateoverflow.in/127185/computer-networksThu, 27 Apr 2017 20:46:13 +0000Book corman
http://gateoverflow.in/127183/book-corman
How many elements of the in- put sequence need to be checked on the average, assuming that the element being searched for is equally likely to be any element in the array? How about in the worst case? What are the average-case and worst-case running times of linear search in O notation? Justify your answers.Algorithmshttp://gateoverflow.in/127183/book-cormanThu, 27 Apr 2017 19:20:57 +0000iit bombay ra interview call letter cse
http://gateoverflow.in/127174/iit-bombay-ra-interview-call-letter-cse
Even after having a gate score of 690 i havent received a RA written test call letter from IIT BOMBAY (CSE dept). Why is this so?<br />
<br />
Has anyone else with the same range of score received a call letter?IISc/IITshttp://gateoverflow.in/127174/iit-bombay-ra-interview-call-letter-cseThu, 27 Apr 2017 17:00:49 +0000Selection sort and Insertion sort
http://gateoverflow.in/127129/selection-sort-and-insertion-sort
Selection sort is an example of ____(I)_______ and insertion sort is an example of __(II)______.<br />
<br />
a) I- Greedy, II- Brute Force<br />
<br />
b) I- Brute Force II- Divide and conquer<br />
<br />
c) I- Greedy II- Divide and conquer<br />
<br />
d) I- Brute Force II- Brute ForceAlgorithmshttp://gateoverflow.in/127129/selection-sort-and-insertion-sortThu, 27 Apr 2017 11:37:18 +0000Block replacement in cache
http://gateoverflow.in/127124/block-replacement-in-cache
How we replace blocks in k-way set associative cache ? What strategy we follow?CO & Architecturehttp://gateoverflow.in/127124/block-replacement-in-cacheThu, 27 Apr 2017 10:47:09 +0000databases
http://gateoverflow.in/127078/databases
Which of the following statements is TRUE ?<br />
<br />
A) Every primary index is also a clustered index.<br />
<br />
B) Every clustered index is also a primary index.<br />
<br />
C) Both primary index and clustered index are one and the same,<br />
<br />
D) An index can be either primary or clustered but not both.Databaseshttp://gateoverflow.in/127078/databasesThu, 27 Apr 2017 04:32:32 +0000Complexity
http://gateoverflow.in/127073/complexity
We have for Counting Sort, O(n+k), for a simple uniform hashing, search operation of O(1+alpha) etc. What is the meaning when we say n + k? Is it that counting sort will depend on either n or k? Because there are separate loops in counting sort running on O(n) and O(k) separately. What does O(n + k) mean? What kind of algorithms have this summation for their order, generally?Algorithmshttp://gateoverflow.in/127073/complexityThu, 27 Apr 2017 03:05:44 +0000GATE 2017
http://gateoverflow.in/127068/gate-2017
At AIR 205 and score-799(general category) in gate 2017 cs, how much chance do i have in getting into iitkgp?IISc/IITshttp://gateoverflow.in/127068/gate-2017Wed, 26 Apr 2017 21:14:56 +0000Peripheral devices : CAO
http://gateoverflow.in/127065/peripheral-devices-cao
Consider READ and WRITE bits:<br />
<br />
a) Both are written by CPU<br />
<br />
b) Both are written by peripheral<br />
<br />
c) READ bit is written by peripheral while WRITE bit is written by CPU<br />
<br />
d) WRITE bit is written by peripheral while READ bit is written by CPUCO & Architecturehttp://gateoverflow.in/127065/peripheral-devices-caoWed, 26 Apr 2017 19:30:25 +0000pointer to array
http://gateoverflow.in/127061/pointer-to-array
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=15544348394448950848"></p>
<p> </p>
<p> </p>
<p> </p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=7426546527867184465"></p>
<p>how this question gives -3? according to rule both pointers must pointing to same array then only difference ie ptr1-ptr2 is used but here how answer always is -3???</p>
<p>Turbo c also giving -3.</p>Programminghttp://gateoverflow.in/127061/pointer-to-arrayWed, 26 Apr 2017 17:49:02 +0000databases
http://gateoverflow.in/127059/databases
<p>This index is a dense index ...right ...???</p>
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=16069362650942805401"></p>Databaseshttp://gateoverflow.in/127059/databasesWed, 26 Apr 2017 17:29:10 +0000ISI 2016-PCB C4
http://gateoverflow.in/127056/isi-2016-pcb-c4
Commodity items have some positive or negative changes in their<br />
prices each week. Each trading company picks a portfolio of commodity items, that is, they have one or more items and they own<br />
some non-zero quantity of each one. The database table for this problem consists of the following two relations:<br />
<br />
Commodity(item-number int, price-change oat, week int),<br />
Owns(company-name text, item-number int, quantity oat).<br />
<br />
Write an SQL query which returns the item-numbers of commodities for which, in any given week, the price change is greater than or equal to that of all other items and there exists at least one company selling that item only (i.e., not selling any other item) in that week.Databaseshttp://gateoverflow.in/127056/isi-2016-pcb-c4Wed, 26 Apr 2017 16:54:42 +0000operating system
http://gateoverflow.in/127052/operating-system
a) What is the role of OS as resource manager?<br />
<br />
b) What is the need of page replacement?<br />
<br />
c) From where to study device management policies in GALVIN?<br />
<br />
d) How is software trap used in OS design?<br />
<br />
e) What is the purpose of paging the page tables?<br />
<br />
f) How to find physical address in case of segmentation?Operating Systemhttp://gateoverflow.in/127052/operating-systemWed, 26 Apr 2017 14:10:47 +0000Admission
http://gateoverflow.in/127051/admission
How is NIT ALLAHABAD for Mtech?NITshttp://gateoverflow.in/127051/admissionWed, 26 Apr 2017 14:00:13 +0000operating systems
http://gateoverflow.in/127049/operating-systems
What is the role of file system in OS?<br />
<br />
<br />
<br />
Thank YouOperating Systemhttp://gateoverflow.in/127049/operating-systemsWed, 26 Apr 2017 13:48:26 +0000operating systems
http://gateoverflow.in/127048/operating-systems
what is i/o traffic controller and it's functions in operating system?<br />
<br />
And also from where to study it in GALVIN?Operating Systemhttp://gateoverflow.in/127048/operating-systemsWed, 26 Apr 2017 13:44:38 +0000ISI 2014 C2
http://gateoverflow.in/127042/isi-2014-c2
S[1 . . . n] is a sorted array of n integers, where n is even. A new<br />
array S′ is generated by swapping some elements in odd-numbered<br />
positions in the first half of S with some elements in odd-numbered<br />
positions in the second half of S. Note that the elements in the even numbered positions are the same in both S and S′, whereas each element in an odd-numbered position in S takes part in at most one swap.<br />
Write an O(log n) algorithm that takes S′ and an integer x as inputs<br />
and finds whether x is present in S′ or notAlgorithmshttp://gateoverflow.in/127042/isi-2014-c2Wed, 26 Apr 2017 12:50:47 +0000Gate 2018 schedule
http://gateoverflow.in/127041/gate-2018-schedule
When will gate 2018 schedule come out? Last year this time it was out for gate 2017Study Resourceshttp://gateoverflow.in/127041/gate-2018-scheduleWed, 26 Apr 2017 12:40:33 +0000random access
http://gateoverflow.in/127032/random-access
PURE ALOHA:<br />
<br />
Vulnerable time:<br />
<br />
Let us find the length of time, the vulnerable time, in which there<br />
is a possibility of collision. We assume that the stations send fixed-length frames with<br />
each frame taking T to send.<br />
<br />
---------------------------------------------------------------------------------------------------------------------------------------------------<br />
<br />
so in pure aloha <br />
<br />
vulnerable time(VT)<br />
<br />
VT = 2 * transmission time <br />
<br />
OR<br />
<br />
VT = 2 * prapogation time<br />
<br />
i m confused?????????????????????Computer Networkshttp://gateoverflow.in/127032/random-accessWed, 26 Apr 2017 10:52:52 +0000databases
http://gateoverflow.in/127020/databases
<p>State TRUE or FALSE.</p>
<p><em>"In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1".</em></p>
<p>Please support your answer with explanations ...</p>
<p> </p>Databaseshttp://gateoverflow.in/127020/databasesWed, 26 Apr 2017 09:29:13 +0000Modified form of gate - 2000 , ISRO 2015
http://gateoverflow.in/127011/modified-form-of-gate-2000-isro-2015
<pre class="prettyprint lang-c_cpp">
#include<stdio.h>
struct
{
short x[5];
union
{
float y;
long z;
}u;
}t;
int main()
{
printf("short=%d\n",sizeof(short));
printf("float=%d\n",sizeof(float));
printf("long=%d\n",sizeof(long));
printf("%d",sizeof(t));
return 0;
}</pre>
<p>Answer should be 14 but why the answer is 16 ?</p>
<p>Note : short : 2 bytes , float : 4 bytes , long : 4 bytes</p>Programminghttp://gateoverflow.in/127011/modified-form-of-gate-2000-isro-2015Wed, 26 Apr 2017 08:18:21 +0000DM controller
http://gateoverflow.in/126987/dm-controller
What is the difference between DM controller and micropcessor. <br />
<br />
Block diagram of the device seems similar , both contains pins. Then how they are different from each other?CO & Architecturehttp://gateoverflow.in/126987/dm-controllerWed, 26 Apr 2017 04:26:38 +0000UGC Net Query
http://gateoverflow.in/126976/ugc-net-query
<p>The query may sound trivial but (my bad) I have no knowledge about such exam. I am not much aware about UGC-NET exam for Computer Science and came to come about such an exam recently. I wanted to know,</p>
<ul>
<li>What is the eligibility of this exam ? Does it require MTech ?</li>
<li>What are the career prospects ? </li>
<li>What is the score validity?</li>
<li>What is the max age limit ?</li>
</ul>
<p>Anything else that would be useful to know.</p>CBSE/UGC NEThttp://gateoverflow.in/126976/ugc-net-queryWed, 26 Apr 2017 03:05:23 +0000peter linz excercise
http://gateoverflow.in/126906/peter-linz-excercise
<p><img alt="No automatic alt text available." src="https://scontent-sit4-1.xx.fbcdn.net/v/t1.0-9/18157324_1309619519074438_2239952107950417207_n.jpg?oh=5c8e2c92f692e1b22afde013ea41dee1&oe=59748974"></p>Theory of Computationhttp://gateoverflow.in/126906/peter-linz-excerciseTue, 25 Apr 2017 06:05:59 +0000Standard books PDF.
http://gateoverflow.in/126865/standard-books-pdf
Anyone is having standard book for coa hamachare 7 edition pls share link.Othershttp://gateoverflow.in/126865/standard-books-pdfMon, 24 Apr 2017 23:26:14 +0000decomposition is lossy or lossless
http://gateoverflow.in/126856/decomposition-is-lossy-or-lossless
<p> </p>
<p><img alt="Image may contain: text" src="https://scontent-sit4-1.xx.fbcdn.net/v/t1.0-9/18118536_1309049152464808_4176957638768214882_n.jpg?oh=9513f8c1dac252183b87bd9b235e5133&oe=59961B91"></p>
<p>R Decomposed into R1(BCD) and R2(CA) </p>
<p><img alt="Image may contain: text" src="https://scontent-sit4-1.xx.fbcdn.net/v/t1.0-9/18157559_1309040765798980_8184547347839122868_n.jpg?oh=3d5c414ebe1c195e9b40652e7487740c&oe=597885AE"></p>
<p> </p>
<p> </p>Databaseshttp://gateoverflow.in/126856/decomposition-is-lossy-or-losslessMon, 24 Apr 2017 18:29:44 +0000Is last year
http://gateoverflow.in/126780/is-last-year
Angles between any pair of 4 main diagonals of a cube are?Other Collegeshttp://gateoverflow.in/126780/is-last-yearMon, 24 Apr 2017 05:49:16 +0000General Query
http://gateoverflow.in/126761/general-query
I have heard that for exams like Gate and Ugc Net, exam pattern will be divided into 2 parts like pre and mains.<br />
<br />
And moreover, MHRD may plan to set maximum number of attempts and age limit for Gate exam?<br />
<br />
Is it true?GATEhttp://gateoverflow.in/126761/general-queryMon, 24 Apr 2017 01:36:49 +0000How is IIITA for Placements? If not, is Phd good from IIiTA?
http://gateoverflow.in/126701/how-is-iiita-for-placements-if-not-is-phd-good-from-iiita
Written Examhttp://gateoverflow.in/126701/how-is-iiita-for-placements-if-not-is-phd-good-from-iiitaSun, 23 Apr 2017 13:12:05 +0000array of pointer
http://gateoverflow.in/126672/array-of-pointer
<pre class="prettyprint lang-c_cpp">
void main()
{
int a[][3]={ {4,14,24}
{5,15,25}
{6,16,26} };
int *ptr[3];
int **pptr;
ptr[0]=a;
ptr[1]=a+1;
ptr[2]=a+2;
pptr=ptr;
++*ptr;
++ptr[0];
++**pptr;
++**pptr[0];
++pptr;
++*pptr;
--*ptr[1];
--*pptr;
++pptr;
++*pptr;
--ptr[2];
--*pptr;
++*ptr[2];
pf("a[0][2],a[1][1],a[2][0]");
pf("*(*(a+0)+2),*(*(a+1)+1),*(*(a+2)+0");
getch();
}
</pre>
<p>
<br>
any one explain this program line by line???</p>Programminghttp://gateoverflow.in/126672/array-of-pointerSun, 23 Apr 2017 09:49:44 +0000Admission to IIT wiith rank of 1225 and OBC category
http://gateoverflow.in/126644/admission-to-iit-wiith-rank-of-1225-and-obc-category
I have a rank of 1225, my gate cutoff is 647 and I belong OBC (non creamy layer) category. What all college can I expect to get in ? Will I be able to get into any of the old IITs ? I am interested in MEIISc/IITshttp://gateoverflow.in/126644/admission-to-iit-wiith-rank-of-1225-and-obc-categorySun, 23 Apr 2017 07:16:29 +0000theory of computation
http://gateoverflow.in/126641/theory-of-computation
<p>Consider the following statements.</p>
<p><strong>S1 :</strong> union of any finite number of countable sets is countable.</p>
<p><strong>S2 :</strong> union of infinite number of countable sets is countable </p>
<p><strong>S3 : </strong>cross product of any finite number of countable sets is countable.</p>
<p><strong>S4 :</strong> cross product of infinite number of countable sets is countable.</p>
<p>Which of the above statements is TRUE ?</p>
<p>A) Only S1</p>
<p>B) Only S1) and S3)</p>
<p>C) Only S1),S2),S3)</p>
<p>D) All of S1),S2),S3),S4)</p>
<p> </p>
<p> </p>Theory of Computationhttp://gateoverflow.in/126641/theory-of-computationSun, 23 Apr 2017 06:48:50 +0000MS Test In IIT Mandi
http://gateoverflow.in/126592/ms-test-in-iit-mandi
How should I prepare for interview/written test at IIT Mandi for admission in MS in Computer Science?Written Examhttp://gateoverflow.in/126592/ms-test-in-iit-mandiSat, 22 Apr 2017 14:09:40 +0000i want to read Tanenbaum Datastructure book. Can anyone tell me the source of pdf Tanenbaum Datastructure book ?
http://gateoverflow.in/126578/tanenbaum-datastructure-anyone-tanenbaum-datastructure
i want to read Tanenbaum Datastructure book. Can anyone tell me the source of pdf Tanenbaum Datastructure book ?Programminghttp://gateoverflow.in/126578/tanenbaum-datastructure-anyone-tanenbaum-datastructureSat, 22 Apr 2017 12:28:28 +0000Linear algebra
http://gateoverflow.in/126560/linear-algebra
Which book to study for Linear algebra grewal or Gilbert Strang from gate perspective?Linear Algebrahttp://gateoverflow.in/126560/linear-algebraSat, 22 Apr 2017 10:48:33 +0000Difference bétween distance vector routing and link state routing
http://gateoverflow.in/126555/difference-b%C3%A9tween-distance-vector-routing-state-routing
I'm confused with these two please can some explainComputer Networkshttp://gateoverflow.in/126555/difference-b%C3%A9tween-distance-vector-routing-state-routingSat, 22 Apr 2017 09:57:17 +0000Can any one tell me about IIIT Alahabad , I want to become professor .Is it good to take admission in it ?
http://gateoverflow.in/126554/tell-about-iiit-alahabad-want-become-professor-good-admission
Gate Score 618<br />
<br />
Rank 1570Written Examhttp://gateoverflow.in/126554/tell-about-iiit-alahabad-want-become-professor-good-admissionSat, 22 Apr 2017 09:26:48 +0000How we decide address bit to select bit from one row?
http://gateoverflow.in/126551/how-we-decide-address-bit-to-select-bit-from-one-row
It is given that for 4096 cells in each row are divided in to 512 groups of 8. Therefore address bits are of 12 to select row and 9 are to select a bit from a selected row. <br />
<br />
My question is how we decide this 9 bits for one row in order to select one bit ?CO & Architecturehttp://gateoverflow.in/126551/how-we-decide-address-bit-to-select-bit-from-one-rowSat, 22 Apr 2017 08:15:51 +0000IIT-Madras MS
http://gateoverflow.in/126550/iit-madras-ms
<p>According to <a rel="nofollow" href="https://research.iitm.ac.in/">https://research.iitm.ac.in/</a>, Admission for M.S Online application portal for Academic year 2017 - 2018 will be open tentatively from 19.04.2017. But the portal has not opened since 19th April.</p>
<p>Would anyone be aware whether new registrations are allowed/not?</p>
<p>I need to register as I missed to apply by 2nd April. I had called IIT-Madras.They told to wait till 21st April, but there is no registrations link on the website. </p>Written Examhttp://gateoverflow.in/126550/iit-madras-msSat, 22 Apr 2017 08:08:38 +0000theory of computation
http://gateoverflow.in/126487/theory-of-computation
<p>L = { <M,w> / M is a TM,w is a string and M on simulating w,the Read/write head of M moves 100 steps away from the left most symbol of input }.Assume initially the Read/write head is in left-most symbol of input. </p>
<p>MY ANSWER : This language is <em><strong>Recursively enumerable but not recursive</strong></em> ...right ??? </p>Theory of Computationhttp://gateoverflow.in/126487/theory-of-computationFri, 21 Apr 2017 17:12:22 +0000theory of computation
http://gateoverflow.in/126455/theory-of-computation
<p>This language,</p>
<p>L = { <M,w> / M is a TM,w is a string and M does not halt on string w }</p>
<p>is<strong> <em>not recursively enumerable</em></strong> ...right ???</p>Theory of Computationhttp://gateoverflow.in/126455/theory-of-computationFri, 21 Apr 2017 11:52:03 +0000theory of computation
http://gateoverflow.in/126452/theory-of-computation
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=8993467309629943550"></p>
<p>why the above language is not Recursively enumerable ??? please explain </p>Theory of Computationhttp://gateoverflow.in/126452/theory-of-computationFri, 21 Apr 2017 11:23:00 +0000theory of computation
http://gateoverflow.in/126424/theory-of-computation
<p>Which of the following languages below are NOT recursively enumerable ?</p>
<p>L<sub>1</sub> = {<M> / M is a TM that accepts all even numbers }.</p>
<p>L<sub>2</sub> = {<M> / M does not accept all even numbers }</p>
<p>L<sub>3</sub> = {<M> / M rejects all even numbers }</p>
<p>A) Only L<sub>1</sub></p>
<p>B) Only L<sub>1</sub> and L<sub>2</sub></p>
<p>C) Only L<sub>1</sub> and L<sub>3 </sub></p>
<p>D) All of L<sub>1</sub>,L<sub>2</sub> and L<sub>3 </sub></p>
<p> </p>Theory of Computationhttp://gateoverflow.in/126424/theory-of-computationFri, 21 Apr 2017 09:51:21 +0000Self Doubt
http://gateoverflow.in/126414/self-doubt
How collision can be occur in 1 persistent CSMA, since each and every station sensing the channel continuously, so the station that sense the channel idle first will send the data, is there any possibility that more than one station sense the channel as idle at a same time? Give that scenario (diagrammatical approach will be appreciated)?Computer Networkshttp://gateoverflow.in/126414/self-doubtFri, 21 Apr 2017 08:10:36 +0000what will be fuzzy set ?
http://gateoverflow.in/126412/what-will-be-fuzzy-set
<p><img alt="" src="http://gateoverflow.in/?qa=blob&qa_blobid=12093664083042897413"></p>Mathematical Logichttp://gateoverflow.in/126412/what-will-be-fuzzy-setFri, 21 Apr 2017 07:51:19 +0000