Discrete Mathematics
SWE · Final · Summer 25
Section All
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Daffodil International University
Department of Software Engineering
Faculty of Science & Information Technology
Final Examination, Summer 2025
Course Code: SE123; Course Title: Discrete Mathematics
Sections & Teachers: All
Time: 2:00 Hrs
Marks: 40
Answer ALL Questions
[The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.]
1. Analyze the following set X and relation R provided below:
X = {1, 2, 3, 4} and R = {(1, 1), (1, 2), (2, 1), (2, 3), (3, 3), (3, 4)}.
a) Determine if the relation R is reflexive, symmetric, and transitive. | [Marks-3+4+3] | CLO-3 Level-4
b) Graphically express the relation using a directed graph, a tabular array, and an arrow graph.
c) Is the relation R an equivalence relation? If yes, explain why. If not, explain which properties are not satisfied.
2. a) Analyze the diagram with your understanding of function, and find out the following:
1. Domain
2. Range
3. Co-Domain
4. Image
5. Preimages
[Figure 1: A Venn diagram showing function mapping between sets C and D, with elements connected by arrows]
[Marks-5] | CLO-3 Level-4
b) Suppose f: R -> R, f(x) = x+1. Analyze the function, then classify it and justify your answer (the classification may come under multiple types at the same time). | [Marks-5]
3. Evaluate the following hierarchy of University Course Prerequisites. In a university:
- Main course: Computer Science
- Two prerequisites: Programming (P) and Mathematics (M)
- Programming has two sub-courses: Data Structures (DS) and Algorithms (Algo)
- Mathematics has one sub-topic: Statistics (Stats)
- Algorithms have two sub-topics: Graph Theory (GT) and Dynamic Programming (DP)
a) Sketch the tree structure of course dependencies. | [Marks-2+6+2] | CLO-4 Level-5
b) Determine the Pre-order, In-order, and Post-order traversal sequences.
c) Justify the tree as a Full Binary tree
4. Evaluate the characteristics of the graphs illustrated in Figure 2. Redraw the graphs in your script and use proper identifiers. Categorize them into isomorphic and non-isomorphic categories. Finally, justify your categorization using an appropriate concept of graph theory.
[Figure 2: Five graphs labeled G1, G2, G3, G4, and G5] | [Marks-10] | CLO-4 Level-5