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
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.
Recent questions tagged numericalanswers
Questions with numerical answers and no options. No negative marks for these questions.
+9
votes
3
answers
1
GATE201855
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carriersense the medium access protocol. A node that ... allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s on going transmission is _______
asked
Feb 14
in
Computer Networks
by
gatecse
Veteran
(
18k
points)

2.2k
views
gate2018
computernetworks
congestioncontrol
numericalanswers
+10
votes
3
answers
2
GATE201852
Given a language $L$, define $L^i$ as follows: $$L^0 = \{ \varepsilon \}$$ $$L^i = L^{i1} \bullet L \text{ for all } I >0$$ The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1$ (over alphabet O) accepted by the following automaton. The order of $L_1$ is ____
asked
Feb 14
in
Theory of Computation
by
gatecse
Veteran
(
18k
points)

1.5k
views
gate2018
theoryofcomputation
numericalanswers
+8
votes
1
answer
3
GATE201853
Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, , 199), and 256 sectors per track (numbered as 0, 1, 255). The following 6 disk requests of the ... The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____
asked
Feb 14
in
Operating System
by
gatecse
Veteran
(
18k
points)

1.5k
views
gate2018
operatingsystem
disks
numericalanswers
+11
votes
4
answers
4
GATE201851
A processor has 16 integer registers (R0, R1, , R15) and 64 floating point registers (F0, F1, , F63). It uses a 2 byte instruction format. There are four categories of instructions: Type1, Type2, Type3, and Type 4. ... 1F). Type4 category consists of N instructions, each with a floating point register operand (1F). The maximum value of N is _____
asked
Feb 14
in
CO & Architecture
by
gatecse
Veteran
(
18k
points)

1.6k
views
gate2018
coandarchitecture
machineinstructions
instructionformat
numericalanswers
+5
votes
2
answers
5
GATE201854
Consider an IP packet with a length of 4,500 bytes that includes a 20byte IPv4 header ans 40byte TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of 600 bytes. Assume ... the fragmentation offset value stored in the first fragment is 0. The fragmentation offset value stored in the third fragment is _____
asked
Feb 14
in
Computer Networks
by
gatecse
Veteran
(
18k
points)

1.2k
views
gate2018
computernetworks
fragmentation
ipv4
numericalanswers
+6
votes
2
answers
6
GATE201850
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB), The IF, ID, OF and WB stages take 1 ... hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____
asked
Feb 14
in
CO & Architecture
by
gatecse
Veteran
(
18k
points)

1.2k
views
gate2018
coandarchitecture
pipelining
numericalanswers
+4
votes
4
answers
7
GATE201849
Consider the minterm list form of a Boolean function $F$ given below. $$F(P, Q, R, S) = \Sigma m(0, 2, 5, 7, 9, 11) + d(3, 8, 10, 12, 14)$$ Here, $m$ denotes a minterm and $d$ denotes a don't care term. The number of essential prime implicants od hte function $F$ is ___
asked
Feb 14
in
Digital Logic
by
gatecse
Veteran
(
18k
points)

1.2k
views
gate2018
digitallogic
minsumofproductsform
numericalanswers
+5
votes
3
answers
8
GATE201848
Consider the weights and values of items listed below. Note that there is only one unit of each item. Item number Weight (in Kgs) Value (in rupees) 1 10 60 2 7 28 3 4 20 4 2 24 The task is to pick a subset of these items such that ... The total value of items picked by the greedy algorithm is denoted by $V_{greedy}$. The value of $V_{opt}V_{greedy}$ is ____
asked
Feb 14
in
Algorithms
by
gatecse
Veteran
(
18k
points)

1.5k
views
gate2018
algorithms
greedyalgorithm
numericalanswers
+6
votes
4
answers
9
GATE201847
Consider the following undirected graph G: Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is ____
asked
Feb 14
in
Algorithms
by
gatecse
Veteran
(
18k
points)

1.2k
views
gate2018
algorithms
graphalgorithms
minimumspanningtrees
numericalanswers
+3
votes
8
answers
10
GATE201846
The number of possible minheaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
asked
Feb 14
in
Combinatory
by
gatecse
Veteran
(
18k
points)

1.7k
views
gate2018
permutationsandcombinations
heap
numericalanswers
+2
votes
1
answer
11
GATE201843
Let $G$ be a graph with 100! vertices!, with each vertex labelled by a distinct permutation od the numbers 1, 2, ..., 100. There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two ... $y$ denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then $y+10z$ = ____
asked
Feb 14
in
Algorithms
by
gatecse
Veteran
(
18k
points)

1k
views
gate2018
algorithms
graphalgorithms
graphconnectivity
numericalanswers
+4
votes
4
answers
12
GATE201845
Consider the following program written in pseudocode. Assume that $x$ and $y$ are integers. Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y1; Count (1024, y); } } } The number of times that the $print$ statement is executed by the call $Count(1024, 1024)$ is _____
asked
Feb 14
in
Programming
by
gatecse
Veteran
(
18k
points)

1.4k
views
gate2018
programminginc
numericalanswers
+2
votes
2
answers
13
GATE201844
Consider Guwahati, (G) and Delhi (D) whose temperatures can be classified as high $(H)$, medium $(M)$ and low $(L)$. Let $P(H_G)$ denote the probability that Guwahati has high temperature. Similarly, $P(M_G)$ and $P( ... .3$, then the probability (correct to two decimal places) that Guwahati has high temperature given that Delhi has high temperature is _____
asked
Feb 14
in
Probability
by
gatecse
Veteran
(
18k
points)

1.1k
views
gate2018
probability
conditionalprobability
numericalanswers
+2
votes
2
answers
14
GATE201825
Consider a longlived TCP session with an endtoend bandwidth of 1 Gbps ($10^9$ bitspersecond). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is ____
asked
Feb 14
in
Computer Networks
by
gatecse
Veteran
(
18k
points)

1.7k
views
gate2018
computernetworks
tcp
normal
numericalanswers
+5
votes
1
answer
15
GATE201824
Consider a system with 3 processors that share 4 instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___
asked
Feb 14
in
Operating System
by
gatecse
Veteran
(
18k
points)

1.1k
views
gate2018
operatingsystem
deadlockpreventionavoidancedetection
easy
numericalanswers
+5
votes
1
answer
16
GATE201822
Consider the sequential circuit shown in the figure, where both flipflops used are positive edgetriggered D flipflops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____
asked
Feb 14
in
Digital Logic
by
gatecse
Veteran
(
18k
points)

1.1k
views
gate2018
digitallogic
flipflop
numericalanswers
normal
+2
votes
1
answer
17
GATE201823
A 32bit wide main memory unit with a capacity of 1 GB is built using 256M $\times$ 4bit DRAM chips. The number of rows of memory cells in the DRAM chip is $2^{14}$. The time taken to perform one refresh ... percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is_____
asked
Feb 14
in
CO & Architecture
by
gatecse
Veteran
(
18k
points)

1.2k
views
gate2018
coandarchitecture
ram
normal
numericalanswers
+6
votes
6
answers
18
GATE201821
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.
asked
Feb 14
in
Programming
by
gatecse
Veteran
(
18k
points)

1.1k
views
gate2018
programminginc
numericalanswers
recursion
+1
vote
6
answers
19
GATE201816
The value of $\int^{\pi/4} _0 x \cos(x^2) dx$ correct to three decimal places (assuming that $\pi = 3.14$) is ____
asked
Feb 14
in
Calculus
by
gatecse
Veteran
(
18k
points)

1.1k
views
gate2018
calculus
integration
normal
numericalanswers
+5
votes
4
answers
20
GATE201817
Consider a matrix $A= uv^T$ where $u=\begin{pmatrix}1 \\ 2 \end{pmatrix} , v = \begin{pmatrix}1 \\1 \end{pmatrix}$. Note that $v^T$ denotes the transpose of $v$. The largest eigenvalue of $A$ is ____
asked
Feb 14
in
Linear Algebra
by
gatecse
Veteran
(
18k
points)

876
views
gate2018
linearalgebra
eigenvalue
normal
numericalanswers
+1
vote
4
answers
21
GATE201819
Let $G$ be a finite group on 84 elements. The size of a largest possible proper subgroup of $G$ is _____
asked
Feb 14
in
Set Theory & Algebra
by
gatecse
Veteran
(
18k
points)

1k
views
gate2018
groups
numericalanswers
+2
votes
4
answers
22
GATE201820
The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is _____
asked
Feb 14
in
DS
by
gatecse
Veteran
(
18k
points)

949
views
gate2018
datastructure
binarytree
numericalanswers
+4
votes
3
answers
23
GATE201818
The chromatic number of the following graph is _____
asked
Feb 14
in
Graph Theory
by
gatecse
Veteran
(
18k
points)

934
views
gate2018
graphtheory
chromaticnumber
numericalanswers
+2
votes
5
answers
24
GATE201815
Two people, P and Q, decide to independently roll two identical dice, each with 6 faces, numbered 1 to 6. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... that all trials are independent. THe probability (rounded to 3 decimal places) that one of them wins on the third trial is ____
asked
Feb 14
in
Probability
by
gatecse
Veteran
(
18k
points)

905
views
gate2018
probability
normal
numericalanswers
+2
votes
0
answers
25
Mathematics for Algorithm and Systems Analysis By Edward A. Bender, Stanley Gill Williamson
asked
Jan 22
in
Numerical Ability
by
pankaj joshi 1
(
277
points)

44
views
probability
gate
2018
numericalanswers
+1
vote
0
answers
26
Mathematics for Algorithm and Systems Analysis By Edward A. Bender, Stanley Gill Williamson
asked
Jan 22
in
Numerical Ability
by
pankaj joshi 1
(
277
points)

24
views
gate
2018
permutationsandcombinations
numericalanswers
+1
vote
0
answers
27
4.2Qn 3c
In any boolean algebra show that (a+b')(b+c')(c+a')=(a'+b)(b'+c)(c'+a)
asked
Jan 22
in
Mathematical Logic
by
Ashok Tripathi
(
21
points)

25
views
numericalanswers
+1
vote
1
answer
28
The roots of ax2+bx+c=0 are real and positive. a, b and c are real. Then ax2+bx+c=0 has
asked
Nov 29, 2017
in
Numerical Ability
by
hem chandra joshi
Boss
(
5.1k
points)

124
views
numericalanswers
+1
vote
0
answers
29
Testbook Test Series
Assume there are 1024 men,each with distinct arm strength,in an arm wrestling match stronger arm always wins.Number of arm wrestling matches required to find men with strongest and second strongest arm in worst case is ______. I got ... fought with the strongest one in the last match? Answer says for second strongest it will be 9 matches more.
asked
Nov 1, 2017
in
Algorithms
by
jaig
(
213
points)

79
views
algorithms
numericalanswers
+1
vote
0
answers
30
Is Go2017 enough?
I am reading standard books of each subjects as much as I can and solving questions from GO2017 PDFs. I am able to do almost all of the questions from the subjects I have read from those 3 PDFs except for having difficulty in ... scoring in testbook series tests even though I can easily solve go PDFs. Is this bad? Thanks in advance for answering.
asked
Oct 16, 2017
in
GATE
by
Vasu Srivastava
Junior
(
635
points)

106
views
studyresources
go2017programming1
numericalanswers
programming
programminginc
gate
2018
Page:
1
2
3
4
5
6
...
19
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
isro sc 2017 2nd paper
Which college to expect?
Interview Guidance
CDAC CoursesAugust session
Counselling...
Follow @csegate
Gatecse
Recent questions tagged numericalanswers
Recent Blog Comments
@raviyogi Do you know what was the cutoff ot IIT ...
I think the exam has not yet been created.
Then why it's not appearing as a separate exam in ...
very low chances for top nits even in nsr round
okay. What about top NITs?
33,700
questions
40,250
answers
114,331
comments
38,858
users