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.
Answers by Kantikumar
User Kantikumar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kantikumar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
NetworkingKurose ross
in CSMA/CD after Fifth collision ,what is the probability that a Node choose K=4? The result k=4 correspond to how many seconds delay on a 10 Mbps Ethernet? k is standard notation here
answered
Jun 19, 2017
in
Computer Networks

142
views
computernetworks
+4
votes
2
Gate 2017 Set 1
I am expecting 52 marks without normalization in set 1. OBC category. Can anyone please tell me what chances do i stand in getting into any of the IIT's ? Thanks in advance for the reply.
answered
Feb 16, 2017
in
IISc/IITs

643
views
admissiongate2017
+33
votes
3
GATE2017140
Recall that Belady's anomaly is that the pagefault rate may increase as the number of allocated frames increases. Now, consider the following statement: S1: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's anomaly. ... , S2 is true S1 is true, S2 is false S1 is false, S2 is true S1 is false, S2 is false
answered
Feb 14, 2017
in
Operating System

3.1k
views
gate20171
pagereplacement
operatingsystem
normal
+13
votes
4
GATE2017145
The values of parameters for the StopandWait ARQ protocol are as given below: Bit rate of the transmission channel = 1 Mbps. Propagation delay from sender to receiver = 0.75 ms. Time to process a frame = 0.25 ms. Number ... (expressed in percentage) of the StopandWait ARQ protocol for the above parameters is _____________ (correct to 2 decimal places).
answered
Feb 14, 2017
in
Computer Networks

7.2k
views
gate20171
computernetworks
stopandwait
numericalanswers
normal
+27
votes
5
GATE2017118
Threads of a process share global variables but not heap heap but not global variables neither global variables nor heap both heap and global variables
answered
Feb 14, 2017
in
Operating System

3.6k
views
gate20171
operatingsystem
threads
+23
votes
6
GATE2017120
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
answered
Feb 14, 2017
in
DS

2.8k
views
gate20171
datastructure
trees
numericalanswers
+8
votes
7
GATE2017101
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
answered
Feb 14, 2017
in
Mathematical Logic

1.9k
views
gate20171
mathematicallogic
propositionallogic
easy
+16
votes
8
GATE2017237
Consider the C program fragment below which is meant to divide $x$ by $y$ using repeated subtractions. The variables $x$, $y$, $q$ and $r$ are all unsigned int. while (r >= y) { r=ry; q=q+1; } Which of the following conditions on the variables $x, y, q$ and $r$ before ... ;\& \ (r==x) \ \&\& \ (y >0)$ $(q==0) \ \&\& \ (y>0)$
answered
Feb 14, 2017
in
Programming

1.9k
views
gate20172
programming
loopinvariants
+31
votes
9
GATE2017220
The maximum number of IPv4 router addresses that can be listed in the record route (RR) option field of an IPv4 header is______
answered
Feb 14, 2017
in
Computer Networks

3.9k
views
gate20172
computernetworks
ipv4
numericalanswers
+18
votes
10
GATE2017212
Given the following binary number in $32$bit (single precision) $IEEE754$ format : $\large 00111110011011010000000000000000$ The decimal value closest to this floatingpoint number is : $1.45*10^1$ $1.45*10^{1}$ $2.27*10^{1}$ $2.27*10^1$
answered
Feb 14, 2017
in
Digital Logic

4.3k
views
gate20172
digitallogic
numberrepresentation
floatingpointrepresentation
+2
votes
11
GATE200618
We are given a set X = {x1, x2 ...., xn} where xi = 2i. A sample S ⊆ X is drawn by selecting each xi independently with probability Pi = $\frac{1}{2}$. The expected value of the smallest number in sample S is: A) $\frac{1}{n}$ B) 2 C) $\sqrt{n}$ D) n
answered
Feb 3, 2017
in
Probability

168
views
gate2006
engineeringmathematics
expectation
probability
+3
votes
12
made easy qq
answered
Jan 2, 2017
in
Operating System

277
views
madeeasytestseries
operatingsystem
processschedule
threads
+3
votes
13
TIFR2016A7
Let $S$ be the $4 \times 4$ square grid $\{(x, y): x, y \in \{0, 1, 2, 3\} \}$. A $monotone \: \: path$ in this grid starts at $(0, 0)$ and at each step either moves one unit up or one unit right. For example, fromthe point $(x ... . How many distinct monotone paths are there to reach point $(3, 3)$ starting from $(0, 0)$? $2z+6$ $3z+6$ $2z+8$ $3z+8$ $3z+4$
answered
Dec 27, 2016
in
Others

67
views
tifr2016
permutationsandcombinations
dynamicprogramming
+5
votes
14
Schedules
$1)$ Find the number of all possible conflictequivalent and viewequivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B).
answered
Dec 25, 2016
in
Databases

452
views
transactions
conflictserializable
view_serializable
0
votes
15
Self TCP
Why one of the causes of Silly Window Syndrome is when the server announces an empty space of 0? I understand the other two cases that is when When client is able to generate only 1 byte at a time When server is able to consume only 1 byte at a time. But why the third one? https://en.wikipedia.org/wiki/Silly_window_syndrome#Solution
answered
Dec 22, 2016
in
Computer Networks

64
views
computernetworks
+6
votes
16
GATE19882vii
Define the validity of a wellformed formula(wff)
answered
Dec 18, 2016
in
Mathematical Logic

197
views
gate1988
descriptive
mathematicallogic
propositionallogic
+7
votes
17
no of symmetric relations
answered
Dec 16, 2016
in
Set Theory & Algebra

241
views
settheory&algebra
0
votes
18
TOC_Turing Machine
answered
Nov 14, 2016
in
Theory of Computation

60
views
0
votes
19
DMA anc CPU idle time
Which of the following statements is / are true? A. In DMA approach CPU never gets idle for data transfer. B. In DMA approach, CPU becomes idle whenever DMA controller steals cycle. C. In DMA approach,DMA controller accepts a ... last data transfer request D. In DMA approach, CPU can proceed in parallel, only if next instructions do not need bus
answered
Nov 11, 2016
in
Operating System

444
views
dma
operatingsystem
+3
votes
20
GATE1995_21
Let $G_1$ and $G_2$ be subgroups of a group $G$. Show that $G_1 \cap G_2$ is also a subgroup of $G$. Is $G_1 \cup G_2$ always a subgroup of $G$?.
answered
Nov 10, 2016
in
Set Theory & Algebra

528
views
gate1995
settheory&algebra
groups
normal
+1
vote
21
Serializability
My doubt is ... when checking serializbility why do we check conflict and view serializability ..i mean result equivalence would be better ... no doubt it would be more complex but if any transaction is giving the same result as ... has different order of conflicting operations but same result ?? in that case would it be equivalent to serial schedule ??
answered
Nov 10, 2016
in
Databases

47
views
+11
votes
22
GATE19871vii
The exponent of a floatingpoint number is represented in excessN code so that: The dynamic range is large. The precision is high. The smallest number is represented by all zeros. Overflow is avoided.
answered
Nov 9, 2016
in
Digital Logic

472
views
gate1987
digitallogic
numberrepresentation
floatingpointrepresentation
+4
votes
23
GATE EC2006
A probability density function density function is of form P(x)= k e ^(a x) , the value of k is A)0.5 B)1 C) 0.5 a D) a
answered
Nov 8, 2016
in
Probability

181
views
+1
vote
24
GATE practice question
L = {a^i b^j c^k i=j=k or i > 1000 } is regular or not.?
answered
Nov 8, 2016
in
Theory of Computation

51
views
regularlanguages
+2
votes
25
Flow control
Consider two links, (A,B) and (B,C), with propagation delays of d1 and d2, respectively. Assume that host A sends M packets to host C using a sliding window flow control protocol with a window of size W. What is the minimum time it take to send all packets from A to C when ... (A) 2(d1+d2) Ceil(M/W) (B) (d1+d2) MW (C) 2(d1+d2)ceil(W/M) (D) 2(d1+d2)W
answered
Nov 7, 2016
in
Computer Networks

93
views
+4
votes
26
Congestion control is done by
Congestion control is done by Network layer Physical layer Presentation layer Application layer
answered
Sep 6, 2016
in
Computer Networks

672
views
+1
vote
27
#sql #dbms
answered
Sep 6, 2016
in
Databases

134
views
databases
sql
+3
votes
28
#View Serializability #DBMS
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializable But still wanted to know what is the view serializable sequence?
answered
Sep 5, 2016
in
Databases

243
views
view_serializable
databases
transactions
+1
vote
29
Permutations combination
A playoff between two teams consists of atmost five games.The first team that wins three games wins the playoff.In how many different ways can the playoff occur?
answered
Sep 3, 2016

331
views
+1
vote
30
Recurrence for number of nodes
I have a doubt in this question : https://gateoverflow.in/3811/gate2005it_50 I am posting this, as there is a very low probability my comment will be replied. I wanted to progress in the solution by forming the recurrence . This was my ... not correct, as T(1) should be 2. It gives 5; T(0)=1 Can anynody help me with correct recurrence?
answered
Sep 2, 2016
in
Algorithms

56
views
algorithms
recurrence
0
votes
31
GATEBOOK exam
Maximum height an AVL tree can have with 77 nodes (A) 8 (B) 9 (C) 6 (D) 7
answered
Aug 31, 2016
in
Algorithms

896
views
+3
votes
32
IP Addressing
Why mac address alone can't be used in transmitting the data . ?why will be the prob.? Explain please ?
answered
Aug 31, 2016
in
Computer Networks

93
views
34,210
questions
40,895
answers
116,083
comments
39,794
users