Font size
WorksheetsDISCRETE MATHEMATICS
Total questions: 10
Worksheet time: 6mins
p → q is logically equivalent to
∼q → p
∼p → q
∼ p ∧ q
∼p ∨ q
In a finite state machine, m = (Q, Σ, δ, q0, F) transition function δ is a function which maps
Q → Σ xQ
Qx Σ → Q
Q → F
Qx q0 → Σ
Which of the following is not a well formed formula ?
∀x [P(x) → f(X) ∧ x]
∀x1 ∀x2 ∀x3 [(x1 = x2 ∧ x2 = x3) ⟹ x1 = x3]
∼(p → q) → q
[T ∨ P(a,b)] → ∃zQ(z)
The number of distinguishable permutations of the letters in the word BANANA are,
60
20
Which of the following statement is the negation of the statement,
"2 is even and -3 is negative" ?
2 is even and -3 is not negative
2 is odd and -3 is not negative
2 is even or -3 is not negative
2 is odd or -3 is not negative
if A x B = B x A, (where A and B are general matrices) then
A =
A = B'
B = A
A' = B
A partial ordered relation is transitive, reflexive and
(a)
Let N = {1, 2, 3, ..... } be ordered by divisibility, which of the following subset is totally ordered,
(2, 6, 24)
(3, 5, 15)
(2, 9, 16)
(4, 15, 30)
The minimized expression of ABC + A BC + ABC + ABC is
A +
BC
C
C
if f(x) = cos x and g (x) = x3 , then (f,g)(x) is
(cos x)3
cos 3 x
x (cos x)3
cos x3
