QUE BANK FOR Mathematics III

1. Laplace transform of 1 is:

1
a) b) s c) 0 d) ∞
S

2. If L{f(t)} = F(s), then L{f'(t)} is:

a) sF(s) b) sF(s) - f(0) c) F(s) - f(0) d) sF(s) + f(0)

3. Laplace transform of cos(at) is:

1 a S 1
a) 2 2 b) 2 2 c) 2 2 d) 2 2
s +a s −a s +a s −a

4. Laplace transform of sin(at) is:

1 a S 1
a) 22 b) 22 c) 22 d) 2 2
s +a s +a s +a s −a

5. Laplace transform of 4t 2 is:

1 8
a) b) s 3 c) d) ∞
S S
6. Laplace transform of L[f ( at ) ] is:
1 1 s 8 1
a) f ( )b) f( ) c) 3 d) 2 2
S a a S s −a

t
1. Find the Laplace Transform of: ∫ u . cos u du
2

2. Find the Laplace Transform of the rectified semi-wave unction defined by

π
L{f(t)} if f(t) = { sinω t } 0 < t <
ω
π 2π
0 <t<
ω ω

∞
cos 2 t sin 3 t
1. Find the Laplace Transform of: ∫ e
−2 t
dt
0 t

1−cost
2. Find the Laplace Transform of:
t
 ∞
sinht sint
3. Find the Laplace Transform of: ∫ e
−√2 t
dt
0 t

QUE BANK FOR Discrete mathematics

1. If it rains, then I will stay at home. Symbolic form?

a) p ∨q b) p → q c) p ∧ q d) q → p

2. Truth value of (p ∧ q) when p = T, q = F?

a) F b) Both c) None d) T

3. Which is a contradiction?

a) p ∨ ¬p b) p ∧ ¬p c) p → p d) p ∨ q

4. If P(x): x is even, Domain = {2,4,6}, then ∀x P(x) is

a) True b) False c) Undefined d) None

5. Which is equivalent to p → q ?

a) ¬p ∨ q b) ¬q → ¬p c) Both A and B d) p ∧ q

6. The truth table of biconditional p ↔ q is true when:

a) Both are True b) Both are False c) Both same d) One is True

1. Define propositional logic. Write the truth table for logical connectives (AND, OR, NOT,
IMPLIES, IFF).

2. .Translate the following English statement into a propositional logic expression .Then, prove
its validity using a truth table or rules of inference.
Statement: “If student studies hard, then they pass the exam. If they pass the exam, then
they get a certificate. Therefore, if a student studies hard, then they get a certificate”.
1. Test the validity of the following arguments:
- If it rains, then the ground will be wet.
- It is raining.
- Therefore, the ground is wet.

2. Prove the equivalence: (p ↔ q) ≡ (p → q) ∧ (q → p).

3. Verify using truth table: (p → q) ∧ (q → r) ⇒ (p → r)