Skip to content

Discrete Mathematics

SWE · Final · Fall 23

Section All

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

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, Fall 2023 Course Code: SE 123; Course Title: Discrete Mathematics Sections & Teachers: All (NF, RM) 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 | In a game, a player rolls three distinct six-sided dice: a red die, a blue die, and a green die. Each die is fair and has faces numbered from 1 to 6. The player wins if the following conditions are met: 1. The number on the red die is even. 2. The number on the blue die is either 2 or 5. 3. The sum of the numbers on the red and green dice is greater than the number on the blue die. Identify the problem and calculate the probability of the player winning the game. | Marks- 10 2 | A directed graph is illustrated in Figure 1. Examine the figure and utilize the concept of relational algebra to find out the set of relations exists in the directed graph. After that, find out the inverse of the relation and redraw the directed graph for inverted relation. [Figure: A directed graph with vertices 1, 2, 3, 4, 5, 6, 7 and directed edges between them] | Marks- 10 3 | A graph has been illustrated in Figure 2. Analyze the graph, redraw the figure on your answer script, and mark the edges with proper sequential notation. Evaluate the graph in terms of (i) number of vertices, (ii) number of edges, (iii) degree sequence, (iv) parallel edges, and (v) total degree, (vi) Loops of the degrees, (vii) Construct a graph with 5 vertices of degrees 1, 1, 2, 2, 4. [Figure: Figure 2: Graph 1, a graph with vertices v1, v2, v3, v4, v5, v6, v7 and a loop at v7] | Marks- 13 4 | Determine the isomorphic and non-isomorphic graphs from the set of graphs illustrated below. Justify your answer with valid logic of graph theory. [Figure: Five graphs labeled G1, G2, G3, G4, and G5] | Marks- 07