COMSATS University, Islamabad

Islamabad Campus
Department of Computer Science

Assignment No. 4: Combinatorics and Graph

Course code and Title: CSC102, DISCRETE STRUCTURES
Instructor: Tanveer Ahmed Siddiqui
Assigned Date: May 25,2023 Due Date: June 5,2023
CLO-5:
Use probabilistic concepts to solve a particular problem.

CLO-6
Model a real-world problem using graphs and trees.
Instructions:
1. This is group assignment. You will submit your work through your logins (course portal)
2. Try to get the concepts, consolidate your concepts and ideas from these questions
3. You should concern recommended books for clarify your concepts as handouts are not
sufficient.
4. Try to make solution by yourself and protect your work from other students. If I found
the solution files of some students are same then I will reward zero marks to all those
students.
5. Deadline for this assignment is June 5,2023. This deadline will not be extended.

Spring 2023 Page 1

Question # 1 (Counting Various Relation using combinatorics)
i. Let X be a set of n elements. How many different relations on X are there?
ii. How many of these relations are reflexive?
iii. How many of these relations are symmetric?
iv. How many of these relations are anti-symmetric?
v. How many of these relations are reflexive and symmetric?
vi. How many of these relations are reflexive and anti-symmetric?
vii. How many symmetric and antisymmetric relations are there on an n-element set?
viii. How many reflexive, symmetric, and antisymmetric relations are there on an n-element set?
Question # 2 (Counting functions using combinatorics)
i. How many functions are there from a set with m elements to a set with n elements?
ii. How many different functions are there from a set with 10 elements to sets with the following numbers of elements?
a) 2 b) 3 c) 4 d) 5
iii. How many one-to-one functions are there from a set with m elements to one with n elements?
iv. How many one-to-one functions are there from a set with five elements to sets with the following number of elements?
a) 4 b) 5 c) 6 d) 7
v. How many functions are there from the set {1, 2, . . . , n}, where n is a positive integer, to the set {0, 1}?
vi. How many functions are there from the set {1, 2, . . . , n}, where n is a positive integer, to the set {0, 1}
a) that are one-to-one?
b) that assign 0 to both 1 and n?
c) that assign 1 to exactly one of the positive integers less than n?
vii. How many partial functions (see Section 2.3) are therefrom a set with five elements to sets with each of these number of
elements?
a) 1 b) 2 c) 5 d) 9
viii. How many subsets of a set with 100 elements have more than one element?
Question # 3 (Permutation and Combination)
i. If P(n,3) = 12P(n/2, 3) , find n
ii. Find n if P(2n+1, n-1) : P(2n-1,n) = 3:5
iii. If C(18,r) = C(18,r+2) , findC(r,5)
iv. Find n and r, if P(n,r) = P(n,r+1) and C(n,r) = nC(n, r-1)
v. A department in a University consists of 4 professors and 8 students. A study tour is to be arranged. In how
many ways can a party of four be chosen so as to include at least on professor?
vi. In how many ways can the letters of the word “ARRANGE” be arranged so that
a. The two R’s are never together?
b. The two A’s are together but not two R’s?
c. Neither the A’s nor the two R’s are together?
vii. How many positive whole numbers can be formed with the digits 3,4,5,6,5,4,3 so that the even digits occupy the
even places?
Question # 4 (CLO-6) Graph
i. Find the degree of each vertex for the following graphs.

Spring 2023 Page 2

ii. Draw a graph having the given properties or explain why no such graph exists.
a. Six vertices each of degree 3
b. Four vertices each of degree 1
c. Five vertices each of degree 3
d. Six vertices; four edges
e. Four vertices having degrees 1, 2, 3, 4
f. Four edges; four vertices having degrees 1, 2, 3, 4
g. Simple graph; six vertices having degrees 1, 2, 3, 4, 5, 5
h. Simple graph; five vertices having degrees 2, 2, 4, 4, 4
i. Simple graph; five vertices having degrees 2, 3, 3, 4, 4
iii. Verify that the number of vertices of odd degree in the graph is even.

iv. Determine whether the following graphs are bipartite or not. If so, identify the vertex sets V1 and V2

Spring 2023 Page 3

 v. Decide whether the graph has an Euler cycle (Circuit). If the graph has an Euler cycle, exhibit one.

vi. Find a Hamiltonian cycle in each graph.

vii. Determine whether the graph G1 and G2 are isomorphic or not?

viii. Show that each graph is planar by redrawing it so that no edges cross.

Spring 2023 Page 4

i.

Spring 2023 Page 5