Recent activity by Groot / GATE Overflow for GATE CSE

1 answer

1

Peterson Davie Computer Networks
Can a node receive its own copy of LSP(link state packet)?

Can a node receive its own copy of LSP(link state packet)?

203 views

asked Jan 3, 2018

1 answer

2

computer netwk
Compute approximate optimal window size when packet size is 53 bytes, the RTT is 60 micro seconds and bottleneck bandwidth is 155 Mbps?

Compute approximate optimal window size when packet size is 53 bytes, the RTT is 60 micro seconds and bottleneck bandwidth is 155 Mbps?

3.0k views

commented Jan 2, 2018

2 answers

3

ISI2015-PCB-CS-3a
Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe how pointer $ptr2$ should be set up for each node so that you will be able to locate the $i$-th node from the start node in the list traversing no more than $[\log\: i] + [i/2]$ nodes.

Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe ...

1.8k views

commented Dec 20, 2017

4 answers

4

TIFR CSE 2017 | Part A | Question: 15
Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following recurrence: $ T(a, b) = T \left( \frac{a}{2}, b \right) +T\left( a, \frac{b}{2} \right)\quad \quad \quad \text{if } a, b \geq 2$ ... $\begin{pmatrix} r+s \\ r \end{pmatrix}$ $2^{r-s}$ if $r \geq s$, otherwise $2^{s-r}$

Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following recurrence:$ T(a, b) = T \left( \frac{a}{2}, b \right) +...

2.4k views

answer edited Oct 31, 2017

0 answers

5

MadeEasy Subject Test: Compiler Design - Parsing
The given answer is 5,i am getting 6 16 in CLR and 10 in LALR.Please someone confirm?

The given answer is 5,i am getting 616 in CLR and 10 in LALR.Please someone confirm?

597 views

commented Oct 31, 2017

1 answer

6

combinatorics
10 persons are seated at round table. The number of ways of selecting 3 persons out of them if no two persons are adjacent to each other is?

10 persons are seated at round table. The number of ways of selecting 3 persons out of them if no two persons are adjacent to each other is?

287 views

answered Sep 16, 2017

3 answers

7

ISRO2007-80
Djikstra’s algorithm is used to Create LSAs Flood an internet with information Calculate the routing tables Create a link state database

Djikstra’s algorithm is used toCreate LSAsFlood an internet with informationCalculate the routing tablesCreate a link state database

5.2k views

commented Sep 15, 2017

1 answer

8

P& c doubt
In a room filled with 7 people ,4 people have exactly 1 Sibling in the room and three people have exactly two sibling in the room .if two individuals are selected from the room at random what is the probability that those two individuals are not sibling? 5/21 3/7 4/7 5/7 16/21

In a room filled with 7 people ,4 people have exactly 1 Sibling in the room and three people have exactly two sibling in the room .if two individuals are selected from th...

316 views

answered Sep 14, 2017

1 answer

9

Fragmentation
Which of the following statements is/ are true about the fragmentation which is done at network layer. (I) The offset of 1st fragment is always offset of parent. (II) The MF of last fragment is always same MF of parent. I think I is true and II is false: Explanation for II :- Host ... MF = 1 packet 1.3 <20,40> MF = 0 packet 1.3's MF != MF of packet 1 In A-R1. is it correct.

Which of the following statements is/ are true about the fragmentation which is done at network layer.(I) The offset of 1st fragment is always offset of parent.(II) The M...

3.8k views

commented Sep 8, 2017

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