My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Memory Hierarchy and I/O - Computer Organization and Architecture - Computer Science & Information Technology Previous Year Questions

Practice Memory Hierarchy and I/O - Computer Organization and Architecture - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

26Papers
17Years
75Questions
1Topics

Memory Hierarchy and I/O question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Memory Hierarchy and I/O. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 50 66.7%
Easy 25 33.3%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 46 61.3%
Numerical Answer Type (NAT) 23 30.7%
MSQ 6 8%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
75 Qs

Most asked topics

Top topics across the included previous year papers.

Computer Organization and Architecture
75 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Memory Hierarchy and I/O
75 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2010
3 Qs
Computer Science & Information Technology (CS) 2009
4 Qs
Computer Science & Information Technology (CS) 2008
6 Qs
Computer Science & Information Technology (CS) 2007
4 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620263View paper
Computer Science and Information Technology (CS) 202620263View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20252View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20252View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20243View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20242View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20232View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20224View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20212View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20203View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20194View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20182View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20173View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20162View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20161View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20135View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20134View paper
Computer Science & Information Technology (CS) 201020103View paper
Computer Science & Information Technology (CS) 200920094View paper
Computer Science & Information Technology (CS) 200820086View paper
Computer Science & Information Technology (CS) 200720074View paper

All Memory Hierarchy and I/O previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2007

Consider a 4-way set associative cache consisting of 128 lines with a line size of 64 words. The CPU generates a 20-bit address of a word in main memory. The number of bits in the TAG, LINE and WORD fields are respectively:

Open complete paper
2
2007 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2007

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:

Open complete paper
3
2007 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2007
How many data cache misses will occur in total?
Open complete paper
4
2007 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2007

Which of the following lines of the data cache will be replaced by new blocks in accessing the array for the second time?

Open complete paper
5
2008 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2008

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to

Open complete paper
6
2008 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2008
For inclusion to hold between two cache levels L1 and L2 in a multi-level cache hierarchy, which of the following are necessary?
I. L1 must be a write-through cache
II. L2 must be a write-through cache
III. The associativity of L2 must be greater than that of L1
IV. The L2 cache must be at least as large as the L1 cache
Open complete paper
7
2008 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2008

In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is

Open complete paper
8
2008 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2008
The total size of the tags in the cache directory is
Open complete paper
9
2008 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2008

Which of the following array elements has the same cache index as ARR [0] [0]?

Open complete paper
10
2008 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2008

The cache hit ratio for this initialization loop is

Open complete paper
11
2009 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2009
How many 32K × 1 RAM chips are needed to provide a memory capacity of 256 K-bytes ?
Open complete paper
12
2009 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2009
Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in the following order :
0, 255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155.
Which one of the following memory block will NOT be in cache if LRU replacement policy is used ?
Open complete paper
13
2009 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2009
A hard disk has 63 sectors per track, 10 platters each with 2 recording surfaces and 1000 cylinders. The address of a sector is given as a triple ⟨c, h, s⟩, where c is the cylinder number, h is the surface number and s is the sector number. Thus, the 0th sector is addressed as ⟨0,0,0⟩, the 1st sector as ⟨0,0,1⟩, and so on.
The address ⟨400,16,29⟩ corresponds to sector number:
Open complete paper
14
2009 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2009

The address of 1039th sector is

Open complete paper
15
2010 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2010

A main memory unit with a capacity of 4 megabytes is built using 1M × 1-bit DRAM chips. Each DRAM chip has 1K rows of cells with 1K cells in each row. The time taken for a single refresh operation is 100 nanoseconds. The time required to perform one refresh operation on all the cells in the memory unit is

Open complete paper
16
2010 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2010
When there is a miss in L1 cache and a hit in L2 cache, a block is transferred from L2 cache to L1 cache. What is the time taken for this transfer?

Question diagram

Open complete paper
17
2010 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2010

When there is a miss in both L1 cache and L2 cache, first a block is transferred from main memory to L2 cache, and then a block is transferred from L2 cache to L1 cache. What is the total time taken for these transfers?

Open complete paper
18
2013 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2013 [Session 1]
In a \(k\)-way set associative cache, the cache is divided into \(v\) sets, each of which consists of \(k\) lines. The lines of a set are placed in sequence one after another. The lines in set \(s\) are sequenced before the lines in set \((s+1)\). The main memory blocks are numbered 0 onwards. The main memory block numbered \(j\) must be mapped to any one of the cache lines from
Open complete paper
19
2013 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2013 [Session 1]
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
Open complete paper
20
2013 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2013 [Session 1]

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is

Open complete paper

Showing 20 of 70 questions