My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Discrete Mathematics - Engineering Mathematics - Computer Science & Information Technology Previous Year Questions

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

28Papers
18Years
126Questions
1Topics

Discrete Mathematics question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Discrete Mathematics. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Easy 86 68.3%
Medium 39 31%
Hard 1 0.8%

Question type distribution

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

MCQ 84 66.7%
Numerical Answer Type (NAT) 29 23%
MSQ 13 10.3%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
126 Qs

Most asked topics

Top topics across the included previous year papers.

Engineering Mathematics
126 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Discrete Mathematics
126 Qs

Paper coverage

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

Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
7 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
6 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
11 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
10 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
9 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2010
13 Qs
Computer Science & Information Technology (CS) 2009
6 Qs
Computer Science & Information Technology (CS) 2008
2 Qs
Computer Science & Information Technology (CS) 2007
7 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) 202620261View paper
Computer Science and Information Technology (CS) 202620262View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20254View 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]20244View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20235View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20224View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20213View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20213View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20204View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20195View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20183View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20173View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20167View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20146View paper
Computer Science & Information Technology (CS) 2013 [Session 1]201311View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20139View paper
Computer Science & Information Technology (CS) 2013 [Session 4]201310View paper
Computer Science & Information Technology (CS) 2010201013View paper
Computer Science & Information Technology (CS) 200920096View paper
Computer Science & Information Technology (CS) 200820082View paper
Computer Science & Information Technology (CS) 200720077View paper

All Discrete Mathematics previous year questions

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

1
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007
Let S be a set of \( n \) elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are
Open complete paper
2
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007
How many different non-isomorphic Abelian groups of order 4 are there?
Open complete paper
3
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007
Let Graph(x) be a predicate which denotes that x is a graph. Let Connected(x) be a predicate which denotes that x is connected. Which of the following first order logic sentences DOES NOT represent the statement: "Not every graph is connected"?
Open complete paper
4
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007

Which of the following graphs has an Eulerian circuit?

Open complete paper
5
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007
Consider the set S = {a, b, c, d}. Consider the following 4 partitions π₁, π₂, π₃, π₄ on S: π₁ = {abcd}, π₂ = {ab, cd}, π₃ = {abc, d}, π₄ = {a, b, c, d}. Let < be the partial order on the set of partitions S' = {π₁, π₂, π₃, π₄} defined as follows: πᵢ < πⱼ if and only if πᵢ refines πⱼ. The poset diagram for (S', <) is

Question diagram

Open complete paper
6
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007
How many distinct paths are there for the robot to reach the point \((10,10)\) starting from the initial position \((0,0)\)?
Open complete paper
7
2007 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2007
Suppose that the robot is not allowed to traverse the line segment from \((4,4)\) to \((5,4)\). With this constraint, how many distinct paths are there for the robot to reach \((10,10)\) starting from \((0,0)\)?
Open complete paper
8
2008 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2008
If P, Q, R are subsets of the universal set U, then \((P \cap Q \cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c\) is
Open complete paper
9
2008 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2008
Let $P = \sum_{\substack{1 \le i < j \le k}} i$ and $Q = \sum_{\substack{1 \le i < j \le k}} j$, where $k$ is a positive integer. Then
Open complete paper
10
2009 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2009
Which one of the following is NOT necessarily a property of a Group ?
Open complete paper
11
2009 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2009
Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices ?
Open complete paper
12
2009 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2009
Consider the binary relation \(R = \{(x, y), (x, z), (z, x), (z, y)\}\) on the set \(\{x, y, z\}\). Which one of the following is TRUE ?
Open complete paper
13
2009 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2009
For the composition table of a cyclic group shown below
*abcd
aabcd
bbadc
ccdab
ddcab
Which one of the following choices is correct ?
Open complete paper
14
2009 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2009
Which one of the following is the most appropriate logical formula to represent the statement :
“Gold and silver ornaments are precious”
The following notations are used :
G(x): x is a gold ornament
S(x): x is a silver ornament
P(x): x is precious
Open complete paper
15
2009 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2009
Consider the following well-formed formulae :
I. ¬∀x(P(x))
II. ¬∃x(P(x))
III. ¬∃x(¬P(x))
IV. ∃x(¬P(x))
Which of the above are equivalent ?
Open complete paper
16
2010 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2010

What is the possible number of reflexive relations on a set of 5 elements?

Open complete paper
17
2010 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2010
Consider the set \(S = \{1, \omega, \omega^2\}\), where \(\omega\) and \(\omega^2\) are cube roots of unity. If * denotes the multiplication operation, the structure \(S, *\) forms
Open complete paper
18
2010 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2010
What is the probability that a divisor of 10^99 is a multiple of 10^96?
Open complete paper
19
2010 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2010
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?
I. 7, 6, 5, 4, 4, 3, 2, 1
II. 6, 6, 6, 6, 3, 3, 2, 2
III. 7, 6, 6, 4, 4, 3, 2, 2
IV. 8, 7, 7, 6, 4, 2, 1, 1
Open complete paper
20
2010 · Computer Science & Information Technology · Engineering Mathematics · Discrete Mathematics
Computer Science & Information Technology (CS) 2010
Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. Which one of the statements below expresses best the meaning of the formula \forall x \exists y \exists t(\neg F(x, y, t))?
Open complete paper

Showing 20 of 113 questions