(1) In predicate logic, there may be more than one quantifier with the same variable, and we

need a rule to determine which quantifier a given occurrence of that variable is bound to.
This rule is called:
(A) Capturing
(B) Witnessing
(C) Scoping
(D) Quantification

(2) Among the following choices, which is not a complete set of Boolean connectives?
(A) {, 0}
(B) {, }
(C) {, }
(D) {NAND}

(3) All but one of the following problems directly use discrete mathematics in their solution.
The exception is:
(A) proving a property of the natural numbers with induction.
(B) applying a graph algorithm to determine if a graph is connected.
(C) calculating the area under an arbitrary curve (function).
(D) using a truth table to evaluate a propositional formula.

(4) The implication (p  q)  q is:

(A) a tautology.
(B) true for exactly one truth assignment to the variables p and q.
(C) false for exactly one truth assignment to the variables p and q.
(D) true whenever p is true, but false otherwise.
(E) true whenever q is true, but false otherwise.

(5) Which of the following operators are not associative? (There may be more than one.)
(A) The operator ‘–‘ for set difference.
(B) The operator ‘NAND’ for propositional expressions.
(C) The disjunction operator  for propositional expressions.
(D) The intersection operator  for sets.
(E) The relational composition operator ◦ for binary relations.

(6) F(x, y) is the statement "x can fool y", and assume that A(x) is the statement "x is an adult".
Using predicate logic with the above definitions, what would be the appropriate equivalents
of the following statements?
Fred can fool Betty, but Betty cannot fool Fred.
(A) F(Fred, Betty)
(B) F(Betty, Fred)
(C) F(Fred, Betty)  F(Betty, Fred)
(D) F(Fred, Betty)  F(Betty, Fred)
(E) (F(Fred, Betty)  F(Betty, Fred))
(7) No child can fool an adult. (Assume that the domain is the set of all people)
(A) x, y A(x)  F(x, y) (B) x, y (A(x)  A(y))  F(x, y)
(C) x, y A(x)  F(y, x) (D) x, y (A(x)  A(y))  F(y, x)
(E) x, y (A(x)  A(y))  F(y, x)

(8) Which of the following statements would be least likely to appear in an inductive proof as
the induction hypothesis?
(A) "Assume that P(k) is true for some fixed but arbitrary k  N."
(B) "Assume that P(k) is true for all 0  k < n."
(C) "Assume that P(k) is true for all 0  k  n."
(D) "Assume that P(k) is true for all natural numbers k."
(9) p ∨ p is syntactically equivalent to
a. p
b. p ∨ p
c. ￢￢p
d. p ∧ p
e. ￢p ∧ p
(10) The CNF form for the following formula, ￢p, is
a. ￢p ∧ ￢p
b. (￢p ∨ ￢p) ∧ (￢p ∨ ￢p)
c. p
d. ￢p
e. ￢￢p
(10) The DNF form for the following formula, ￢p, is
a. ￢p ∧ ￢p
b. (￢p ∧ ￢p) ∨ (￢p ∧ ￢p)
c. p
d. ￢p
e. ￢￢p

(12) Proposition is a statement which is

a) true
b) false
c)either true or false but not both
d) both true and false
13) Converse of the statement (p  q) is:
a) q  p
b) ￢q  ￢p
c) ￢p  ￢q
d) p  ￢q
14) Inverse of the statement (p  q) is:
a) q  p
b) ￢q  ￢p
c) ￢p  ￢q
d) p  ￢q
15) Contra positive of the statement (p  q) is:
a) q  p
b).￢q  ￢p
c) ￢p  ￢q
 d) p  ￢q
16) (pr) ∧ (q r) is logically equivalent to:
a) (p ∨ q) r
b) (p ∧ q) r
c) p ( q ∧ r)
d) p ( q ∨ r)
17) Demorgan’s law for ￢( q ∨ r) is :
a) ￢ q ∨ r
b) ￢ q∧￢ r
c) ￢ q∨￢ r
d) r∨ ￢ q
18) Demorgan’s law for ￢( p∧ ￢ r) is :
a) ￢ p ∨ ￢ r
b) ￢ p∨ ￢ r
c) ￢ p ∨ r
d) p ∨ r
19) ￢ (p  q) is logically equivalent to :
a) p ∧ ￢q
b) p ∨ ￢q
c) q  p
d) ￢ p ∨ q
20) ￢(p∨(￢p∧q) is logically equivalent to:
a) p ∧ ￢q
b) ￢ p ∨ q
c) p ∨ ￢ q
d) ￢p ∧ ￢q
21) (p ∧ q)  (p ∨ q) is a:
a) Tautology
b) Contradiction
c) Contingency
d) none of above
22) ￢ x (p(x)) is equivalent to:
a) x ￢ (p(x))
b) x (p(x))
c) x￢ (p(x))
d) ￢x (p(x))
23) ￢x (p(x)) is equivalent to:
a) ￢ x (p(x))
b) x ￢ (p(x))
c) ￢x (p(x))
d) x￢ (p(x))
24) Negation of the statement “ Some birds can not fly” is:
a) Every birds can fly
b) Every birds cannot fly
c) Some birds can fly
d) No birds can fly
25) which logical operator has highest precedence?
a) Negation
 b) Conjunction
c) Disjunction
d) Implication
26) [p∧(p  q)]  q is a tautological expression for the rule:
a) Modus Tollens
b) Modus Ponens
c) Implication
d) Reduction
27) Given ((pq) AND (qr)) concludes:
a) p r, Hypothetical Sylloligm
b) p (q AND r), Reduction
c) q AND (p  r) , Hypothetical Sylloligm
d) (p AND r)  q, Disjunctive Sylloligm
28) which is not a rule for quantified statement:
a) Universal Generalization
b) Existential Instantiation
c) Hypothetical Sylloligm
d) Existential Generalization
29) “if somebody is female and is parent, then this person is someone’s mother” can be logically
expressed as:
a) x[(Female(x) ∧ Parent (x))  y Mother(x,y)]
b) x,y[(Female (x) ∧ Parent (x))  Mother(x,y)]
c) x[(Female (x) ∧ Parent (x))  x Mother(x,y)]
d) x,y[(Female (x) ∧ Parent (x)) Mother(x,y)]
30) “A student in this class has not read the book” can be logically expressed as:
a) x(S(x) ∧ ￢B(x))
b) x(S(x) ∧ ￢B(x))
c) x(S(x)  ￢B(x))
d) x(S(x)  ￢B(x))
31) we want to prove (pq is true) by using contradiction method. The assumption will be:
a) (pq) is is false
b) ￢q is false.
c) (p ￢q) is false.
d) (p∧ ￢q) is false.
32) In Vacuous proof, for (p q) we have to show :
a) p is false
b) q is true
c) ￢p ∧ q is false
d) ￢p ∨ q is true
33) Prove by mathematical induction can be expressed as a rule of inference, the rule can be stated as:
a) [(P(1) ∧ k(P(k))  P(k+1)] n(P(n)
b) [(P(1) ∧ k(P(k))  P(k+1)] n(P(n)

c) [(P(1) ∨ k(P(k))  P(k+1)] n(P(n)

d) [(P(1) ∨ k(P(k))  P(k+1)] n(P(n)
34) Truth Table can be used to show :
 a) Tautotlogy
b) Logical Equivalent
c) Contradiction
d) All of above
35) if there are 5 variables, then number of rows while constructing truth table will be:
a) 30
b) 32
c) 16
d) 36
36) Tautology means:
a) Always true
b) Always false
c) Neither true nor false
d) Both true or false
37) Contradiction means:
a) Always true
b) Always false
c) Neither true nor false
d) Both true or false
38) p<-> q means:
a) (pq) ∧ ( q p)
b) (￢p∨q) ∧ ( q p)
c) (￢p∨q) ∧ (￢q∨p)
d) All of above
39) The truth table of (pq) is false only when:’
a) p is true and q is false
b) p is false and q is true
c) both p and q are false
d) Neither p nor q is false
40) The truth table of (p <-> q) is false only when:
a) Both p and q has same truth value
b) Both p and q has different truth value
c) Both a and b
d) Neither a nor b
41) The negation of the statement “ Every student loves Discrete Mathematics” is:
a) No student loves Discrete Mathematics
b) There is a student who doesnot love Discrete Mathematics
c) Every student do not love Discrete Mathematics
d) There is a student who loves Discrete Mathematics.
42) x, y loves (x,y) is false when
a) There is a pair x,y for which loves (x,y) is false
b) There is an x such that loves(x,y) is false for every y.
c) For every x, there is a y for which loves(x,y) is false
d) loves(x,y) is false for every pair of x,y.
43) Order of nested quatifier doesnot matter if quatifiers are of :
a) same type
b) different types
c) both a and b
d) neither a nor b