Scribd
Upload
87 views2 pages

2023-2024 - SEM - 1 - Online B.Sc. CS-Batch 2 - SEM 1 - BCS ZC219 - Discrete Mathematics - EC-3 - SLOT-2 - 15-10-2023

The document contains a comprehensive exam for a discrete mathematics course. It consists of 9 questions covering topics like truth tables, mathematical induction, sets, lexicographic order, bit strings, recurrence relations, group theory, graph coloring, and the relationship between a graph and its complementary graph.

Uploaded by

fa2193127
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
87 views2 pages

2023-2024 - SEM - 1 - Online B.Sc. CS-Batch 2 - SEM 1 - BCS ZC219 - Discrete Mathematics - EC-3 - SLOT-2 - 15-10-2023

The document contains a comprehensive exam for a discrete mathematics course. It consists of 9 questions covering topics like truth tables, mathematical induction, sets, lexicographic order, bit strings, recurrence relations, group theory, graph coloring, and the relationship between a graph and its complementary graph.

Uploaded by

fa2193127
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Birla Institute of Technology & Science, Pilani

Online B.Sc. Computer Science Programme


Second Semester 2022-2023

Comprehensive Exam
(Slot-2)

Course No. : BCS ZC219


Course Title : Discrete Mathematics
Nature of Exam : Open Book
Weightage : 50% No. of Pages = 2
Duration : 2 Hours 30 Minutes No. of Questions = 9
Date of Exam : 15-10-2023
Note to Students:
1. All parts of a question should be answered consecutively. Each answer should start from a fresh page.
2. Assumptions made if any, should be stated clearly at the beginning of your answer.

Q.1. Construct a truth table for these 2 compound statements.

Are these 2 compound statements equivalent? Justify your answer.


[5 Marks]

Q.2. Prove 2n+1 < 1 + (n + 1)2n using mathematical induction for every positive integer.
[5 Marks]
Q.3. Find two sets and such that
a) and
b) and are uncountable but is countably infinite.
c) and are uncountable but - and - both are countably infinite.
[5 Marks]

Q.4. Let S = {a, c, e, g}. With respect to the lexicographic order based on the usual less than
relation ‘≤’,
a) Find all pairs in S × S less than (c, e).
b) Find all pairs in S × S greater than (e, a).
c) Draw the Hasse diagram of the poset (S × S, ≤).
d) Is the poset a lattice? Give justification.
[10 Marks]

Q.5. How many bit strings of length seven begin with two 0s or end with three 1s?
[5 Marks]
Q.6. Solve the recurrence relation with the initial conditions given below:
an = 6an−1 − 8an−2 for n ≥ 2, a0 = 4, a1 = 10.
[5 Marks]

Q.7. Let (G,*) be group under this operation *, with the following property: If x, y, z belong to G
and xy=zx then y=z. Prove that G is abelian.
[5 Marks]
Q.8. Show that a simple graph that has a circuit with an odd number of vertices in it cannot be
colored using two colors.
[5 Marks]

Q.9. The complementary graph of a simple graph G has the same vertices as G. Two vertices are
adjacent in the complementary graph of G if and only if they are not adjacent in G. If G is a
simple graph with 20 edges and and complementary graph of G has 16 edges, how many
vertices does G have?
[5 Marks]

***********

You might also like