Scribd
Upload
488 views

Mathematical Foundations of Computer Science Question Paper

The document is a question paper for a Mathematical Foundations of Computer Science exam that contains two parts - Part A with short answer questions and Part B with longer answer questions. It covers topics like propositional logic, functions, relations, recurrence relations, graphs, and algorithms. The exam tests students on their understanding of fundamental mathematical concepts that form the basis of computer science.

Uploaded by

murugesh72
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
488 views

Mathematical Foundations of Computer Science Question Paper

The document is a question paper for a Mathematical Foundations of Computer Science exam that contains two parts - Part A with short answer questions and Part B with longer answer questions. It covers topics like propositional logic, functions, relations, recurrence relations, graphs, and algorithms. The exam tests students on their understanding of fundamental mathematical concepts that form the basis of computer science.

Uploaded by

murugesh72
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: R1621052 R16 SET - 1

II B. Tech I Semester Supplementary Examinations, March - 2021


MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE
(Com to CSE & IT)
Time: 3 hours Max. Marks: 70
Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answer ALL the question in Part-A
3. Answer any FOUR Questions from Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART –A
1. a) What is the minimal set of connectives required to form a well formed (2M)
formula?
b) Prove that A – (B ∩ C) = (A-B) U (A-C). (3M)
c) What is an Abelian Group? (2M)
d) Define permutation and combination. (2M)
e) List different methods for solving recurrence relations. (3M)
f) How many vertices will the graph contain, if there are 6 edges and degree all (2M)
vertices is 3?
PART -B
2. a) Show that S v R is tautologically implied by (P v R) ˄ (P→R) ˄ (Q→S). (7M)
b) Obtain equivalent PDNF for the propositional function ~(P V Q)↔(P ɅQ). (7M)

3. a) Let A={1, 2,3 ,4} and f and g be functions from A to A given by f={(1,4), (7M)
(2,1), (3,2),(4,3)} and g={(1,2), (2,3), (3,4), (4,1)}. Prove that f and g are
inverse of each other.
b) Prove that (S,≤) is a Lattice, where S= {1,2,5,10} and ≤ is for divisibility. (7M)

4. a) Using Euclidean Algorithm, find GCD(1819,3587). (7M)


b) Let X={2,3,6,12,24,36} and a relation ′≤’ be such that x ≤ y, if x divides y. (7M)
Draw Hasse diagram of (x,≤).

5. a) How many different five digit numbers can be formed from the digits 0, 1, 2, 3 (7M)
and 4?
b) State and explain properties of pigeon hole principle and explain how it is (7M)
useful

6. a) Explain how to solve recurrence relations using generating methods. (7M)


b) Find a general expression for a solution to the recurrence relation an – 5an-1 + (7M)
6an-2 = 4n for n≥2.

7. a) Explain algorithm for finding Hamiltonian cycle in a graph, with an example. (7M)
b) Show that the number of odd degree vertices in a graph is always even. (7M)

1 of 1

|''|'|''|''|''|||'|| www.manaresults.co.in

You might also like