Assignment 4
Assignment 4
1. Each user on a computer system has a password, which is six to eight characters long, where
each character is an uppercase letter or a digit. Each password must contain at least one digit
and must start with a letter. How many possible passwords are there?
2. Let A be the set of 27 distinct English words. What shall be the minimum number of words i n
the set A that must begin with the same alphabet?
3 If
n
P4 = 2 5 P3 , find the value of 𝑛 . Ans. n=5
4 If
n
P4 = 20 n P2 , find the value of 𝑛 . Ans. n=7
5. Show that there are at least 9 people among a group of 100 people who were born in the same month.
6. Find the generating function of each of the following discrete numeric functions
(i). 2, 4, 8, 16, 32, ……. Ans. 2 (1 − 2 z ), 2 z 1
2 3 4 r +1
Ans. 9 (3 − z ) ,
2
(iii). 1, , , ,........... r ,
3 9 27 3
7. Find the generating functions of the following numeric functions
5
(i) an = 5.2n Ans: A( z ) =
(1 − 2 z )
8
(ii) an = 2n+3 , n 0 Ans: A( z ) =
(1 − 2 z )
1 1 1 1 1
1 r r +1
(iii) A( z ) = Ans: − = 1 − , r 0
5 − 6z + z2 4 20 5 4 5
10. By using truth table, find whether the following is a tautology, contradiction, or contingencyin
propositional variables 𝑝, 𝑞 and 𝑟:
((𝑝 → 𝑞) 𝖠 (𝑝 ∨ 𝑟) 𝖠 (∼ 𝑞)) → 𝑟
11. Over the universe of four wheelers, let 𝐴(𝑥): 𝑥 is a four wheeler, 𝐵(𝑥): 𝑥 is a car and 𝐶(𝑥):
𝑥 is manufactured by Nissan. Express the following statements using quantifiers.
i) Every car is a four-wheeler manufactured by Nissan.
ii) There are cars that are not manufactured by Nissan.
iii) Every four-wheeler is a car.
12. By using truth table, find whether the following is a tautology, contradiction or contingency in
propositional variables 𝑝, 𝑞 and 𝑟:
((𝑝 → 𝑞) 𝖠 (𝑞 → 𝑟)) → (𝑝 → 𝑟)
13. Over the universe of students at MUJ, let 𝑃(𝑥): 𝑥 has studied computer programming and
𝑄(𝑥): 𝑥 is an engineer. Express the following statements using quantifiers.
i) Every student has studied computer programming, but some are not engineers.
ii) At least one of the students who has studied the computer programming is an engineer.
iii) If there is a student who is engineer, then computer programming must be studied by the
student.
14. Let p and q be the propositions
p : It is below freezing.
q : It is snowing.
Write these propositions using p and q and logical connectives (including negations).
(a) It is below freezing but not snowing.
(b) It is not below freezing, and it is not snowing.
(c) It is either snowing or below freezing (or both).
(d) If it is below freezing, it is also snowing.
(e) Either it is below freezing, or it is snowing, but it is not snowing if it is below freezing.
(f ) That it is below freezing is necessary and sufficient for it to be snowing.
15. Assume x is a particular real number. Determine whether statement (a) and (b) are logically
equivalent
a) x < 2 or it is not the case that 0 < x < 3.
b) x 0 or either x < 2 or x ≥ 3.
Do this question by letting p, q, r be the 3 statement variables for the 3 statements in a) and b).
Then write out a) and b) in symbols and now construct a truth table and a justifying sentence.
16. There are two restaurants next to each other one has sign that says, “Good food is not cheap” and
other has a sign that says, “Cheap food is not good”. Are the signs saying the same thing? Consider
the conditional statement p and verify the result by truth table.
17. Let P(x) be the statement “x can speak French” and let Q(x) be the statement “x knows the
computer language C++.” Express each of these sentences in terms of P(x), Q(x), quantifiers, and
logical connectives. The domain for quantifiers consists of all students of MUJ in 2019-20.
(a) There is a student at MUJ who can speak French and who knows C++.
(b) There is a student at MUJ who can speak French but who does not know C++.
18. Translate each of these statements into logical expressions using predicates, quantifiers, and
logical connectives. Let C(x) denote the predicate “x is in the correct place”, let E(x) denote the
predicate “x is in excellent condition”, and let T(x) denote the predicate “x is a tool”. and suppose
that the domain consists of all tools.
i) Something is not in the correct place.
ii) All tools are in the correct place and are in excellent condition.
((𝑝 ∨ 𝑞) 𝖠∼ 𝑝) → 𝑞