Scribd
Upload
38 views1 page

Assignment

Assignment pdf of ps tee

Uploaded by

deoreg1386
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
38 views1 page

Assignment

Assignment pdf of ps tee

Uploaded by

deoreg1386
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/ 1

Assignment

Discrete Mathematics

Q.1. Solve one unique problem from the syllabus which shows an application of topic.

Q.2. The famous detective Percule Hoirot was called in to solve a baffling murder
mystery. He determined the following facts:
a. Lord Hazelton, the murdered man, was killed by a blow on the head with a
brass candlestick.
b. Either Lady Hazelton or a maid, Sara, was in the dining room at the time of
the murder.
c. If the cook was in the kitchen at the time of the murder, then the butler killed
Lord Hazelton with a fatal dose of strychnine.
d. If Lady Hazelton was in the dining room at the time of the murder, then the
chauffeur killed Lord Hazelton.
e. If the cook was not in the kitchen at the time of the murder, then Sara was not
in the dining room when the murder was committed.
f. If Sara was in the dining room at the time the murder was committed, then
the wine steward killed Lord Hazelton.
Is it possible for the detective to deduce the identity of the murderer from these
facts? If so, who did murder Lord Hazelton? (Assume there was only one cause of
death.)

Q.3. Let 𝑃(𝑛) be the following sentence: Given any graph 𝐺 with n vertices satisfying
the condition that every vertex of 𝐺 has degree at most 𝑀, then the vertices of 𝐺
can be colored with at most 𝑀 + 1 colors in such a way that no two adjacent
vertices have the same color. Use mathematical induction to prove this statement
is true for every integer 𝑛 ≥ 1.

Q.4. How many different channels are needed for six stations located at the distances
shown in the table, if two stations cannot use the same channel when they are
within 150 miles of each other?
1 2 3 4 5 6
1 - 85 175 200 50 100
2 85 - 125 175 100 160
3 175 125 - 100 200 250
4 200 175 100 - 210 220
5 20 100 200 210 - 100
6 100 160 250 220 100 -

You might also like