Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without an upvoted answer
0
votes
0
answers
10321
Decidability
From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$ I was unable to get proof given in pdf above.Can anyone explain, if someone got it.
From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$I was unable to get...
Ayush Upadhyaya
446
views
Ayush Upadhyaya
asked
Jan 13, 2019
Theory of Computation
decidability
theory-of-computation
+
–
0
votes
0
answers
10322
ME_test_series
An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following algorithms will be the best choice for sorting the array A? A.) quick sort B.) insertion sort C.) selection sort D.) bubble sort I can’t understand how can insertion sort be better in this case?
An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following algorithms will be the b...
Shivam Kasat
510
views
Shivam Kasat
asked
Jan 13, 2019
Algorithms
algorithms
sorting
+
–
0
votes
0
answers
10323
Mock test
How was your Made easy CBT mock test??
How was your Made easy CBT mock test??
sahil_malik
240
views
sahil_malik
asked
Jan 13, 2019
1
votes
3
answers
10324
MadeEasy Subject Test: CO & Architecture - Cache Memory
A cache memory is 30 times faster than main memory (MM) and 50% of the time cache is referred for the execution of instruction. The performance is gained by introducing this cache is ________. What I did EMAT = 0.5(M/30)+0.5(M/30+M) = 32M/60 speed up= (M)/32M/60) =60/32=1.875 answer given is 1.90-1.97 (using amdhal’s law)
A cache memory is 30 times faster than main memory (MM) and 50% of the time cache is referred for the execution of instruction. The performance is gained by introducing t...
Shivam Kasat
954
views
Shivam Kasat
asked
Jan 13, 2019
CO and Architecture
made-easy-test-series
co-and-architecture
cache-memory
amdhals-law
speedup
+
–
1
votes
0
answers
10325
MadeEasy Test Series 2019: Databases - Er Diagram
NO. OF RELATIONS REQURIED FOR THIS ER-DIAGRAM: I am getting answer 1, Reference :https://gateoverflow.in/201404/er-diagram read out @raviyogi comment
NO. OF RELATIONS REQURIED FOR THIS ER-DIAGRAM:I am getting answer 1,Reference :https://gateoverflow.in/201404/er-diagram read out @raviyogi comment
Shivam Kasat
647
views
Shivam Kasat
asked
Jan 13, 2019
Databases
databases
er-diagram
made-easy-test-series
+
–
0
votes
0
answers
10326
ME_test_series
Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for acknowledgment from the server and this lead to deadlock situation. Which timer is used and who ... timer, client Keep alive timer, client I am not understand how persistent timer is used and what is it used for?
Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for ...
Shivam Kasat
1.2k
views
Shivam Kasat
asked
Jan 13, 2019
Computer Networks
computer-networks
flow-control-methods
+
–
2
votes
0
answers
10327
Dynamic Programming basics
Can any one explain whats happening in side the green area due to dynamic programming ?
Can any one explain whats happening in side the green area due to dynamic programming ?
Nandkishor3939
671
views
Nandkishor3939
asked
Jan 13, 2019
Programming in C
dynamic-programming
algorithms
programming
+
–
0
votes
0
answers
10328
TLB misses
1 2 2048 none
122048none
gate_forum
295
views
gate_forum
asked
Jan 13, 2019
Operating System
operating-system
translation-lookaside-buffer
paging
+
–
1
votes
1
answer
10329
ACE Material
what does the following declaration specify? int *(*q(char*))[ ]
what does the following declaration specify?int *(*q(char*))[ ]
OneZero
390
views
OneZero
asked
Jan 13, 2019
Programming in C
programming-in-c
+
–
0
votes
0
answers
10330
Self Doubt
Does DMA use interrupts? or not. please, someone ..
Does DMA use interrupts? or not. please, someone ..
saif
302
views
saif
asked
Jan 13, 2019
CO and Architecture
co-and-architecture
dma
+
–
0
votes
1
answer
10331
Made easy
Piyush mishra
247
views
Piyush mishra
asked
Jan 13, 2019
0
votes
0
answers
10332
Find correct statements
Find correct statements: The read system call to fetch data from a file always blocks the invoking process. During filesystem operations, if the file system implementation ensures that changes to data blocks of a file are flushed to disk before changes to ... interrupts on its CPU core for the duration that the spinlock is held, in both single core and multi core systems.
Find correct statements:The read system call to fetch data from a file always blocks the invoking process. During filesystem operations, if the file system implementation...
dd
2.1k
views
dd
asked
Jan 13, 2019
Operating System
operating-system
+
–
2
votes
1
answer
10333
TLB hit ration and memory lookup time
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, and a PTE size of $2$ bytes, what is the minimum TLB hit ratio that results in an average v2p (virtual to physical) translation latency of $185$ ns?
Consider a system where TLB lookup time is $25$ ns and memory access time is $200$ ns, respectively. Assuming a virtual address space of $2$ KB, page size of $32$ bytes, ...
dd
777
views
dd
asked
Jan 13, 2019
Operating System
translation-lookaside-buffer
hit-ratio
+
–
0
votes
1
answer
10334
process state in operating system
Consider a process P1 that is executing on a Linux-like OS on a single core system. When P1 is executing, a disk interrupt occurs, causing P1 to go to kernel mode to service that interrupt. The interrupt delivers all the disk blocks that unblock a ... user mode of P1. At this point in time, what are the states (ready/running/blocked) of processes P1 and P2 ?
Consider a process P1 that is executing on a Linux-like OS on a single core system. When P1 is executing, a disk interrupt occurs, causing P1 to go to kernel mode to serv...
dd
1.1k
views
dd
asked
Jan 13, 2019
Operating System
operating-system
process
+
–
0
votes
0
answers
10335
Self Doubt
GATE2018-50 https://gateoverflow.in/204125/gate2018-50 Why can't I do this question with $(k+(n-1))*t_p$ For PO stage: $0.40*3 + 0.35*2 + 0.25*1 = 2.15$ cycles. This is larger than all the 5 stages of the given pipeline. So applying the above formula it gives $(5+99)*2.15 =224$ cycles. why we use the expanded form of the same formula $k*t_p+(n-1)t_p$ and get answer as $219$ cycles
GATE2018-50https://gateoverflow.in/204125/gate2018-50Why can't I do this question with $(k+(n-1))*t_p$For PO stage: $0.40*3 + 0.35*2 + 0.25*1 = 2.15$ cycles. This is larg...
Gupta731
418
views
Gupta731
asked
Jan 13, 2019
CO and Architecture
co-and-architecture
+
–
0
votes
0
answers
10336
programming
#include<stdio.h> #include<string.h> int main() { char fullname[]="abcd"; char firstname[]="xxxxx"; //char lastName[]='Nagula'; printf("enter number\n"); printf("Press 1 for fullname\n"); printf("Press 2 for ... :invalid initialiser in line char name[]= ( a==1 ? fullname : firstname); how to correct it. thank you..!
#include<stdio.h>#include<string.h>int main(){ char fullname[]="abcd"; char firstname[]="xxxxx"; //char lastName[]='Nagula'; printf("enter number\n"); ...
shiva0
311
views
shiva0
asked
Jan 13, 2019
Programming in C
programming-in-c
programming
output
+
–
0
votes
0
answers
10337
MadeEasy Subject Test 2019: Theory of Computation - Regular Expressions
Which of the following RE are equivalent ? (a+b)*abb(a+b)* (a+b)*a(a+b)*bb(a+b)* (a+b)*ab(a+b)*b(a+b)*
Which of the following RE are equivalent ?(a+b)*abb(a+b)*(a+b)*a(a+b)*bb(a+b)*(a+b)*ab(a+b)*b(a+b)*
Shamim Ahmed
514
views
Shamim Ahmed
asked
Jan 13, 2019
Theory of Computation
regular-language
theory-of-computation
made-easy-test-series
+
–
0
votes
0
answers
10338
Compilers Doubt
Suppose Grammars given:- S→ Bbb B→ epsilon If we do SLR(1) parsing on the above grammar. Then the first state would have shift-reduce conflict right?? Because B→ epsilon would be same as B→ . right? Please make this clear.
Suppose Grammars given:-S→ BbbB→ epsilonIf we do SLR(1) parsing on the above grammar. Then the first state would have shift-reduce conflict right??Because B→ epsilo...
Shamim Ahmed
477
views
Shamim Ahmed
asked
Jan 13, 2019
Compiler Design
compiler-design
+
–
0
votes
0
answers
10339
Algorithms
Is branch and bound technique part of gate syllabus ?
Is branch and bound technique part of gate syllabus ?
sahil_malik
245
views
sahil_malik
asked
Jan 13, 2019
1
votes
0
answers
10340
MadeEasy Subject Test 2019: Operating System - Process Syncronization
Fails to Guarantee mutual exclusion Guarantee mutual exclusion and prevents deadlock Fails to prevent deadlock Fails to guarantee mutual exclusion and fails to prevent deadlock
Fails to Guarantee mutual exclusion Guarantee mutual exclusion and prevents deadlockFails to prevent deadlockFails to guarantee mutual exclusion and fails to prevent dead...
snaily16
519
views
snaily16
asked
Jan 12, 2019
Operating System
operating-system
process-synchronization
made-easy-test-series
+
–
0
votes
0
answers
10341
madeeasy
Consider a 5 stage pipeline with IF , ID, EX, WB and MA having latencies (in ms) 3,8,5,6,4. What is average CPI of non pipeline CPU when speed up achieved by to pipeline is 4? I think answer is wrong For non pipe line total time = Total number of ... * time for each cycle calculation For pipeline version total time = Total number of instruction * max(3,8,5,6,4) So No role of CPI
Consider a 5 stage pipeline with IF , ID, EX, WB and MA having latencies (in ms) 3,8,5,6,4. What is average CPI of non pipeline CPU when speed up achieved by to pipeline ...
mehul vaidya
342
views
mehul vaidya
asked
Jan 12, 2019
CO and Architecture
co-and-architecture
pipelining
speedup
+
–
0
votes
0
answers
10342
Algorithm analysis
Find a growth rate that cubes the run time when we double the input size. That is, if T(n) = X, then T(2n) = x^3.
Find a growth rate that cubes the run time when we double the input size. That is, if T(n) = X, then T(2n) = x^3.
debanjan sarkar
481
views
debanjan sarkar
asked
Jan 12, 2019
Algorithms
asymptotic-notation
algorithms
+
–
0
votes
0
answers
10343
ace test series
pream sagar
220
views
pream sagar
asked
Jan 12, 2019
0
votes
0
answers
10344
ace test series dout
address can be increment if increment then what happen what is the ans please eplain
address can be incrementif increment then what happenwhat is the ans please eplain
pream sagar
256
views
pream sagar
asked
Jan 12, 2019
0
votes
0
answers
10345
Self doubt(Sliding Window)
In sliding window protocol question if to maintain some x% efficiency if we got window size in fraction ..should we take ceil or floor Eg : GBN to get 60% eff ..we got Ws=9.3 What will be answer 9 OR 10
In sliding window protocol question if to maintain some x% efficiency if we got window size in fraction ..should we take ceil or floorEg : GBN to get 60% eff ..we got Ws=...
jatin khachane 1
317
views
jatin khachane 1
asked
Jan 12, 2019
Computer Networks
computer-networks
+
–
0
votes
0
answers
10346
ace test series dout
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N) A. O(1) B. O(N) C. O(NlogN) D) what is difference between Option b and last option D
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N)A. O(1)B. O(N)C. O(NlogN)D)what is difference...
pream sagar
448
views
pream sagar
asked
Jan 12, 2019
0
votes
0
answers
10347
MADE EASY OS
Vivekk
340
views
Vivekk
asked
Jan 12, 2019
0
votes
0
answers
10348
MadeEasy Full Length Test 2018: CO & Architecture - Instruction Execution
A particular parallel program computation requires 100 seconds when executed on a single processor. If 40 percent of this computation is “ inherently sequential ”, then what are the theoretically best elapsed times for this program running with 2 and 4 processors, respectively ?
A particular parallel program computation requires 100 seconds when executed on a single processor. If 40 percent of this computation is “ inherently sequential ”, th...
mehul vaidya
712
views
mehul vaidya
asked
Jan 12, 2019
CO and Architecture
co-and-architecture
instruction-execution
made-easy-test-series
+
–
0
votes
2
answers
10349
permutation and combination
1 2 10 16
121016
gate_forum
391
views
gate_forum
asked
Jan 12, 2019
1
votes
0
answers
10350
Data Hazards
B. C. D.
B. C. D.
gate_forum
266
views
gate_forum
asked
Jan 12, 2019
CO and Architecture
co-and-architecture
data-hazards
+
–
Page:
« prev
1
...
340
341
342
343
344
345
346
347
348
349
350
...
1008
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register