GATE Overflow - Recent questions
https://gateoverflow.in/questions
Powered by Question2AnswerCache Performance
https://gateoverflow.in/173691/cache-performance
Consider a CPU that executes at a clock rate of 200 MHz(5ns per cycle) with a single level cache.<br />
<br />
CPI execution i.e. CPI with ideal memory is 1.1.<br />
<br />
Instruction mix are 50% arithmetic/Logical, 30% load/store, 20% control instruction.<br />
<br />
Assume the cache miss rate is 1.5% and a miss penalty of 50 cycles.<br />
<br />
1.The number of times cpu with ideal memory is faster when no miss occurs ?<br />
<br />
2.Now,on doubling the clock rate to 400 MHz,How much faster is this machine,assuming similar miss rate,instruction mix as give above ?CO & Architecturehttps://gateoverflow.in/173691/cache-performanceFri, 24 Nov 2017 17:58:20 +0000up and down counter
https://gateoverflow.in/173672/up-and-down-counter
A ripple counter is made with three positive edge triggered flip-flops. If the output of previous lower significant bit flip-flop is used as a triggering clock pulse of the next higher significant bit flip-flop, then the resultant counter is aDigital Logichttps://gateoverflow.in/173672/up-and-down-counterFri, 24 Nov 2017 16:26:59 +0000Deadlock
https://gateoverflow.in/173657/deadlock
Let there are 10 resources in the system and every process can demand maximum 4 and minimum 2 resources of the same type then what is the minimum and the maximum number of processes in a system such that system is deadlock-free in which all resources are busy.<br />
<br />
A. 2 & 5 <br />
<br />
B. 3 & 9<br />
<br />
C. 4 & 9<br />
<br />
D. 3 & 5Operating Systemhttps://gateoverflow.in/173657/deadlockFri, 24 Nov 2017 15:37:04 +0000Regular Language
https://gateoverflow.in/173634/regular-language
<p>State True of False</p>
<p>S1 :If L is regular,then the language = {uv u $\epsilon$ L ,v $\epsilon$ L<sup>R</sup>} is Regular.</p>
<p>S2:If w $\epsilon$ L, where L is regular than the language {ww<sup>R</sup>;w$\epsilon$ L} is Regular.</p>Theory of Computationhttps://gateoverflow.in/173634/regular-languageFri, 24 Nov 2017 14:21:00 +0000Help to clarify
https://gateoverflow.in/173618/help-to-clarify
int *A[10];<br />
<br />
Now, what is meant by A[2][3]?Programminghttps://gateoverflow.in/173618/help-to-clarifyFri, 24 Nov 2017 13:35:30 +0000database normalisation
https://gateoverflow.in/173610/database-normalisation
consider:<br />
<br />
T1: {A11, A12, A13} - key is A11<br />
T2: {A21, A22, A11} - key is A21<br />
T3: {A21, A23} - key is {A21 A23}<br />
<br />
T1, T2, T3 all are in which normal form? <br />
<br />
a) 2nf<br />
<br />
b) 3nf<br />
<br />
c) BCNF<br />
<br />
FUNCTIONAL DEPENDENCIES ARE NOT MENTIONED. SO, PLEASE EXPLAIN HOW TO CHECK NORMAL FORM FOR THE RELATION?Databaseshttps://gateoverflow.in/173610/database-normalisationFri, 24 Nov 2017 13:24:10 +0000made easy
https://gateoverflow.in/173601/made-easy
<p>Consider the following synchronous counter made up of JK, D, T Flip-Flops.</p>
<p>The modulus value of the counter is</p>
<p>
<br>
<img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=7334297990781180043"></p>Digital Logichttps://gateoverflow.in/173601/made-easyFri, 24 Nov 2017 13:07:32 +0000recursion
https://gateoverflow.in/173585/recursion
void abc()<br />
<br />
{<br />
<br />
auto int a;<br />
<br />
static int s;<br />
<br />
a=s++;<br />
<br />
printf("%d%d",a,s);<br />
<br />
if(a<=2)<br />
<br />
abc();<br />
<br />
printf("%d%d",a,s);<br />
<br />
}<br />
<br />
void main()<br />
<br />
{<br />
<br />
abc();<br />
<br />
abc();<br />
<br />
}<br />
<br />
how many times printf will execute??Programminghttps://gateoverflow.in/173585/recursionFri, 24 Nov 2017 12:46:13 +0000Operations in Instruction cycle
https://gateoverflow.in/173584/operations-in-instruction-cycle
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=16251428270177169452"></p>
<p> </p>
<p>Please explain this.I am unable to understand this. If someone can share the source,from where shud i study to solve such type of problems.</p>
<p>Answer given is B.</p>CO & Architecturehttps://gateoverflow.in/173584/operations-in-instruction-cycleFri, 24 Nov 2017 12:44:35 +0000Address Translation
https://gateoverflow.in/173579/address-translation
Which one is TRUE? Give explaination<br />
<br />
1)The main reason to have multilevel page to speed up address translation<br />
<br />
2)The main reason to have hardware TLB to speed up address translationOperating Systemhttps://gateoverflow.in/173579/address-translationFri, 24 Nov 2017 12:38:49 +0000endian
https://gateoverflow.in/173574/endian
<pre>
int main()
{
int a = 300;
char *b = (char *)&a;
*++b = 2;
printf("%d ",a);
return 0;
}
</pre>
<p>Consider the size of int as two bytes and size of char as one byte.Machine is little-endian</p>
<p>O/P_________</p>
<p> </p>
<p> </p>
<p>a=300-->(<strong>00000001 00101100)<sub>2</sub></strong></p>
<p>now b will point to<strong> 00101100</strong></p>
<pre>
<span class="marker"> </span><strong><span class="marker">*++b = 2;</span> what will this do ?</strong></pre>Programminghttps://gateoverflow.in/173574/endianFri, 24 Nov 2017 12:33:20 +0000One to one relationship with one side total participation
https://gateoverflow.in/173573/one-to-one-relationship-with-one-side-total-participation
I am confused whether we need to have 2 tables or a single table when 2 strong entities are in 1:1 relationship with one having complete participation.<br />
<br />
Ex: Entities 'Person' and 'License'. 1:1 relationship and License has total participation.<br />
<br />
If we have a single table then what about the Person records who are not participating in the relationship?<br />
So, I think a single table is not possible. We need to have one table for Person and one for License with License referencing Person. Please let me know if I am correct or not.Databaseshttps://gateoverflow.in/173573/one-to-one-relationship-with-one-side-total-participationFri, 24 Nov 2017 12:32:15 +0000Cache Vs CAM (SELF DOUBT)
https://gateoverflow.in/173572/cache-vs-cam-self-doubt
CAM (Content addressable memory or Associative memory) is faster than Cache Memory?? <br />
<br />
If someone knows it. .please explain.CO & Architecturehttps://gateoverflow.in/173572/cache-vs-cam-self-doubtFri, 24 Nov 2017 12:31:55 +0000Minimum relations required for ER diagram
https://gateoverflow.in/173567/minimum-relations-required-for-er-diagram
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9724767971850622690"></p>
<p>How many minimum relations required for the above ER diagram?
<br>
<br>
According to me it should be 7. Please let me know the answer according to you.</p>Databaseshttps://gateoverflow.in/173567/minimum-relations-required-for-er-diagramFri, 24 Nov 2017 12:20:06 +0000Instruction Pipelining
https://gateoverflow.in/173560/instruction-pipelining
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13754190441005367157"></p>CO & Architecturehttps://gateoverflow.in/173560/instruction-pipeliningFri, 24 Nov 2017 11:35:36 +0000Regarding prims algo
https://gateoverflow.in/173559/regarding-prims-algo
Hello,<br />
<br />
I have doubt regarding prims algorithm<br />
<br />
1)should we choose the lowest cost edge and then implement algo further?<br />
<br />
2)Or we choose any vertex and then lowest cost edge of that vertex?DShttps://gateoverflow.in/173559/regarding-prims-algoFri, 24 Nov 2017 11:31:49 +0000Normalization
https://gateoverflow.in/173537/normalization
Please explain with example how lossless decomposition into BCNF is possible but dependency preservating BCNF decomposition may not be possible for all relations?Databaseshttps://gateoverflow.in/173537/normalizationFri, 24 Nov 2017 10:03:46 +0000PRACTICE PAPER
https://gateoverflow.in/173522/practice-paper
1.Asynchronous mode of transmission is suitable for systems with multiple peripheral devices.<br />
a) True<br />
b) False<br />
<br />
2.The asynhronous BUS mode of transmission allows for a faster mode of data transfer.<br />
a) True<br />
b) False<br />
<br />
PLEASE GIVE REASON FOR ANSWERCO & Architecturehttps://gateoverflow.in/173522/practice-paperFri, 24 Nov 2017 08:39:49 +0000Made Easy Test Series
https://gateoverflow.in/173501/made-easy-test-series
<p>Which of the following statement is/are true?</p>
<ul>
<li>For any data file it is possible to construct two separate sparse first level indexes on different keys.</li>
<li>For any data file, it is possible to construct two separate dense first level indexes on different keys.</li>
<li>For any data file, it is possible to construct a sparse first level index and a dense second level index,both should be useful.</li>
<li>All the above</li>
</ul>Databaseshttps://gateoverflow.in/173501/made-easy-test-seriesFri, 24 Nov 2017 06:35:47 +0000B Trees
https://gateoverflow.in/173500/b-trees
<div style="margin-top:20px;"> </div>
<div>
<div>
<p>Which of the following statement true about B tree and B<sup>+</sup> tree index? Assume order of B tree node same as order of B<sup>+</sup> tree node.</p>
</div>
</div>
<ul>
<li>B tree index has more levels than B<sup>+</sup> tree index for large number of keys.</li>
<li>B<sup>+</sup> tree index has more levels than B tree index for large number of keys.</li>
<li>Both B tree B<sup>+</sup> tree best for sequential access of records.</li>
<li>B<sup>+</sup> tree index nodes more than B<sup>+</sup> tree for large number of keys.</li>
</ul>Databaseshttps://gateoverflow.in/173500/b-treesFri, 24 Nov 2017 06:32:31 +0000Transaction Made easy
https://gateoverflow.in/173493/transaction-made-easy
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________<br />
<br />
I am getting 54 but the given ans is 60.<br />
<br />
My doubt is are serial schedules counted or not in the concurrent schedules.Databaseshttps://gateoverflow.in/173493/transaction-made-easyFri, 24 Nov 2017 06:03:21 +0000#doubt #programming
https://gateoverflow.in/173485/%23doubt-%23programming
difference between #define and typedef ???<br />
<br />
please give logical answer not general answerProgramminghttps://gateoverflow.in/173485/%23doubt-%23programmingFri, 24 Nov 2017 05:12:10 +0000Dbms #weak-entity
https://gateoverflow.in/173474/dbms-%23weak-entity
Which of the following statements are true for weak entity sets:<br />
<br />
1. A weak entity set cannot have a primary key.<br />
<br />
2. A weak entity set must have a local attribute in primary key.<br />
<br />
3. A weak entity must borrow an attribute from another entity sey to form a primary key.<br />
<br />
a) 1 and 2<br />
<br />
b) 2 and 3<br />
<br />
c) 3 only<br />
<br />
d) none of theseDatabaseshttps://gateoverflow.in/173474/dbms-%23weak-entityFri, 24 Nov 2017 04:17:15 +0000GATE EE
https://gateoverflow.in/173468/gate-ee
The maximum value of a such that the matrix below has three linearly independent real eigen vectors is<br />
<br />
$\begin{pmatrix} -3& 0 &-2 \\ 1& -1 & 0\\ 0& a & 2 \end{pmatrix}$<br />
<br />
(a) $\frac{2}{3\sqrt{3}}$<br />
<br />
(b) $\frac{1}{3\sqrt{3}}$<br />
<br />
(c) $\frac{1+2\sqrt{3}}{3\sqrt{3}}$<br />
<br />
(d)$\frac{1+\sqrt{3}}{3\sqrt{3}}$Linear Algebrahttps://gateoverflow.in/173468/gate-eeFri, 24 Nov 2017 03:22:12 +0000Compiler design
https://gateoverflow.in/173466/compiler-design
Hi mates, <br />
<br />
Show that it is ambiguous grammar <br />
<br />
TIA<br />
<br />
S->aAB/bBA<br />
<br />
A->bS/a<br />
<br />
B->aS/bCompiler Designhttps://gateoverflow.in/173466/compiler-designFri, 24 Nov 2017 03:07:14 +0000[Self Doubt] previous year explanation
https://gateoverflow.in/173465/self-doubt-previous-year-explanation
<p><a rel="nofollow" href="https://gateoverflow.in/683/gate2000-12">https://gateoverflow.in/683/gate2000-12</a></p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=14193936971469721872"></p>
<p>Can you please explain the meaning of the highlighted portion of the text. This is an explanation by Arjun Sir</p>CO & Architecturehttps://gateoverflow.in/173465/self-doubt-previous-year-explanationFri, 24 Nov 2017 02:51:58 +0000nptel
https://gateoverflow.in/173452/nptel
Consider a B-tree with the following specifications: Page size c = 2 kB; Size of key γ = 32 bytes; Size of pointer η = 8 bytes. What is the order m of the B+-tree? How many records can a tree of height 3 store?<br />
<br />
doubt:<br />
<br />
x->pointer to block<br />
<br />
8*x +(8+32)*(x-1)<=2048<br />
<br />
x<=43.5<br />
<br />
but given solution is<br />
<br />
2*1024>=32*m+8(m+1)+8*m=42.2=42<br />
<br />
please guide where i am wrongDatabaseshttps://gateoverflow.in/173452/nptelThu, 23 Nov 2017 20:13:15 +0000ace test series 2018
https://gateoverflow.in/173450/ace-test-series-2018
Consider a packet switched network the propagation delay is 20 msec per hop and the packet size is 1000 bits and the <br />
<br />
data rate is 52 kbps. assuming all packet follow the same 4 hop path, then the delay in sending an 100000 bit message<br />
<br />
is________Computer Networkshttps://gateoverflow.in/173450/ace-test-series-2018Thu, 23 Nov 2017 20:03:35 +0000endian
https://gateoverflow.in/173448/endian
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=891484528322507322"></p>
<p> </p>
<p>how this hex representation is done?</p>CO & Architecturehttps://gateoverflow.in/173448/endianThu, 23 Nov 2017 19:42:41 +0000self doubt dbms
https://gateoverflow.in/173445/self-doubt-dbms
Deletion in B+ tree, unable to get the underflow condition when we deal with <br />
<br />
<a href="http://home.iitj.ac.in/~ramana/ch10-st" rel="nofollow" target="_blank">http://home.iitj.ac.in/~ramana/ch10-st</a><br />
<br />
How grouping is done during underflow in B+, IN B we see the most populous sibling and do grouping and merge it.Databaseshttps://gateoverflow.in/173445/self-doubt-dbmsThu, 23 Nov 2017 19:35:25 +0000[Programming in c] Extern variable
https://gateoverflow.in/173444/programming-in-c-extern-variable
#include <stdio.h><br />
<br />
int main() {<br />
int a=10;<br />
extern int a;<br />
return 0;<br />
}<br />
<br />
<br />
<br />
Why this gives compilation error? Extern is just a declaration.So why it is giving error on compilation?Programminghttps://gateoverflow.in/173444/programming-in-c-extern-variableThu, 23 Nov 2017 19:14:48 +0000TAT Paging
https://gateoverflow.in/173443/tat-paging
Let Memory access time=20ns<br />
<br />
Disk Access time is=10ms<br />
<br />
No TLB is used.<br />
<br />
Page size=4KB and PTES=64 bytes.<br />
<br />
Assume that the processes are referenced such that each of its page is referenced only once. However the order of reference is not known.<br />
<br />
For a process of size 10MB, compute TAT using 2 level and 3 level Paging.Operating Systemhttps://gateoverflow.in/173443/tat-pagingThu, 23 Nov 2017 19:06:58 +0000Previous Gate
https://gateoverflow.in/173423/previous-gate
The second moment of a Poisson-distributed random variable is 2. The mean of the variable is ....<br />
<br />
My question on solving we get 2 values of lamda(ie mean) .One is -2 and the other is 1 .So which one to choose?Mathematical Logichttps://gateoverflow.in/173423/previous-gateThu, 23 Nov 2017 16:29:26 +0000self doubt
https://gateoverflow.in/173400/self-doubt
relation schema with no non trivial fd's then relation is always in bcnf.<br />
<br />
please someone explain this i am not able to get it.Databaseshttps://gateoverflow.in/173400/self-doubtThu, 23 Nov 2017 14:27:07 +0000Can epsilon be used as a tape alphabet in case of Turing Machine?
https://gateoverflow.in/173397/can-epsilon-be-used-as-tape-alphabet-in-case-of-turing-machine
Theory of Computationhttps://gateoverflow.in/173397/can-epsilon-be-used-as-tape-alphabet-in-case-of-turing-machineThu, 23 Nov 2017 14:23:00 +0000Turing Machine
https://gateoverflow.in/173396/turing-machine
<p>Draw a Turing machine for the following.</p>
<p>" Concatenate two strings w1 and w2 , where each string is generated over {a,b}"</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=4754923579556671102"></p>
<p>Can anyone tell me whether this solution is correct or not ?If not plz provide a alternative solution.</p>Theory of Computationhttps://gateoverflow.in/173396/turing-machineThu, 23 Nov 2017 14:18:34 +0000madeeasy test series
https://gateoverflow.in/173388/madeeasy-test-series
<p><a rel="nofollow" href="https://gateoverflow.in/?qa=blob&qa_blobid=13313697975716394852">https://gateoverflow.in/?qa=blob&qa_blobid=13313697975716394852</a></p>
<p>how to solve this??</p>Digital Logichttps://gateoverflow.in/173388/madeeasy-test-seriesThu, 23 Nov 2017 13:52:19 +0000Memory overhead in Multilevel paging with TLB
https://gateoverflow.in/173382/memory-overhead-in-multilevel-paging-with-tlb
Consider a computer system using 2-level paging with TLB.The logical address supported is 32 bits.The page table is divided into 512 pages each of size 1K.The memory access time is 100ns and the TLB access time 15ns .Page table entry size at 1st level is 2 Bytes and that at second level us 4 Bytes each.<br />
<br />
What is the memory overhead of storing the top level page table along with the page of the second level page table for a process?<br />
<br />
A)6KB<br />
<br />
B)4KB<br />
<br />
C)5KB<br />
<br />
D)12KBOperating Systemhttps://gateoverflow.in/173382/memory-overhead-in-multilevel-paging-with-tlbThu, 23 Nov 2017 13:24:05 +0000madeeasy test series
https://gateoverflow.in/173381/madeeasy-test-series
<p><a rel="nofollow" href="https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233">https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233</a></p>
<p>someone plz tell ??</p>Algorithmshttps://gateoverflow.in/173381/madeeasy-test-seriesThu, 23 Nov 2017 13:05:06 +0000self doubt
https://gateoverflow.in/173362/self-doubt
<ol>
<li>if a boolean function having cyclic prime implicants k-map then the function is having how many minimal form?? F(A,B,C)</li>
</ol>Digital Logichttps://gateoverflow.in/173362/self-doubtThu, 23 Nov 2017 11:41:31 +0000Addressing Mode
https://gateoverflow.in/173361/addressing-mode
"THE ADDRESS PART OF THE INDEX ADDRESSING MODE INSTRUCTION MUST BE SET TO ZERO,TO BEHAVE LIKE REGISTER INDIRECT MODE INSTRUCTION"<br />
<br />
IS IT A VALID STATEMENT ?CO & Architecturehttps://gateoverflow.in/173361/addressing-modeThu, 23 Nov 2017 11:37:29 +0000General syllabus doubt
https://gateoverflow.in/173359/general-syllabus-doubt
Hello,<br />
<br />
The gate 2018 syllabus explicitly mentions regular languages, context free languages and turing machines. It does not say anything about context sensitive languages and linear bounded automata..How much of these topics should i study?..definitions? closure properties?Study Resourceshttps://gateoverflow.in/173359/general-syllabus-doubtThu, 23 Nov 2017 11:32:03 +0000Internet
https://gateoverflow.in/173348/internet
<pre class="prettyprint lang-c_cpp">
for ( i= 1; i<=n; i++)
for(j=n/3: j<=2n; j=j+n/3)
sum =sum+1;
</pre>
<p>What will be O and θ for this</p>Algorithmshttps://gateoverflow.in/173348/internetThu, 23 Nov 2017 10:50:32 +0000self doubt
https://gateoverflow.in/173344/self-doubt
4th and 5th normal form are in gate syllabus?Databaseshttps://gateoverflow.in/173344/self-doubtThu, 23 Nov 2017 10:26:47 +0000Regular and Non regular Language
https://gateoverflow.in/173340/regular-and-non-regular-language
<p>if L1 = {a<sup>n</sup>b<sup>n</sup>| n>=0} is not regular then how come L2 = {a<sup>n</sup>|n>=0} is regular?</p>
<p> </p>Theory of Computationhttps://gateoverflow.in/173340/regular-and-non-regular-languageThu, 23 Nov 2017 10:02:03 +0000TEST Series
https://gateoverflow.in/173333/test-series
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=8951976332580515909"></p>
<p> </p>
<p>Kindly explain why B is not correct. thanks in advance </p>Theory of Computationhttps://gateoverflow.in/173333/test-seriesThu, 23 Nov 2017 09:36:01 +0000self doubt
https://gateoverflow.in/173311/self-doubt
<p><img alt="Image result for total participation in dbms" src="http://cs.slu.edu/~goldwamh/class/slu/csci371/2003_Fall/lectures/design/figure2.11.gif"></p>
<p>min no. of tables ?</p>
<p>(participation of dependent is total)</p>Databaseshttps://gateoverflow.in/173311/self-doubtThu, 23 Nov 2017 08:27:33 +0000self dobt
https://gateoverflow.in/173309/self-dobt
<p><img alt="Image result for total participation in dbms" src="http://i.imgur.com/8nxJXiz.jpg"> </p>
<p>min no. of tables</p>Databaseshttps://gateoverflow.in/173309/self-dobtThu, 23 Nov 2017 08:26:04 +0000dense index
https://gateoverflow.in/173299/dense-index
<p>Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriate until the final level of index has only one block?</p>
<p>a) n/3^n</p>
<p>b) log<sub>3</sub>n</p>
<p>c) n/4^n</p>
<p>d)log<sub>10</sub>n</p>
<p> </p>Databaseshttps://gateoverflow.in/173299/dense-indexThu, 23 Nov 2017 08:11:51 +0000Segmentation really non contiguous ?
https://gateoverflow.in/173294/segmentation-really-non-contiguous
External fragmentation occurs when enough memory space is available but we are not able to allocate that memory space because the memory space available is not contiguous.<br />
<br />
Now segmentation suffers from external Fragmentation.<br />
<br />
So how is it non-contiguous memory allocation technique ? If it would have been non contiguous , then external fragmentation can't happen right ?<br />
<br />
I think each segment can be allocated contiguously only.<br />
<br />
Please help me with this doubt.Operating Systemhttps://gateoverflow.in/173294/segmentation-really-non-contiguousThu, 23 Nov 2017 08:03:43 +0000