Scribd
Upload
19 views4 pages

Exercise Discrete Mathematics

Uploaded by

theotonious.kollol02
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
19 views4 pages

Exercise Discrete Mathematics

Uploaded by

theotonious.kollol02
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/ 4

1.

Choose the right answer among A, B, C, and D and fill the blanks
(1) Which one is equivalent to p → q? ( )

A. ¬ p →¬ q. B. q →p. C. ¬ q → ¬ p. D. ¬ p ∧ q.

(2) Express the statement “There is no one who doesn’t make mistakes.” using
predicates and quantifiers where P(x) represents the statement that x is a person,
and Q(x) represents the statement that x makes mistakes. ( )
A.¬ x (P(x)∧¬ Q(x)) B. x (P(x)→Q(x))
C. x (P(x)∧¬ Q(x)) D. ¬x (P(x)→¬Q(x))
(3) Let A ={{a}} and its power set is P(A), which statement is true? ( )
A. {a}∈ P(A). B. a∈ P(A).
C. {{a}}∈ P(A). D. {{{a}}}∈ P(A).
(4) The relation R={(1,1),(2,2),(3,3),(4,3), (3,4)} on {1,2,3,4} is ( ).
A. reflexive B. symmetric
C. antisymmetric D. transitive
(5) Let A={1,2,3,4}.R={(1,2), (2,1), (1,1), (3,3), (2,2), (4,4) }is equivalence relation,
the equivalence classes of R are ( ).
A. [1], [2], [3], [4] . B. [1,2], [3,4].
C. [1], [2], [4]. D. [1], [3], [4].

(6)Assume that A-B= , which statement must be false?( )

A. A = B. B=
C. A⊂B D. A⊃B
(7) Let f be the function from {a,b,c,d} to {1,2,3} defined by f(a) = 3, f(b) = 2, f(c) = 1,
and f(d) = 3. f is ( )
A. one-to-one B. onto
C. invertible D. not one-to-one and not onto
(8) In how many ways can eight distinct books be divided among three students if Bill
gets four books and Shizuo and Marian each get two books? ( )
A. 420 B. 40320 C. 1680 D. 10080
1/4
(9) Consider the graph below. The number of different paths of length 2 from to

is ( ).

A. 4. B. 3. C. 2. D. 1.
(10) which graph has not Hamilton circuit? ( )

A. B.

D.
C.

2. Fill the answer in the blanks .


(1) Logical expressions(p→r)∨(q→r) and (p∧q) →r are

( equivalent or not equivalent).


(2) Assume that the domain is {1, 2, 3}. The truth value of ∀x ∃y (x+y=4)
is .
(3) Let A and B be sets. If |A|=m, |B|=n, then the number of relations from A to B
is .
(4) A relation on a set is a partial ordering if it has three properties:
.
(5) Suppose that A={1,2,3}. Then the matrix of R={(1,1),(1,2), (2,3),(3,3)} on the set
A is .
(6) Let A={1,2,3,4}, and R={(1,1), (2,1),(3,2),(4,3)} and S={(1,3), (3,4)} are relations
on set A, then R˚S= .
2/4
(7) Suppose that there are piles of red, blue, and green balls and that each pile
contains at least eight balls. The number ways of selecting eight balls
is .
(8) The following graph is (tree/not tree).

(9) The following two graphs are ( isomorphic/not


isomorphic).

(10) The following graph (has or hasn’t) an Euler path.

3. Answer the questions .


(1) Use rules of inference to show that if ∀x(P(x)∨Q(x)), ∀x(¬Q(x)∨S(x)), ∀x(R(x)
→ ¬S(x)), and ∃x¬P(x) are true, then ∃x¬R(x) is true.

(2) Answer these questions for the poset


({{1}, {2}, {4}, {1, 2}, {1, 4}, {3, 4}, {1, 3, 4}, {1,2, 4}}, ⊆).
a) Draw its Hasse diagram.
a) Find the maximal elements, the minimal elements, the greatest element and least
element. Find all upper bounds of {{4}, {3,4}}.

(3) What is the solution of the recurrence relation =6 −9 with initial

3/4
conditions = 1 and = 6?

(4) How many solutions are there to the equation

+ + + + + = 29,

where , i = 1, 2, 3, 4, 5, 6, is a nonnegative integer such that

a) > 1 for i = 1, 2, 3, 4, 5, 6?

b) ≥ 1, ≥ 2, ≥ 3, ≥ 4, > 5, and ≥ 6?

c) ≤ 5?

(5) Use Dijkstra's algorithm to find the shortest path from a to any other vertices.

(6) Use Kruskal’s algorithm to find a minimum spanning tree for the following
weighted graph.

4/4

You might also like