Roll No.
Total Pages : 3
MDQA{-17 4230
DISCRETE MATHEMATICS AND COMPUTER
PROGRAMMING
Paper : VII MM-502
Time : Three Hoursl [Maximum Marks : 80
Note : Attempt any fva questions but at least ane question from
each section.
SECTION-I
1. (a) Let L be a modular lattice. Prove that if a, D € L, then
Ilavb,b)=lla,avbl. 8
(b) Prove that a lattice L satisfies the descending chain
condition if and only if every ideal of L is principal. 8
2. (a) Prove that in a modular and complemented lattice, either
of the chain condition implies the other. 8
(b) Prove that a Boolean ring with unity defines a Boolean
algebra. 8
SECTION-II
3. (a) Let G = (V, E) be a simple (n, rz) graph such that
Sfrl lV,
2
> e V. Prove that G has a Hamiltonian
circuit. 8
(b) Prove that a connected graph of n vertices and n - I
edges is a tree. 8
4230/350lKD/1576 IP.T.O.
4 (a) Prove that if S, and S, are two cut-sets in G, then S, (E 9. (a) Illustrate with examples the declaration, initialization,
S, is the union of edge-disjoint cut-sets. 8 reading and printing of strings. 8
(b) kt G be a non-separable graph. Prove that the set of (b) Write a program to copy one string into another and
all edges incident at any vertex of G is a cut-set in G. count the number of characters copied. 8
8
10. Explain the declaration, initialization and assignments of
(a) Prove that the dimension of the circuit space of a structures. Give an example of a C-function that retums a
connected graph G is the nullity of G. 8 structure. 16
(b) Prove that the rank of the incidence matrix of a connected
graph G is the rank ofG. 8
SECTION-III
6, (a) Write algorithm and draw flowchart for finding the
smallest of three given values, say.r, ), z. 8
(b) Explain with examples all the rules to be followed for
naming the variables, functions or locations in a
C-program. 8
7 Discuss with examples the working of the while statement,
the do..... rvhile statement and the /ar statement for looping
in C. 16
SECTION-IV
8 (a) Explain the declaration and initialization of one-
dimensional arrays. 4
(b) Explain bubble sort algorithm and write its C-program
to sort a given one-dim array in ascending order. 12
4230/350tKDn576 2 423015s0/KDt1576 3
