GATE Overflow - Recent questions without answers
https://gateoverflow.in/unanswered
Powered by Question2AnswerSir i am first year ug student plese help me what to concentrate for gate from 1st year
https://gateoverflow.in/235121/first-year-student-plese-help-what-concentrate-gate-from-year
Mathematical Logichttps://gateoverflow.in/235121/first-year-student-plese-help-what-concentrate-gate-from-yearSun, 19 Aug 2018 17:56:18 +0000Self doubt
https://gateoverflow.in/235117/self-doubt
Is it True or False<br />
<br />
Let there be two algorithms<br />
<br />
If an algorithm is growing asymptotically faster will take more time than other.Algorithmshttps://gateoverflow.in/235117/self-doubtSun, 19 Aug 2018 17:50:00 +0000Corman
https://gateoverflow.in/235106/corman
Computer Networkshttps://gateoverflow.in/235106/cormanSun, 19 Aug 2018 17:29:09 +0000syllabis
https://gateoverflow.in/235088/syllabis
IS VECTOR SPACE OF LINEAR ALGEBRA IN SYLLABUS ?<br />
<br />
AS IT IS NOT WRITTEN IN OFFICAL WEBSITE BUT THERE ARE SOME QUESTION ASKED IN GATE 2017. MAY BE IT IS INCLUDED IN SOME TOPIC SO THEY DONT WRITE IT SEPERATELY. <br />
<br />
SO IS IT?????GATEhttps://gateoverflow.in/235088/syllabisSun, 19 Aug 2018 17:01:39 +0000Linked List
https://gateoverflow.in/235059/linked-list
<blockquote>
<div style="background:#eeeeee;border:1px solid #cccccc;padding:5px 10px;">What kind of linked list is best to answer question like “What is the item at position n?”
<br>
a) Singly linked list
<br>
b) Doubly linked list
<br>
c) Circular linked list
<br>
d) Array implementation of linked list</div>
</blockquote>Programminghttps://gateoverflow.in/235059/linked-listSun, 19 Aug 2018 16:17:00 +0000Time Complexity
https://gateoverflow.in/235056/time-complexity
<blockquote>
<p>
<br>
<strong>What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?</strong>
<br>
<strong>a) O(1)
<br>
b) O(n)
<br>
c) θ(n)
<br>
d) θ(1)</strong></p>
</blockquote>
<p> </p>Programminghttps://gateoverflow.in/235056/time-complexitySun, 19 Aug 2018 16:15:28 +0000Control sequence to add the contents of memory location whose address is at memory location num to register r1
https://gateoverflow.in/235035/control-sequence-contents-location-address-location-register
CO & Architecturehttps://gateoverflow.in/235035/control-sequence-contents-location-address-location-registerSun, 19 Aug 2018 15:05:47 +0000Paging
https://gateoverflow.in/235032/paging
<p><a rel="nofollow" href="https://gateoverflow.in/3600/gate2006-it-56">https://gateoverflow.in/3600/gate2006-it-56</a></p>
<p>Please explain the solution again. I am not getting.</p>Operating Systemhttps://gateoverflow.in/235032/pagingSun, 19 Aug 2018 14:57:16 +0000Test Series
https://gateoverflow.in/235026/test-series
<p>Consider the following schedules involving two transactions.</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13573187210548129075"></p>
<p>Which of the following statements is true?
<br>
<br>
A) Both S1 and S2 are allowed under 2PL
<br>
B) only S1 is allowed under 2PL
<br>
C) only S2 is allowed under 2PL
<br>
D) neither S1 nor S2 is allowed under 2PL</p>Databaseshttps://gateoverflow.in/235026/test-seriesSun, 19 Aug 2018 14:38:33 +0000forouzan
https://gateoverflow.in/235010/forouzan
Which signal has a wider bandwidth, a sine wave with a frequency of 100 Hz<br />
or a sine wave with a frequency of 200 Hz?Computer Networkshttps://gateoverflow.in/235010/forouzanSun, 19 Aug 2018 14:09:49 +0000Adder delay
https://gateoverflow.in/235004/adder-delay
<p>A full adder circuit takes 20 ns to generate the carry-out bit and 40 ns for the sum bit. When 4, 1 bit full adders are cascaded, the maximum rate of additions per second will be<img alt="" height="17" src="file:///C:/Users/crrma/AppData/Local/Temp/msohtmlclip1/01/clip_image002.png" width="33"> $\text{____} \times 10^6 $sec.</p>
<p><strong>Usual Solution given</strong></p>
<p>The answer usually given is 100ns to generate addition of all 4 bits:</p>
<p>(3*20ns) + 40ns = 100ns</p>
<p>3 since 20 ns delay of generating carries is rippled / forwarded thrice. 40ns is required to generate sum at first FA.</p>
<p>So in 1 s, there will be 1/100ns = 10 * 10^6 additions per seconds.</p>
<p><strong>Doubt</strong></p>
<p>Consider numbers given to gates in the below diagram:</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=10809205993190454772"></p>
<p>How it is correct to keep adding delay of calculating carry to delay of calculating sum?</p>
<p>When FAs are cascaded, FA1-C is added to FA2-XOR2 to generate FA2-S (Red 1 in the diagram).</p>
<p>It is also followed by FA2-AND2 and FA2-OR to generate FA2-C (Red 2 and 3 in the diagram)</p>
<p>Next FA2-C is added to FA3-XOR2 to generate FA3-S</p>
<p>It its also followed by FA3-AND2 and FA3-OR to generate FA3-C</p>
<p>And so on.</p>
<p>So in generating FA1-C we have to consider delay of AND1.</p>
<p>But in in generating subsequent Cs, we dont consider AND1 delays.</p>
<p>In fact, all HA1-S and HA1-Cs are available after fixed time as they do not depend on inputs from earlier FAs at LSBs.</p>
<p>That means we cannot simply keep adding delays of carry generation to time taken to calculate sum at lesser significant bit to calculate time taken to generate sum at current bit. Right?</p>
<p>I guess, here we have not given delay of AND2,OR and XOR2. So we cannot really calculate the total time taken to perform one round of four bit addition. Right?</p>
<p>(Similar old question: <a href="https://gateoverflow.in/83500/digitals" rel="nofollow" target="_blank">https://gateoverflow.in/83500/digitals</a>)</p>Digital Logichttps://gateoverflow.in/235004/adder-delaySun, 19 Aug 2018 13:54:13 +0000Test Series
https://gateoverflow.in/234990/test-series
<p>Question:</p>
<p>Consider the following transactions:</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=17884197310815619400"></p>
<p>The number schedules of <em>T</em><sub>1</sub> and <em>T</em><sub>2</sub> recoverable are ________.</p>Databaseshttps://gateoverflow.in/234990/test-seriesSun, 19 Aug 2018 13:05:17 +0000gate 2007
https://gateoverflow.in/234989/gate-2007
<p>GATE 2007 QUESTION(DOUBT)</p>
<p><a rel="nofollow" href="https://gateoverflow.in/3465/gate2007-it-32">https://gateoverflow.in/3465/gate2007-it-32</a></p>
<p>Guys in this question %c is there in printf.......and ans is 25.....but why the ASCII value of 25 is not printed????? As %c is used here. Kindly help where I am getting wrong??</p>DShttps://gateoverflow.in/234989/gate-2007Sun, 19 Aug 2018 13:02:49 +0000draw dfa on w such that number of a in w mod 3 less than number of b in w mod 3
https://gateoverflow.in/234980/draw-dfa-on-such-that-number-of-in-mod-less-than-number-of-in-mod
draw dfa on w number of a in w mod 3 less than number of b in w mod 3Theory of Computationhttps://gateoverflow.in/234980/draw-dfa-on-such-that-number-of-in-mod-less-than-number-of-in-modSun, 19 Aug 2018 12:40:48 +0000self doubt inherently ambiguity
https://gateoverflow.in/234969/self-doubt-inherently-ambiguity
<p><a rel="nofollow" href="https://gateoverflow.in/7428/grammar-generates-inherently-ambiguous-context-language">https://gateoverflow.in/7428/grammar-generates-inherently-ambiguous-context-language</a></p>
<p>how can we check that for ambiguous grammar no unambiguous grammar exist??</p>Theory of Computationhttps://gateoverflow.in/234969/self-doubt-inherently-ambiguitySun, 19 Aug 2018 12:25:42 +0000TestSeries
https://gateoverflow.in/234964/testseries
<p>Consider two relations R(A, B, C) and S(B, D) with R contains 5000 tupples stored in a sequential file sorted on attribute A and S contain 100000 tupples stored in a sequential file sorted on attribute B. Each block can hold 10 R tupples or 10 S tupples. Which one of the following index is most appropriate for answering query <img alt="" src="denied:data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEMAAAAVCAIAAACSf8TOAAADN0lEQVRYhe2WwUvbUBzHe9ufkULYwUJB6aUFKZ5GTaCGDdlBkM6u6EA3ha09tKuDuR0MpFrGJpMQNxjbJXthc4xtroENhInBHDyUoAUnJVgZEiKoxNe3Q2uaxjRTNjYZfskp/F5+38/v997vxYP+F3n+tYE/pnOSs6dzkrp25emr0dE8kLeMU60ztmSejoV6puXd3zPQkAchhAwp1+7FMdvjI9IvJPXAdbm+TF8ZnJqdjHWFYjR/Ap6qvlZgU2SASs48udsdoZd1xzCoSgJz3d9wwr6VVIgQVBfz8aCjPbMnusR041h3Tqp9WlNAlsC8eJRToDtJP72sI7RfkQEd67xIptjCml51QDAqKyA/RgaoJCuW9EOEvvP9pDOJvpSLdDSMQlV6niainAL3FC41LpYhQghti+mw1Z5JYqhgxEKCENoU4h14OyO51dkkqelQL4lskgqQKfbD6rZRNRl4eiAUGqD5lYphUrYiqTkZEVRLYkPKDQO1ObXEdFvDWpPA4lzU50+LmguIncTk+fpyciAUuvbg8ezUbSpAJmfmZQuDO8mewvXh2OWctOOWudaTtqyoQVcSXfnMDFFpoOhue6sFSd3QxtPIBY/H4731RTt0CmhFAnUpT2BeHAsmmFcCAAIAgqjY4mAZ3GiLZkDRfG8noTmGwrz25p6KpKqVCs/u93eFYjS/+O0TmyIDPaN5Qa7sn4wEIXSgSu8FwGYivsYEikyI5vnWl/LZN+XmIh/vyQ9VnCAwr38IlN37cZykqpUKbJLsJJNsoaQ1NlN95nbFaGDhcSGxSStyQ37MR3FFiBBCOxLTlwCbtiDH3VVfSTBLv8pzRFL32tmbaWawytiS52csnCcnQUgTM23eQG36aGKmvXE83EkQgmUxG8WxYIJbdU2lL9M9vXdS/fZ6t5bZt9HUYPiSI4khPbrZXHKocJQ5A+CGMJwWyvaLznafhDPi9tGL1bl4EMeiR/PbUXvr/MPszLsTMTRpvyIDeuwev753HEQFo0SaE5Xa1IS68jEXDxPZBdV1tzvd8fH65IbqwnjE13zJ/BXpisgziba6H3+ceW2dXSpIWEyaOv+DPHs6Jzl7+gmdv+7M+pF6GAAAAABJRU5ErkJgggA="> (Assume index always stored in memory)</p>Databaseshttps://gateoverflow.in/234964/testseriesSun, 19 Aug 2018 12:16:21 +0000An Introduction to formal languages and automata
https://gateoverflow.in/234911/an-introduction-to-formal-languages-and-automata
find grammar that generates L={a^nb^m:n>=0,m<n}Theory of Computationhttps://gateoverflow.in/234911/an-introduction-to-formal-languages-and-automataSun, 19 Aug 2018 10:42:14 +0000Parsing
https://gateoverflow.in/234905/parsing
<p> </p>
<p>Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production.
<br>
The number of entries have multiple productions in LL(1) table are ________.</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13327500167821617833"></p>Compiler Designhttps://gateoverflow.in/234905/parsingSun, 19 Aug 2018 10:28:07 +0000ace quetion bank
https://gateoverflow.in/234893/ace-quetion-bank
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states.Puzzleshttps://gateoverflow.in/234893/ace-quetion-bankSun, 19 Aug 2018 10:02:25 +0000Lattice
https://gateoverflow.in/234884/lattice
<p style="text-align:center"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=11761401436099210315"></p>
<p>Ans. C</p>Mathematical Logichttps://gateoverflow.in/234884/latticeSun, 19 Aug 2018 09:36:58 +0000B-tech
https://gateoverflow.in/234883/b-tech
Symmetrical questionLinear Algebrahttps://gateoverflow.in/234883/b-techSun, 19 Aug 2018 09:34:03 +0000Foreign key
https://gateoverflow.in/234882/foreign-key
<p><img alt="" height="200" src="https://gateoverflow.in/?qa=blob&qa_blobid=18329065575114996121" width="600"></p>Databaseshttps://gateoverflow.in/234882/foreign-keySun, 19 Aug 2018 09:33:23 +0000syllabus doubt
https://gateoverflow.in/234844/syllabus-doubt
although i know that disjoint set is not in the syllabus, but should we need to study it for learning krushkal's and prims, or i should skip disjoint set data structures?Programminghttps://gateoverflow.in/234844/syllabus-doubtSun, 19 Aug 2018 06:45:44 +0000Countability and Well Ordering
https://gateoverflow.in/234842/countability-and-well-ordering
Is there any relation between countability and well ordering? I mean if a set is well ordered, does it have any influence on it being countable and vice versa?Set Theory & Algebrahttps://gateoverflow.in/234842/countability-and-well-orderingSun, 19 Aug 2018 06:44:35 +0000self doubt toc
https://gateoverflow.in/234813/self-doubt-toc
assume pda stack is limited to 210 symbols .now stack can contain maximum of 2^10 symbols The language Accepted by such pda is <br />
<br />
a)regular lang but not finite<br />
<br />
b)dcfl but not regular<br />
<br />
c)cfl but not dcfl<br />
<br />
d)non of these<br />
<br />
actually my doubt is that pda with finite stack is equivalent to finite automata so it will accept regular language is fine but not finite how???Theory of Computationhttps://gateoverflow.in/234813/self-doubt-tocSun, 19 Aug 2018 04:56:49 +0000SELF DOUBT
https://gateoverflow.in/234808/self-doubt
ANY ANYONE PLEASE EXPLAIN THE CONCEPT OF CHECKPOINT IN TRANSACTION?OR PROVIDE SOME GOOD REFERENCEDatabaseshttps://gateoverflow.in/234808/self-doubtSun, 19 Aug 2018 04:44:36 +0000K-map and don't cares
https://gateoverflow.in/234799/k-map-and-dont-cares
"once you have assumed a don't care as '1' u can't use the same don't care for grouping zeros and vice versa."<br />
<br />
is it correct or not??Digital Logichttps://gateoverflow.in/234799/k-map-and-dont-caresSun, 19 Aug 2018 04:03:23 +0000SELF DOUBT
https://gateoverflow.in/234792/self-doubt
<p><a rel="nofollow" href="https://gateoverflow.in/3828/gate2005-it-66">https://gateoverflow.in/3828/gate2005-it-66</a></p>
<p> </p>
<p>WHAT IS THIS QUESTION TRYING TO SAY????</p>Databaseshttps://gateoverflow.in/234792/self-doubtSun, 19 Aug 2018 03:26:03 +0000Semaphore bounded waiting
https://gateoverflow.in/234758/semaphore-bounded-waiting
Does Semaphore satisfy bounded waiting? If so, how?Operating Systemhttps://gateoverflow.in/234758/semaphore-bounded-waitingSat, 18 Aug 2018 19:17:36 +0000Binary Search Tree
https://gateoverflow.in/234695/binary-search-tree
1) How many ways we can traverse 1,2,3,4 in BST?<br />
<br />
2) How many ways we can insert 1,2,3,4 in BST?<br />
<br />
______________________________________________________________________<br />
<br />
How both are different in calculation of BST?Why they are use different formula?DShttps://gateoverflow.in/234695/binary-search-treeSat, 18 Aug 2018 16:31:26 +0000Countability question
https://gateoverflow.in/234636/countability-question
GATEhttps://gateoverflow.in/234636/countability-questionSat, 18 Aug 2018 13:49:56 +0000GO PDF
https://gateoverflow.in/234629/go-pdf
A NULL free LL(1) grammar is also SLR(1)<br />
<br />
WHY?Compiler Designhttps://gateoverflow.in/234629/go-pdfSat, 18 Aug 2018 13:36:30 +0000Heap Sorting
https://gateoverflow.in/234577/heap-sorting
Consider a binary tree, where left and right subtreealready heapified. But we havenot done heapificationfor root yet. Then what is time complexity to convert it in a full heap tree?<br />
<br />
$A)O(\log n)$ or $o(n)$ $B)\Omega (\log n)$ or $\omega(n)$ $C)\Theta (\log n)$ or $\theta (n)$ $D)\text{None of these}$DShttps://gateoverflow.in/234577/heap-sortingSat, 18 Aug 2018 10:36:04 +0000Merge Sort (Code)
https://gateoverflow.in/234569/merge-sort-code
<p>why this margeSort program showing <code>time limit exceed ?</code></p>
<pre class="prettyprint lang-c_cpp" data-pbcklang="c_cpp" data-pbcktabsize="4">
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void fillArray(int array[], int n)
{
time_t t;
time(&t);//get current time
srand(t);//gives current time as seed for random number generator
for(int i = 0; i < n; i++)
{
array[i] = rand()%(10*n);//Doing mod to avoid very large numbers
}
}
void printArray(int array[], int n)
{
for(int i = 0; i < n; i++)
{
printf("%d ", array[i]);
}
}
void mergeSort(int A[],int n){
int i;
int mid=n/2;
int p=(n-mid);
int w=sizeof(A[mid]);
int x=sizeof(A[p]);
int Aleft[w];
int Aright[x];
for(i=0;i<(mid-1);i++){
Aleft[i]=A[i];
}
for(i=mid;i<(n-1);i++){
Aright[i-mid]=A[i];
}
mergeSort(Aleft,n/2);
mergeSort(Aright,n/2);
merge(Aleft,Aright,A);
}
void merge(int lArray[], int rArray[],int Array[])
{
int nL=sizeof(lArray);
int nR=sizeof(rArray);
int i=0;
int j=0;
int k=0;
while((i<nL)&&(j<nR)){
if(lArray[i]<=rArray[j]){
Array[k]=lArray[i];
i++;
}
else{
Array[k]=rArray[j];
j++;
}
k++;
}
}
int main()
{
int *Array, n=8;
//int p=(n-mid);
clock_t start, end;
double cpu_time_used;
//printf("Enter the no. of numbers: ");
//scanf("%d", &n);
Array = malloc(n * sizeof(int));
//lArray = malloc(mid * sizeof(int));
//rArray = malloc((n-mid) * sizeof(int));
fillArray(Array, n);
//fillArray(lArray, mid);
//fillArray(rArray, p);
start = clock();
mergeSort(Array,n);
end = clock();
cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;
printArray(Array, n);
printf("\n \n Time taken for sorting: %f seconds\n\n",cpu_time_used);
return 0;
}
</pre>
<p> </p>Programminghttps://gateoverflow.in/234569/merge-sort-codeSat, 18 Aug 2018 09:41:17 +0000Memory Hierarchy
https://gateoverflow.in/234567/memory-hierarchy
if simply the access time of level-1 meomry and level-2 memory is given and hit ratio is given then for average time access what should be the approach? should i go for hierarchical or simultaneous access?CO & Architecturehttps://gateoverflow.in/234567/memory-hierarchySat, 18 Aug 2018 09:15:39 +0000self doubt
https://gateoverflow.in/234523/self-doubt
Q. The part of the operating system manages the essential peripherals , such as keyboard , screen , disk drives , and parallel and serial ports . <br />
<br />
options <br />
<br />
A . Basic I/O System <br />
<br />
B. Secondary I/O System <br />
<br />
C. Peripherals I/O System <br />
<br />
D. Marginal I/O SystemOperating Systemhttps://gateoverflow.in/234523/self-doubtSat, 18 Aug 2018 06:38:37 +0000Eigen vector
https://gateoverflow.in/234467/eigen-vector
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=2772476239140801338"></p>Mathematical Logichttps://gateoverflow.in/234467/eigen-vectorSat, 18 Aug 2018 04:54:39 +0000Process Scheduling
https://gateoverflow.in/234445/process-scheduling
printf("Hello");<br />
<br />
if(!fork())<br />
<br />
printf("World");Operating Systemhttps://gateoverflow.in/234445/process-schedulingSat, 18 Aug 2018 03:43:54 +0000multi dimensional array
https://gateoverflow.in/234416/multi-dimensional-array
Let A be a two-dimensional array declared as follows: A: array[1..23][1..19] of integer; Assuming that each integer takes one memory location, the array is stored in rowmajor order and the first element of the array is stored at the location. Find out the address of the address of the element A[i][j].DShttps://gateoverflow.in/234416/multi-dimensional-arrayFri, 17 Aug 2018 20:08:38 +0000Eigen vector
https://gateoverflow.in/234414/eigen-vector
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=11506214965616950011"></p>Mathematical Logichttps://gateoverflow.in/234414/eigen-vectorFri, 17 Aug 2018 19:58:38 +0000Eigen vector
https://gateoverflow.in/234369/eigen-vector
Is it true that if we have 3 distinct eigen vectors x,y and z than x,y and z would respectively be orthogonal to each other .Please elaborateLinear Algebrahttps://gateoverflow.in/234369/eigen-vectorFri, 17 Aug 2018 17:21:17 +0000C programming
https://gateoverflow.in/234323/c-programming
Consider 2 cases:<br />
<br />
1. Call by value result<br />
<br />
2. Call by reference<br />
<br />
int x = 10 ;<br />
main ( )<br />
{<br />
P(x); printf (x);<br />
}<br />
P ( int a)<br />
{<br />
If ( a ≤ 40 )<br />
{<br />
a = a +10;<br />
P(a);<br />
x=a+10;<br />
}<br />
}<br />
Please explain this in the above referenceIn case of call by reference the value of the actual parameter is simultaneously updated whereas, in case of call by value result, the final value of a formal parameter is passed to actual.<br />
Any example in which these 2 will differ in output(especially in case of function calls)?Programminghttps://gateoverflow.in/234323/c-programmingFri, 17 Aug 2018 15:10:08 +0000Monitors Process Synchronization
https://gateoverflow.in/234286/monitors-process-synchronization
Is Monitors concept not in GATE 2019 ?Operating Systemhttps://gateoverflow.in/234286/monitors-process-synchronizationFri, 17 Aug 2018 14:08:17 +0000where can i find GO pdf ?
https://gateoverflow.in/234283/where-can-i-find-go-pdf
<p>where can i find GO pdf ? </p>
<p>can't find download option here</p>
<p><a rel="nofollow" href="https://gatecse.in/gate-overflow-book-qa-only-previous-gate-tifr/">https://gatecse.in/gate-overflow-book-qa-only-previous-gate-tifr/</a></p>Othershttps://gateoverflow.in/234283/where-can-i-find-go-pdfFri, 17 Aug 2018 14:03:26 +0000ace test series
https://gateoverflow.in/234265/ace-test-series
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.<br />
<br />
n=4;<a1,a2,a3,a4>=<do,if,int,while><br />
<br />
P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1><br />
<br />
The Cost of OBST(optimal binary search tree) is________Algorithmshttps://gateoverflow.in/234265/ace-test-seriesFri, 17 Aug 2018 13:16:00 +0000Patterson-Henessey, Pipelining
https://gateoverflow.in/234263/patterson-henessey-pipelining
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=8086321836690593826"><img alt="" src="denied:blob:https://web.whatsapp.com/daedd130-0740-4b68-a913-489b4c6f6cc1">
<br>
<br>
Here, in the DADDI instruction, there are only two stalls. But since there is no operand forwarding, won't the contents of the register be available after they've been written into the register file and so, there should be three stalls?
<br>
<br>
From what I could understand in this question, the value of the registers is available after the M stage, before it is written. </p>CO & Architecturehttps://gateoverflow.in/234263/patterson-henessey-pipeliningFri, 17 Aug 2018 13:11:29 +0000gate 2009
https://gateoverflow.in/234248/gate-2009
<p><img alt="" src="https://www.geeksforgeeks.org/wp-content/uploads/GATE2009DBMS22.gif"></p>
<p>What does this relational calculus evaluates to?</p>
<p>(A) Names of employees with a male supervisor.
<br>
(B) Names of employees with no immediate male subordinates.
<br>
(C) Names of employees with no immediate female subordinates.
<br>
(D) Names of employees with a female supervisor.</p>
<p>Can you please explain how to deal with the negation?</p>
<p> </p>Databaseshttps://gateoverflow.in/234248/gate-2009Fri, 17 Aug 2018 12:21:21 +0000#Test series
https://gateoverflow.in/234176/%23test-series
Let R(A, B, C, D, E) be a relation which has 500000 records. Size of each record is 200 B. Size of attribute A is 16 B. Size of pointer is 4 B and size of the block is 2400 B (assume elements are stored in sorted order of key).<br />
On the execution of the query,<br />
Select ∗ from R where A = ‘GATE’<br />
The difference of the cost in term of number of block transfer from the disk when multilevel index used and when binary search applied without indexing is _______.Databaseshttps://gateoverflow.in/234176/%23test-seriesFri, 17 Aug 2018 09:12:58 +0000Ugc net september 2013 paper 3 Question number 71
https://gateoverflow.in/234121/ugc-net-september-2013-paper-3-question-number-71
Operating Systemhttps://gateoverflow.in/234121/ugc-net-september-2013-paper-3-question-number-71Fri, 17 Aug 2018 07:23:19 +0000Sliding window
https://gateoverflow.in/234102/sliding-window
Consider a sliding window protocol operating at the data link layer between two stations 1000<br />
kilometers apart, directly connected by an error-free 1.0 Mbps link. The frame sizes used are<br />
500 bits, of which 50 bits are header and 450 bits are data. Ack frames are 100 bits, and frame<br />
processing time is 100 microseconds. Assume that the signal propagation delay is 10 µsec/km.<br />
If a window size of W = 10 is used, then the efficiency of the channel isComputer Networkshttps://gateoverflow.in/234102/sliding-windowFri, 17 Aug 2018 06:35:28 +0000