My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Computer Science & Information Technology Previous Year Questions

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

27Papers
15Years
1,223Questions
10Topics

Computer Science & Information Technology question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Computer Science & Information Technology. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 678 55.4%
Easy 513 41.9%
Hard 32 2.6%

Question type distribution

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

MCQ 696 56.9%
Numerical Answer Type (NAT) 379 31%
MSQ 148 12.1%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
1223 Qs

Most asked topics

Top topics across the included previous year papers.

Engineering Mathematics
231 Qs
Algorithms
146 Qs
Programming and Data Structures
135 Qs
Computer Networks
120 Qs
Theory of Computation
115 Qs
Computer Organization and Architecture
108 Qs
Databases
107 Qs
Operating System
102 Qs
Digital Logic
86 Qs
Compiler Design
73 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Discrete Mathematics
98 Qs
C Programming and Recursion
73 Qs
Graph Algorithms
66 Qs
Memory Hierarchy and I/O
59 Qs
Regular Languages and Finite Automata
57 Qs
Network Layers and Switching
50 Qs
Probability and Statistics
48 Qs
Calculus
48 Qs
Lexical and Syntax Analysis
41 Qs
Trees, Heaps and Graphs
40 Qs
Complexity Analysis
40 Qs
TCP, Socket Interfaces and Application Protocols
38 Qs
Relational Models, Algebra and SQL
37 Qs
Linear Algebra
37 Qs
Storage, Indexing and Transactions
36 Qs
Processes, Threads and Synchronization
35 Qs
Deadlocks and Scheduling
34 Qs
Integrity Constraints and Normalization
34 Qs
Memory Management and File Systems
33 Qs
Context-free Languages and Pushdown Automata
32 Qs
Number Representation and Arithmetic
31 Qs
Combinational and Sequential Logic
29 Qs
Instruction Sets, ALU and Control Units
29 Qs
Turing Machines and Undecidability
26 Qs
Boolean Algebra and Logic Minimization
26 Qs
Data-link Protocols and Error Detection
22 Qs
Linear Data Structures
22 Qs
Searching, Sorting and Hashing
20 Qs
Pipelining and Hazards
20 Qs
Algorithm Design Techniques
20 Qs
Code Generation and Optimization
19 Qs
Translation and Runtime Environments
13 Qs
Routing and IPv4
10 Qs

Paper coverage

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

Computer Science and Information Technology (CS) 2026
55 Qs
Computer Science and Information Technology (CS) 2026
55 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
55 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
55 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
55 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
54 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
54 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
53 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
54 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
43 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
54 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
55 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
54 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
55 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
44 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
44 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
8 Qs
Computer Science & Information Technology (CS) 2015 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2015 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
53 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
52 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
50 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
64 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
64 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
63 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
20 Qs
Computer Science & Information Technology (CS) 2009
6 Qs

Browse by topics

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

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) 2026202655View paper
Computer Science and Information Technology (CS) 2026202655View paper
Computer Science & Information Technology (CS) 2025 [Session 1]202555View paper
Computer Science & Information Technology (CS) 2025 [Session 2]202555View paper
Computer Science & Information Technology (CS) 2024 [Session 1]202455View paper
Computer Science & Information Technology (CS) 2024 [Session 2]202454View paper
Computer Science & Information Technology (CS) 2023 [Session 2]202354View paper
Computer Science & Information Technology (CS) 2022 [Session 2]202253View paper
Computer Science & Information Technology (CS) 2021 [Session 1]202143View paper
Computer Science & Information Technology (CS) 2021 [Session 2]202154View paper
Computer Science & Information Technology (CS) 2020 [Session 2]202054View paper
Computer Science & Information Technology (CS) 2019 [Session 2]201955View paper
Computer Science & Information Technology (CS) 2018 [Session 2]201854View paper
Computer Science & Information Technology (CS) 2017 [Session 2]201755View paper
Computer Science & Information Technology (CS) 2016 [Session 1]201644View paper
Computer Science & Information Technology (CS) 2016 [Session 2]201644View paper
Computer Science & Information Technology (CS) 2015 [Session 1]20152View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20158View paper
Computer Science & Information Technology (CS) 2015 [Session 3]20152View paper
Computer Science & Information Technology (CS) 2014 [Session 1]201452View paper
Computer Science & Information Technology (CS) 2014 [Session 2]201453View paper
Computer Science & Information Technology (CS) 2014 [Session 3]201450View paper
Computer Science & Information Technology (CS) 2013 [Session 1]201364View paper
Computer Science & Information Technology (CS) 2013 [Session 2]201320View paper
Computer Science & Information Technology (CS) 2013 [Session 3]201363View paper
Computer Science & Information Technology (CS) 2013 [Session 4]201364View paper
Computer Science & Information Technology (CS) 200920096View 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 · Engineering Mathematics · Probability and Statistics
Computer Science & Information Technology (CS) 2009
An unbalanced dice (with 6 faces, numbered from 1 to 6) is thrown. The probability that the face value is odd is 90% of the probability that the face value is even. The probability of getting any even numbered face is the same.
If the probability that the face is even given that it is greater than 3 is 0.75, which one of the following options is closest to the probability that the face value exceeds 3 ?
Open complete paper
2
2013 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2013 [Session 1]
A binary operation ⊕ on a set of integers is defined as x ⊕ y = x² + y² . Which one of the following statements is TRUE about ⊕?
Open complete paper
3
2013 · Computer Science & Information Technology · Engineering Mathematics · Probability and Statistics
Computer Science & Information Technology (CS) 2013 [Session 2]
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
Open complete paper
4
2013 · Computer Science & Information Technology · Computer Networks · TCP, Socket Interfaces and Application Protocols
Computer Science & Information Technology (CS) 2013 [Session 3]
Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ>, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
Open complete paper
5
2013 · Computer Science & Information Technology · Computer Networks · TCP, Socket Interfaces and Application Protocols
Computer Science & Information Technology (CS) 2013 [Session 4]
The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
Open complete paper
6
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?
Open complete paper