GATE CSE format:nat PYQs & Answers — Page 24

Home
GATE
Computer Science and Information Technology
Topics
format:nat

Questions 231–240 of 281. Imported answers require independent review unless marked reviewed.

Topic practice 281 questionsPage 24 of 29

Consider the following program written in pseudo-code. Assume that x and y are integer.

Count(x, y) {

if (y != 1) {

if (x != 1) {

print("*");

Count(x/2, y);

}

else {

y = y-1;

Count(1024, y);

}

The number of times that the print statement is executed by the call Count(1024,1024) is _____.

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

The number of possible min-heaps containing each value from exactly once is _____.

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

Consider the following directed graph G:

Diagram for Computer Science and Information Technology question 47

Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is _____.

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

Consider the weights and values of items listed below. Note that there is only one unit of each item.

Item number	Weight (in Kgs)	Value (in Rupees)
1	10	60
2	7	28
3	4	20
4	2	24

The task is to pick a subset of these items such that their total weight is no more than 11 Kgs and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by

. A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by

The value of

is __________.

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

Consider the minterm list form of a Boolean function

given below.

Here,

denotes a minterm and

denotes a don't care term. The number of essential prime implicants of the function

is _____.

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

The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB). The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 instructions. In the PO stage, 40 instructions take 3 clock cycles each, 35 instructions take 2 clock cycles each, and the remaining 25 instructions take 1 clock cycle each. Assume that there are no data hazards and no control hazards.

The number of clock cycles required for completion of execution of the sequence of instructions is _____.

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

A processor has 16 integer registers (R0, R1, ..., R15) and 64 floating point registers (F0, F1, ..., F63). It uses a 2-byte instruction format. There are four categories of instructions: Type-1, Type-2, Type-3, and Type-4. Type-1 category consists of four instructions, each with 3 integer register operands (3Rs). Type-2 category consists of eight instructions, each with 2 floating point register operands (2Fs). Type-3 category consists of fourteen instructions, each with one integer register operand and one floating point register operand (1R+1F). Type-4 category consists of N instructions, each with a floating point register operand (1F).

The maximum value of N is __________.

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

Given a language

, define

as follows:

for all

Diagram for Computer Science and Information Technology question 52

The order of a language

is defined as the smallest k such that

. Consider the language

(over alphabet 0) accepted by the following automaton.

The order of

is _____.

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

Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, ..., 199) and 256 sectors per track (numbered as 0, 1, ..., 255). The following 6 disk requests of the form [sector number, cylinder number, platter number] are received by the disk controller at the same time:

[120, 72, 2], [180, 134, 1], [60, 20, 0], [212, 86, 3], [56, 116, 2], [118, 16, 1]

Currently the head is positioned at sector number 100 of cylinder 80, and is moving towards higher cylinder numbers. The average power dissipation in moving the head over 100 cylinders is 20 milliwatts and for reversing the direction of the head movement once is 15 milliwatts. Power dissipation associated with rotational latency and switching of head between different platters is negligible.

The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____.

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

Consider an IP packet with a length of 4,500 bytes that includes a 20-byte IPv4 header and a 40-byte TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of 600 bytes. Assume that the length of the IP header in all the outgoing fragments of this packet is 20 bytes. Assume that the fragmentation offset value stored in the first fragment is 0.

The fragmentation offset value stored in the third fragment is _____.

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

GATE CSE format:nat PYQs

Question 45

Question 46

Question 47

Question 48

Question 49

Question 50

Question 51

Question 52

Question 53

Question 54