GATE-CS-2016 (Set 2)

Question 31

In an Ethernet local area network, which one of the following statements is TRUE ?

• A station stops to sense the channel once it starts transmitting a frame.
• The purpose of the jamming signal is to pad the frames that are smaller than the minimum frame size.
• A station continues to transmit the packet even after the collision is detected.
• The exponential backoff mechanism reduces the probability of collision on retransmissions

Question 32

Identify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted.

• HTTP GET request, DNS query, TCP SYN
• DNS query, HTTP GET request, TCP SYN
• DNS query, TCP SYN, HTTP GET request
• TCP SYN, DNS query, HTTP GET request

Question 33

A binary relation R on N x N is defined as follows:

(a, b) R (c, d) if a <= c or b <= d.

Consider the following propositions:

P: R is reflexive
Q: R is transitive

Which one of the following statements is TRUE?

• Both P and Q are true.
• P is true and Q is false.
• P is false and Q is true.
• Both P and Q are false.

Question 34

Which one of the following well-formed formulae in predicate calculus is NOT valid?

• A
• B
• C
• D

Question 35

Consider a set U of 23 different compounds in a Chemistry lab. There is a subset S of U of 9 compounds, each of which reacts with exactly 3 compounds of U. Consider the following statements:

I.  Each compound in U \\ S reacts with an odd number of compounds.
II.  At least one compound in U \\ S reacts with an odd number of compounds.
III.  Each compound in U \\ S reacts with an even number of compounds. 

Which one of the above statements is ALWAYS TRUE?

• Only I
• Only II
• Only III
• None

Question 36

The value of the expression 13⁹⁹(mod 17), in the range 0 to 16, is :   Note : This question was asked as Numerical Answer Type.

• 4
• 13
• 8
• 16

Question 37

Suppose the functions F and G can be computed in 5 and 3 nanoseconds by functional units U_F and U_G, respectively. Given two instances of U_F and two instances of U_G, it is required to implement the computation F(G(Xi)) for 1 <= i <= 10. ignoring all other delays, the minimum time required to complete this computation is ________________ nanoseconds [Note that this is originally a Fill-in-the-Blanks Question]

• 28
• 20
• 18
• 30

Question 38

Consider a processor with 64 registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and a twelve-bit immediate value. Each instruction must be stored in memory in a byte-aligned fashion. If a program has 100 instructions, the amount of memory (in bytes) consumed by the program text is ____________ [Note that this was originally a Fill-in-the-Blanks question]

• 100
• 200
• 400
• 500

Question 39

The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is ____________ bits

• 24
• 20
• 30
• 40

Question 40

Consider a 3 GHz (gigahertz) processor with a three-stage pipeline and stage latencies v1, v2, and v3 such that v1 = 3v2/4 = 2v3. If the longest pipeline stage is split into two pipeline stages of equal latency, the new frequency is _________ GHz, ignoring delays in the pipeline registers

• 2
• 4
• 8
• 16