Scribd
Upload
50 views3 pages

United International University: Department of Computer Science and Engineering

1. The document is the final exam for a discrete mathematics course. It contains 6 questions testing concepts like mathematical induction, binary search trees, graph traversals, graph properties, and combinatorics. Students are warned that cheating will result in expulsion from the program. 2. The questions cover topics like proving a summation formula using mathematical induction, analyzing properties of a binary search tree constructed from letters, performing graph traversals on sample trees and graphs, identifying graph types based on properties, finding graph representations like adjacency matrices, testing for graph isomorphism, and solving combinatorial counting problems. 3. Students must show their work for all parts of the 6 questions, drawing on their knowledge of discrete math topics

Uploaded by

Muntaka Ibnath
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views3 pages

United International University: Department of Computer Science and Engineering

1. The document is the final exam for a discrete mathematics course. It contains 6 questions testing concepts like mathematical induction, binary search trees, graph traversals, graph properties, and combinatorics. Students are warned that cheating will result in expulsion from the program. 2. The questions cover topics like proving a summation formula using mathematical induction, analyzing properties of a binary search tree constructed from letters, performing graph traversals on sample trees and graphs, identifying graph types based on properties, finding graph representations like adjacency matrices, testing for graph isomorphism, and solving combinatorial counting problems. 3. Students must show their work for all parts of the 6 questions, drawing on their knowledge of discrete math topics

Uploaded by

Muntaka Ibnath
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

United International University

Department of Computer Science and Engineering


CSE 2213/CSI 219: Discrete Mathematics
Final Examination : Spring 2022
Total Marks: 40 Time: 2 hours
Any examinee found adopting unfair means will be expelled from
the trimester / program as per UIU disciplinary rules.

Answer all the 6 questions. Numbers to the right of the questions denote their marks.

1. Use mathematical induction to prove the following summation formula for all positive integer values of n: [4]

n(n + 1)(2n + 1)
12 + 22 + 32 + 42 + · · · + n2 =
6
2. (a) Suppose a binary search tree has only 4 vertices who have no children. Find out the total number of vertices
of the tree. [1]
(b) Observe these 7 letters from the English alphabet, ’A’, ’C’, ’E’, ’H’, ’I’, ’S’, ’T’. Considering the dictionary
order, construct a Binary Search Tree from the letters. [2.5]
(c) Find out the number of edges and height of the tree you constructed in Question 2(b). Based on the height,
what is the maximum limit of the number of leaves in such a tree? [1.5]
(d) Is the tree you constructed in Question 2(b) a balanced tree? Explain with proper reasoning. [1]
3. (a) Show the order of vertices generated by inorder traversal of the ordered tree in Figure 1. [1]

Figure 1: Graph for Question 3(a)

(b) Show that postorder traversals of both ordered rooted trees in Figure 2 produce the same list of vertices. [2]

Figure 2: Graph for Question 3(b)

(c) Represent the expression ((y + 2) ↑ 3) ∗ (x − (y + 3)) − 8 using a binary tree. Write this expression in Prefix
notation. [2]
(d) Evaluate the following postfix expression : 9 3/5 + 7 2 − ∗ [1]
4. (a) In a road network graph, vertices represent intersections and edges represent roads. If we want to model both
one-way and two-way roads, and there is at most one road connecting two intersections, what kind of graph
that will be? State your reasoning. [2]
(b) Suppose, you have been told to draw an undirected graph of 5 vertices with some constraints. The graph
must contain at least one vertex of odd-degree, and at least one of even-degree. The odd-degree vertices must
have degree 3, and the even-degree vertices must have degree 4. What are the possible number of edges of the
graph? [3]
(c) Find out if the graph in Figure 3 is bipartite or not, using two coloring algorithm. If bipartite, show the graph
in bipartite form. [3]

Figure 3: Graph for Question 4(c)

5. (a) Find the adjacency matrix of the graph in Figure 4. [2]

Figure 4: Graph for Question 5(a)

(b) Find out if Graph 1 and Graph 2 in Figure 5 are isomorphic or not. [2]

Figure 5: Graph for Question 5(b)


(c) Find out the strongly connected components of the graph in Figure 6. [4]

Figure 6: Graph for Question 5(c)

6. (a) If a librarian picks 5 Calculus books from 7 different Calculus books and 4 different Discrete Math books from
6 different Discrete Math books, how many ways he can arrange these 9 books on a shelf such that a Calculus
book is at the beginning and a Discrete Math book is in the middle? [Note: each of the Calculus or Discrete
Math books is written by different writers] [3]
(b) From 6 CS faculty and 4 EE faculty, a committee of 6 is to be formed. In how many ways can this be done if
the committee contains (i) exactly 2 EE faculty, or (ii) at least 2 EE faculty? [2]
(c) If a student writes random strings of length 3 using the vowels (A,E,I,O,U) only, how many times he is required
to write such strings to be sure that he has written a string twice? [3]

You might also like