Scribd
Upload
216 views1 page

MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper

This document outlines an exam for a course on mathematical foundations for computer science. The exam contains 8 questions testing various topics including logic, relations, graph theory, algorithms, recurrence relations, and functions. Students must answer 5 of the 8 questions, with each question worth 12 marks for a total exam score of 60 marks. Questions involve topics like propositional logic, Hasse diagrams, the pigeonhole principle, graph coloring, breadth-first search, solving recurrence relations, and analyzing functions.

Uploaded by

Amrutha Tarigopula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
216 views1 page

MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper

This document outlines an exam for a course on mathematical foundations for computer science. The exam contains 8 questions testing various topics including logic, relations, graph theory, algorithms, recurrence relations, and functions. Students must answer 5 of the 8 questions, with each question worth 12 marks for a total exam score of 60 marks. Questions involve topics like propositional logic, Hasse diagrams, the pigeonhole principle, graph coloring, breadth-first search, solving recurrence relations, and analyzing functions.

Uploaded by

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

MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE

(Common to CSE, IT, CyS, AIML, DS and IOT)


Time: 3 hours Max. Marks:
60
Answer any FIVE questions
All Questions Carry Equal Marks
5X12=60
***
1. a) Rephrase the statement formula as 8M CO-1 BL-3
principal conjunctive normal form. also define PCNF and PDNF.
b) “If there was a ball game, then traveling was difficult. If they arrived on 4M CO-1 BL-2
time, then traveling was not difficult. They arrived on time. Therefore,
there was no ball game.” Show that these statements constitute a valid
argument.
2. a) Explain the properties of relations with examples. 6M CO-1 BL-2
b) Let X={2,3,6,12,24,36} and the relation ≤ be such that x≤ y if x divides 6M CO-1 BL-3
y. Model Hasse diagram of (X, ≤)
3. a) State Pigeon hole principle. Make use of it, find how many people were 6M CO-2 BL-2
born on the same month among 200 people.
b) How many bit strings of length 8 contain 6M CO-2 BL-3
i. exactly five 1’s
ii. an equal number of 0’s and 1’s
iii. at least four 1’s
iv. at least three 1’s and at least three 0’s
4. a) Define chromatic number of the graph. Write the chromatic number of 6M CO-3 BL-2
complete graph, cycle graph, wheel graph, bipartite graph and regular
graph.
b) Differentiate Hamiltonian and Eulerian graphs. 6M CO-3 BL-2
5. Make use of BFS algorithm to find a spanning tree of the following graph. 12M CO-3 BL-3
Also explain BFS algorithm.

6. Solve the recurrence relation 12M CO-4 BL-4


n
a n+2 +3 an +1+ 2a n=3 for n ≥0 , a 0=0 , a1=1
7. a) A function f is defined as on a set R of real numbers. 6M CO-1 BL-3
Check whether the function f is bijective or not, if so find inverse of the
function. And hence compute
b) Explain about Free and bounded variables. 6M CO-1 BL-2
8. Utilize the generating functions to solve the recurrence relation 12M CO-4 BL-4
a n−9 a n−1 +26 an−1−24 an−1=0 for (n ≥ 3)

You might also like