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 answers
0
votes
0
answers
11161
Which previous year GATE CS papers to solve?
Which previous year papers should I solve? As each year has multiple sets and time is limited. So far I have solved set 1 of GATE 2014 and 2015. Which is better option doing multiple sets from the same year or doing 1 set from each year (covering more years)?
Which previous year papers should I solve? As each year has multiple sets and time is limited. So far I have solved set 1 of GATE 2014 and 2015. Which is better option do...
neeraj1996
296
views
neeraj1996
asked
Jan 29, 2018
0
votes
0
answers
11162
TLB-Memory-access-live-test-2
A system uses $2$ level paging scheme. A regular memory access takes $100$ ns and servicing a page fault takes $10$ millisecond. An avg instruction takes $100$ ns of CPU time and $2$ memory access. The TLB hit ratio is $95\%$. and page fault is $1$ in every $10,000$ memory access. Avg instruction execution time.$?$ Options given are $1300$ns $1150$ns $2320$ns $1275$ns
A system uses $2$ level paging scheme.A regular memory access takes $100$ ns and servicing a page fault takes $10$ millisecond.An avg instruction takes $100$ ns of CPU ti...
Inspiron
501
views
Inspiron
asked
Jan 29, 2018
CO and Architecture
effective-memory-access
co-and-architecture
+
–
0
votes
0
answers
11163
OS pagetable
pradeepdeepu
206
views
pradeepdeepu
asked
Jan 29, 2018
0
votes
0
answers
11164
minimum spanning trees
pradeepdeepu
396
views
pradeepdeepu
asked
Jan 29, 2018
0
votes
0
answers
11165
made easy test series
Consider the following grammar G: S->AB|d A->aA|b B->bB|c The grammar G is A LL (1) grammar and not LR (0) B LL (1) and LR (0) C Not LL (1) but LR (0) /*correct answer*/ D Neither LL (1) nor LR (0)
Consider the following grammar G:S->AB|dA->aA|bB->bB|c The grammar G isA LL (1) grammar and not LR (0)B LL (1) and LR (0)C Not LL (1) but LR (0) /*correct answer*/D Neith...
rohit vishkarma
309
views
rohit vishkarma
asked
Jan 29, 2018
Compiler Design
ll-parser
lr-parser
+
–
1
votes
0
answers
11166
test series
hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank was 250 also. but i am unable to cross 50marks ...i am obc student . is there any chance for me to iit...plz advice me
hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank wa...
rohit vishkarma
672
views
rohit vishkarma
asked
Jan 29, 2018
Others
general
test-series
+
–
1
votes
0
answers
11167
virtualgate
Niharika 1
127
views
Niharika 1
asked
Jan 29, 2018
1
votes
0
answers
11168
#test-series
Please explain why 127 is taken in numerator instead of 7?
Please explain why 127 is taken in numerator instead of 7?
Kaifi7
240
views
Kaifi7
asked
Jan 29, 2018
4
votes
0
answers
11169
made easy test
Consider the following statements: S1 : To evaluate postfix expression, one operator stack is used. S2 : The sequence of procedure calls corresponds to a preorder traversal of the activation tree. S3 : The sequence of returns corresponds to a postorder traversal of the activation tree. ... following is true? A) Only S1 and S2 B) Only S2 and S3 C) Only S1 and S3 D) All the statements
Consider the following statements:S1 : To evaluate postfix expression, one operator stack is used.S2 : The sequence of procedure calls corresponds to a preorder traversal...
khedkar devidas
873
views
khedkar devidas
asked
Jan 29, 2018
Compiler Design
compiler-design
+
–
1
votes
0
answers
11170
monotonic property
what is rice theorem for monotonic property
what is rice theorem for monotonic property
raviyogi
181
views
raviyogi
asked
Jan 29, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
0
answers
11171
ravula test
σ(x<y) ( π(x,y) R ) Is this type of query valid or should I have selection operator inside the and projection outside or both are same?
σ(x<y) ( π(x,y) R ) Is this type of query valid or should I have selection operator inside the and projection outside or both are same?
ankit_thawal
276
views
ankit_thawal
asked
Jan 29, 2018
3
votes
0
answers
11172
SQL Query
Why this Query is illigal? i.e. Answer given is option C I tried this on W3school IDE it is giving result as option A.
Why this Query is illigal? i.e. Answer given is option CI tried this on W3school IDE it is giving result as option A.
Ashwin Kulkarni
414
views
Ashwin Kulkarni
asked
Jan 29, 2018
Databases
sql
query
self-doubt
+
–
1
votes
0
answers
11173
Univeristy of California Finals
a) Assume each router implements FIFO queuing. If each flow consists of an identical, 1-Mbps constant bit rate UDP flow with equal packet sizes, what will the resulting rate be for each flow? You can assume that FIFO drops packets with uniform probability. ... is assigned a weight equal to its number (i.e., flow F4 gets weight 4). What are the resulting throughputs?
a) Assume each router implements FIFO queuing. If each flow consists of an identical, 1-Mbps constant bit rate UDP flow with equal packet sizes, what will the resulting r...
Balaji Jegan
376
views
Balaji Jegan
asked
Jan 29, 2018
Computer Networks
routers-bridge-hubs-switches
computer-networks
computer
networking
+
–
3
votes
0
answers
11174
Exam Queries
How many question Gate Toppers attempt in actual Gate Exam and How many marks they do negative? In case of both Easy or Tough paper. Seniors, Please share your experiences.
How many question Gate Toppers attempt in actual Gate Exam and How many marks they do negative? In case of both Easy or Tough paper. Seniors, Please share your experience...
Rajnish Kumar 1
340
views
Rajnish Kumar 1
asked
Jan 29, 2018
GATE
self-doubt
+
–
1
votes
0
answers
11175
OS GERERAL DOUBT
WHEN TIME OUT OCCUR IN ROUND ROUBIN ALGORITHM THEN IN WHICH STATE PROCESS GO
WHEN TIME OUT OCCUR IN ROUND ROUBIN ALGORITHM THEN IN WHICH STATE PROCESS GO
dm4006
212
views
dm4006
asked
Jan 29, 2018
Operating System
operating-system
+
–
1
votes
0
answers
11176
made easy test series
Consider CSMA/CD LAN with bandwidth 10 Mbps and propagation delay of 5 μsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum and other overhead. The first bit slot after a successful transmission is reserved for ... use th efficiency formula of csma cd lan 1/((1+6.43a)+T(ack)/T(pack)) how we can solve this ques.
Consider CSMA/CD LAN with bandwidth 10 Mbps and propagation delay of 5 μsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits o...
ADITYA CHAURASIYA 5
231
views
ADITYA CHAURASIYA 5
asked
Jan 29, 2018
2
votes
0
answers
11177
Previous Year Gate Doubt
I have query How we can expand this a[0][2]=*(a..something like) ??
I have queryHow we can expand this a[0] =*(a..something like) ??
hem chandra joshi
223
views
hem chandra joshi
asked
Jan 29, 2018
Programming in C
programming-in-c
+
–
1
votes
0
answers
11178
MadeEasy Test Series: Graph Theory - Vertex Cover
Vertex cover = Total vertex - Maximum independent set vertex cover = 8 - 3 = 5. In given answer Covering number is given as 4. I think it is given wrong please verify. Thank you.
Vertex cover = Total vertex - Maximum independent setvertex cover = 8 - 3 = 5.In given answer Covering number is given as 4. I think it is given wrong please verify. Than...
Hemant Parihar
497
views
Hemant Parihar
asked
Jan 29, 2018
Graph Theory
graph-theory
made-easy-test-series
vertex-cover
+
–
1
votes
0
answers
11179
ace test valid,satsfiable
ankit_thawal
232
views
ankit_thawal
asked
Jan 29, 2018
1
votes
0
answers
11180
ace test dms
Can anyone provide table about DU is called in each layer?
Can anyone provide table about DU is called in each layer?
ankit_thawal
189
views
ankit_thawal
asked
Jan 29, 2018
1
votes
0
answers
11181
ace test cn
In TCP, acknowledgement no always suggest the next sequence no it wants (means if ack no=1024 which mean 1023 packet are received and it receiver want 1024 as next seq no.) And as 3rd is erroneous it will ask for the same packet hence I think the answer should be (D). Please correct me if I am wrong about the concept of acknowledgment in TCP.
In TCP, acknowledgement no always suggest the next sequence no it wants (means if ack no=1024 which mean 1023 packet are received and it receiver want 1024 as next seq no...
ankit_thawal
163
views
ankit_thawal
asked
Jan 29, 2018
1
votes
0
answers
11182
ace test hard
I calculated like: 50+25+12.5+6.25+3.125+1.56+0.78+0.39=99% please give standard procedure
I calculated like:50+25+12.5+6.25+3.125+1.56+0.78+0.39=99%please give standard procedure
ankit_thawal
164
views
ankit_thawal
asked
Jan 29, 2018
1
votes
0
answers
11183
please explain me the third output
What is the output of the following program? void main() { printf("%d",5%2); printf("%d",-5%2); printf("%d",5%-2); printf("%d",-5%-2); printf("%d",2%5); } A) 1,-1 -1 1 0 B)1 -1 1 -1 0 c)1 -1 -1 -1 0 d)1 -1 -1 1 2
What is the output of the following program?void main(){printf("%d",5%2);printf("%d",-5%2);printf("%d",5%-2);printf("%d",-5%-2);printf("%d",2%5);}A) 1,-1 -1 1 0B)1 -1 1 -...
Akshay Nair
445
views
Akshay Nair
asked
Jan 29, 2018
Programming in C
programming
programming-in-c
output
+
–
1
votes
0
answers
11184
check this plz
consider -- static char *s[ ] = { "sumit" , " ankit " } ; char **ptr = { s , s+1 } ; char ***p = ptr ; ---------------------------- below code is same or not if static is not used , what is work performed by static here ?? char *s[ ] = { "sumit" , " ankit " } ; char **ptr = { s , s+1 } ; char ***p = ptr ;
consider static char *s[ ] = { "sumit" , " ankit " } ;char ptr = { s , s+1 } ;char *p = ptr ; below code is same or not if static is not used , what ...
sumit goyal 1
228
views
sumit goyal 1
asked
Jan 29, 2018
Programming in C
programming-in-c
+
–
1
votes
0
answers
11185
check this
main() { char a[22] = "sumit" printf("%s",a); } It prints sumit fine here but ,if statement is printf("%c",a); It should print s but it is printing $\alpha$ iam bit confused why ??
main(){char a[22] = "sumit"printf("%s",a);}It prints sumit fine here but ,if statement is printf("%c",a); It should print s but it is printing $\alpha$iam bit confu...
sumit goyal 1
219
views
sumit goyal 1
asked
Jan 29, 2018
Programming in C
programming-in-c
+
–
1
votes
0
answers
11186
Made easy test 1
Consider an array A' of n distinct elements where value of elements lies from 1 to n. Array A' contains permutation of n elements. If we apply an operation which of the following is correct? (Assume both array of same size) (a) Array B' will be sorted array. ... of array A' (d) Doing the same permutation twice will not give the same array i.e., How can solve it ? Please help
Consider an array ‘A’ of n distinct elements where value of elements lies from 1 to n. Array ‘A’ contains permutation of n elements. If we apply an operation whi...
sandeep yadav
324
views
sandeep yadav
asked
Jan 29, 2018
2
votes
0
answers
11187
Theory of Computation
Consider the homomorphism h(a) = 11 amd h(b) = 10. Consider the inverse homomorphism of the regular set (01+00)* a) The resulting set is empty b) The resulting set is 00* c) The resulting set is infinite d) None of the above How to solve this?
Consider the homomorphism h(a) = 11 amd h(b) = 10. Consider the inverse homomorphism of the regular set (01+00)*a) The resulting set is emptyb) The resulting set is 00*c)...
gauravkc
1.0k
views
gauravkc
asked
Jan 29, 2018
Theory of Computation
theory-of-computation
homomorphism
+
–
1
votes
0
answers
11188
made easy test
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is _______
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 reso...
khedkar devidas
261
views
khedkar devidas
asked
Jan 29, 2018
2
votes
0
answers
11189
ACE TEST SERIES
Identify an equivalent non-left recursive CFG for the following CFG: How to solve such quesitons? I know that, if A->Ax/y then it will be reduced to A->yA' A'->xA'/epsilon How to identify "y" from above example.
Identify an equivalent non-left recursive CFG for the following CFG:How to solve such quesitons?I know that, ifA->Ax/ythen it will be reduced toA->yA'A'->xA'/epsilonHow t...
ankit_thawal
168
views
ankit_thawal
asked
Jan 28, 2018
1
votes
0
answers
11190
Ace cbt
sm
244
views
sm
asked
Jan 28, 2018
Page:
« prev
1
...
368
369
370
371
372
373
374
375
376
377
378
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register