Recent activity by sarannya / GATE Overflow for GATE CSE

7 answers

1

GATE IT 2006 | Question: 66
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and the Inter-Packet-Gap). The maximum packet processing time at the router for wirespeed forwarding to be possible is (in microseconds) $0.01$ $3.36$ $6.72$ $8$

A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and ...

22.4k views

commented Jan 15, 2018

2 answers

2

Fragmentation
A TCP message consisting of 2800 bytes is passed to IP for delivery across two networks. The first network can carry a maximum payload of 1500 bytes per frame and the second network can carry a maximum payload of 500 bytes per frame, excluding network overhead. ... IP overhead in the second network for this transmission? Doubt:- Answer is given as 120 Bytes but I am getting 140 Bytes

A TCP message consisting of 2800 bytes is passed to IP for delivery across two networks. The first network can carry a maximum payload of 1500 bytes per frame and the sec...

1.8k views

commented Jan 7, 2018

2 answers

3

Self_doubt
This is true that at every router the value of TTL is decremented by one but does that actually mean that other fields in the header are also recomputed?

This is true that at every router the value of TTL is decremented by one but does that actually mean that other fields in the header are also recomputed?

1.7k views

commented Dec 19, 2017

6 answers

4

GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$

For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...

29.4k views

commented Dec 11, 2017

1 answer

5

Process Scheduling
Consider a system which has CPU bound process, which requires burst time of 80 seconds, the multilevel feedback queue scheduling algorithm is used and the queue time quantum is '4' seconds and in each level it is incremented by '10' seconds.Then how many times the process will be interrupted and on which queue the process will terminate the execution?

Consider a system which has CPU bound process, which requires burst time of 80 seconds, the multilevel feedback queue scheduling algorithm is used and the queue time quan...

575 views

commented Dec 11, 2017

4 answers

6

GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.

Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if th...

18.6k views

commented Dec 4, 2017

2 answers

7

theory of computation
$L=\{\langle M \rangle\mid M$ is a TM such that if $M$ accepts $w$ then $M$ accepts $ww$ also$\}$ Which of the following is correct? $L$ is decidable $L$ is recognizable but undecidable $L$ is unrecognizable and $\bar L$ is decidable $L$ is unrecognizable and $\bar L$ is undecidable

$L=\{\langle M \rangle\mid M$ is a TM such that if $M$ accepts $w$ then $M$ accepts $ww$ also$\}$ Which of the following is correct? $L$ is decidable$L$ is recognizable ...

713 views

commented Dec 3, 2017

4 answers

8

L(M) is infinite
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$ $L$ is RE but $L'$ is not RE Both $L$ and $L'$ are RE $L$ is not RE but $L'$ is RE Both $L$ and $L'$ are not RE

$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$$L$ is RE but $L'$ is not REBoth $L$ and $L'$ are RE$L$ is not RE but $L'$ is REBoth $L$ and $L'$ are not RE

5.9k views

commented Dec 3, 2017

1 answer

9

Decidability
Which of the following decision problem is undecidable? I)Given a CFG $G=\left ( N,\Sigma ,P,S \right )$ and a string $x\epsilon \Sigma ^{*}$, does $x\epsilon L\left ( G \right )$? II) Given CFG $G_{1},G_{2}$, Is $L\left ( G_{1} \right )=L\left (G_{2} \right )$?

Which of the following decision problem is undecidable?I)Given a CFG $G=\left ( N,\Sigma ,P,S \right )$ and a string $x\epsilon \Sigma ^{*}$, does $x\epsilon L\left ( G \...

859 views

commented Dec 3, 2017

1 answer

10

How could you find first occurence in Logn time using a variant of BS?
I mean i guess it should be in O(n/2) i.e. O(n) time. Because one must check for every element starting from the first one till n/2 th element & for each of which one must whether A[i]==A[n/2 +i]. Please explain.

I mean i guess it should be in O(n/2) i.e. O(n) time. Because one must check for every element starting from the first one till n/2 th element & for each of which one mus...

1.1k views

commented Nov 24, 2017

1 answer

11

fragmentation
Assume a datagram of length 5*103 bytes needs to pass through five networks to reach its destination. The MTU’s of each network is 1000, 820, 850, 950 and 900 respectively. Then at destination how many datagrams has to reached and what is the offset value of 3rd fragment after fragmentation? 7, 200 6, 400 6, 300

Assume a datagram of length 5*103 bytes needs to pass through five networks to reach its destination. The MTU’s of each network is 1000, 820, 850, 950 and 900 respectiv...

1.9k views

commented Oct 31, 2017

5 answers

12

Formula for calculating efficiency of ethernet
What formula to use for calculating efficiency of ethernet is it $\frac{1}{1+6.44a}$ or $\frac{1}{1+5.44a}$ or $\frac{1}{1+5a}$ I saw three versions for calculating the same thing in different places. I want to know which one is correct.

What formula to use for calculating efficiency of ethernet is it $\frac{1}{1+6.44a}$ or $\frac{1}{1+5.44a}$ or $\frac{1}{1+5a}$I saw three versions for calculating...

16.7k views

commented Oct 26, 2017

2 answers

13

Logical and airthmatic left shift.
I just read that the logical and airthmatical left shift are same while there is a difference in case of right shift. https://en.wikipedia.org/wiki/Bitwise_operation (under Logical shift) Can understand how are they same. Like What is arithmetic left ... other hand, the logical left shift by 1 pos would be 10010010 but both are not same. any example on that.

I just read that the logical and airthmatical left shift are same while there is a difference in case of right shift.https://en.wikipedia.org/wiki/Bitwise_operation (unde...

1.6k views

answered Sep 24, 2017

3 answers

14

Implementation of BSA(Branch and save address) instruction
I have a doubt regarding the implementation of BSA instruction. I read that BSA instruction can be implemented as :- T4:- m[AR] <-- PC; AR<--AR+1 T5:- PC<--AR; SC<--0 Here T4 and T5 are 4th and ... to the position where PC is written. So they should happen at different clock cycles right so that they can execute in proper order?

I have a doubt regarding the implementation of BSA instruction. I read that BSA instruction can be implemented as :-T4:- m[AR] < PC; AR< AR+1T5:- PC< AR; SC< 0He...

3.2k views

commented Sep 15, 2017

4 answers

15

number of ordered trees
The number of possible ordered trees with 3 nodes A, B, C is: (a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?

The number of possible ordered trees with 3 nodes A, B, C is:(a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?

19.3k views

commented Aug 31, 2017

0 answers

16

Prefix property and DPDA
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.

Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.

2.6k views

commented Aug 31, 2017

0 answers

17

Semaphore OS
var occupied, var blocked; Entry section: { if(occupied) { blocked = blocked + 1; sleep(); } else occupied = 1; } Exit section: { occupied = 0; if(blocked) { wakeup(process); blocked = blocked - 1; } } which of the following is ... ie, 2 processes could be in critical section. Please elaborate the correct working of this, for all the possible initial values of occupied and blocked.

var occupied, var blocked;Entry section:{ if(occupied) { blocked = blocked + 1; sleep(); } else occupied = 1;} Exit section:{ ...

222 views

asked Aug 29, 2017

1 answer

18

Binary semaphore
In the standard code for UP operation, UP (S) { if(Waiting queue L is empty) S = 1; else Select a process from waiting queue and wake up(); } ( S is the mutex) Here, why S=1 is not set in the else part as well? For eg: if S=0 and ... wake up(); } Or, is it mandatory that a process can enter the critical section only after letting in, all the processes the got blocked before it?

In the standard code for UP operation,UP (S){ if(Waiting queue L is empty) S = 1; else Select a process from waiting queue and wa...

552 views

asked Aug 6, 2017

0 answers

19

Serializable schedules
If a schedule is conflict/view serializable, does it guarantee that it is strict (and hence cascadeless) as well? OR- Does there exist a serializable schedule which is cascading (not cascadeless)?

If a schedule is conflict/view serializable, does it guarantee that it is strict (and hence cascadeless) as well?OR- Does there exist a serializable schedule which is cas...

227 views

asked Aug 5, 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