About this question paper
This is the previous year question paper of Mathematics Advanced Discrete Mathematics (MA, MSc) (Semester 1) conducted by Pt. Ravishankar Shukla University, Raipur (Jan 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 देखें।
MATHEMATICS
Paper Fifth
Time : Three Hours ] [ Maximum Marks : 80
[ Minimum Pass Marks : 16
Note : Attempt all Sections as directed.
(Objective/Multiple Choice Questions)
Note : Attempt all questions.
Choose the correct answer :
1. The proposition is :
(a) A tautology
correct ?
3. A semigroup < M > with an identity element with respect to
operation (.) is called :
(a) Monoid
(b) Homomorphism
(c) Automorphism
4. Every finite semigroup has an :
(a) Identity element
(b) Inverse element
(c) Idempotent element
operation * of M be taken as addition of matrices . Then
(a) Semigroup
(b) Monoid
6. An equivalent relation R on a semgrioup (S, *) is called a
congruence relation if :
7. Union of two sub-semigroups of a semigroup (S, *) is :
(a) Semigroup of (S, *)
(d) Need not be a sub-semigroup of (S, *)
8. Which of the following statements is a proposition ?
(a) Get me a glass of milk.
9. Every finite subset of a lattice has :
10. A self-complemented, distributive lattice is called :
(a) Modular lattice
(b) Boolean algebra
(c) Complete lattice
(d) Self-dual lattice
11. The term sum-of-product in Boolean algebra means :
(a) AND function of several OR functions
(b) OR function of several AND functions
13. The dual of Boolean expression (a + 1) (a + 0) = a is :
14. If < T, *, > is lattice and if then < S, *, > is
sublattice of < T, *, ⊕ > if and only if :
(a) S is closed under the operation ⊕
table ?
16. In a lattice property is called :
(a) Idempotent Laws
(b) Commutative Laws
(c) Absorption Laws
17. Let L be a language recognizable by a finite automation. The
where } is a :
(a) Regular language
(b) Context-free language
(c) Context-sensitive language
18. A regular grammar contains only produionsct of the form
, where :
19. Which of the following regular expression identifiers a re
true ?
(a) L (a) is regular
(Very Short Answer Type Questions)
Note : Attempt all questions. Answer in 2-3 sentences.
1. Define Tautology.
2. Define semi-group with one example.
3. Define submonoids.
4. Give example of a sub-semigroup.
5. Define distributive lattices.
6. Define sublattice.
7. Define minterm or minimal boolean function.
8. Define join-irreducible elements.
9. Define context-free grammar.
10. Define type zero grammar.
(Short Answer Type Questions)
Note : Attempt all questions. Answer in less than 75 words.
1. Define contradiction. Verify that the proposition
is contradiction.
2. Consider the set Q of rational numbers, and let * be the
operation on Q defined by :
Is (Q, *) a semigroup ? Is it commutative ?
3. Define direct product of semigroups.
4. Define monoid homomorphism.
(L, ≤) be a lattice for any , the
6. Prove that let abc,,∈ L
following holds :
7. Simplify the Boolean expression :
12 12 12 12
8. Show that the order relation is partial order relation in a
Boolean algebra.
9. Define the following terms :
(a) Context-sensitive grammar
(b) Regular grammar
10. Show that the language :
starting symbol.
(Long Answer Type Questions)
Note : Attempt all questions. Answer using less than 150 words
for each.
1. What is Quantifiers ? Explain different types of quantifiers.
Show that the following argument is not valid :
2. State and prove fundamental theorem of homomorphism for
semigroup.
11 22 1 21 2
3. In a Boolean algebra (B, +, .); state and prove :
(a) Absorption law
is a distributive lattice.
4. Show that the algebra of Boolean circuits is a Boolean
algebra.
Draw the switching circuit of the function :
and replace it by a simplified one.
5. State and prove pumping lemma for regular sets.
Construct a grammar for the language :