GATE CSE 2020 Paper 1 — page 18

Questions 52–54 of 65. Imported answers require review unless explicitly marked reviewed.

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ________.

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

Consider a non-pipelined processor operating at 2.5 GHz. It takes 5 clock cycles to complete an instruction. You are going to make a 5-stage pipeline out of this processor. Overheads associated with pipelining force you to operate the pipeline processor at 2 GHz. In a given program, assume that 30% are memory instructions, 60% are ALU instructions and the rest are branch instructions. 5% of the memory instructions cause stalls of 50 clock cycles each due to cache misses and 50% of the branch instructions cause stalls of 2 cycles each. Assume that there are no stalls associated with the execution of ALU instructions. For this program, the speedup achieved by the pipelined processor over the non-pipelined processor (round off to 2 decimal places) 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 64 registers and uses 16-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a 4-bit immediate value. Each R-type instruction contains an opcode and two register names. If there are 8 distinct I-type opcodes, then the maximum number of distinct R-type opcodes is ______.

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

2020 · Paper 1

Question 42

Question 43

Question 44