100% of possible MCQs covered • Study + Practice + Understand
In circuit analysis, circuits are modeled by differential equations. Their solutions describe the circuit's total response behavior. Solving differential equations directly is hard. The Laplace transformation turns differential equations into algebraic equations, making the solution much easier.
You already know phasor analysis: transform circuit from time domain → frequency (phasor) domain, solve, then transform back. The Laplace transform does the same thing: time domain → s-domain (frequency domain) → solve → inverse Laplace transform back to time domain.
Key facts:
| # | f(t) | F(s) = ℒ{f(t)} | Notes |
|---|---|---|---|
| 1 | δ(t) (unit impulse) | 1 | Most fundamental |
| 2 | 1 (unit step) = u(t) | 1/s | s > 0 |
| 3 | t (unit ramp) | 1/s² | n=1 case of tⁿ |
| 4 | tⁿ (n = 0,1,2,...) | n! / sⁿ⁺¹ | n! = factorial |
| 5 | eat | 1/(s - a) | s > a |
| 6 | tⁿ eat | n! / (s - a)ⁿ⁺¹ | Combination |
| 7 | sin(ωt) | ω / (s² + ω²) | Numerator = ω |
| 8 | cos(ωt) | s / (s² + ω²) | Numerator = s |
| 9 | sinh(ωt) | ω / (s² - ω²) | Hyperbolic |
| 10 | cosh(ωt) | s / (s² - ω²) | Hyperbolic |
| 11 | eat sin(ωt) | ω / ((s - a)² + ω²) | Frequency shift on sin |
| 12 | eat cos(ωt) | (s - a) / ((s - a)² + ω²) | Frequency shift on cos |
Properties let you find transforms without directly using Eq. (15.1) — this is their whole purpose.
| Property | Time Domain | s-Domain | MCQ Focus |
|---|---|---|---|
| Linearity | a f(t) + b g(t) | a F(s) + b G(s) | Superposition works |
| Time Shift | f(t - t₀) u(t - t₀) | e-st₀ F(s) | Delay = multiply by e-st₀ |
| Frequency Shift | eat f(t) | F(s - a) | Multiply by eat = shift s |
| 1st Derivative | f'(t) | sF(s) - f(0) | Most used property! |
| 2nd Derivative | f''(t) | s²F(s) - sf(0) - f'(0) | Pattern continues |
| n-th Derivative | f(n)(t) | sⁿF(s) - sⁿ⁻¹f(0) - ... - f(n-1)(0) | All initial conditions |
| Integration | ∫0t f(τ) dτ | F(s) / s | Division by s |
| Multiplication by t | t f(t) | -dF(s)/ds | Differentiate in s |
| Division by t | f(t) / t | ∫s∞ F(u) du | Integrate in s |
| Time Scaling | f(at) | (1/a) F(s/a) | a > 0 |
| Convolution | f(t) * g(t) | F(s) G(s) | Time convolution = s-multiply |
| Initial Value | f(0+) | lims→∞ s F(s) | Start value |
| Final Value | f(∞) | lims→0 s F(s) | Steady-state value |
Initial Value Theorem: f(0+) = lims→∞ s F(s)
Final Value Theorem: f(∞) = lims→0 s F(s)
A gate function can be written as the difference of two step functions:
This uses the time-shift property of the step function.
To go from F(s) back to f(t), the standard method is:
PFE Cases:
| Example | Topic | What You'd Be Asked |
|---|---|---|
| 1 & 2 | Basic transforms using definition | Apply ∫ f(t)e-st dt directly |
| 3 & 4 | Gate function (Fig. 15.5) | Express as steps, use time-shift property |
| 5 | Initial & final values | Apply lims→∞ and lims→0 |
| 6, 7, 8 | Inverse Laplace transform | Partial fractions + match pairs |