MAASAI MARA UNIVERSITY

UNIVERSITY EXAMINATIONS 2014/2015 (REGULAR)

SCHOOL OF SCIENCE AND INFORMATION SCIENCES

UNIVERSITY EXAMINATIONS FOR THE DEGREE OF BACHELOR OF

SCIENCE (COMPUTER SCIENCE)
FIRST YEAR SECOND SEMESTER EXAMINATION

COURSE CODE: COM 123

COURSE TITLE: MATHEMATICS FOR COMPUTER SCIENCE II

DATE: 2ND SEPT 2015 TIME: 11:00AM-1:00PM
INSTRUCTIONS

 Answer Question ONE and any other TWO

SECTION A

QUESTION ONE 30 MARKS

a. Define Logic? And briefly explainits three components (3 marks)

b. i. Explain the Validity and Satisfiability of a formula (3 marks)

ii. Translate the sentences into propositional expressions:

"Neither the fox nor the lynx can catch the hare if the hare is alert and quick."

(5 marks)

c. i) Define Proposition (1 mark)

ii) state five types of proposition connectives with their symbols ( 5 marks)
iii). Argument (1 mark)

d. i). Verify ˜˜p≋p (2 marks)

ii).Show that the propositions ¬ (p∧q) and ¬p∨¬q are logically equivalent
(4 marks)
e. Show that p↔q logically implies p→q (3 marks)

f. Find truth table of ¬p ۸ q (3

marks)

SECTION B :ANSWER ANY TWO QUESTIONS FROM THIS SECTION

QUESTION TWO 20 MARKS

a. Consider the conditional proposition p→q. The simple propositions q→p, ¬p→¬q and
¬q→¬pare called, respectively, the converse, inverse , and contra positive of the
conditional p→q. Which if any of these propositions are logically equivalent to p→q?
( 5 marks)

b. Verify that the proposition p∨¬(p∧q) is a tautology (5 marks)

c. Given a conditional statement in English,

a. translate the sentence into a logical expression

 b. write the negation of the logical expression and translate the negation
into English
c. write the converse of the logical expression and translate the
converse into English
d. write the inverse of the logical expression and translate the inverse
into English
e. write the contrapositive of the logical expression and translate the
contrapositive into English (6 marks)

"If we are on vacation we go fishing."

d. Write the contrapositive, converse and inverse of the expressions:

P → Q, ~P → Q, Q → ~P (4 marks)

QUESTION THREE 20 MARKS

a. Translate the sentences in quantified expressions of predicate logic, write down the
negated expression and then translate the negated expression in English. The
predicates to be used are given in parentheses. (7 marks)

Some problems are difficult. (problem(x), difficult(x))

x, (problem(x) difficult(x))

b. No students are allowed to carry guns. (student(x), carry gun(x)) (7 marks)

x (student(x) ~carry gun(x))

c. Prove or disprove the following equivalence,

~ p qp~ qq~ p
 marks 

QUESTION FOUR 20 MARKS

 a. Let p be “He is tall” and let q be “He is handsome” write each of the following
statements in symbolic form using p and q (assume that “He is short” means “He
is not tall” i.e. – p)
1. He is tall and handsome
2. He is tall but not handsome
3. It is false that he is short or handsome
4. He is neither tall nor handsome
5. He is tall or he is short and handsome
6. It is not true that he is short or not handsome

Show that p implies q and q implies p is logically equivalent to the biconditional p if and
only if q that is, (p→q) (q→p) =↔q. (6 marks)

b. Show that the biconditional p ↔q can be written in terms of the original three
connectives ν ۸ and ῀ (4 marks)

c. Determine the truth tables of (a) (p→q)→(p…q), (b)(p→q) v-(p→-q)

(10 marks)