Discrete Mathematics (DM) SPPU Endsem Question Paper May 2024
All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.
- Subject code
- 210241
- Pattern
- 2019 pattern
- Exam
- Endsem
- Session
- May 2024
- Max. marks
- 70
- Time
- 2½ Hours
- Semester
- III
- Paper code
- [6261]-40
Printed for: S.E. (Computer Engg.) (Artificial Intelligence & Data Science Engg.)
Instructions to the candidates
- Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
- Neat diagrams must be drawn whenever necessary.
- Figures to the right indicates full marks.
- Assume suitable data if necessary.
Questions
Q1
- a)[6]
From a group of 7 men and 6 women, five persons are to be selected to from a committee so that at least 3 men are there on the committee. In how many ways can it be done?
- b)[6]
How many 3-digit numbers can be formed from the digits 2,3,5,6,7 and 9, which are divisible by 5 and none of the digits is repeated?
- c)[6]
How many 6-digit odd numbers greater than 6,00,000 can be formed from the digits 5,6,7,8,9, and 0 i) If repetition is allowed. ii) If repitition is not allowed
OR- a)
Q2
- a)[6]
In how many different ways can the letters of the word ‘OPTICAL’ be arranged so that the vowels always come together
- b)[6]
If a committee has eight members. i) How many way can the committee members be seated in a row? ii) How many way can the committee select a president, vice-precident and secretary
- c)[6]
In a certain country, the car number plate is formed by 4 digits from the digits 1,2,3,4,5,6,7,8 and 9 followed by 3 letters from the alphabet. How many number plates can be formed if neither the digits nor the letters are repeated? 2
- a)
Q3
ORQ4
- a)[7]
Use dijkstras algorithm to find the shortes path between A and Z in figure.
- b)[5]
Draw a complete bipartite graph on 2 and 4 vertices K2,4 and 2 and 3 vertices K2,3.
- c)[5]
Under What condition K m,n will have eulerian circuit
- a)
Q5
- a)[6]
Define following terms i) Level of a tree ii) Height of a tree iii) Fundamental circuit 3
Also asked:Dec 2025
- b)[6]
Use labeling procedure to find a maximum flow in the transport network given in the following figure. Determine the corresponding minimum cut.
- c)[6]
Construct Minimal spanning tree for the following graphs using prims algorithm
Also asked:Dec 2025
OR- a)
Q6
Q7
- a)[6]
Define: i) Cyclic group ii) Abelian group iii) Cosets
- b)[6]
This part has equations that don’t show as text. Open the PDF to read it.
- c)[5]
This part has equations that don’t show as text. Open the PDF to read it.
OR- a)
Q8
- a)[6]
Define: i) Group codes ii) Subgroup iii) Integral domain
- b)[6]
Let (A,*) be an algebraic system where * is a binary operation such that for any a,b, belongs to A, a*b=a i) Show that * is an associated operation ii) Can * ever be a communtative operation?
- c)[5]
Prove that the set Z of all integers with binary operation * defined by a* b = a+b+1 such that for all a,b belonging to Z is an abelian group
Also asked:May 2025
- a)