About this question paper
This is the previous year question paper of CS Mathematical Foundation of Computer Science (MSc) (Semester 1) conducted by Hemchand Yadav Vishwavidyalaya, Durg (Apr 2021). Practising it helps you understand the exam pattern, important questions and marks distribution of your university.
How to prepare with this paper
- पूरा पेपर एक बार पढ़ें और जो प्रश्न आपको आते हैं उन पर निशान लगाएँ।
- देखें कि हर प्रश्न सिलेबस की किस इकाई से है — जो इकाइयाँ बार-बार आती हैं, वही सबसे ज़रूरी हैं।
- बिना नोट्स देखे 3 घंटे में पेपर हल करें, फिर अपनी किताब से उत्तर मिलाएँ।
- इसी विषय के दूसरे वर्षों के पेपर भी डाउनलोड करें और दोहराए गए प्रश्न ढूँढें।
Questions in this paper (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
COMPUTER SCIENCE
Paper - I
Mathematical Foundation of
Computer Science
Time : Three Hours] [Maximum Marks : 100
Note : Answer any two parts from each question. All
questions carry equal marks.
Unit-I
1. (a) Prove that :
(b) Explain the following terms and also give
example to explain them :
(i) Quantifier
(ii) Negation of a Quantifier
( 2 )
(c) Let T be the set of all triangles in a plane
that is a R b if and only if area of
a=area of b. Prove that R is an
equivalence relation.
Unit-II
2. (a) A lattice L is distributive if and only if
where and are binary operations
satisfying the absorption law. Show that
and also satisfy the idempotent law.
(c) If (B, +, , ) is a Boolean algebra, then
prove that the following statements are
equivalent :
3. (a) Prove that the inverse of the product of
two elements of a group is the product
of the inverse taken in the reverse order
( 3 )
(b) Define Grammar. Find the phase-structure
grammar that generate the set :
(c) Show that the order of a subgroup of a
finite group divides the order of the
group.
Unit-IV
4. (a) Prove that in any graph, the number of
vertices of odd degree is always even.
(b) Prove that if the intersection of two path
in a graph is a disconnected graph. Show
that the union of the two path has at
least one circuit.
(c) Write an algorithm for shortest path in
weighted graph and use it to find shortest
path from a to z in the graph shown in
figure where number associated with the
edges are the weights.
( 4 )
Unit-V
5. (a) Find the minimum spanning tree for the
graph :
15 10 1 8
(c) Express the following algebraic
expression in binary tree :