CO-1

1) Find the power set of the Set {a, b, c ,d}

2) If U = {1,2,3,4,5,6,7,8}, A = {1,2,4}, B = {3,4,5,6}, C = {3,4,7}, find
a. (A ∩ B) ∪ (A ∩ C)
b. (A – B)1
c. A-(B U C)
d. (A U B)1

e. (A-B) X (A-C)

3) Draw the Venn diagrams for following

a. (A-B) U (A-C)
b. A-(B U C)
c. C) A I U B1
4) What will be the Cardinality of the Power Set of {a,b,c,d,e}
5) There are 30 students in a class. Among them, 8 students are learning both English and
French. A total of 18 students are learning English. If every student is learning at least one
language, how many students are learning French in total?
6) In a survey of 80 people, it was found that 35 people read newspaper H, 20 read newspaper
T, 15 read the newspaper I, 5 read both H and I, 10 read both H and T, 7 read both T and I, 4
read all three newspapers. Find the number of people who read at least one of the
newspapers?
7) In a school, all pupils play either Hockey or Football or both. 400 play Football, 150 play
Hockey, and 130 play both the games. Find (i) The number of pupils who play Football only,
(ii) The number of pupils who play Hockey only, (iii) The total number of pupils in the school.
8) How many natural numbers n ≤ 1000 are divisible by any of 2, 5 ?
9) Find the domain and the range of the real function, f(x) = 1/ (x + 3).
10) Determine whether each of the following is a function with domain {1, 2, 3, 4}. If it is not a
function explain, give reason. a) R1= {(1, 1), (2, 1), (3, 1), (4,1), (3, 3)} b) R2= {(1, 2), (2, 3),
(4,2)} c) R3= {(1, 1), (2, 1), (3, 1), (4,1)} d) R4= {(1, 4), (2, 3), (3, 2), (4,1)}
11) If 𝐴 = {1,2,3,4,5},𝐵 = {1,2,3,8,9} and the functions 𝑓: 𝐴 → 𝐵 and 𝑔: 𝐴 → 𝐴 are defined by 𝑓 =
{(1,8), (3,9), (4,3), (2,1), (5,2)} and 𝑔 = {(1, 2), (3, 1), (2, 2), (4, 3), (5, 2)}, then find 𝑓 ∘ 𝑔, 𝑔 ∘ 𝑓,
𝑓 ∘ 𝑓 𝑎𝑛𝑑 𝑔 ∘ 𝑔 if they exist.
12) Find the inverse of the function f: R → R defined by f(x)=3x+5.
13) Find the inverse of the function 𝑓: 𝑅 → 𝑅 defined by f(x)=3x+5.
14) .Find f◦g and g◦f, where f(x)= x2+1 and g(x)=x+2, are functions from R to R.
15) If f(x) = x + 2 and g(x) = 2x + 1, then find (fog)(x) and (gof)(x).
16) A relation R defined from a set A={2,3,4,5} to the set B={3,6,7,10} as follows If (X,Y) belongs
to R then “X divides Y”. Write R as a set of ordered pairs and also find R-1.
17) Let S be the set of all lines in 3 dimensional space. A relation ’R’ is defined on S by “l R m if
and only if l lies on the plane of m” for l, m ∈ S. Examine if R is (i) reflexive, (ii) symmetric,(iii)
transitive. Give your conclusion.
18) Let R1 be the relation defined on the set of real numbers are such that as (a, b) belongs to R1
if and only if 1+ab > 0 for all (a, b) belongs to R1. Illustrate that R1 is reflexive, symmetric but
not transitive.
CO-2
1. Construct the truth tables for the following
i. [(pVq) Ʌ(~r)] ↔q
ii. (pVq) Ʌ( (~p) V (~r) )
2. Prove the following are tautologies
i. (p ∧ q) → p
ii. p → (p ∨ q)
iii. ￢p → (p → q)
3. Show that ￢(￢p) and p are logically equivalent.
4. Use a truth table to verify the De Morgan law ￢(p ∧ q) ≡ ￢p ∨￢q.
5. Use resolution to show that the hypotheses “It is not raining, or Yvette has her umbrella,”
“Yvette does not have her umbrella, or she does not get wet,” and “It is raining, or Yvette
does not get wet” imply that “Yvette does not get wet.”
6. S.T. r ∨s follows logically from the premises
i. cVd, (cVd) → ￢h, ￢h →(aɅ ￢b), and (aɅ ￢b) → (rVs)
7. Let P(x), Q(x), and R(x) be the statements “x is a professor,” “x is ignorant,” and “x is vain,”
respectively. Express each of these statements using quantifiers; logical connectives; and
P(x), Q(x), and R(x), where the domain consists of all people. a. No professors are ignorant. b.
All ignorant people are vain. c. No professors are vain. d. Does (c) follow from (a) and (b)?
8. Let P(x), Q(x), and R(x) be the statements “x is a clear explanation,” “x is satisfactory,” and “x
is an excuse,” respectively. Suppose that the domain for x consists of all English text. Express
each of these statements using quantifiers,
9. logical connectives, and P(x), Q(x), and R(x). a. All clear explanations are satisfactory. b. Some
excuses are unsatisfactory. c. Some excuses are not clear explanations. d. Does (c) follow
from (a) and (b)?
10. Let P(x), Q(x), R(x), and S(x) be the statements “x is a baby,” “x is logical,” “x is able to manage
a crocodile,” and “x is despised,” respectively. Suppose that the domain consists of all people.
Express each of these statements using quantifiers; logical connectives; and P(x), Q(x), R(x),
and S(x).
i. Babies are illogical.
ii. Nobody is despised who can manage a crocodile.
iii. Illogical persons are despised.
iv. Babies cannot manage crocodiles.
v. Does (d) follow from (a), (b), and (c)? If not, is there a correct conclusion?
11. Let S(x) be the predicate “x is a student,” F(x) the predicate “x is a faculty member,” and A(x,
y) the predicate “x has asked y a question,” where the domain consists of all people
associated with your school. Use quantifiers to express each of these statements.
a) Lois has asked Professor Michaels a question.
b) Every student has asked Professor Gross a question.
c) Every faculty member has either asked Professor Miller a question or been
asked a question by Professor Miller.
d) Some student has not asked any faculty member a question.
e) There is a faculty member who has never been asked a question by a
student.
f) Some student has asked every faculty member a question.
g) There is a faculty member who has asked every other faculty member a
question.
 h) Some student has never been asked a question by a faculty member.
12. Prove that the sum of two odd integers is an even integer.
13. Prove that the product of two even integers is an even integer.
14. Prove that the sum of two rational numbers is a rational number.
15. Explain the process of an indirect proof by contradiction. Give an example to support your
explanation.
16. Use an indirect proof by contradiction to prove that the square root of 2 is irrational.
17. Prove that there is no largest prime number using an indirect proof by contradiction.
18. Explain how you can use an indirect proof by contradiction to prove that there are infinitely
many prime numbers.
19. Prove the statement "If n is a positive integer and n^2 is even, then n is even" using indirect
proof by contrapositive.
20. Prove the statement "If p is a prime number and p ≠ 2, then p is odd" using indirect proof by
contrapositive.
21. Prove the statement "If a + b = c, where a, b, and c are integers, then at least one of a, b, and
c is even" using indirect proof by contrapositive.
CO-3
1. How many different license plates can be made if each plate contains a sequence of three
uppercase English letters followed by three digits (and no sequences of letters are
prohibited, even if they are obscene)?
2. For instance, suppose a bakery has a selection of 20 different cupcakes, 10 different donuts,
and 15 different muffins. If you are to select a tasty treat, how many different choices of
sweets can you choose from?
3. A password of 6 digits is made of digits 9,2,6,0,0,2. How many possible passwords are there?
How long would it take to try all the possible passwords if trying one password takes 5
seconds?
4. Find the number of arrangements of the letters of the word INDEPENDENCE. In how many of
these arrangements,
a. do the words start with P
b. do all the vowels always occur together
c. do the vowels never occur together
d. do the words begin with I and end in P?
5. There are 3 elements a, b, c. Use them to make:
a. permutations (without repetition)
b. permutations with repetition, where, “a” occurs 2 times, “b” one time and “c” one
time.
6. A bank pays 6% (annual) interest on savings, compounding the interest monthly. If Bonnie
deposits$1000 on the first day of May, how much will this deposit be worth a year later?
7. Obtain the solution to the recurrence relation a n = 7a n−2 - 6a n−3 with the initial conditions
a 0 = -1, a 1 = 0, and a 2 = 3.
8. Suppose that the roots of the characteristic equation of a linear homogeneous recurrence
relation are -2, -2, -2, 7, 7, and 8 (that is, there are three roots, the root -2 with multiplicity
three, the root 7 with multiplicity two, and the root 8 with multiplicity one). What is the form
of the general solution?
9. Determine the general solutions of the recurrence relation a n = 5a n−1 -4a n-2 +2n. What is
the solution with a 1 = 3?
10. Solve the recurrence relations using generating functions.
CO-4
1. Identify the degree sequence in graphical 2,2,2,2.

2. Is there a simple graph with degree sequence (1,1,3,3,3,4,6,7)? Justify your answer.

3. Determine whether the following graph is a simple graph or multigraph, and obtain the
degree of each vertex.

4. Obtain the adjacency matrix for the given graphs.

1 1 1 0
5. Draw a graph with the adjacency matrix [0 0 1 0] with respect to the ordering of
1 0 1 0
1 1 1 0
the vertices a, b, c, d.
6. Check whether the graph H displayed are bipartite or not?
7. Check whether the graphs are isomorphic or not?

8. Is the graphs isomorphic or not?

i.

9. which of the following graphs have Euler circuit, then construct such graph if exist.

10. Which of the following graphs have Hamilton circuit or Hamilton path, and then
construct such graph if exist.
11. Which of the following graphs have Hamilton circuit or Hamilton path, then construct
such graph if exist.

12. Solve the traveling salesperson problem for this graph by finding the total weight of all
Hamilton circuits and determining a circuit with minimum total weight.

13. Which of these non-planar graphs have the property that the removal of any vertex and
all edges incident with that vertex produces with planar graph?
a) K6 b) K3, 3

14. Suppose that a connected planar graph has six vertices, each of degree four. Into how
many regions is the plane divided by a planar representation of this graph?
15. Determine whether the given graph is planar. If so, draw it so that no edges cross.

a. b.
16. A connected planar graph has 10 vertices each of degree 3. Into how many regions does a
representation of this planar graph split the plane.
17. Find the chromatic number of the complete bipartite graph Km,n, where m and n are
positive integers?

18. Determine all spanning trees of the graph G shown in the following Figure.

a.

b.
19. Construct all possible spanning trees of the graph H shown in the following Figure.

a.

20. Apply Kruskal’s Algorithm to construct the minimum spanning tree (MST) from the
following graph.

a.
21. Apply Kruskal’s Algorithm to construct the minimum spanning tree (MST) from the
following graph.
 a.
22. Construct the minimum spanning tree (MST) for the given graph using Kruskal’s
Algorithm.

a.

23. Construct the minimum spanning tree (MST) for the given graph using Kruskal’s
Algorithm.