GateAI
Cache Memory and Hierarchy

GATE CSE 2025 Set 2 · Q61

NAT2 marksEasy

Time

An application executes 6.4×1086.4 \times 10^8 number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock cycle in nanoseconds is __________. (rounded off to one decimal place)

GATE CSE 2025 Set 2 Q61 diagram

Your answerNumerical answer

Enter a value to check

Solution

Step-by-step verified solution

Official answer: 3

Cache Memory and Hierarchy

To find the clock cycle duration, we calculate the total number of clock cycles required to execute all the instructions:

  1. Clock cycles per instruction type:

    • Branch: 2.25×108×2=4.50×1082.25 \times 10^8 \times 2 = 4.50 \times 10^8 cycles

    • Load: 1.20×108×5=6.00×1081.20 \times 10^8 \times 5 = 6.00 \times 10^8 cycles

    • Store: 1.65×108×4=6.60×1081.65 \times 10^8 \times 4 = 6.60 \times 10^8 cycles

    • Arithmetic: 1.30×108×3=3.90×1081.30 \times 10^8 \times 3 = 3.90 \times 10^8 cycles

  2. Total clock cycles:

    Total Cycles=(4.50+6.00+6.60+3.90)×108=21.0×108 cycles\text{Total Cycles} = (4.50 + 6.00 + 6.60 + 3.90) \times 10^8 = 21.0 \times 10^8\text{ cycles}
  3. Clock cycle duration (TclkT_{\text{clk}}):

    Execution Time=Total Cycles×Tclk\text{Execution Time} = \text{Total Cycles} \times T_{\text{clk}}
    6.3 s=21.0×108×Tclk6.3\text{ s} = 21.0 \times 10^8 \times T_{\text{clk}}
    Tclk=6.321.0×108=0.3×10−8 s=3.0×10−9 s=3.0 nsT_{\text{clk}} = \frac{6.3}{21.0 \times 10^8} = 0.3 \times 10^{-8}\text{ s} = 3.0 \times 10^{-9}\text{ s} = 3.0\text{ ns}

Thus, the duration of a clock cycle is 3.0 nanoseconds.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Cache Memory and Hierarchy previous year question is Q61 of the GATE CSE 2025 Set 2 paper. Find more GATE CSE PYQs on Cache Memory and Hierarchy in Computer Organization and Architecture, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Cache Memory and Hierarchy PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Cache Memory and Hierarchy in GATE CSE

Cache Memory and Hierarchy has 47 GATE CSE PYQs across 23 papers from 2011 to 2026. 16 of them are 2-mark NAT questions like this one, and GATE CSE 2025 Set 2 has 3.

How GATE tests Cache Memory and Hierarchy

More from GATE CSE 2025 Set 2

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2025 Set 2 · Q61 · NAT

An application executes 6.4 × 108 number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock cycle in nanoseconds is … (rounded off to one decimal place)

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.