In the class, 20 students have Lenovo laptops, 15 students have Sony laptops and 8 students have both Lenovo and Sony laptops. How many students are there in the class?
Discrete Mathematics Question Papers - SPPU University
Access and download Discrete Mathematics question papers from Savitribai Phule Pune University (SPPU). Our collection includes INSEM (Internal Semester) and ENDSEM (End Semester) exam papers.
Available Discrete Mathematics Papers
We offer 5 question papers for Discrete Mathematics, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
INSEM Papers for Discrete Mathematics
Prepare for mid-term evaluations with Discrete Mathematics INSEM papers, aligned with the SPPU exam pattern and syllabus.
ENDSEM Papers for Discrete Mathematics
Access Discrete Mathematics ENDSEM papers covering the entire syllabus, essential for final exam preparation.
Online PDF Viewer Features
Our question-paper viewer enables you to:
- View papers in single or split-screen mode.
- Compare multiple papers simultaneously.
- Use fullscreen mode for better readability.
- Filter by exam type (INSEM/ENDSEM).
- Download papers for offline study.
About SPPU Question Papers Hub
SPPU Question Papers Hub is focused entirely on SPPU previous year papers, with cleaner discovery by branch, semester, and subject.
Study Materials for Discrete Mathematics
Discrete Mathematics is a key subject in the SPPU curriculum. Our question paper collection helps students understand exam patterns, practice effectively, and improve academic performance.
Relevant Keywords & Topics
Explore Discrete Mathematics resources including SPPU question papers from Savitribai Phule Pune University. Find INSEM and ENDSEM papers for effective examination preparation. Our platform offers academic resources, a PDF viewer for online study, university question papers, and materials for semester examinations.
Discrete Mathematics
Download Discrete Mathematics Papers
INSEM Papers
Download all INSEM question papers as ZIP
ENDSEM Papers
Download all ENDSEM question papers as ZIP
All Papers
Download all question papers (INSEM + ENDSEM) as ZIP
Discrete Mathematics Questions
Pre-rendered question cards from available structured metadata.
2025 Oct INSEM
Q1
15 MarksConstruct a truth table for each of these compound propositions. i) (p q) q ii) (p q) (p q)
Use mathematical induction to show that : n3 + 2n is divisible by 3 for all n > = 1
Q2
15 MarksHow many different license plates are available if each plate contains a sequence of 3 letters followed by 4 even digits (0, 2, 4, 6, 8) where 0 cannot be taken as 1st digit?
A = {x : x is a natural number less than or equal to 10 and divisible by 2} and B = {x : x is an odd natural number less than or equal to 10} Find i) A – B ii) B – A iii) is A – B = B – A?
What is CNF? Convert p q into CNF.
Q3
15 MarksIn a country club, 60% of women play tennis, 40% play golf, and 20% play both. A woman is chosen at random. Given that she plays tennis, what is the probability that she plays golf?
A committee of 5 people is to be formed from a group of 4 men and 7 women. How many possible committees can be formed if at least 3 women are on the committee?
A man is informed that when a pair of dice were rolled, the result was seven. How much information is there in this message?
Q4
15 MarksA box contain 6 white balls and 5 black balls find the number of ways 4 balls can be drawn from the box if i) Two must be white ii) All of them must have same color
Consider the experiment of tossing a coin three times. What is the probability of getting exactly two tails?
In how many ways can the letters of the word PERMUTATIONS be arranged if the vowels are all together?
| Subject Name | Discrete Mathematics |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 218541 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6578]-32 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Machine Learning |
| Exam Type | INSEM |
| Exam Session | 2025 Oct INSEM |
| Watermark | ['CEGP013091', '49.248.216.237 03/11/2025 10:49:55 static-237'] |
2024 Sep INSEM
Q1
15 MarksWrite the contrapositive, the converse, inverse of the following sentence. “If today is Easter, then tomorrow is Monday”.
Show that (3 1) 1 4 7 ...... (3 2) 2 n n n by Mathematical Induction.
In a survey of 60 people, it was found that, 25 read Business India 26 read India Today 26 read Times of India 11 read both Business India and India Today 9 read both Business India and Times of India 8 read both India Today and Times of India 8 read none of these i) How many read all three? ii) How many read exactly one?
Q2
15 MarksShow that (A – B) – C = A – (B U C) using Venn Diagram.
Prove by truth table : i) ( ) [~ ( )] p q p q ii) [( ) ( )] ( ) p q q r p r
Determine the validity of the argument. S1 : If I like discreate mathematics then I will Study. S2 : Either I will study or I will fail. S : If I fail then I do not like discreate mathematics
Q3
15 MarksFind the number of permutations that can be made out of the letters i) COMPUTER ii) ASSASSINATION
Out of 5 males and 6 females, a committee of 5 is to be formed. Find the number of ways in which it can be formed so that among the person chosen in the committee there are, i) Exactly a male and 2 female ii) At least 2 male and 1 female
A single card is drawn from an ordinary deck of 52 cards. Find the probability p that : i) The card is a face card ii) The card is face card and heart iii) The card is face card or heart
Q4
15 MarksIn how many ways can 6 men and 5 women be seated in a line so that no two women sit together?
In a group of 6 boys and 4 girls, four children are to be selected. In how many ways can they be selected such that at least one boy should be there.
A bag contains 5 red, 4 white and 8 blue balls. 4 balls are drawn at random. What is the probability that there is at least one ball of each color?
| Subject Name | Discrete Mathematics |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 218541 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6359]-532 |
| Academic Year | S.E. |
| Branch Name | AI & ML |
| Exam Type | INSEM |
| Exam Session | 2024 Sep INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 07/10/2024 10:45:10 static-238'] |
2025 May Jun ENDSEM
Q1
18 MarksWhat is a planar graph? Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph?
Build a minimum spanning tree for the following graph using Kruskal’s algorithm.
Define Prefix Code. Which of the following codes are prefix codes? Justify your answer. i) a: 101, e: 11, t: 001, s: 011, n: 010 ii) a: 010, e: 11, t: 011,s :1011, n: 1001, i: 10101
Q2
18 MarksDetermine whether the following graphs are isomorphic to each other. Justify your answer.
Using the labeling procedure, find the maximum flow in the following transport network.
Use the nearest Neighborhood method to solve the Traveling Salesperson problem starting with vertex A. Find the cost of the tour.
Q3
17 MarksConsider these relations on the set of integers: R1={(a, b) | a ≤ b}’, R2= {(a, b) | a > b}, R3= {(a, b) | a =b} R4= {(a, b) | a=1 + b} R5= {(a, b) | a = b or a = –b}, R6= {(a, b) | a + b ≤ 3} Which of these relations contain each of the pairs (1, 1), (1, 2), (2, 1), (1, –1), and (2, 2)?
Solve the following recurrence relation. an = an–1 +2an–2 where a0 =2 and a1=7
What is the minimum number of students required in a discrete mathematics class to be sure that at least five will receive the same grade, if there are five possible grades, A, B, C, D, and F?
Q4
17 MarksExplain the injective function with an example? Determine whether each of these functions is an injection from R to R. i) f(x)= 2x +1 ii) f(x)= x2 +1 iii) f(x)= x3 iv) f(x)= (x2 +1)/(x2 +2)
What is POSET? Let A is set of factors of positive integer m and relation is divisibility on A. i.e. R = { (x,y) | x,y ∈ A, x divides y } For m = 50. Draw Hasse Diagram.
Find the transitive closure by using Warshall’s algorithm for the given relation as: R = {(2,1),(2,3),(3,1),(3,4),(4,1),(4,3)}
Q5
18 MarksUsing Binary expansion method solve the following (Show step-wise answer) 771 mod 15
Which of the following is true? Justify your answer. i) 8347 ≡ 597 (mod 25) ii) 1960 ≡ 971 (mod 23) iii) 1253 ≡ 1045 (mod 10)
Using Chinese Remainder Theorem, find the value of P using following data P ≡ 4 (mod 11) P ≡ 5 (mod 7)
Q6
18 MarksWhat is a Mersenne prime number? Which of the following is the Mersenne Prime number? 7, 31, 255, 63, 8191
Find the Euler’s totient function of the following numbers. i) 37 ii) 50 iii) 96
Find a multiplicative inverse of 52 mod 127 using Extended Euclidean Algorithm.
Q7
17 MarksConsider the set A={1,3,5,7,9 ........} i.e. a set of odd positive integers. Determine whether A is closed under: i) a*b = a + 3b ii) a*b=a/b iii) a*b=a. b (Multiplication) iv) a*b=power (a,b) – b v) a*b=2a+2b vi) a*b=min(1,a,b) – a
Show that (Z7, +) is an Abelian Group
Prove that Hamming Distance d(x,y)=d(y,x).
Q8
17 MarksShow that with operation * defined on the set P={1,-1} by (a* b = a.b) is an Abelian group. * 1 -1 1 1 -1 -1 -1 1
Explain Integral Domain with an example.
Consider the (2,6) encoding function e. e(00)=110000, e(10)=101000 e(01)=011110, e(11)=111001 Find the minimum distance of e.
| Subject Name | Discrete Mathematics |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 218541 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6402]-64 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Machine Learning Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 13/05/2025 09:37:20 static-237'] |
2025 Nov Dec ENDSEM
Q1
17 MarksWhat is Isomorphism in the graph? Explain the rules for graph to be isomorphic with an example.
Construct an optimal tree for the weights 5,7,10,15,35,40. Find the weight of the optimal tree.
Find the fundamental cutset and fundamental circuit for the spanning graph with vertices v4, v2, v1, v3, v5
Q2
17 MarksExplain chromatic numbers with respect to the following graphs i) Complete Graph ii) Star Graph iii) Wheel Graph
Find the maximum flow in the given network
What number of edges are present in a complete graph with n vertices? Explain with the help of a handshaking lemma.
Q3
18 MarksConsider the following relations on {1, 2, 3, 4} : R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 4), (4, 1), (4, 4)}, R2 = {(1, 1), (1, 2), (2, 1)}, R3 = {(1, 1), (1, 2), (1, 4), (2, 1), (2, 2), (3, 3), (4, 1), (4, 4)}, R4 = {(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3)}, R5 = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (2, 4), (3, 3), (3, 4), (4, 4)}, R6 = {(3, 4)}. Which of these relations are reflexive?
Use Warshall’s algorithm to find the transitive closure R* of the following relation R on the set A = {1, 2, 3, 4}, where R = {(1, 2), (1, 3), (1, 4), (2, 1), (2, 3), (3, 4), (3, 2), (4, 2), (4, 3)}
Show that if seven numbers from 1 to 12 are chosen then two of them will add up to 13.
Q4
18 MarksConsider these relations on the set of integers : R1 = {(a, b) | a < b}, R2 = {(a, b) | a > b}, R3 = {(a, b) | a = b or a = –b}, R4 = {(a, b) | a = b}, R5 = {(a, b) | a = b + 1}, R6 = {(a, b) | a + b < 3} Which of these relations contain each of the pairs (1, 1), (1, 2), (2, 1), (1, –1), and (2, 2)?
Let A = {a1, a2, a3} and B = {b1, b2, b3, b4, b5}. Which ordered pairs are in the relation R and R–1 represented by the matrix?
Show that 7 colors are used to paint 50 bicycles, then at least 8 bicycles of the same color.
Q5
18 MarksDetermine quotient and remainder for the following : i) 88 / 10 ii) –88 / 10
State and explain the Euclidean algorithm to computer GCD of two numbers.
Let a = 37 and b = 249. Find i) d = gcd(a, b) ii) Find integers m and n such that d = ma + nb
Q6
18 MarksFind the multiplicative inverse of 40 mod 197 using the Extended Euclidean algorithm.
Using the primality test theorem determine if the following numbers are prime. Justify your answer : i) 131 ii) 253
Using the Chinese Remainder Theorem find the value of X such that : X = 2 mod 3 X = 4 mod 5 X = 3 mod 7
Q7
17 MarksLet R = {0º, 45º, 90º, 135º, 180º, 225º, 270º, 315º} and * = binary operation, so that a*b is overall angular rotation corresponding to successive rotations by a and then by b. Show that (R,*) is a group.
Consider the (2, 6) encoding function e. e(00) = 10111100, e(10) = 10101010 e(01) =00111010, e(11) = 10101101 Find the minimum distance of e. How many errors will e detect?
Define Ring with Unity, with an example.
Q8
17 MarksProve that the following table on relation of elements of set G = {0,1,2,3,4,5} multiplication mod 6 is not a group.
S = {1,2,3,6,12,28}, where a*b is defined as GCD (a,b). Determine whether it is an Abelian Group or not.
Define Commutative Ring, with an example.
| Subject Name | Discrete Mathematics |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 218541 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6582]-68 |
| Academic Year | S.E. |
| Branch Name | Information Technology, AIML |
| Exam Type | ENDSEM |
| Exam Session | 2025 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 10/12/2025 09:41:50 static-237'] |
2024 Nov Dec ENDSEM
Q1
18 MarksWhat is a planar graph? Suppose that a connected planar graph has 30 edges. If a planar representation of this graph divides the plane into 20 regions, how many vertices does this graph have?
Build a minimum spanning tree for the following graph using Kruskal’s algorithm.
Define Prefix Code. Which of the following codes are prefix codes? Justify your answer. i) a: 0, e: 1, t: 01, s: 001 ii) a: 101, e: 11, t: 001, s: 011, n: 010
Q2
18 MarksDetermine whether the following graphs are isomorphic to each other. Justify your answer.
Using the labeling procedure, find the maximum flow in the following transport network.
Use the nearest Neighborhood method to solve the Traveling Salesperson problem starting with vertex a. Find the cost of the tour.
Q3
17 MarksConsider these relations on the set of integers : R 1 = {(a, b) | a < b}, R 2 = {(a, b) | a > b}, R 3 = {(a, b) | a = b} R 4 = {(a, b) | a = 1 + b} R 5 = {(a, b) | a = b or a = –b}, R 6 = {(a, b) | a + b < 3) Which of these relations contain each of the pairs (1, 1), (1, 2), (2, 1), (1, –1) and (2, 2)?
Solve the following recurrence relation. an = an–1 + 2.an–2 where a0 = 2, a1 = 7
What is the minimum number of students required in a discrete mathematics class to be sure that at least six will receive the same grade, if there are five possible grades, A, B, C, D, and F?
Q4
17 MarksExplain the injective function with an example? Determine whether each of these functions is an injection from R to R. i) f(x) = 2x + 1 ii) f(x) = x2 +1 iii) f(x) = x3 iv) f(x) = (x2 +1)/(x2 + 2)
What is POSET? Let A is set of factors of positive integer m and relation is divisibility on A. i.e. R = { (x, y) | x, y A, x divides y } For m = 30. Draw Hasse Diagram.
Find the transitive closure by using Warshall’s algorithm for the given relation as: R = {(2, l), (2, 3), (3, 1), (3, 4), (4, 1), (4, 3)}
Q5
18 MarksUsing Binary expansion method solve the following (Show step-wise answer) 761 mod 15.
Which of the following is true? Justify your answer. i) 556 1296 (mod 25) ii) 1655 935 (mod 23) iii) 448 788 (mod 10)
Using Chinese Remainder Theorem, find the value of p using following data P 2 (mod 11) P 3 (mod 7)
Q6
18 MarksWhat is a Mersenne prime number? Which of the following is the Mersenne Prime number? 71, 31, 255, 63, 7 Justify your answer.
Find the Euler’s totient function of the following numbers : i) 47 ii) 45 iii) 65
Find the multiplicative inverse of 1234 mod 4321 using Extended Euclidean Algorithm.
Q7
17 MarksConsider the set A={1, 3, 5, 7, 9, .........} i.e. a set of odd positive integers. Determine whether A is closed under: i) a*b = a + 3b ii) a*b = (a–b) / 2. iii) a*b=max(a, b) iv) a*b=power (a, b) v) a*b = 2a–b vi) a*b=GCD(a, b)
Show that (Z6, +) is an Abelian Group.
Prove that Hamming Distance d(x,y)=d(y,x).
Q8
17 MarksShow that G = {1, w, w2} is an abelian group under multiplication where w is the cube root of unity.
Explain Integral Domain with an example.
Consider the (2,6) encoding function e. e(00)=110000, e(10)=101000 e(01)=011110, e(11)=111001 Find the minimum distance of e.
| Subject Name | Discrete Mathematics |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 218541 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6352]-68 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Machine Learning |
| Exam Type | ENDSEM |
| Exam Session | 2024 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 27/11/2024 09:47:36 static-237'] |