Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Kantikumar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Kantikumar
1
votes
1
Networking-Kurose 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
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 ...
8.9k
views
answered
Jun 19, 2017
Computer Networks
computer-networks
+
–
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.
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...
1.4k
views
answered
Feb 16, 2017
IISc/IITs
admission-gate2017
+
–
70
votes
3
GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:$S_1$: Random pa...
15.1k
views
answered
Feb 14, 2017
Operating System
gatecse-2017-set1
page-replacement
operating-system
normal
+
–
44
votes
4
GATE CSE 2017 Set 1 | Question: 45
The values of parameters for the Stop-and-Wait 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 Stop-and-Wait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).
The values of parameters for the Stop-and-Wait ARQ protocol are as given below:Bit rate of the transmission channel $= 1$ Mbps.Propagation delay from sender to receiver $...
32.6k
views
answered
Feb 14, 2017
Computer Networks
gatecse-2017-set1
computer-networks
stop-and-wait
numerical-answers
normal
+
–
57
votes
5
GATE CSE 2017 Set 1 | Question: 18
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
Threads of a process shareglobal variables but not heapheap but not global variablesneither global variables nor heapboth heap and global variables
16.8k
views
answered
Feb 14, 2017
Operating System
gatecse-2017-set1
operating-system
threads
+
–
52
votes
6
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
18.7k
views
answered
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
tree
easy
numerical-answers
+
–
11
votes
7
GATE CSE 2017 Set 1 | Question: 01
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
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 ( ...
8.9k
views
answered
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
propositional-logic
easy
+
–
52
votes
8
GATE CSE 2017 Set 2 | Question: 37
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=r-y; q=q+1; } Which of the following conditions on the variables $x, y, q$ and $r$ ... $(q==0) \ \&\& \ (y>0)$
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 >...
14.0k
views
answered
Feb 14, 2017
Programming in C
gatecse-2017-set2
programming
loop-invariants
+
–
63
votes
9
GATE CSE 2017 Set 2 | Question: 20
The maximum number of $\textsf{IPv4}$ router addresses that can be listed in the record route (RR) option field of an $\textsf{IPv4}$ header is______.
The maximum number of $\textsf{IPv4}$ router addresses that can be listed in the record route (RR) option field of an $\textsf{IPv4}$ header is______.
16.3k
views
answered
Feb 14, 2017
Computer Networks
gatecse-2017-set2
computer-networks
ip-addressing
numerical-answers
+
–
49
votes
10
GATE CSE 2017 Set 2 | Question: 12
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$ The decimal value closest to this floating-point number is : $1.45*10^1$ $1.45*10^{-1}$ $2.27*10^{-1}$ $2.27*10^1$
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$Th...
21.7k
views
answered
Feb 14, 2017
Digital Logic
gatecse-2017-set2
digital-logic
number-representation
floating-point-representation
ieee-representation
+
–
10
votes
11
GATE CSE 2006 | Question: 18
We are given a set $X = \{X_1,\ldots,X_n\}$ where $X_i=2^i$. A sample $S\subseteq X$ is drawn by selecting each $X_i$ independently with probability $P_i = \frac{1}{2}$ . The expected value of the smallest number in sample $S$ is: $\left(\frac{1}{n}\right)$ $2$ $\sqrt n$ $n$
We are given a set $X = \{X_1,\ldots,X_n\}$ where $X_i=2^i$. A sample $S\subseteq X$ is drawn by selecting each $X_i$ independently with probability $P_i = \frac{1}{2...
14.7k
views
answered
Feb 3, 2017
Probability
gatecse-2006
probability
expectation
normal
+
–
3
votes
12
MadeEasy Subject Test: Operating System - Process Synchronization
825
views
answered
Jan 2, 2017
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
6
votes
13
TIFR CSE 2016 | Part A | Question: 7
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, from the point $(x, y)$ one ... 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$
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 ...
733
views
answered
Dec 27, 2016
Combinatory
tifr2016
combinatory
counting
+
–
7
votes
14
Schedules
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B).
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
4.9k
views
answered
Dec 25, 2016
Databases
transaction-and-concurrency
conflict-serializable
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
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 gener...
273
views
answered
Dec 22, 2016
Computer Networks
computer-networks
+
–
22
votes
16
GATE CSE 1988 | Question: 2vii
Define the validity of a well-formed formula(wff)?
Define the validity of a well-formed formula(wff)?
1.9k
views
answered
Dec 18, 2016
Mathematical Logic
gate1988
descriptive
mathematical-logic
propositional-logic
+
–
9
votes
17
Ace Test Series: Set Theory & Algebra - Relations
698
views
answered
Dec 16, 2016
Set Theory & Algebra
set-theory&algebra
relations
ace-test-series
+
–
0
votes
18
TOC_Turing Machine
260
views
answered
Nov 14, 2016
1
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 data transfer ... completing last data transfer request D. In DMA approach, CPU can proceed in parallel, only if next instructions do not need bus
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 stea...
2.8k
views
answered
Nov 11, 2016
Operating System
dma
operating-system
+
–
3
votes
20
GATE CSE 1995 | Question: 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$?.
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$?.
6.5k
views
answered
Nov 10, 2016
Set Theory & Algebra
gate1995
set-theory&algebra
group-theory
normal
descriptive
proof
+
–
1
votes
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 serial schedule then ... which has different order of conflicting operations but same result ?? in that case would it be equivalent to serial schedule ??
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 c...
254
views
answered
Nov 10, 2016
30
votes
22
GATE CSE 1987 | Question: 1-vii
The exponent of a floating-point number is represented in excess-$\text{N}$ code so that: The dynamic range is large. The precision is high. The smallest number is represented by all zeros. Overflow is avoided.
The exponent of a floating-point number is represented in excess-$\text{N}$ code so that:The dynamic range is large.The precision is high.The smallest number is represent...
5.3k
views
answered
Nov 9, 2016
Digital Logic
gate1987
digital-logic
number-representation
floating-point-representation
+
–
5
votes
23
GATE EC-2006
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
A probability density function density function is of form P(x)= k e ^(-a |x|) , the value of k isA)0.5B)1C) 0.5 aD) a
2.8k
views
answered
Nov 8, 2016
1
votes
24
GATE practice question
L = {a^i b^j c^k| i=j=k or i > 1000 } is regular or not.?
L = {a^i b^j c^k| i=j=k or i 1000 } is regular or not.?
338
views
answered
Nov 8, 2016
Theory of Computation
regular-language
+
–
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 the flow control ... are negligible (A) 2(d1+d2) Ceil(M/W) (B) (d1+d2) MW (C) 2(d1+d2)ceil(W/M) (D) 2(d1+d2)W
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 ...
513
views
answered
Nov 7, 2016
5
votes
26
Congestion control is done by
Congestion control is done by Network layer Physical layer Presentation layer Application layer
Congestion control is done byNetwork layerPhysical layerPresentation layerApplication layer
4.4k
views
answered
Sep 6, 2016
1
votes
27
#sql #dbms
505
views
answered
Sep 6, 2016
Databases
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?
I know that this is Conflict serializable and i know all schedules which are Conflict serializable are also view serializableBut still wanted to know what is the view ser...
971
views
answered
Sep 5, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
3
votes
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?
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?
2.6k
views
answered
Sep 3, 2016
1
votes
30
Recurrence for number of nodes
I have a doubt in this question : https://gateoverflow.in/3811/gate2005-it_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 logic : T(h) : No. ... 3 This is not correct, as T(1) should be 2. It gives 5; T(0)=1 Can anynody help me with correct recurrence?
I have a doubt in this question :https://gateoverflow.in/3811/gate2005-it_50I am posting this, as there is a very low probability my comment will be replied.I wanted to p...
263
views
answered
Sep 2, 2016
Algorithms
algorithms
recurrence-relation
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register