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.
32Papers
19Years
1,582Questions
10Topics
Computer Science & Information Technology question pattern
Every graph below is calculated only from this selection.
Questions by year
Compare question counts across years.
Difficulty distribution
How the classified questions are distributed by difficulty.
1,582questions
Medium865
54.7%
Easy681
43%
Hard36
2.3%
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
1,582questions
MCQ1,038
65.6%
Numerical Answer Type (NAT)379
24%
MSQ157
9.9%
Fill in the blanks8
0.5%
Subject weightage
Top subjects by unique question coverage.
Computer Science & Information Technology
1582 Qs
Most asked topics
Top topics across the included previous year papers.
Engineering Mathematics
296 Qs
Algorithms
195 Qs
Programming and Data Structures
176 Qs
Theory of Computation
149 Qs
Computer Networks
149 Qs
Computer Organization and Architecture
145 Qs
Databases
134 Qs
Operating System
131 Qs
Digital Logic
113 Qs
Compiler Design
94 Qs
Subtopic coverage
Top subtopics inside this exact selection.
Discrete Mathematics
132 Qs
C Programming and Recursion
94 Qs
Graph Algorithms
82 Qs
Memory Hierarchy and I/O
80 Qs
Regular Languages and Finite Automata
75 Qs
Calculus
61 Qs
Probability and Statistics
60 Qs
Network Layers and Switching
57 Qs
Lexical and Syntax Analysis
53 Qs
Trees, Heaps and Graphs
52 Qs
Complexity Analysis
51 Qs
TCP, Socket Interfaces and Application Protocols
48 Qs
Relational Models, Algebra and SQL
48 Qs
Storage, Indexing and Transactions
47 Qs
Processes, Threads and Synchronization
46 Qs
Linear Algebra
43 Qs
Memory Management and File Systems
43 Qs
Context-free Languages and Pushdown Automata
42 Qs
Deadlocks and Scheduling
42 Qs
Combinational and Sequential Logic
40 Qs
Integrity Constraints and Normalization
39 Qs
Instruction Sets, ALU and Control Units
39 Qs
Boolean Algebra and Logic Minimization
38 Qs
Algorithm Design Techniques
37 Qs
Number Representation and Arithmetic
35 Qs
Turing Machines and Undecidability
32 Qs
Data-link Protocols and Error Detection
30 Qs
Linear Data Structures
30 Qs
Pipelining and Hazards
26 Qs
Searching, Sorting and Hashing
25 Qs
Code Generation and Optimization
25 Qs
Translation and Runtime Environments
16 Qs
Routing and IPv4
14 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) 2017 [Session 1]
10 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) 2011
61 Qs
Computer Science & Information Technology (CS) 2010
65 Qs
Computer Science & Information Technology (CS) 2009
59 Qs
Computer Science & Information Technology (CS) 2008
85 Qs
Computer Science & Information Technology (CS) 2007
85 Qs
Browse by topics
Open a focused page built from the same verified paper data.
Computer Science & Information Technology (CS) 2007
Consider the following two statements about the function \( f(x) = |x| \): P. \( f(x) \) is continuous for all real values of \( x \) Q. \( f(x) \) is differentiable for all real values of \( x \) Which of the following is TRUE?
Computer Science & Information Technology (CS) 2010
Let \(G = (V, E)\) be a graph. Define \(\xi(G) = \sum\limits_d i_d * d\), where \(i_d\) is the number of vertices of degree \(d\) in \(G\). If \(S\) and \(T\) are two different trees with \(\xi(S) = \xi(T)\), then
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?