My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Computer Organization and Architecture - Computer Science & Information Technology Previous Year Questions

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

23Papers
14Years
108Questions
1Topics

Computer Organization and Architecture question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Computer Organization and Architecture. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 71 65.7%
Easy 35 32.4%
Hard 2 1.9%

Question type distribution

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

MCQ 52 48.1%
Numerical Answer Type (NAT) 47 43.5%
MSQ 9 8.3%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
108 Qs

Most asked topics

Top topics across the included previous year papers.

Computer Organization and Architecture
108 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Memory Hierarchy and I/O
59 Qs
Instruction Sets, ALU and Control Units
29 Qs
Pipelining and Hazards
20 Qs

Paper coverage

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

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

Browse by subtopics

Open a focused page built from the same verified paper data.

Memory Hierarchy and I/O

Explore previous-paper coverage, trends and focused practice for Memory Hierarchy and I/O.

59 questions23 papers14 years

Instruction Sets, ALU and Control Units

Explore previous-paper coverage, trends and focused practice for Instruction Sets, ALU and Control Units.

29 questions15 papers10 years

Pipelining and Hazards

Explore previous-paper coverage, trends and focused practice for Pipelining and Hazards.

20 questions17 papers11 years

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) 202620267View paper
Computer Science and Information Technology (CS) 202620266View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20255View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20256View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20246View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20246View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20235View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20225View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20215View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20208View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20194View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20186View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20173View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20163View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20163View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20144View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20142View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20137View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20136View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20136View paper
Computer Science & Information Technology (CS) 200920091View paper

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
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
2
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
3
2013 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2013 [Session 2]
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
4
2013 · Computer Science & Information Technology · Computer Organization and Architecture · Memory Hierarchy and I/O
Computer Science & Information Technology (CS) 2013 [Session 3]
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
5
2014 · Computer Science & Information Technology · Computer Organization and Architecture · Pipelining and Hazards
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2 pipeline stall cycles is _______________________.
Open complete paper