Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
6 views2 pages

DMS Assignment

The document contains a list of assignment questions related to logic, combinatorics, and set theory, with a submission deadline of November 19, 2024. Topics include contradictions, tautologies, logical connectives, quantifiers, permutation and combination problems, and principles like Inclusion-Exclusion and Pigeonhole. Additionally, it includes practical problems involving counting, committee formation, and selections from sets.

Uploaded by

Prasad Patil
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
6 views2 pages

DMS Assignment

The document contains a list of assignment questions related to logic, combinatorics, and set theory, with a submission deadline of November 19, 2024. Topics include contradictions, tautologies, logical connectives, quantifiers, permutation and combination problems, and principles like Inclusion-Exclusion and Pigeonhole. Additionally, it includes practical problems involving counting, committee formation, and selections from sets.

Uploaded by

Prasad Patil
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

DMS Assignment questions (Last date : 19/11/2024)

1) What do you mean by Contradiction?


2) Show that (a ˅ b) ∧ {(a → c) ∧ (b → c)} → c is a Tautology.
3) Show that (p → q) ∧ (q → p) ≡ (p ↔ q).
4) Explain any 2 Logical Connectives with truth table.
5) Define Universal quantifier and Existential quantifier. Write down the following
proposition in the symbolic form and find its negation. “All Integers are rational
numbers and some rational numbers are not integers.”
6) What is Sum rule and Product rule? State and prove the Pigeonhole principle.
7) Find the number of permutations of the letter of the word “MASSASAUGA”.
a) In how many ways of all 4 A’s can be arranged together?
b) How many of them begins with letter ‘S’?
8) How many bits of length 8 either starts with 1 or end with 00 ?
9) Explain the Inclusion-Exclusion principle.
10) Out of 6 men and 2 women, a committee of 3 is to be formed.
In how many ways this can be done so as to include
a) exactly one woman,
b) at least one woman.
11) Explain the Generalized Permutation and Generalized combination.
Suppose that a cookie shop has 4 different kinds of cookies. How many different
ways can 6 cookies be chosen? Assume that only the type of cookie, and not the
individual cookies or the order in which they are chosen, matters.
12) There are 32 computers in a computer center. Each microcomputer has 24 ports.
How many different ports to a microcomputer in a center are there?
13) How many numbers must be selected from the set {1,2,3,4,5,6} to guarantee that at
least one pair of these numbers adds up to 7?
14) In how many ways can a set of 5 letters be selected from the English alphabet?
15) Suppose that a department contains 10 men and 15 women. How many ways are there
to form a committee of 6 members if it must have the same number of men and
women?
16) How many solutions are there to the equation x1+x2+x3+x4=17,
where x1, x2, x3, and x4 are non-negative integers?
17) Find the next larger four combinations of the set {1,2,3,4,5,6} after {1,2,5,6}.
18) How many ways are there to select a first prize winner, second prize winner,
and third prize winner from 100 different people who have entered a contest?
19) Suppose that a cookie shop has 4 different kinds of cookies. How many different
ways can 6 cookies be chosen? Assume that only the type of cookie, and not the
individual cookies or the order in which they are chosen, matters.
20) During a month with 30 days, a baseball team plays at least one game a day but no
more than 45 games. Show that there must be a period of some consecutive days
during which the team must play exactly 14 games.

You might also like