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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
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.
Search results for gate20161
+28
votes
5
answers
1
GATE 2016150
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n1}$. In the code, function $\text{pmax}$ returns an integer not smaller than any of its arguments .For all $i,t[i]$ is ... can be in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
asked
Feb 12, 2016
in
Operating System
by
Sandeep Singh
Boss
(
9.2k
points)

5.7k
views
gate20161
operatingsystem
resourceallocation
difficult
ambiguous
+25
votes
8
answers
2
GATE 2016154
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second. Tokens arrive at a rate to sustain output at a rate of 10 mega ... full and the machine needs to send 12 mega bytes of data. The minimum time required to transmit the data is _____________ seconds.
asked
Feb 12, 2016
in
Computer Networks
by
Sandeep Singh
Boss
(
9.2k
points)

5.3k
views
gate20161
computernetworks
tokenbucket
normal
numericalanswers
+36
votes
8
answers
3
GATE 201618
We want to design a synchronous counter that counts the sequence $010203$ and then repeats. The minimum number of $\text{JK}$ flipflops required to implement this counter is _____________.
asked
Feb 12, 2016
in
Digital Logic
by
Sandeep Singh
Boss
(
9.2k
points)

7.5k
views
gate20161
digitallogic
digitalcounter
flipflop
normal
numericalanswers
+24
votes
10
answers
4
GATE 2016139
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
asked
Feb 12, 2016
in
Algorithms
by
Sandeep Singh
Boss
(
9.2k
points)

4.5k
views
gate20161
algorithms
spanningtree
normal
numericalanswers
+17
votes
4
answers
5
GATE 2016132
The stage delays in a $4$stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
asked
Feb 12, 2016
in
CO & Architecture
by
Sandeep Singh
Boss
(
9.2k
points)

3.8k
views
gate20161
coandarchitecture
pipelining
normal
numericalanswers
+15
votes
6
answers
6
GATE 2016155
A sender uses the StopandWait ARQ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80$ Kbps (1 Kbps = 1000 bits/second). Size of an acknowledgement is $100$ bytes and the ... Kbps. The oneway propagation delay is $100$ milliseconds. Assuming no frame is lost, the sender throughout is ________ bytes/ second.
asked
Feb 12, 2016
in
Computer Networks
by
Sandeep Singh
Boss
(
9.2k
points)

3.6k
views
gate20161
computernetworks
stopandwait
normal
numericalanswers
+19
votes
8
answers
7
GATE 2016126
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
asked
Feb 12, 2016
in
Combinatory
by
Sandeep Singh
Boss
(
9.2k
points)

3.5k
views
gate20161
permutationsandcombinations
generatingfunctions
normal
numericalanswers
+13
votes
6
answers
8
GATE2016138
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &5 \\ 2&0 &5 &8 \\ 8&5 & ... possible integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________
asked
Feb 12, 2016
in
DS
by
Sandeep Singh
Boss
(
9.2k
points)

3.6k
views
gate20161
datastructure
graphs
normal
numericalanswers
+30
votes
7
answers
9
GATE 2016141
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. Head(Q) returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly Top (S) returns the element at the top of $S$ without removing it from $S$. Consider ... Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
asked
Feb 12, 2016
in
DS
by
Sandeep Singh
Boss
(
9.2k
points)

3.7k
views
gate20161
datastructure
queues
difficult
numericalanswers
+13
votes
4
answers
10
GATE 2016111
Consider the following directed graph: The number of different topological orderings of the vertices of the graph is _____________.
asked
Feb 12, 2016
in
Algorithms
by
Sandeep Singh
Boss
(
9.2k
points)

3k
views
gate20161
algorithms
graphalgorithms
normal
numericalanswers
+23
votes
4
answers
11
GATE 2016115
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); print f("%d\n", a); } The output of the program is _________.
asked
Feb 12, 2016
in
Programming
by
Sandeep Singh
Boss
(
9.2k
points)

2.4k
views
gate20161
programminginc
easy
numericalanswers
+15
votes
3
answers
12
GATE 2016110
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ time. At most one ... for both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$
asked
Feb 12, 2016
in
DS
by
Sandeep Singh
Boss
(
9.2k
points)

2.8k
views
gate20161
datastructure
queues
normal
+12
votes
5
answers
13
GATE 2016107
The $16$ bit $2's$ complement representation of an integer is $1111 \quad 1111 \quad 1111 \quad 0101$; its decimal representation is ______________.
asked
Feb 12, 2016
in
Digital Logic
by
Sandeep Singh
Boss
(
9.2k
points)

2.3k
views
gate20161
digitallogic
numberrepresentation
normal
numericalanswers
+16
votes
8
answers
14
GATE 2016135
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$
asked
Feb 12, 2016
in
Programming
by
Sandeep Singh
Boss
(
9.2k
points)

2.5k
views
gate20161
programminginc
recursion
normal
+17
votes
6
answers
15
GATE 2016127
Consider the recurrence relation $a_1 =8 ,a_n =6n^2 +2n+a_{n1}.$ Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
asked
Feb 12, 2016
in
Combinatory
by
Sandeep Singh
Boss
(
9.2k
points)

3.4k
views
gate20161
permutationsandcombinations
recurrence
normal
numericalanswers
+22
votes
6
answers
16
GATE 2016148
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The CLOOK scheduling algorithm is used. The head is initially at cylinder number $63$, moving towards larger cylinder numbers ... The cylinders are numbered from $0$ to $199$. The total head movement (in number of cylinders) incurred while servicing these requests is__________.
asked
Feb 12, 2016
in
Operating System
by
Sandeep Singh
Boss
(
9.2k
points)

3.7k
views
gate20161
operatingsystem
diskscheduling
normal
numericalanswers
+15
votes
7
answers
17
GATE2016142
Consider the following contextfree grammars; $G_1 : S \to aS \mid B, B \to b \mid bB$ $G_2 : S \to aA \mid bB, A \to aA \mid B \mid \varepsilon,B \to bB \mid \varepsilon$ Which one of the following pairs of languages is generaed by $G_1$ and $G_2$ ,respectively? $\{ a^mb^n \mid m > 0 \ ... $\{ a^mb^n \mid m \geq 0 \ and \ n >0\} \ and \ \{ a^mb^n \mid m > 0 \ or \ n>0\}$
asked
Feb 12, 2016
in
Theory of Computation
by
Sandeep Singh
Boss
(
9.2k
points)

2.1k
views
gate20161
theoryofcomputation
contextfreelanguage
normal
+13
votes
4
answers
18
GATE 2016105
Two eigenvalues of a $3 \times 3$ real matrix $P$ are $(2+\sqrt {1})$ and $3$. The determinant of $P$ is _______
asked
Feb 12, 2016
in
Linear Algebra
by
Sandeep Singh
Boss
(
9.2k
points)

1.8k
views
gate20161
linearalgebra
eigenvalue
numericalanswers
normal
+10
votes
3
answers
19
GATE 2016129
Consider the following experiment. Step 1. Flip a fair coin twice. Step 2. If the outcomes are (TAILS, HEADS) then output $Y$ and stop. Step 3. If the outcomes are either (HEADS, HEADS) or (HEADS, TAILS), then output $N$ and stop. Step 4. If the ... TAILS, TAILS), then go to Step 1. The probability that the output of the experiment is $Y$ is (up to two decimal places) ____________.
asked
Feb 12, 2016
in
Probability
by
Sandeep Singh
Boss
(
9.2k
points)

1.8k
views
gate20161
probability
normal
numericalanswers
+26
votes
5
answers
20
GATE 2016140
$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE? If $e$ is the lightest edge of some cycle in $G$, ... edge of some cycle in $G$, then every MST of $G$ excludes $e$. I only. II only. Both I and II. Neither I nor II.
asked
Feb 12, 2016
in
Algorithms
by
Sandeep Singh
Boss
(
9.2k
points)

3.5k
views
gate20161
algorithms
spanningtree
normal
Page:
1
2
3
...
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Easy or Right: The Choice is Yours
Follow @csegate
Gatecse
Search results for gate20161
Recent Blog Comments
Hi @
thanks a lot sir
I hope everybody derives the best out of this. :)
For creating automatas you can also ...
Really one of the Great post.Thanks papesh.
28,839
questions
36,692
answers
90,637
comments
34,642
users