Code No: R2021054 R20 SET - 1

II B. Tech I Semester Regular/Supplementary Examinations, January - 2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CS,CSD, CSE, CSE-AI, CST,CSE,CSE-AI&ML,(AI&ML), CSE-AI&DS,CSE-AIDS, CSE-DS,
CSE-IOT, CSE(CS), CSE-IOT & Incl BCT, CSBS, IOT, AIDS, AUML)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
UNIT-I
1 a) Construct the truth table of the compound proposition ( p ∨ ¬ q ) → ( p ∧ q ). [7M]
b) How can this English sentence be translated into a logical expression? [7M]
“You cannot ride the roller coaster if you are under 4 feet tall unless you are
older than 16 years old.”
OR
2 a) Show that ¬ ( p ∨ q ) and ¬ p ∧ ¬ q are logically equivalent. [7M]
b) Show that the premises “It is not sunny this afternoon and it is colder than yesterday,” “We [7M]
will go swimming only if it is sunny,” “If we do not go swimming, then we will
take a canoe trip,” and “If we take a canoe trip, then we will be home by sunset”
lead to the conclusion “We will be home by sunset.”
UNIT-II
3 a) Prove that if A and B are sets, then A ∩ B = A ∪ B . [7M]
b) State and prove the principle of Inclusion-Exclusion. [7M]

OR
4 a) A total of 1232 students have taken a course in Spanish, 879 have taken a course [7M]
in French, and 114 have taken a course in Russian. Further, 103 have taken
courses in both Spanish and French, 23 have taken courses in both Spanish and
Russian, and 14 have taken courses in both French and Russian. If 2092 students
have taken at least one of Spanish, French, and Russian, how many students have
taken a course in all three languages?
b) Does the following table define a semi group or a monoid? [7M]
* a b c
a c b a
b b c b
c a b c
UNIT-III
5 a) How many permutations of the letters ABCDEFGH contain the string ABC ? [7M]
b) Suppose that a department contains 10 men and 15 women. How many ways are [7M]
there to form a committee with six members if it must have more women than
men?
OR

1 of 3
|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 1

6 a) Find the prime factorization of each of these integers i) 143, ii) 289 and iii ) 899. [7M]
b) Find the greatest common divisor of 414 and 662 using the Euclidean algorithm. [7M]

UNIT-IV
7 a) Build a generating function for ar, the number of integral solutions to the [7M]
equation e1 + e2 + e3 = r if 0 ≤ ei ≤ 3 for each i .
b) Write an expression for ar which is the coefficient of X r in the following [7M]
1 4 13 9
generating function A ( X ) : − + + .
1 − X 3 ( X + 1) 12 ( X − 2 ) 4 ( 2 + X )
OR
8 a) Solve the following recurrence relation using generating function [7M]
an − 5an −1 + 6an − 2 = 0 for n ≥ 2, a0 = 0 , a1 = −2 .
b) Solve the recurrence relation a − 3a + 2a = 3n . [7M]
n n −1 n−2

UNIT-V
9 a) Find the number of vertices, the number of edges, and the degree of each vertex [7M]
in the given undirected graph. Identify all isolated and pendant vertices.

b) Determine whether the following graphs are isomorphic. [7M]

OR

2 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 1

10 a) Find a spanning tree of the following Graph. [7M]

b) Use Kruskal’s algorithm to find a minimum spanning tree in the weighted graph [7M]
given.

3 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 2

II B. Tech I Semester Regular/Supplementary Examinations, January – 2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CS,CSD, CSE, CSE-AI, CST,CSE,CSE-AI&ML,(AI&ML), CSE-AI&DS,CSE-AIDS, CSE-DS,
CSE-IOT, CSE(CS), CSE-IOT&Incl BCT, CSBS, IOT, AIDS, AUML)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
UNIT-I
1 a) Construct the truth table of the compound proposition ( p ∧ q ) → ( p ∨ q ) . [7M]
b) Translate the given statement into propositional logic using the propositions [7M]
provided. You cannot edit a protected Wikipedia entry unless you are an
administrator. Express your answer in terms of e :“You can edit a protected
Wikipedia entry” and a : “You are an administrator.”
OR
2 a) Show that p ∨ ( q ∧ r ) and ( p ∨ q ) ∧ ( p ∨ r ) are logically equivalent. [7M]
b) Show that the premises “If you send me an e-mail message, then I will finish [7M]
writing the program,” “If you do not send me an e-mail message, then I will go
to sleep early,” and “If I go to sleep early, then I will wake up feeling refreshed”
lead to the conclusion “If I do not finish writing the program, then I will wake
up feeling refreshed.”
UNIT-II
3 a) Prove that A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) for all sets A, B and C . [7M]
b) Find f o g and g o f , where f ( x ) = x 2 + 1 and g ( x) = x + 2, are functions from [7M]
R to R.
OR
4 a) Suppose that there are 1807 freshmen at your school. Of these, 453 are taking a [7M]
course in computer science, 567 are taking a course in mathematics, and 299 are
taking courses in both computer science and mathematics. How many are not
taking a course either in computer science or in mathematics?
b) Does the following table define a semi group or a monoid? [7M]
* a b c
a a c b
b c b a
c b a c

1 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 2

UNIT-III
5 a) How many ways are there to select a first-prize winner, a second-prize winner, [7M]
and a third-prize winner from 100 different people who have entered a contest?
b) Suppose that a department contains 10 men and 15 women. How many ways are [7M]
there to form a committee with six members if it must have the same number of
men and women?
OR
6 a) Find the prime factorization of each of these integers i) 88 , ii) 126 and iii) 729. [7M]
b) Find the greatest common divisor of 123 and 277 using the Euclidean algorithm. [7M]

UNIT-IV
7 a) Build a generating function for ar = the number of integral solutions to the [7M]
equation e1 + e2 + e3 = r if 2 ≤ ei ≤ 5 for each i .
b) Write an expression for ar is the coefficient of X r in the following generating [7M]
8 1
function A ( X ) : 2
+ 3
.
(3 + 2 X ) (5 + X )
OR
8 a) Solve the following recurrence relation using generating function [7M]
an − 3an− 2 + 2an −3 = 0 for n ≥ 3, a0 = 1 , a1 = 0 , a2 = 0 .
b) Solve the recurrence relation [7M]
an − 6an −1 + 8an − 2 = n 4n where a0 = 8 and a1 = 22 .
UNIT-V
9 a) Are the graphs G and H bipartite [7M]

b) Show that the graphs displayed are not isomorphic. [7M]

OR

2 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 2

10 a) Use depth-first search to find a spanning tree for the graph G. [7M]

b) Use Prim’s algorithm to find a minimum spanning tree in the graph [7M]

3 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 3

II B. Tech I Semester Regular/Supplementary Examinations, January - 2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CS,CSD, CSE, CSE-AI, CST,CSE,CSE-AI&ML,(AI&ML), CSE-AI&DS,CSE-AIDS, CSE-DS,
CSE-IOT, CSE(CS), CSE-IOT&Incl BCT, CSBS, IOT, AIDS, AUML)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
UNIT-I
1 a) Construct the truth table of the compound proposition (q → ¬p ) ↔ ( p ↔ q ) [7M]
b) Translate the given statement into propositional logic using the propositions [7M]
provided. You can see the movie only if you are over 18 years old or you have
the permission of a parent. Express your answer in terms of m: “You can see the
movie,” e: “You are over 18 years old,” and p: “You have the permission of a
parent.”
OR
2 a) Show that ¬ ( p → q ) and p ∧ ¬ q are logically equivalent. [7M]
b) Show that the premises “Everyone in this discrete mathematics class has taken a [7M]
course in computer science” and “Marla is a student in this class” imply the
conclusion “Marla has taken a course in computer science.”
UNIT-II
3 a) Prove that A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) for all sets A , B and C . [7M]
b) Let f and g be the functions from the set of integers to the set of integers defined [7M]
by f ( x ) = 2x + 3 and g ( x) = 3x + 2. What is the composition of f and g ? What
is the composition of g and f ?
OR
4 a) There are 345 students at a college who have taken a course in calculus, 212 [7M]
who have taken a course in discrete mathematics, and 188 who have taken
courses in both calculus and discrete mathematics. How many students have
taken a course in either calculus or discrete mathematics?
b) Let ( S1 , ∗1 ), ( S 2 , ∗2 ), and ( S3 , ∗3 ) be semi groups and f : S1 → S2 and g : S2 → S3 [7M]
be homeomorphisms. Prove that g o f is a homomorphism from S1 to S3 .
UNIT-III
5 a) Suppose that there are eight runners in a race. The winner receives a gold medal, [7M]
the second place finisher receives a silver medal, and the third-place finisher
receives a bronze medal. How many different ways are there to award these
medals, if all possible outcomes of the race can occur and there are no ties?
b) How many poker hands of five cards can be dealt from a standard deck of 52 [7M]
cards? Also, how many ways are there to select 47 cards from a standard deck of
52 cards?
OR

|''|'||||''|'''|||'| 1 of 3
Code No: R2021054 R20 SET - 3

6 a) Determine whether each of these integers is prime i) 97, ii) 111 and iii ) 143. [7M]
b) Find the greatest common divisor of 1001 and 1331 using the Euclidean [7M]
algorithm.
UNIT-IV
7 a) Find a generating function for ar = the number of integral solutions to the [7M]
equation e1 + e2 + e3 = r if 0 < ei for each i .
b) Write an expression for ar is the coefficient of X r in the following generating [7M]
3 7 8
function A ( X ) : 2
− 3
+ .
(1 − X ) (1 − 2 X ) 3 + 2 X
OR
8 a) Solve the following recurrence relation using generating function [7M]
an − 4an− 2 = 0 for n ≥ 2, a0 = 0 , a1 = 1 .
b) Solve the recurrence relation a − 6a + 8a = 3n where a = 3 and a = 7 . [7M]
n n −1 n−2 0 1

UNIT-V
9 a) Find the in-degree and out-degree of each vertex in the graph G with directed [7M]
edges .

b) Determine whether the given pair of graphs is isomorphic. [7M]

OR

2 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 3

10 a) Use breadth-first search to find a spanning tree for the graph. [7M]

b) Use Kruskal’s algorithm to find a minimum spanning tree in the weighted graph. [7M]

3 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 4

II B. Tech I Semester Regular/Supplementary Examinations, January - 2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CS,CSD, CSE, CSE-AI, CST,CSE,CSE-AI&ML,(AI&ML), CSE-AI&DS,CSE-AIDS, CSE-DS,
CSE-IOT, CSE(CS), CSE-IOT&Incl BCT, CSBS, IOT, AIDS, AUML)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

UNIT-I
1 a) Construct the truth table of the compound proposition ( p → q ) ↔ (¬ q → ¬ p ). [7M]
b) Translate the given statement into propositional logic using the propositions [7M]
provided. You can graduate only if you have completed the requirements of your
major and you do not owe money to the university and you do not have an overdue
library book. Express your answer in terms of g: “You can graduate,” m: “You
owe money to the university,” r: “You have completed the requirements of your
major,” and b: “You have an overdue library book.”
OR
2 a) Show that ¬ ( p ∨ (¬ p ∧ q )) and ¬ p ∧ ¬ q are logically equivalent. [7M]
b) Show that the premises “A student in this class has not read the book,” and [7M]
“Everyone in this class passed the first exam” imply the conclusion “Someone
who passed the first exam has not read the book.”
UNIT-II
3 a) Prove that if A and B are sets, then A ∪ B = A ∩ B . [7M]
b) Let g be the function from the set {a, b, c} to itself such that g(a) = b, g(b) = c, and [7M]
g(c) = a. Let f be the function from the set {a, b, c} to the set {1, 2, 3} such that f
(a) = 3, f (b) = 2, and f (c) = 1. What is the composition of f and g, and what is the
composition of g and f ?
OR
4 a) In a discrete mathematics class every student is a major in computer science or [7M]
mathematics, or both. The number of students having computer science as a major
(possibly along with mathematics) is 25; the number of students having
mathematics as a major (possibly along with computer science) is 13; and the
number of students majoring in both computer science and mathematics is 8. How
many students are in this class?
b) What is an algebraic system? How to represent it? Give its properties. [7M]

UNIT-III
5 a) How many permutations of the letters ABCDEFGH contain the string ED? [7M]
b) How many ways are there to select five players from a 10-member tennis team to [7M]
make a trip to a match at another school?
OR

1 of 3
|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 4

6 a) Determine whether each of these integers is prime i) 21 , ii) 29 and iii) 71 . [7M]

b) Find the greatest common divisor of 1000 and 5040 using the Euclidean algorithm. [7M]

UNIT-IV
7 a) Build a generating function for ar = the number of integral solutions to the [7M]
equation e1 + e2 + e3 = r if 0 ≤ ei ≤ 6 and ei is even ; 2 ≤ ei ≤ 7 and ei is odd ;
5 ≤ ei ≤ 7 .
b) Write an expression for ar is the coefficient of X r in the following generating [7M]
1 5 7
function A ( X ) : + + .
1 − X 1 + 2 X (1 − X )5
OR
8 a) Solve the following recurrence relation using generating function [7M]
an − 9an −1 + 20an − 2 = 0 for n ≥ 2, a0 = −3 , a1 = −10 .
b) Solve the recurrence relation an − 6an−1 + 8an − 2 = 9 where a0 = 10 and a1 = 25 . [7M]

UNIT-V
9 a) What are the degrees and what are the neighbourhoods of the vertices in the graphs [7M]
G and H?

b) Determine whether the given pair of graphs is isomorphic. [7M]

OR

2 of 3

|''|'||||''|'''|||'|
Code No: R2021054 R20 SET - 4

10 a) Use depth-first search to find a spanning tree for the graph G. [7M]

b) Use Prim’s algorithm to find a minimum spanning tree in the graph. [7M]

3 of 3

|''|'||||''|'''|||'|