Math for Computer Science
CSE · Final · Spring 23
Batch 59
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Daffodil International University
Faculty of Science & Information Technology
Final Examination, Spring 2023
Course Code: CSE236 Course Title: Math for Computer Science
Level: 3 Term: 1 Batch: 59
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. a) Justify whether the following graph has at least one Euler path and Euler Circuit (Fig 1), Hamiltonian Path and Hamiltonian Circuit (Fig 2) [8] CO3
[Figure: Fig 1 shows a graph with vertices A, B, C, D and edges forming a specific connection structure.]
[Figure: Fig 2 shows a graph with vertices A, B, C, D, E, F, G and edges forming a specific connection structure.]
b) Construct Hasse Diagram for ({2,4,6,8,10,16,18,20,24,36,72}, /) [8] CO3
Using the constructed Hasse Diagram Identify the following attributes
i) Maximal Elements and greatest Elements
ii) Minimal Elements and Least Elements
iii) All upper bound of {2,10,18}
iv) All lower bound of {4,20,24}
2. a) Solve (Sum from k=1 to n) K^2 = (n(n+1)(2n+1))/6 using proof by induction method. [4] CO2
b) Use rules of inference to prove the following argument is valid: [6] CO2
i) If it rains, I will take a leave
If it is hot outside, I will go for a shower
Either it will rain or it is hot outside
Prove Therefore - "I will take a leave or I will go for a shower" using rules of inference.
ii) Prove that if, p -> (q v r) and q -> s and r -> t, then p -> (s v t).
3. a) Find How many strings of eight English letters are there (consider only uppercase letter)? [8] CO2
i) That contain no vowels, if letters can be repeated?
ii) That contain no vowels, if letters cannot be repeated?
iii) That start with a consonant, if letters can be repeated?
iv) That start with a vowel, if letters cannot be repeated?
4. a) Illustrate the undirected graph represented by the given adjacency matrix and Prove handshaking theorem for this graph. [06] CO3
a b c d
a | 1 2 0 1
b | 2 0 3 0
c | 0 3 2 2
d | 0 1 0 1