Aux 2017

Roll Number:
Thapar University, Patiala

Department of Computer Science and Engineering
AUXILIARY EXAMINATION
B. E. (Second Year): Semester-I Course Code: UCS405
(COE/COEM/CAG/CML/ SEM) Course Name: Discrete Mathematical
Structures
July 25, 2017 Time: 3 Hours, M. Marks: 100
Note: Attempt all questions with proper justification. Assume missing data, if any.
Q.1 a) Determine whether the pair of graphs given in Figure 1 is isomorphic (5+5)
or not? If yes, exhibit an isomorphism. If not, give a suitable reason.
U U2 Vi
V
U3
(, U4
Us
Figure 1
b) Determine whether the directed graphs given in Figure 2 have an
Euler circuit or not. If yes, write the Euler circuit. If no, then determine
whether they have an Euler path. Write the Euler path if one exists.
a
Figure 2
Q.2 a) What is a ring? Mention the conditions necessary to be a ring. (6+4)
b) What do you mean by a monoid? Mention the conditions necessary to
be a monoid.
Q.3 Answer the following questions for the poset ({3, 5, 9, 15, 24, 45}, I ). (10)
a) Find the maximal elements.

b) Find the minimal elements.
c) Is there a greatest element?
d) Is there a least element?
e) Find all upper bounds of {3, 5}.
0 Find the least upper bound of {3, 5}, if it exists.
1/3
M
g) Find all lower bounds of {15, 45}.

h) Find the greatest lower bound of {15, 45}, if it exists.
Q.4 i) Let p and q be the propositions "Swimming at the New Jersey shore is (5+5)
allowed" and "Sharks have been spotted near the shore," respectively.
Express each of these compound propositions as an English sentence.
a) —'q b) p A q c) —7) v q d) p —) —iq e) --lq —> p
ii) Let p and q be the following propositions
p :You drive over 65 miles per hour.

q :You get a speeding ticket.
Write the following propositions using p and q and logical connectives

(including negations).
a) You do not drive over 65 miles per hour.
b) You drive over 65 miles per hour, but you do not get a speeding ticket.
c) You will get a speeding ticket if you drive over 65 miles per hour.
d) If you do not drive over 65 miles per hour, then you will not get a
speeding ticket.
e) Driving over 65 miles per hour is sufficient for getting a speeding
ticket.
Q.5 Write the name of rule of inference used in each of the following (10)
arguments.
Also mention the rule using propositional variables clearly stating the
statements those propositional variables represent.
a) Alice is a mathematics major. Therefore, Alice is either a mathematics

major or a computer science major.
b) Jerry is a mathematics major and a computer science major.
Therefore, Jerry is a mathematics major.
c) If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool
is closed.
d) If it snows today, the university will close. The university is not closed
today. Therefore, it did not snow today.
e) If I go swimming, then I will stay in the sun too long. If I stay in the sun
too long, then I will sunburn. Therefore, if I go swimming, then I will
sunburn.
Q.6 Show that if A and B are sets, then (5+5)

a)A—B=An B.
b) (A n B) u (A n B)= A.
Q.7 Suppose that g is a function from A to B and f is a function from B to C. (5+5)
a) Show that if both f and g are one-to-one functions, then f o g is also

one-to-one.
2/3
•
4
r
b) Show that if both fand g are onto functions, then f o ,g is also onto.
Q.8 Find big-0 estimate for the following functions: (10)
a) (n log n + n2)(n3 + 2)
b) (n! + 2n)(n3 + log(n2 + 1))
Q.9 A parking lot has 31 visitor spaces, numbered from 0 to 30.Visitors are (5+5)
assigned parking spaces using the hashing function h(k) = k mod 31,
where k is the number formed from the first three digits on a visitor's
license plate.
a) Which spaces are assigned by the hashing function to cars that have
these first three digits on their license plates: 317, 918, 007, 100, 111,
310?
• Q.10
b)Use linear probing to resolve collisions in part a). Find new spaces
assigned to cars after resolving collisions.
Let S be the subset of the set of ordered pairs of integers defined (4+6)
recursively by
Basis step: (0, 0) E S.
Recursive step: If (a, b) E S, then (a, b + 1) e S, (a + 1, b + 1) E S, and (a + 2,
b +1) E S.
a) List the elements of S produced by the first four applications of the

recursive definition.
b) Use structural induction to show that a 2b whenever (a, b) E S.
3/3

Aux 2017

Uploaded by

Copyright:

Available Formats

Aux 2017

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Aux 2017

Uploaded by

Copyright:

Available Formats

Roll Number:

Thapar University, Patiala

a) Find the maximal elements.

g) Find all lower bounds of {15, 45}.

a) —'q b) p A q c) —7) v q d) p —) —iq e) --lq —> p

ii) Let p and q be the following propositions

p :You drive over 65 miles per hour.

Write the following propositions using p and q and logical connectives

a) Alice is a mathematics major. Therefore, Alice is either a mathematics

Q.6 Show that if A and B are sets, then (5+5)

Q.7 Suppose that g is a function from A to B and f is a function from B to C. (5+5)

a) Show that if both f and g are one-to-one functions, then f o g is also

b) (n! + 2n)(n3 + log(n2 + 1))

a) List the elements of S produced by the first four applications of the

b) Use structural induction to show that a 2b whenever (a, b) E S.

You might also like