Recent activity by rickeshjohn / GATE Overflow for GATE CSE

13 answers

1

GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.

The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of ...

35.9k views

commented Jul 3, 2017

3 answers

2

TIFR CSE 2012 | Part B | Question: 10
Consider the blocked-set semaphore where the signaling process awakens any one of the suspended process; i.e., Wait (S): If $S>0$ then $S\leftarrow S - 1$, else suspend the execution of this process. Signal (S): If there are ... exclusion, but allows starvation for any $N\geq 2$ The program achieves mutual exclusion and starvation freedom for any $N\geq 1$

Consider the blocked-set semaphore where the signaling process awakens any one of the suspended process; i.e.,Wait (S): If $S>0$ then $S\leftarrow S - 1$, else suspend th...

3.6k views

commented Nov 17, 2016

8 answers

3

GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$

Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...

34.4k views

commented Nov 10, 2016

5 answers

4

GATE CSE 2016 Set 1 | Question: 20
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ... quantum less than the shortest CPU burst Uniform random Highest priority first with priority proportional to CPU burst length

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process schedu...

14.3k views

commented Oct 26, 2016

1 answer

5

Which of the following statements is/are true?
The Operations P(S) & V(S) needs to be atomic. A process exiting the CS will call V(S) Busy-Wait' solutions to the Critical Section are typically implemented using machine instructions that execute in the Kernel mode All of ... the above process to enter the critical section) will never be able to run. Are my points incorrect? Please advice.

The Operations P(S) & V(S) needs to be atomic.A process exiting the CS will call V(S)‘Busy-Wait’ solutions to the Critical Section are typically implemented using mac...

3.3k views

edited Oct 22, 2016

6 answers

6

GATE CSE 2007 | Question: 36
The control signal functions of a $4$-$bit$ binary counter are given below (where $X$ ... through the following sequence: $0, 3, 4$ $0, 3, 4, 5$ $0, 1, 2, 3, 4$ $0, 1, 2, 3, 4, 5$

The control signal functions of a $4$-$bit$ binary counter are given below (where $X$ is “don’t care”):$$\small {\begin{array}{|c|c|c|c|l|}\hline\textbf{Clear}& ...

19.5k views

comment reshown Sep 7, 2016

0 answers

7

Question on the effects of alteration in the cost of link onto the routing tables.
I have a little confusion about some concepts in Distance Vector Routing. Please help. Is it correct to say the following, with regard to Distance Vector routing: 1. Any finite change to the cost of a link will be ... in the next round of exchange, will contain the new values due to the change in cost of the link.

I have a little confusion about some concepts in Distance Vector Routing. Please help. Is it correct to say the following, with regard to Distance Vector routing:1. Any f...

530 views

asked Jun 8, 2016

1 answer

8

Is |L1. L2| = |L1| x |L2|?
The answer given is NO. I have a doubt. When concatenating two languages, we take the strings of the first language and concatenate it with each string of the second language. So if I go by the definition only, the above statement is correct. But by taking a ... ;= |L1| x |L2|. Is this the right logic to answer this question? Or did I miss out on any conceptual reasons?

The answer given is NO. I have a doubt. When concatenating two languages, we take the strings of the first language and concatenate it with each string of the second lang...

962 views

asked Jan 20, 2016

3 answers

9

What is the effect on line utilization, if we increase the number of frames for a constant message size?

a) lower line efficiencyb) higher line efficiencyc) no change in line efficiencyd) no relation between line efficiency and frame size

3.4k views

asked Dec 25, 2015

2 answers

10

Computer Networks DRDO-2008
Two ground stations are connected by a 10Mbps satellite link. The altitude of the satellite is 36,000km and the speed of the signal is 3x108 m/sec. What should be the packet size for channel utilization of 50% using GBN sliding window protocol. ... packets are negligible in size and there are no errors during communcations. 1.5 Kbytes 3 Kbytes 4.5 Kbytes 6 Kbytes

Two ground stations are connected by a 10Mbps satellite link. The altitude of the satellite is 36,000km and the speed of the signal is 3x108 m/sec. What should be the pac...

4.1k views

commented Dec 23, 2015

3 answers

11

Computer Networks question JNUEE 2006
Sliding Window Protocol with Selective Reject/Repeat gives better performance than other protocols when a) buffer is sufficient and bandwidth is limited b) buffer is moderate and bandwidth is sufficient c) buffer is moderate and bandwidth is limited d) buffer is sufficient and bandwidth is sufficient

Sliding Window Protocol with Selective Reject/Repeat gives better performance than other protocols whena) buffer is sufficient and bandwidth is limitedb) buffer is modera...

1.3k views

asked Dec 23, 2015

1 answer

12

MadeEasy Test Series: Computer Networks - Sliding Window
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The sender and receiver window sizes are 5 packets each. Data packets (sent only from A to B) are all 1000 ... μsec. What is the total time required in this communication? a) 250 μsec b) 200 μsec c) 275 μsec d) 450 μsec

Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The sender and receiver window sizes are 5 packe...

437 views

asked Dec 23, 2015

2 answers

13

What are the advantages of star topology?
(a) Less number of cables are required (b) More number of cables are required (c) It is a distributed topology (d) Security is high

(a) Less number of cables are required(b) More number of cables are required(c) It is a distributed topology(d) Security is high

1.2k views

asked Dec 22, 2015

1 answer

14

What does it mean when the propagation delay is given in bits?
Studying ring latency for Ring topology, there were few mentions of propagation delay in bits. While I have learned to convert the time given in bits to seconds, what does the statement means when it says "the propagation delay of a ... in the channel. Or in short, the capacity of the channel is 10 bits. Am I right? Please advice.

Studying ring latency for Ring topology, there were few mentions of propagation delay in bits. While I have learned to convert the time given in bits to seconds, what doe...

1.5k views

commented Aug 6, 2015

2 answers

15

If L1 & L3 are regular & L3 = L1 . L2
If L1 and L3 are regular & L3 = L1 . L2 then: L2 has to be regular L2 need not be regular L2 has to be context free None of these I came across this question and according to me the answer should have been option 1. ... else the language thus obtained may contain strings that cannot be derived through a FA. Please advise as to what is the correct answer.

If L1 and L3 are regular & L3 = L1 . L2 then:L2 has to be regularL2 need not be regularL2 has to be context freeNone of theseI came across this question and according to ...

2.5k views

answer selected Jul 24, 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