Recent activity by Sunil8860 / GATE Overflow for GATE CSE

3 answers

1

breadth first search
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is

The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is

2.7k views

commented Sep 22, 2017

0 answers

2

program output

364 views

asked Sep 21, 2017

1 answer

3

Virtual GATE test series

597 views

commented Sep 19, 2017

1 answer

4

cogestion window

279 views

asked Sep 19, 2017

1 answer

5

test series
In a IPv6 protocol communication, If total Router Header length is 448 bits. Then how many routers or hops are there for the packet to reach destination. 3 4 5 2

In a IPv6 protocol communication, If total Router Header length is 448 bits. Then how many routers or hops are there for the packet to reach destination. 3 4 5 2

1.0k views

commented Sep 18, 2017

1 answer

6

fragmentation
The following IPv4 header, shown in hex below, is received for an IP packet at its destination. 4500 003c 1c46 4000 4017 c311 aca8 0101 aca8 0102 Using the Internet checksum algorithm, determine if there were any errors in the transmission?: Single bit error Double bit error More than 2 bit error No error

The following IPv4 header, shown in hex below, is received for an IP packet at its destination.4500 003c 1c46 4000 4017 c311 aca8 0101 aca8 0102Using the Internet checksu...

788 views

commented Sep 17, 2017

4 answers

7

GATE IT 2008 | Question: 67
Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true? (S1): Count to infinity is a problem only with DV and not LS routing (S2): In LS, the shortest path algorithm is run only at one node ( ... lesser number of network messages than LS S1, S2 and S4 only S1, S3 and S4 only S2 and S3 only S1 and S4 only

Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?(S1): Count to infinity is a problem only with DV and...

9.6k views

commented Sep 16, 2017

1 answer

8

split horizon
suppose C-D link is broken then what will be the vector of D instantaneously ??

suppose C-D link is broken then what will be the vector of D instantaneously ??

614 views

asked Sep 16, 2017

4 answers

9

GATE CSE 2014 Set 2 | Question: 25
In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a Token-Ring LAN. An $IP$ packet originates from sender $S$ and traverses to $R$, as shown. The links within each $\text{ISP}$ and across the two $\text{ISP}$s, are all ... $\text{TTL}$ field is $32$. The maximum possible value of the $\text{TTL}$ field when $R$ receives the datagram is _______.

In the diagram shown below, $L1$ is an Ethernet LAN and $L2$ is a Token-Ring LAN. An $IP$ packet originates from sender $S$ and traverses to $R$, as shown. The links with...

18.2k views

commented Sep 6, 2017

1 answer

10

doubts
The Token Bucket is filled at rate of 2 Mbps. Is this means that after one second 2Mb of data will be available at the bucket ready to be sent to the network ? what about the number of token produced?

The Token Bucket is filled at rate of 2 Mbps.Is this means that after one second 2Mb of data will be available at the bucket ready to be sent to the network ?what about t...

546 views

asked Sep 5, 2017

0 answers

11

turing machine and language

238 views

asked Sep 4, 2017

1 answer

12

decidability

415 views

asked Sep 4, 2017

0 answers

13

languages

202 views

asked Sep 4, 2017

0 answers

14

context free grammer

242 views

asked Sep 4, 2017

2 answers

15

regular expression

830 views

asked Sep 4, 2017

1 answer

16

doubts
I am not getting the question

I am not getting the question

283 views

asked Sep 4, 2017

0 answers

17

set-up time of flip flop
what is meant by set up time in this question?

what is meant by set up time in this question?

160 views

asked Aug 31, 2017

1 answer

18

adder
This is binary to radix -12 circuit, how?

This is binary to radix -12 circuit, how?

674 views

asked Aug 30, 2017

0 answers

19

waveforms
Que:- You are given a free running clock with a duty cycle of 50% and a digital waveform f which changes only at the negative edge of the clock. Which one of the following circuits (using clocked D flip-flops) will delay the phase of f by 180°? I don't get what is duty cycle of 50% means and and what is meant by delay the phase by 180?

Que:-You are given a free running clock with a duty cycle of 50% and a digital waveform f which changes only at the negativeedge of the clock. Which one of the following ...

330 views

asked Aug 29, 2017

2 answers

20

gate 2014
which is faster, synchronous circuits or asynchronous circuits and why?

which is faster, synchronous circuits or asynchronous circuits and why?

1.4k views

commented Aug 29, 2017

1 answer

21

DECIDABILITY
Is complement of language same type or not decidable by CFL and recursive language or not??? Grammar is ambiguous or not? Grammar in regular/CFL/rel decidable or not?

Is complement of language same type or not decidable by CFL and recursive language or not???Grammar is ambiguous or not?Grammar in regular/CFL/rel decidable or not?

1.4k views

answered Aug 16, 2017

2 answers

22

Decidability
True/False? The complement of every Turning decidable language is Turning decidable

True/False? The complement of every Turning decidable language is Turning decidable

756 views

asked Aug 16, 2017

0 answers

23

Doubt
Suppose there are two FA's F1 and F2 and given that L(F1) = L(F2) then it means F1 and F2 are same .

Suppose there are two FA's F1 and F2 and given that L(F1) = L(F2) then it means F1 and F2 are same .

350 views

asked Aug 16, 2017

0 answers

24

Context free language
Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state transition ... : Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton? A 10110 B 10010 C 01010 D 01001

Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input al...

564 views

asked Aug 16, 2017

1 answer

25

Closure
Context-free grammar is closed over intersection true/false.

Context-free grammar is closed over intersection true/false.

320 views

asked Aug 16, 2017

5 answers

26

GATE CSE 2016 Set 1 | Question: 44
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$, and $Z$ reduces to $\overline{X}$ (reduction means the standard ... enumerable. $W$ is not recursively enumerable and $Z$ is recursive. $W$ is not recursively enumerable and $Z$ is not recursive.

Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$,...

12.5k views

commented Aug 15, 2017

1 answer

27

status Register & I/o
What is the work of status register in I/O operation ?

What is the work of status register in I/O operation ?

1.6k views

commented Aug 15, 2017

1 answer

28

doubt
what is the RE of the above DFA?

what is the RE of the above DFA?

467 views

asked Aug 15, 2017

6 answers

29

GATE CSE 2013 | Question: 17
Which of the following statements is/are FALSE? For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... and intersection. $1$ and $4$ only $1$ and $3$ only $2$ only $3$ only

Which of the following statements is/are FALSE?For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.Turing recognizable lan...

21.1k views

answer selected Aug 15, 2017

0 answers

30

geeksforgeeks
L1 is a recursively enumerable language over Σ. An algorithm A effectively enumerates its words as w1, w2, w3, … Define another language L2 over Σ Union {#} as {wi # wj : wi, wj ∈ L1, i < j}. Here # is a new symbol. Consider the following assertions. S1 : L1 is recursive implies L2 is recursive S1 is correct can anyone explain how?

L1 is a recursively enumerable language over Σ. An algorithm A effectively enumerates its words as w1, w2, w3, … Define another language L2 over Σ Union {#} as {wi # ...

361 views

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