GATE CSE branch:cs PYQs & Answers — Page 25

Home
GATE
Computer Science and Information Technology
Topics
branch:cs

Questions 241–250 of 975. Imported answers require independent review unless marked reviewed.

Topic practice 975 questionsPage 25 of 98

Suppose a 5-bit message is transmitted from a source to a destination through a noisy channel. The probability that a bit of the message gets flipped during transmission is 0.01. Flipping of each bit is independent of one another. The probability that the message is delivered error-free to the destination is _____. (rounded off to three decimal places)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

A 5-stage instruction pipeline has stage delays of 180, 250, 150, 170, and 250, respectively, in nanoseconds. The delay of an inter-stage latch is 10 nanoseconds. Assume that there are no pipeline stalls due to branches and other hazards. The time taken to process 1000 instructions in microseconds is __________. (rounded off to two decimal places)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Suppose a message of size 1500 bytes is transmitted from a source to a destination using IPv4 protocol via two routers as shown in the figure. Each router has a defined maximum transmission unit (MTU) as shown in the figure, including IP header. The number of fragments that will be delivered to the destination is _______. (Answer in integer)

Diagram for Computer Science and Information Technology question 57

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

In a B⁺- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:

A = (49, 77, 83, -), B = (7, 19, 33, 44), C = (20*, 22*, 25*, 26*)

The *-marked keys signify that these are data entries in a leaf.

Assume that a pointer between keys

and

points to a subtree containing keys in

, and that when a leaf is created, the smallest key in it is copied up into its parent.

A record with key value 23 is inserted into the B⁺- tree.

The smallest key value in the parent of the leaf that contains 25* is __________. (Answer in integer)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a probability distribution given by the density function

The probability that

lies between 2 and 3, i.e.,

is __________. (rounded off to three decimal places)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

A computer system supports a logical address space of

bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical address is divided into a

-bit index to the outer page table, an offset within the page of the inner page table, and an offset within the desired page. Each entry of the inner page table uses eight bytes. All the pages in the system have the same size.

The value of

is __________ . (Answer in integer)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a finite state machine (FSM) with one input

and one output

, represented by the given state transition table. The minimum number of states required to realize this FSM is ______. (Answer in integer)

Diagram for Computer Science and Information Technology question 59

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following algorithm someAlgo that takes an undirected graph

as input.

someAlgo(

)

Let

be any vertex in

. Run BFS on

starting at

. Let

be a vertex in

at maximum distance from

as given by the BFS.

Run BFS on

again with

as the starting vertex. Let

be the vertex at maximum distance from

as given by the BFS.

Output the distance between

and

The output of someAlgo(

) for the tree shown in the given figure is __________. (Answer in integer)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the given sequential circuit designed using D-Flip-flops. The circuit is initialized with some value (initial state). The number of distinct states the circuit will go through before returning back to the initial state is ______ . (Answer in integer)

Diagram for Computer Science and Information Technology question 60

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let

. For

, let

be the product of symbols in

modulo 7. We take

, where

is the null string.

For example,

Define

The number of states in a minimum state DFA for

is __________. (Answer in integer)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE branch:cs PYQs

Question 56

Question 56

Question 57

Question 57

Question 58

Question 58

Question 59

Question 59

Question 60

Question 60