Beruflich Dokumente
Kultur Dokumente
:Q−1
a) [5 marks] Construct the truth tables of the statements
(p ˄ ¬r) ˅ ¬(r → ¬q) and p ˄ (q ˅ ¬r).
Determine whether they are logically equivalent.
b) [5×1 marks] In the questions below suppose that the
variable x represents people, F (x): x is friendly, T (x): x is
tall and A (x): x is angry. Write each of the following
statement using these predicates and any needed
quantifier:
i. Some people are not angry.
ii. All tall people are friendly.
iii. No friendly people are angry.
iv. Some tall angry people are friendly.
v. If a person is friendly, then that person is not angry.
:Q−2
a) [5×1 marks] Suppose f : R → Z where f (x) = 2x - 1.
i. Is f one-to-one? Explain.
ii. If A = {x | 1 ≤ x ≤ 4}, find f (A).
iii. If B = {3, 4, 5, 6, 7}, find f (B).
iv. If C = {-9, -8}, find f- -1(C).
v. If D = {0.4, 0.5, 0.6}, find f -1(D).
b) [5×1 marks] Prove or disprove each of the following:
i. The sum of two primes is a prime.
ii. If p and q are primes (> 2), then p + q is composite.
iii. If a ≡ b (mod 2m), then a ≡ b (mod m).
iv. A positive integer congruent to 1 modulo 4 cannot
have a prime factor congruent to 3 modulo 4.
v. For all integers a, b, c, if a | c and b | c, then ab | c2.
:Q−3
a) [5×1 marks] How many permutations of the letters A, B,
C, D, E, F, G that:
i. Have E in one of the first two positions?
ii. Do not have vowels on the ends?
iii. Have the two vowels before the five consonants?
iv. Have A immediately to the left of E?
v. Neither begin nor end with A?
b) [1+2+2 marks] Suppose that you have 30 different books (15
novels, 10 history books, and 5 math books). In how many ways
can you:
i. Get a bunch of four books to give to a friend?
ii. Get a bunch of three history books and seven novels
to give to a friend?
iii. Put the 30 books in a row on a shelf if the novels are
on the left, the math books are in the middle, and the
history books are on the right?
Q−4: [5×2 marks] Suppose that you pick a bit string from the set
of all bit strings of length ten. Find the probability that
;a)the bit string has exactly two 1s
;b)the bit string begins and ends with 0
;c)the bit string has the sum of its digits equal to seven
;d)the bit string has more 0s than 1s
e)the bit string has exactly two 1s, given that the string begins with
a 1.
المهندس أحمد @ الجامعة MT131 M131حل واجبات MT131 M131 00966597837185 TMA
العربية المفتوحة
المهندس أحمد~ ~ MT131 M131 ** 00966597837185حل واجب ~
حلول,واجبات,الجامعة,العربية,المفتوحة
الجامعة العربية MT131 M131حل واجبات MT131 M131 00966597837185حل_واجب#
المفتوحة
واجبات الجامعة MT131 M131 ,المهندس أحمد 00966597837185:حل واجب MT131 M131
العربية المفتوحة
MT131 M131 00966597837185حل واجب MT131 M131 TMA Answers ENG:Ahmed
حلول واجبات الجامعـة العربية المفتوحة ~ , MT131 M131 00966597837185حل ,واجب
المهندس احمد لحلول الواجبات الجامعة العربية > MT131 M131 ? 00966597837185حل واجب
المفتوحة
خل واجبات الجامعة MT131 M131حل واجب المهندس احمد MT131 M131 00966597837185
MT131مهندس أحمد ,,,,حلول واجبات MT131 M131 << 00966597837185حل واجبات المتياز
M131
MT131 M131المفتوحة ,حل واجب MT131 M131,حل,واجبات,الجامعة,العربية00966597837185 ,
حلول واجبات الجامعة العربية المفتوحة
حل واجبات جروب المتياز بقيادة المهندس أحمد 00966597837185تنبيه ,,رقمي الوحيد لعدم التعرض
للحتيال
حل واجبات الجامعة العربية المفتوحة ,, 00966597837185حلو ل واجبات الجامعة العربية المفتوحة ,,
حل الواجب MT131 M131حلول واجبات MT131 M131جروب المتياز المهندس أحمد حل واجب
بدون تشابه حل واجبات الجامعة العربية المفتوحة MT131 M131 TMAحلول الواجبات MT131 M131
,, 00966597837185حلو ل واجبات الجامعة العربية المفتوحة ,,جروب المتياز المهندس أحمد حل واجب
MT131حلول الواجبات MT131 M131حل الواجب MT131 M131حلول واجبات MT131 M131
بدون تشابه M131 TMA