About this question paper
This is the previous year question paper of Mathematics Advanced Discrete Mathematics 2 (MA, MSc) (Semester 1) conducted by Atal Bihari Vajpayee Vishwavidyalaya, Bilaspur (Jun 2020). 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 देखें।
Paper-V
Mi irnurn Passing Mark- 29
Section - A
(a) Define type -2 gramrner.
(b) Define context-fiee gramffrers
(c) A directed graph, called a .... is Llssociatecl th a flnite automation
(d) Define infbrrnation-processing rnach inc.
(e) Define equivalent machine.
makes the remaining graph as
(g) An edge is said to be a If it's both cnrl vertic are sarne
(b) Define Moore machine.
(c) What is minirni zation of a machine.
(e) Explain directed graph.
Section B
1 generated
(a) Write Notes alr Polish Notartion
table. Construct the corresponding Meerltrv Machine
4 (a) Design a flnite state tnachine that receives the set { 0., 1 ) as input and produces
an output such that outpnt is equal to the madulo 3 sLl of digits in the ir"rput
secluence.
belo\\':-
Start 1,0 0,0 1,
State 0utput
(b) Dellne tlnite state langlrerge.
flnite state language.
5 (a) Shou'thut tlrc sLlul of'the clegrec.s ol'erll the riertices in graph is equal to tu'ice
is an inteser.
?. Vcrtcx rlilioint sub graph
ilssociated u'ith the eclges are the \\'eights.
-l cle 6
(b) Dellne [:uler Graph.
Prove that a connected graph G is an Euler graph if an only if G is the union of
sonre eclges dir.ioint circuits.
(a) Solve the travelling salesman problern for the fbllorvin rveighted graph
A 2 BIC
connected. (ie. Graph is a tree)
(b) Deflne spanning tree.
Irirrcl thc nrininrunr spanning tree fbr the fbllou'ing graph.
15 10 1.