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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Amitesh Sharma
User Amitesh Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Amitesh Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
go back n
Assume while transmitting packets using GB5, every 4th packet is lost. Number of transmissions required to transmit 10 packets is ________
comment edited
Nov 29, 2017
in
Computer Networks

277
views
computernetworks
slidingwindow
2
answers
2
Sliding window
Compute approximate optimal window size when packet size is 53 bytes, RTT is 60 microseconds and bottleneck bandwidth is 155 Mbps. 21 22 23 24
commented
Nov 28, 2017
in
Computer Networks

192
views
slidingwindow
computernetworks
1
answer
3
Mathematics: Gate EE 17
Assume that in a traffic junction, the cycle of traffic signal lights is 2 minutes of green(vehicle does not stop) and 3 minutes of red (vehicle stops). Consider the arrival time of vehicles at the junction is uniformly distributed over 5 minute cycle. The expected waiting time in minutes for the vehicle at the junction is _________
commented
Jun 28, 2017
in
Probability

977
views
probability
uniformdistribution
gate2017ee
engineeringmathematics
numericalanswers
4
answers
4
GATE2006IT21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
comment edited
Feb 4, 2017
in
Mathematical Logic

4k
views
gate2006it
mathematicallogic
normal
firstorderlogic
1
answer
5
GATE200942
Which of the following statements are TRUE? There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$ A programming language which allows recursion can be implemented with static storage allocation. No Lattributed definition can be ... at both source language and intermediate code level. I and II I and IV III and IV I, III and IV
commented
Feb 4, 2017
in
Compiler Design

4.4k
views
gate2009
compilerdesign
parsing
normal
8
answers
6
GATE201032
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
commented
Jan 16, 2017
in
Digital Logic

6.3k
views
gate2010
digitallogic
circuitoutput
normal
5
answers
7
GATE2016233
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
commented
Jan 15, 2017
in
CO and Architecture

6k
views
gate20162
coandarchitecture
pipelining
normal
numericalanswers
2
answers
8
GATE2004IT47
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop: for (i = 1; i < = 1000; i++) {I1, I2, I3, I4} where the time taken (in ns) by instructions $I1$ to $I4$ for stages $S1$ to $S4$ ... $I1$ for $i = 2$ will be available after $\text{11 ns}$ $\text{12 ns}$ $\text{13 ns}$ $\text{28 ns}$
commented
Jan 14, 2017
in
CO and Architecture

4k
views
gate2004it
coandarchitecture
pipelining
normal
1
answer
9
GATE2016239
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^{\alpha})$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
commented
Jan 12, 2017
in
Algorithms

4.6k
views
gate20162
algorithms
timecomplexity
recurrence
normal
numericalanswers
2
answers
10
GATE200331
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S \(\to\) {True, False} be a predicate defined on S. Suppose that P(a) = True, P(b) = False and P(x) \(\implies\) P(y) for all $x, y \in S$ satisfying $x \leq y$ ... False for all x \(\in\) S such that b ≤ x and x ≠ c P(x) = False for all x \(\in\) S such that a ≤ x and b ≤ x
commented
Jan 10, 2017
in
Set Theory & Algebra

2.8k
views
gate2003
settheory&algebra
partialorder
normal
propositionallogic
2
answers
11
GATE2004IT4
Let $R$_{1}$ be a relation from $A$ =$\left \{ 1,3,5,7 \right \}$ to $B$ = $\left \{ 2,4,6,8 \right \}$and $R$_{2}$ be another relation from B to C = {1, 2, 3, 4} as defined below: An element $x$ in $A$ is related to an element y in $B$ (under $R$_{1}$) if $x + y$ is divisible by $ ... , 2), (3, 4), (5, 4), (7, 2)} $ $R$_{1}$R$_{2}$ = $ {(3, 2), (3, 4), (5, 1), (5, 3), (7, 1)} $
commented
Jan 10, 2017
in
Set Theory & Algebra

2.1k
views
gate2004it
settheory&algebra
relations
normal
3
answers
12
GATE2015250
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true? A tree has no bridges A bridge cannot be part of a simple cycle Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph) A graph with bridges cannot have cycle
commented
Jan 7, 2017
in
Graph Theory

3k
views
gate20152
graphtheory
graphconnectivity
easy
4
answers
13
GATE2007IT66
Consider the following two transactions : T1 and T2. T1 : read (A); T2 : read (B); read (B); read (A); if A = 0 then B ← B + 1; if B ≠ 0 then A ← A  1; write (B); write (A); Which of the following schemes, using shared and exclusive locks, satisfy the requirements for ... ← B + 1; then A ← A  1; write (B); write (A); unlock (A); unlock (A); unlock (B); unlock (B); commit; commit;
commented
Jan 5, 2017
in
Databases

3.6k
views
gate2007it
databases
transactions
normal
3
answers
14
GATE200410
Consider the grammar rule $E \rightarrow E1  E2$ for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction operation requires the first operand to be in the register. If $E1$ and $E2$ do not have any ... first Evaluation of $E1$ and $E2$ should necessarily be interleaved Order of evaluation of $E1$ and $E2$ is of no consequence
commented
Jan 4, 2017
in
Compiler Design

3.1k
views
gate2004
compilerdesign
targetcodegeneration
normal
8
answers
15
GATE200378
A processor uses $2level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the $10$ most ... a virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
commented
Dec 25, 2016
in
Operating System

12.6k
views
gate2003
operatingsystem
normal
virtualmemory
3
answers
16
GATE2005IT81b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector of the ... data starting from the sector $4$ of the outermost track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
commented
Dec 23, 2016
in
Operating System

3.6k
views
gate2005it
operatingsystem
disks
normal
5
answers
17
GATE2015130
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$. The additional ... ) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.
commented
Dec 10, 2016
in
Operating System

6k
views
gate20151
operatingsystem
diskscheduling
normal
numericalanswers
50,288
questions
55,719
answers
192,113
comments
90,125
users