Difficulty distribution
How the classified questions are distributed by difficulty.
Your cart is empty.
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.
Every graph below is calculated only from this selection.
Year-wise coverage for Memory Hierarchy and I/O. Each bar uses a separate theme-derived color.
How the classified questions are distributed by difficulty.
MCQ, numerical, multiple-select and other formats found in these papers.
Top subjects by unique question coverage.
Top topics across the included previous year papers.
Top subtopics inside this exact selection.
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Newest papers appear first. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| Computer Science and Information Technology (CS) 2026 | 2026 | 3 | View paper |
| Computer Science and Information Technology (CS) 2026 | 2026 | 3 | View paper |
| Computer Science & Information Technology (CS) 2025 [Session 1] | 2025 | 2 | View paper |
| Computer Science & Information Technology (CS) 2025 [Session 2] | 2025 | 2 | View paper |
| Computer Science & Information Technology (CS) 2024 [Session 1] | 2024 | 3 | View paper |
| Computer Science & Information Technology (CS) 2024 [Session 2] | 2024 | 2 | View paper |
| Computer Science & Information Technology (CS) 2023 [Session 2] | 2023 | 2 | View paper |
| Computer Science & Information Technology (CS) 2022 [Session 2] | 2022 | 4 | View paper |
| Computer Science & Information Technology (CS) 2021 [Session 2] | 2021 | 2 | View paper |
| Computer Science & Information Technology (CS) 2020 [Session 2] | 2020 | 3 | View paper |
| Computer Science & Information Technology (CS) 2019 [Session 2] | 2019 | 4 | View paper |
| Computer Science & Information Technology (CS) 2018 [Session 2] | 2018 | 2 | View paper |
| Computer Science & Information Technology (CS) 2017 [Session 2] | 2017 | 3 | View paper |
| Computer Science & Information Technology (CS) 2016 [Session 1] | 2016 | 2 | View paper |
| Computer Science & Information Technology (CS) 2016 [Session 2] | 2016 | 1 | View paper |
| Computer Science & Information Technology (CS) 2014 [Session 1] | 2014 | 2 | View paper |
| Computer Science & Information Technology (CS) 2014 [Session 2] | 2014 | 3 | View paper |
| Computer Science & Information Technology (CS) 2014 [Session 3] | 2014 | 1 | View paper |
| Computer Science & Information Technology (CS) 2013 [Session 1] | 2013 | 5 | View paper |
| Computer Science & Information Technology (CS) 2013 [Session 2] | 2013 | 1 | View paper |
| Computer Science & Information Technology (CS) 2013 [Session 3] | 2013 | 4 | View paper |
| Computer Science & Information Technology (CS) 2013 [Session 4] | 2013 | 4 | View paper |
| Computer Science & Information Technology (CS) 2010 | 2010 | 3 | View paper |
| Computer Science & Information Technology (CS) 2009 | 2009 | 4 | View paper |
| Computer Science & Information Technology (CS) 2008 | 2008 | 6 | View paper |
| Computer Science & Information Technology (CS) 2007 | 2007 | 4 | View paper |
Practice every matching question in batches of 20, with every available option.
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:
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:
Which of the following lines of the data cache will be replaced by new blocks in accessing the array for the second time?
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to
In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is
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

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?
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
Showing 20 of 70 questions