Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
505 views2 pages

MFCS Model Question Paper

1. The document is an exam paper for the course Mathematical Foundations of Computer Science. 2. It contains 5 units and 10 questions, with each question worth 6 marks. Students must answer 1 question from each unit. 3. The questions cover a range of topics including probability, statistics, groups, graphs, and algorithms.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
505 views2 pages

MFCS Model Question Paper

1. The document is an exam paper for the course Mathematical Foundations of Computer Science. 2. It contains 5 units and 10 questions, with each question worth 6 marks. Students must answer 1 question from each unit. 3. The questions cover a range of topics including probability, statistics, groups, graphs, and algorithms.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code: 192CO1T01

ADITYA ENGINEERING COLLEGE (A)


MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science and Engineering)
Time: 3 Hours Max. Marks: 60
Answer ONE question from each unit
All Questions Carry Equal Marks
All parts of the questions must be answered at one place only

UNIT – I
1 a In a bolt factory, machines A,B,C manufacture and of CO1(K3) [6M]
the total of their output and and are defective.A bolt is
drawn at random and found to be defective.Find the probabilities that it
is manufactured from machineA, B and C.
b Let X denote the number of heads in a single toss of 4 fair coins. CO1(K3) [6M]
Determine
OR
2 a A continuous random variable ‘X’ has the following Distribution CO1(K3) [6M]
function

Determine i) Probability density function of ‘X’ ii) Value of k


iii) Mean and variance of the distribution
b Average number of accidents on any day on a national highway is CO1(K3) [6M]
1.8.Determine the probability that the number of accidents are (i) at least one
(ii) at most one.
UNIT – II
3 a A population consists of five numbers 2, 4, 8, 10, 12. Consider all CO2(K3) [6M]
possible samples of size ‘2’ that can be drawn with replacement from
this population. Find i) Mean and standard deviation of the population
ii) Mean and standard deviation of sampling distribution of means
b A random sample of size 100 has a standard deviation of 5.Find CO2(K3) [6M]
maximum error with 95 confidence.
OR
4 a Explain different methods of sampling. CO2(K2) [6M]
b A random sample of size 81 was taken whose variance is 20.5 and CO2(K3) [6M]
mean is 30. Construct 99% confidence interval
UNIT – III
5 a Explain briefly CO3(K2) [6M]
i)Null and Alternative Hypothesis ii) type-I, type-II errors
b The average breaking strength of the steel rods is specified to be 18.5 CO3(K3) [6M]
thousand pounds.To test this sample of 14 rods were tested.The mean and
standard deviations obtained were 17.85 and 1.955 respectively.Is the result
of experiment significant?
OR
6 a A die is thrown 264 times with the following results.show that the die is CO3(K3) [6M]
biased.
[ Given for 5 d.f.]

No.appeared 1 2 3 4 5 6
on the die
Frequency 40 32 28 58 54 52

b A coin was tossed 400 times and returned heads 216 times.Test the CO3(K3) [6M]
hypothesis that the coin is unbiased.Use a 0.05 Level of significance.
UNIT – IV
7 a Is a group with respect to addition modulo 5? CO4(K3) [6M]
b Define Monoid.Prove that the set is an abelian group with CO4(K3) [6M]
respect to multiplication
OR
8 a State and Prove fundamental theorem of arithmetic CO4(K2) [6M]
b Find the GCD of 1820 and 231.Also express this GCD as a linear CO4(K3) [6M]
combination of these numbers

UNIT – V
9 a Show that is non planar graph. CO5(K3) [6M]
b Give an example of a graph which is Hamiltonian but not Eulerian and CO5 (K3) [6M]
which is Eulerian but not Hamiltonian.
OR
10 a Define minimal spanning tree.Explain Krushal’s Algorithm with example CO5(K3) [6M]
b Discuss the following (i) Chromatic number (ii) Isomorphic graphs CO5(K2) [6M]
*****

You might also like