The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by resuscitate
User resuscitate
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User resuscitate
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+4
votes
2
answers
1
TLB ,VGATE
@Arjun sir, I solved it by using the same concept of gate 2003 78,79 ..but techtud marked it as wrong..this qs has only one confusion which is how to use page table walk and tlb update...I used it in the part of L3 ache miss of Tlb miss.. and used this formula . ... hit(cache time) + L2 miss( L3 hit (cache time) + L3 miss(cache time+page table walk and Tlb update )))) Sir,pls check this
asked
Jan 27, 2016
in
CO and Architecture

540
views
tlb
coandarchitecture
cachememory
0
votes
1
answer
2
DAG
it is very confusing in upper part,someone xplain in details
asked
Jan 14, 2016
in
Compiler Design

261
views
compilerdesign
0
votes
0
answers
3
overhead
how to approach
asked
Jan 14, 2016
in
Computer Networks

46
views
computernetworks
+3
votes
1
answer
4
Tcp Udp
An application uses UDP to send 7300 bytes of data in a single message on a path with MTU 1500 and there is an error in one of the datagrams transmitted. The application is a reliable one and so retransmits the data again. If the same application is ... and there is an error in one of the datagrams transmitted, what is the difference in bytes retransmitted using UDP as compared to TCP
asked
Jan 14, 2016
in
Digital Logic

214
views
computernetworks
0
votes
1
answer
5
pipeline cycles
I think they calculated whole things wrong.. with operand forwarding answer is 9,but they drew wrong diagram..and without answer will be 14.as we can use id stage under wb stage. so answer shoyld be 5. @arjun sir.
asked
Jan 12, 2016
in
CO and Architecture

265
views
pipelining
coandarchitecture
+5
votes
1
answer
6
Ds..
Consider the following function: void f(int a) { if(a <= 0) return ; else{ printf("%d ",a); f(a2); printf("%d ",a); f(a3); } } The sum of all values printed by f(6) is _____ .
asked
Jan 12, 2016
in
Programming

165
views
recursion
recurrence
+1
vote
1
answer
7
MadeEasy Test Series: Theory of Computation Closure Property
Which of the following is false ? a. Union of two recursive languages is recursive b. Intersection of regular and recursive language is recursive c. Union of regular language and recursive language is recursive d. None of these. please give examples of each option.. and also describe intersection of regular and recursive is recursive..
asked
Jan 3, 2016
in
Theory of Computation

1.1k
views
theoryofcomputation
closureproperty
madeeasytestseries
0
votes
1
answer
8
data structure
describe in details
asked
Jan 3, 2016
in
DS

182
views
datastructure
programminginc
+1
vote
1
answer
9
matrix
asked
Jan 3, 2016
in
Linear Algebra

624
views
matrices
linearalgebra
0
votes
1
answer
10
matrix
how to solve??
asked
Jan 3, 2016
in
Linear Algebra

160
views
matrices
linearalgebra
+2
votes
2
answers
11
symmetric and antisymmetric
from definitoin of antisymmetry if aRb and bRa is present then a=b. so b should be answer,though d is right,but b is more appropriate
asked
Jan 3, 2016
in
Set Theory & Algebra

204
views
settheory&algebra
relations
sets
madeeasytestseries
+1
vote
1
answer
12
Max size of main memory
why this qs has no effect of two level paging??i dont know if the answer given by madeeasy is right..
asked
Jan 3, 2016
in
CO and Architecture

336
views
virtualmemory
coandarchitecture
+4
votes
3
answers
13
Propositional logic
which one is not tautology? 1.((p v q)^(r v s)) > ((p^r) v q vs) 2. ((p v q)^(r v s)) > (q v s) 3.((p v q)^(r v s)) > (r v q v s) 4.((p v q)^(r v s)) > (p v q v s) 5.((p v q)^(r v s)) > (p v q) please tell how to approach this types of qs,this type of qs came many times in gate.I tried it by making table,but it is not doable..so,help me.
asked
Dec 24, 2015
in
Mathematical Logic

803
views
mathematicallogic
firstorderlogic
0
votes
1
answer
14
minimum no of states and final states
I solved both of these qs in a traditional way,by drawing nfa and then convert them to dfa..by tthis process ans shoulbe 4 and 2..but both of them are wrong..pls check..
asked
Dec 13, 2015
in
Theory of Computation

1k
views
theoryofcomputation
minimalstateautomata
+3
votes
4
answers
15
exponential backoff
Nodes A and B are connected with 100 Mbps ethernet segment with 6 microsec pop.delay between them.Suppose A,B send frames at t=0 and frames get collided.after first collision A draws k=0 and bdraws k=1.if jam signal is ignored and timeout is 1 RTT ... 's packet gets completely delivered to B...assume packet size 1000 bits. a)28 microsec b)16 microsec c)22 microsec d)38 microsec
asked
Dec 8, 2015
in
Computer Networks

954
views
0
votes
3
answers
16
how to construct BST by given preorder and postorder traversal
Given preorder and postorder traversal of binary search tree. Preorder: 50, 27, 16, 4, 12, 34, 29, 44, 88, 65, 52, 77, 93, 92 Postorder: 12, 4, 16, 29, 44, 34, 27, 52, 77, 65, 92, 93, 88, 50 The number of nodes present at level 3 are _________. Assume root is present at level 0.
asked
Dec 8, 2015
in
Algorithms

2.7k
views
datastructure
bst
+6
votes
2
answers
17
TOC Number of Equivalence Classes
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivalence classes here...
asked
Dec 5, 2015
in
Theory of Computation

3.4k
views
theoryofcomputation
equivalenceclasses
myhillnerode
+4
votes
2
answers
18
TM
Consider the following turning machine (where,,$\$ $ is represent accept the string). If the string is $01010$ then what will be the output? $10100$ $10101$ $10110$ $10011$
asked
Dec 5, 2015
in
Theory of Computation

223
views
turingmachine
+4
votes
4
answers
19
PDA
Consider the following push down automata. The language accepted by above PDA is_______. Regular but infinite. DCFL but not regular. CFL but not DCFL Finite language.
asked
Dec 5, 2015
in
Theory of Computation

398
views
theoryofcomputation
contextfreelanguage
pushdownautomata
+2
votes
3
answers
20
how many surfaces are required
pls xplain the last line of the qs,"records cannot span 2 records" and what effect does it bring to the problem
asked
Dec 5, 2015
in
Operating System

150
views
disks
+2
votes
2
answers
21
LL(1)Grammar
First one not LL1 as it is ambigous,option c is left recursive,cant decide about option b.... plss help..
asked
Nov 28, 2015
in
Compiler Design

441
views
compilerdesign
+6
votes
4
answers
22
query
Consider the following instance $R$. A 1 2 3 4 B Null 1 2 2 The number of tuples returned by the following SQL query is > select * from $R$ as $R1$ where not exists (select * from $R$ where $B=R1.A$)
asked
Nov 3, 2015
in
Databases

292
views
databases
sql
relationalcalculus
+2
votes
1
answer
23
no of triples..
.WHAT IS TRIPLES????
asked
Nov 3, 2015
in
Databases

324
views
databases
+1
vote
3
answers
24
Total number of tuples
asked
Nov 2, 2015
in
Databases

313
views
databases
relationalalgebra
+3
votes
1
answer
25
ER DIAGRAM
I think ans is A,Please Confirm?
asked
Oct 3, 2015
in
Databases

493
views
databases
erdiagram
+2
votes
1
answer
26
Consider a system such that the number of clock cycles for a polling operation (including transferring to the polling routine, accessing the device and restarting the user program) is 400 cycles, and that the processor executes with a 500 MHz clock. Determine the fraction of CPU consumed when the mouse must be polled 30 times per second. •0.002 % •0.02 % •0.2 % •None of these
asked
Jul 20, 2015
in
CO and Architecture

497
views
coandarchitecture
+1
vote
2
answers
27
f:R>R be such that f(x)=x^33x^2+5x 10..prove that whether it is one to one or onto or both..
asked
May 2, 2015
in
Set Theory & Algebra

2.3k
views
settheory&algebra
0
votes
1
answer
28
prove that y=cos2x+6 is not a one one and onto function.
asked
Apr 22, 2015
in
Set Theory & Algebra

351
views
0
votes
3
answers
29
permutation
How many numbers without repeating the number or digit less than 1000 are divisible by 5 can be formed ?
asked
Mar 26, 2015
in
Numerical Ability

452
views
numericalability
+1
vote
1
answer
30
propagation delay
Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 100 bits of data are to be transmitted ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is _____.
asked
Mar 14, 2015
in
Computer Networks

725
views
computernetworks
networkswitching
50,644
questions
56,531
answers
195,623
comments
101,350
users