Recent activity by biranchi / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2017 Set 1 | Question: 33
Consider a combination of $\text{T}$ and $\text{D}$ flip-flops connected as shown below. The output of the $\text{D}$ flip-flop is connected to the input of the $\text{T}$ flip-flop and the output of the $\text{T}$ flip-flop is connected to the input of ... $3^{\text{rd}}$ cycle are $01$ and after the $4^{\text{th}}$ cycle are $01$ respectively.

Consider a combination of $\text{T}$ and $\text{D}$ flip-flops connected as shown below. The output of the $\text{D}$ flip-flop is connected to the input of the $\text{T}...

14.8k views

answered Apr 1, 2017

2 answers

2

Test by Bikram | Mock GATE | Test 2 | Question: 53
A logic circuit has three input bits: $x_0$, $x_1$, and $x_2$, where $x_0$ is the least significant bit and $x_2$ is the most significant bit. The output from the circuit is $1$ when its input is any of the $3-bit$ numbers $1$, $4$, $5$, ... $\sim x_2x_0 + \sim x_2 +\sim x_1$ $x_2+ \sim x_1x_0$ $\sim x_1x_0+x_2 \sim x_0$

A logic circuit has three input bits: $x_0$, $x_1$, and $x_2$, where $x_0$ is the least significant bit and $x_2$ is the most significant bit. The output from the circuit...

7.5k views

answered Feb 5, 2017

1 answer

3

Test by Bikram | Mock GATE | Test 2 | Question: 34
Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical address space. The system manages an inverted page table, where ... ). Then the size of the basic inverted page table, including page numbers and overhead bits is ________ $bytes$.

Suppose that a certain computer with paged virtual memory has $4 KB$ pages, a $32-bit$ byte addressable virtual address space, and a $30-bit$ byte-addressable physical ad...

876 views

commented Feb 5, 2017

4 answers

4

GATE CSE 2014 Set 1 | Question: 24
Which of the following are used to generate a message digest by the network security protocols? RSA SHA-$1$ DES MD5 I and III only II and III only II and IV only III and IV only

Which of the following are used to generate a message digest by the network security protocols?RSASHA-$1$DESMD5I and III onlyII and III onlyII and IV onlyIII and IV only

7.1k views

commented Jan 27, 2017

3 answers

5

GATE CSE 2011 | Question: 2
A layer-$4$ firewall (a device that can look at all protocol headers up to the transport layer) CANNOT block entire $\text{HTTP}$ traffic during $9:00PM$ and $5:00AM$ block all $\text{ICMP}$ traffic stop incoming traffic from specific $\text{IP}$ ... same IP address block $\text{TCP}$ traffic from a specific user on a multi-user system during $9:00PM$ to $5:00AM$

A layer-$4$ firewall (a device that can look at all protocol headers up to the transport layer) CANNOTblock entire $\text{HTTP}$ traffic during $9:00PM$ and $5:00AM$block...

17.0k views

commented Jan 27, 2017

1 answer

6

Demand Paging
Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference ... , 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time in milliseconds?

Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main me...

9.9k views

answer selected Jan 25, 2017

4 answers

7

Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?

Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...

4.7k views

asked Jan 25, 2017

3 answers

8

Packet Switched Network [GateBook]

1.1k views

commented Jan 24, 2017

0 answers

9

Set Associative Cache [GateBook]

403 views

commented Jan 24, 2017

0 answers

10

Loop invariants [GateBook]

528 views

asked Jan 24, 2017

0 answers

11

Set Counting [GateBook]

345 views

asked Jan 24, 2017

0 answers

12

Functions fog, gof [GateBook]

639 views

asked Jan 24, 2017

1 answer

13

Threading in OS [GateBook]

710 views

asked Jan 24, 2017

2 answers

14

Data Hazards [GateBook]

2.1k views

asked Jan 24, 2017

1 answer

15

Packet Fragmentation on Routers [GateBook]

793 views

asked Jan 24, 2017

1 answer

16

TCP Sequence Number [GateBook]

691 views

asked Jan 24, 2017

1 answer

17

Ethernet Backoff Algorithm [GateBook]

525 views

asked Jan 24, 2017

1 answer

18

No. of injective functions ( TestBook Test Series 2 )

461 views

asked Jan 23, 2017

2 answers

19

Minimum Spanning Tree ( TestBook Test Series 2)

666 views

asked Jan 23, 2017

1 answer

20

Regular and CFL (TestBook Test Series 2)

653 views

asked Jan 22, 2017

1 answer

21

Demand Paging (TestBook Test Series 2)

470 views

asked Jan 22, 2017

2 answers

22

GATE CSE 1987 | Question: 1-vi
A microprogrammed control unit Is faster than a hard-wired control unit. Facilitates easy implementation of new instruction. Is useful when very small programs are to be run. Usually refers to the control unit of a microprocessor.

A microprogrammed control unitIs faster than a hard-wired control unit.Facilitates easy implementation of new instruction.Is useful when very small programs are to be run...

7.4k views

answered Dec 26, 2016

6 answers

23

GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode

The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode

15.2k views

commented Dec 26, 2016

1 answer

24

Acknowledgement Number in Selective Repeat protocol.
Consider a sliding window protocol that uses Selective Repeat , the sender sliding window size is 32 . The sequence number of the frame to be sent after sending 200 frames ______ After receiving first 100 frames the acknowledgement number that is piggybacked by the receiver along with data frame is _______

Consider a sliding window protocol that uses Selective Repeat , the sender sliding window size is 32 .The sequence number of the frame to be sent after sending 200 frames...

3.1k views

asked Nov 27, 2016

2 answers

25

Turing machines decidability problem
Consider the following two decision problems Whether a Turing Machine takes more than 481 steps on input epsilon? Whether a Turing Machine accepts the null string epsilon? Which of the following statements is true ? Problem a is decidable but b is not Problem a is undecidable but b is decidable Both a and b are decidable Both a and b are undecidable

Consider the following two decision problemsWhether a Turing Machine takes more than 481 steps on input epsilon?Whether a Turing Machine accepts the null string epsilon?W...

1.6k views

answer selected Nov 27, 2016

2 answers

26

Pipelining and CPI
Consider a non-pipelined processor design which has a cycle time of 10ns and average CPI of 1.4. If each pipeline stage adds extra 20ps due to register setup delay. The pipeline stalls 20% of the time for 1 cycle and 5% of the time for 2 cycles (these occurrences are disjoint). What is the new CPI?

Consider a non-pipelined processor design which has a cycle time of 10ns and average CPI of 1.4. If each pipeline stage adds extra 20ps due to register setup delay. The p...

2.6k views

asked Nov 17, 2016

2 answers

27

No. of Tag bits in Set Associative cache memory.
Consider the memory system in which the block size in cache and main memory are equal. Cache consists of 512 blocks and main memory consists of 8192 blocks. Cache is 4-way set associative ,calculate the number of tag bits in cache?

Consider the memory system in which the block size in cache and main memory are equal. Cache consists of 512 blocks and main memory consists of 8192 blocks. Cache is 4-wa...

4.9k views

asked Nov 16, 2016

12 answers

28

GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.

Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size u...

37.9k views

commented Aug 6, 2016

2 answers

29

GATE IT 2008 | Question: 68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only

Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...

16.0k views

commented Jul 31, 2016

4 answers

30

GATE CSE 1992 | Question: 02-i
The operation which is commutative but not associative is: AND OR EX-OR NAND

The operation which is commutative but not associative is:ANDOREX-ORNAND

7.4k views

commented Jul 8, 2016

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