Recent activity by Michail / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$

Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...

30.2k views

commented Jul 14, 2016

2 answers

2

UGC_NET_2012 Find performance improvement on parallel execution
Suppose that a given application is run on a 64-processor machine and that 70 per cent of the application can be parallelized. Then the expected performance improvement is — (A) 4.22 (B) 3.22 (C) 3.32 (D) 3.52

Suppose that a given application is run on a 64-processor machine and that 70 per cent of the application can be parallelized. Then the expected performance improvement ...

978 views

answered Jul 12, 2016

3 answers

3

Self made
Which Languages from (regular, CSL, CFL, DCFL, recursive,REL) are closed under INFINITE UNION/ INFINITE INTERSECTION? Please answer with reason/proof.

Which Languages from (regular, CSL, CFL, DCFL, recursive,REL) are closed under INFINITE UNION/ INFINITE INTERSECTION? Please answer with reason/proof.

1.5k views

answered Jul 12, 2016

12 answers

4

GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$

Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume th...

31.1k views

answered Jul 12, 2016

4 answers

5

What Value Function Return ?
Consider the following C function: int f(int n) { static int r = 0; If (n < = 0) return 1; If (n > 3) { r = n; return f (n – 2) + 2; } return f(n – 1) + r; } What is the value of f(5)? (A) 3 (B) 7 (C) 9 (D) 18

Consider the following C function: int f(int n) { static int r = 0; If (n < = 0) r...

2.5k views

answered Jul 12, 2016

2 answers

6

subnetting
A. GIVE A POSSIBLE ARRANGEMENT OF SUBNET MASK TO MAKE THIS POSSIBLE B. SUGGEST WHAT THE ORGANIZATION MIGHT DO IF DEPARTMENT D GROWS TO 34 HOSTS

A. GIVE A POSSIBLE ARRANGEMENT OF SUBNET MASK TO MAKE THIS POSSIBLEB. SUGGEST WHAT THE ORGANIZATION MIGHT DO IF DEPARTMENT D GROWS TO 34 HOSTS

3.3k views

commented Jul 11, 2016

3 answers

7

Which of the following is a valid word of the language?
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ? 10110010101 1010101010 000101010000 001010001010

Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ?101100101011010101010000101010000001010001010

661 views

answered Jul 10, 2016

19 answers

8

GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$

Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...

63.7k views

commented Jul 10, 2016

1 answer

9

GATE CSE 2010 | Question: 40
Consider the languages $L1=\{0^i1^j\ \mid i \neq j\}, $ $L2=\{0^i1^j\mid i=j\},$ $L3=\{0^i1^j \mid i=2j+1\},$ $L4=\{0^i1^j \mid i\neq2j\}$ Only $L2$ is context free. Only $L2$ and $L3$ are context free. Only $L1$ and $L2$ are context free. All are context free

Consider the languages$L1=\{0^i1^j\ \mid i \neq j\}, $$L2=\{0^i1^j\mid i=j\},$$L3=\{0^i1^j \mid i=2j+1\},$$L4=\{0^i1^j \mid i\neq2j\}$Only $L2$ is context free.Only $L2$ ...

11.9k views

commented Jul 7, 2016

9 answers

10

GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$

What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such th...

13.5k views

commented May 14, 2016

9 answers

11

MadeEasy Test Series: Computer Networks - Flow Control Methods
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets are ready and immediately available for transmission. If every ... gets lost), then the number of packets that X will transmit for sending the message to Y are _____.

Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets ...

2.2k views

answered Jan 25, 2016

3 answers

12

Number of packets to be transmitted if every 6th is lost GBN?
Station A needs to send a message consisting of 15 packets to station B' using a sling window (window size 4) and go-back-N error control strategy. All packets are ready and immediately available for transmission. If every 6th packet that A' transmits ... A' will transmit for sending the message to B' ? (a) 29 (b) 33 (c) 27 (d) 25

Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window (window size 4) and go-back-N error control strategy. All packets are r...

7.2k views

answered Jan 25, 2016

11 answers

13

GATE IT 2004 | Question: 35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$

In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $...

11.5k views

commented Jan 14, 2016

4 answers

14

GATE CSE 2008 | Question: 49
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ ...

Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ indicates a final state)$$\overset{Y}{\begin{array}{|l|l|l|}\hline \text{} & ...

14.7k views

commented Jan 13, 2016

2 answers

15

GATE CSE 2013 | Question: 35
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? Find the distinct names of ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only

Consider the following relational schema.Students(rollno: integer, sname: string)Courses(courseno: integer, cname: string)Registration(rollno: integer, courseno: integer,...

15.1k views

commented Jan 2, 2016

4 answers

16

GATE CSE 1998 | Question: 1.9
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is true? $A \subset B$ $B \subset A$ $A$ and $B$ are incomparable $A = B$

If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...

11.3k views

commented Jan 1, 2016

9 answers

17

GATE IT 2004 | Question: 40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$

Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where$K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and$Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsil...

42.5k views

commented Dec 25, 2015

4 answers

18

GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$

Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...

23.8k views

commented Dec 22, 2015

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