S K Mondal's

15. Numerical Methods

1. The equation x3 – x2 + 4x – 4 = 0 is to be solved using the Newton-Raphson method. If x = 2 is
taken as the initial approximation of the solution, then the next approximation using this
method will be [EC: GATE-2007]
2 4 3
(a) (b) (c) 1 (d)
3 3 2
1.(a)
Newton-Raphson iteration scheme is
f (x n )
x n +1 = x n − ,n = 0,1,2......
f ' ( xn )
Here x 0 = 2,
f (2) 8 2
∴ x1 = 2 − = = .
f '(2) 12 3

2. The recursion relation to solve x = e–x using Newton-Raphson method is [EC: GATE-2008]
(a) X n + 1 = e− xn (b) X n + 1 = X n − e− xn
e− xn X 2n − e− xn (1 + x n ) − 1
(c) X n + 1 = (1 + X n ) (d) X n + 1 =
1 + e − xn x n − e− xn

2. (c)
Newton-Raphson iteration scheme is
f (x n )
x n +1 = x n − ,f (x) = x − e− x .
f ' ( xn )
x n − ex n
= xn −
1 + e− xn

=
( ) (
1 + e− xn x n − x n − e− xn )
− xn
1+e

=
(1 + x n ) e− xn
1 + e− xn
4. We wish to solve x2 – 2 = 0 by Netwon Raphson technique. Let the initial guess b x0 = 1.0
Subsequent estimate of x(i.e.x1) will be: [ME: GATE-1999]
(a) 1.414 (b) 1.5 (c) 2.0 (d) None of the above
4.(b).

Page 164 of 192

S K Mondal's

f ( x0 )
x1 = x0 − , here f ( x) = x 2 − 2
f ′( x0 )
−1
= 1−
2
3
=
2
= 1.5

5. The values of a function f(x) are tabulated below [ME: GATE-2004]

x f(x)
0 1
1 2
2 1
3 10
Using Newton's forward difference formula, the cubic polynomial that can be fitted to the
above data, is
(a) 2x 3 +7x 2 -6x+2 (b) 2x 3 -7x 2 +6x-2
(c) x 3 -7x 2 -6x 2 +1 (d) 2x 3 -7x 2 +6x+1

5. Ans. (d)

x f(x) ∇f (x) ∇2f (x) ∇2f (x)

0 1
1 2 1 2
2 1 -1 10 1
3 10 9 2

Using Newton’s forward interpolation formula we get

x x(x − 1) 2 x(x − 1)(x − 2) 3
f (x) = f (0) + ∇f (0) + ∇ f (0) + ∇ f (0)
1 1.2 1.2.3
x(x − 1) x(x − 1)(x − 2)
= 1 + x(1) + ( −2) + (12), =1+x+(x-x 2 )+2x(x 2 -3x+2)
2 6
=1+x+x-x 2 + 2x 3 − 6x 2 + 4x, =2x 3 − 7x 2 + 6x + 1

6. Starting from X0 = 1, one step of Newton-Raphson method in solving the equation x3 + 3x-7 =
0 gives the next value (x1) as [ME: GATE-2005]
(a) x1= 0.5 (b) x1= 1.406 (c) x1= 1.5 (d) x1 = 2
6. (c)
Newton-Raphson iteration scheme is
f (x n )
x n +1 = x n − ,n = 0,1,2......
f ' ( xn )
Given x 0 = 1
f (1 ) −3 3
∴ x1 = 1 − =1 − = = 1.5
f ' (1 ) 6 2

Page 165 of 192

S K Mondal's

7. The order of error is the Simpson’s rule for numerical integration with a step size h is
[ME: GATE-1997]
(a) h (b) h2 (c) h3 (d) h4
7. Ans. (b)

8. The accuracy of Simpson's rule quadrature for a step size h is [ME: GATE-2003]
(a) O(h2) (b) O(h3) (c) O(h4) (d) O(h2)

8. Ans. (d)

9. With a 1 unit change in b, what is the change in x in the solution of the system of equations x
+ y = 2, 1.01 x + 0.99 y = b? [ME: GATE-2005]
(a) Zero (b) 2 units (c) 50 units (d) 100 units

9.. Ans. (c)

Given x + y = 2 …………….. (i)
1.01 x + 0.99 y = b …………….. (ii)
Multiply 0.99 is equation (i), and subtract from equation (ii), we get
1
(1.01-0.99) x = b -2×0.99 0.02x = b-1.98 ∴ 0.02 Δx=Δb ∴ Δx= = 50 unit
0.02

10. Match the items in columns I and II. [ME: GATE-2006]

Column I Column II
P. Gauss-Seidel method 1. Interpolation
Q. Forward Newton-Gauss method 2. Non-linear differential equations
R. Runge-Kutta method 3. Numerical integration
S. Trapezoidal Rule 4. Linear algebraic equations
(a) P-1, Q-4, R-3, S-2 (b) P-1, Q-4, R-2, S-3
(c) P-1, Q-3, R-2, S-4 (d) P-4, Q-1, R-2, S-3

10. (d)

(P) Gauss – Seidal method Æ Linear algebraic equation

(Q) Forward Newton – Gauss method Æ Interpolation
(R) Runge – Kutta method Æ Non-linear differential equations
(S) Trapezoidal Rule Æ Numerical integration

2π
11. A calculator has accuracy up to 8 digits after decimal place. The value of ∫ sin x dx
0
when

evaluated using this calculator by trapezoidal method with 8 equal intervals, to 5

significant digits is [ME: GATE-2007]
(a) 0.00000 (b) 1.0000 (c) 0.00500 (d) 0.00025

11. Ans. (a)

Page 166 of 192

S K Mondal's

2π − 0 π
h= =
8 4
y 0 = sin(0) = 0
⎛π⎞
y1 = sin ⎜ ⎟ = 0.70710
⎝4⎠
⎛π⎞
y 2 = sin ⎜ ⎟ = 1
⎝2⎠
⎛ 3π ⎞
y 3 = sin ⎜ ⎟ = 0.7010
⎝ 4 ⎠
y 4 = sin ( π ) = 0
⎛ 5π ⎞
y 5 = sin ⎜ ⎟ = −0.70710
⎝ 4 ⎠
⎛ 6π ⎞
y 6 = sin ⎜ ⎟ = −1
⎝ 4 ⎠
⎛ 7π ⎞
y 7 = sin ⎜ ⎟ = −0.70710
⎝ 4 ⎠
⎛ 8π ⎞
y 8 = sin ⎜ ⎟ = 0
⎝ 4 ⎠
Trapezoidal rule
x0 + nh
h
∫ f(x).dx =
2
[(y 0 + yn ) + 2(y1 + y 2 + ... + yn−1 )]
x0
2π
h
∫ sin x.dx = 8
0

[(0 + 0) + 2(0.70710 + 1 + 0.70710 + 0 − 0.70710 − 0.70710)] = 0.00000

13. In the solution of the following set of linear equations by Gauss elimination using partial
pivoting 5x + y + 2z = 34; 4y – 3z = 12; and 10x – 2y + z = –4; the pivots for elimination
of x and y are [CE: GATE – 2009]
(a) 10 and 4 (b) 10 and 2
(c) 5 and 4 (d) 5 and –4

13. Ans.(a)
The equations are
5x + y + 2z = 34
0x + 4y – 3z = 12
and 10x – 2y + z = –4
The augmented matrix for gauss-elimination is
⎡ 5 1 2 34 ⎤
⎢ ⎥
⎢ 0 4 −3 12 ⎥
⎢⎣10 −2 1 −4 ⎥⎦
Since in the first column maximum element in absolute value is 10, we need to
exchange row 1 with row 3.

Page 167 of 192

S K Mondal's

⎡ 5 1 2 34 ⎤ ⎡10 −2 1 −4 ⎤
⎢ ⎥ R(1, 3) ⎢ ⎥
⎢ 0 4 −3 12 ⎥ ⎯⎯⎯⎯ → ⎢ 0 4 −3 12 ⎥
⎢⎣10 −2 1 −4 ⎥⎦ ⎢⎣ 5 1 2 34 ⎥⎦
So the pivot for eliminating x is a11 = 10
Now to eliminate y, we need to compass the eliminate in second column at and below
the diagonal.
Since a22 = 4 is already larger in absolute value compares to a32 = 1
∴ The pivot element for eliminating y is a22 = 4 itself.
∴ The pivots for eliminating x and y are respectively 10 and 4.

CE 10 Years GATE Questions

Q2. The square root of a number N is to be obtained by applying the Newton Raphson
iterations to the equation x2 − N = 0 . If i denotes the iteration index, the correct
iterative scheme will be
1⎛ N⎞ 1⎛ N ⎞
(a) xi +1 = ⎜ xi + ⎟ (b) xi +1 = ⎜ x2i + 2 ⎟
2⎝ xi ⎠ 2⎝ xi⎠
1⎛ N2 ⎞ 1⎛ N⎞
(b) (c) xi +1 = ⎜ xi + ⎟ (d) xi +1 = ⎜ xi − ⎟ [CE-2011]
2⎝ xi ⎠ 2⎝ xi ⎠
Ans. (a)
f ( xi )
Exp. xi +1 = xi − , i = 0,1,2...
f ' ( xi )
x2i − N
= xi − ⎡f ( x ) = x∨ − N ⎤⎦
2xi ⎣
1 ⎡ 2x2i − x2i + N ⎤
= ⎢ ⎥
2⎣ xi ⎦
1 ⎡ x2 i + N ⎤
= ⎢ ⎥
2 ⎣ xi ⎦
1⎡ N⎤
= ⎢ xi + ⎥
2⎣ xi ⎦
Statement for Linked Answer Questions 12 and 13:
1
Give a > 0, we wish to calculate its reciprocal value by using Newton Raphson Method for
a
f(x) = 0.
12. The Newton Raphson algorithm for the function will be [CE: GATE – 2005]
1⎛ a ⎞ ⎛ a ⎞
(a) x k + 1 = ⎜ x k + (b) x k + 1 = ⎜ x k + x 2k ⎟
2⎝ x k ⎟⎠ ⎝ 2 ⎠
a 2
(c) x k + 1 = 2 x k − ax 2k (d) x k + 1 = x k − xk
2
12. (c)

Page 168 of 192

S K Mondal's

1 1
x= ⇒ −a =0
a x
1
Let f (x) = − a
x
Newton Rapshon iteration scheme
f (x n )
x n +1 = x n −
f ' ( xn )
1
−a
x
= xn − n
1
− 2
xn
⎛ 1 ⎞
= xn + xn2 ⎜ − a⎟
⎝ xn ⎠
= 2x n − ax n 2

13. For a = 7 and starting with X0 = 0.2, the first two iterations will be
(a) 0.11, 0.1299 (b) 0.12, 0.1392
(c) 0.12, 0.1416 (d) 0.13, 0.1428

13.(b)
x1 = 2x 0 − ax 0 2
= 2 × 0.2 − 7 × 0.04
= 0.12
x2 = 2x1 − ax12
= 2 × .12 − 7 × 0.0144
= 0.24 − 0.1008
= 0.1392

14. The following equation needs to be numerically solved using the Newton-Raphson method.
x3 + 4x – 9 = 0
The iterative equation for this purpose is (k indicates the iteration level)
[CE: GATE – 2007]
3 2
2 xk + 9 3 xk + 4
(a) x k + 1 = (b) x k + 1 =
3 x 2k + 4 2 x 2k + 9
4 x 2k + 3
(c) x k + 1 = x k − 3 x 2k + 4 (d) x k + 1 =
9 x 2k + 2

14.(a)
Newton –Rapshon iteration scheme is
f ( xn )
x n +1 = x n −
f ' ( xn )
3
x + 4x n − 9
= xn − n

3x 2n + 4

Page 169 of 192

S K Mondal's

2x 3n + 9
=
3x 2n + 4

15. A 2nd degree polynomial, f(x) has values of 1, 4 and 15 at x = 0, 1 and 2, respectively. The
2
integral ∫ f(x) dx
0
is to be estimated by applying the trapezoidal rule to this data. What is

the error (defined as “true value – approximate value”) in the estimate?

4 2
(a) − (b) − [CE: GATE – 2006]
3 3
2
(c) 0 (d)
3

15. (a)
Given
(x) 0 1 2
f(x) 1 4 15
( x − 1)( x − 2 ) f 0 + ( x − 0 )( x − 2 ) f 1 + ( x − 0 )( x − 1) .f 2
∴ f (x) = ( ) () ( )
( 0 − 1)( 0 − 2) (1 − 0 )(1 − 2 ) ( 2 − 0 )( 2 − 1)
x 2 − 3x + 2 x 2 − 2x x2 − x
= .1 + 4+ :15
2 −1 2
= 4x 2 − x + 1
2 b
Error = ∫ f ( x ) dx − ⎣⎡y 0 + y 2 + 2y1 ⎦⎤
0 2
2
1
( )
= ∫ 4x 2 − x + 1 dx − ⎣⎡1 + 15 + 2.4 ⎦⎤
2
0

32
= − 12
3
4
=−
3

16. The table below gives values of a function F(x) obtained for values of x at intervals of 0.25.
x 0 0.25 0.5 0.75 1.0
[CE: GATE – 2010]
F(x) 1 0.9412 0.8 0.64 0.50
The value of the integral of the function between the limits 0 to 1 using Simpson’s rule is
(a) 0.7854 (b) 2.3562
(c) 3.1416 (d) 7.5000

16. (a)
1
h
∫ f ( x ) dx = 3 ⎡⎣( y
0
0 + y 4 ) + 4 ( y1 + y3 ) + 2y 2 ⎤⎦

0.25
= ⎡1 + 0.5 + 4 ( 0.9412 + 0.64 ) + 2 × 0.8 ⎤⎦
3 ⎣

Page 170 of 192

S K Mondal's

= 0.7854

EE All GATE Questions

17. Equation ex-1=0 is required to be solved using Newton’s method with an initial guess x0=-1
Then after one step of Newton’s method, estimate x1 of the solution will be given by
(a) 0.71828 (b) 0.36784 (c) 0.20587 (d) 0.00000
[EE: GATE-2008]
17. (a)
f(x) = ex − 1
Newton iteration scheme
f ( xn )
x n +1 = x n −
f ' ( xn )
xn
e −1
= xn − xn
e
1
−1
ex 0 − 1 e
∴ x1 = x 0 − = − 1. − . = −1 − (1 − e )
ex0 1
e
=e−2
= .71828

18. (a)
Let f (x) = x 2 − 117
Newton iteration scheme is
f ( xn )
x n +1 = x n −
f ' ( xn )
x 2n − 117
= xn −
2x n
x 2n + 117
=
2x n
1⎛ 117 ⎞
= ⎜ xn + ⎟
2⎝ xn ⎠
dx
19. A differential equation = e −2t u ( t ) has to be solved using trapezoidal rule of integration
dt
with a step size h=0.01s. Function u(t) indicates a unit step function. If x(0-)=0, then value
of x at t=0.01s will be given by
[EE: GATE-2008]
(a) 0.00099 (b) 0.00495 (c) 0.0099 (d) 0.0198

19. Ans. (c)

Page 171 of 192

S K Mondal's

dx 1 − x
49. The differential equation = is discretised using Euler’s numerical integration
dt τ
method with a time step ΔT > 0 .What is the maximum permissible value of ΔT to ensure
stability of the solution of the corresponding discrete time equation?
[EE: GATE-2007]
(a) 1 (b) τ / 2 (c) τ (d) 2 τ

49. Ans. (d)

IE All GATE Questions

20. For k = 0, 1, 2, …… the steps of Newton-Raphson method for solving a non-linear equation
is given as [IE: GATE-2006]
2 5 -2
xk + 1 = xk + xk
3 3
Starting from a suitable initial choice as k tends to ∞, the iterate xk tends to
(a) 1.7099 (b) 2.2361
(c) 3.1251 (d) 5.0000

20. (a)
2 5
x k +1 = x k + x k−2
3 3
1 5
= x k − x k + x k−2
3 3
1
⇒ x k +1 − x k = − x k + 5 x k−2
3 3
f ( xk ) 1 x3 − 5
⇒ = x k − 5 x k−2 = k 2
f ' ( xk ) 3 3 3x k
∴ f (x) = x 3 − 5 (by newton-Rapshon medhod)
f (x) = 0
⇒ x3 = 5
⇒ x = 1.7099

21. Identify the Newton-Raphson iteration scheme for finding the square root of 2.
1⎛ 2 ⎞ 1⎛ 2 ⎞
(a) x n + 1 = ⎜ x n + ⎟ (b) x n + 1 = ⎜ x n −
2⎝ xn ⎠ 2⎝ x n ⎟⎠
2
(c) x n + 1 = (d) x n + 1 = 2 + x n [IE: GATE-2007]
xn

21.(a)
x= 2
∴ f (x) = x 2 − 2
N − R scheme is

Page 172 of 192

S K Mondal's

f ( xn )
x n +1 = x n −
f ' ( xn )
x 2n − 2
= xn =
2x n
x 2n + 2
=
2x n
1⎛ 2 ⎞
= ⎜ xn + ⎟
2⎝ xn ⎠

CS All GATE Questions

xn 9
23. Consider the series x n + 1 = + , x 0 = 0.5 obtained from the Newton-Raphson method.
2 8x n
The series converges to [CS: GATE-2007]

(a) 1.5 (b) 2 (c) 1.6 (d) 1.4

23. (a)
xn 9
x n +1 = + ; x 0 = 0.5
2 8x n
The series converges when x n +1 = x n = α
α 9 4α 2 + 9
∴α = + =
2 8α 8α
⇒ 4α 2 = 9
3
⇒ α = = 1.5
2
1⎛ R⎞
24. The Newton-Raphson iteration x n + 1 = ⎜ x n + − ⎟ can be used to compute the
2⎝ xn ⎠
[CS: GATE-2008]
(a) square of R (b) reciprocal of R
(c) square root of R (d) logarithm of R
24.(c)

25. Newton-Raphson method is used to compute a root of the equation x2 – 13 = 0 with 3.5 as
the initial value. The approximation after one iteration is [CS: GATE-2010]
(a) 3.575 (b) 3.677 (c) 3.667 (d) 3.607

25. (d) N-R iteration scheme is

f ( xn )
x n +1 = x n −
f ' ( xn )

Page 173 of 192

S K Mondal's

f ( x0 ) (3.5 )
2
− 13
∴ x1 = x 0 − = 3.5 −
f ' ( x0 ) 2 × 3.5
= 3.607.

26. A piecewise linear function f(x) is plotted using thick solid lines in the figure below (the plot
is drawn to scale). [CS: GATE-2003]

f (x)
1.0 (2.05, 1.0)
a d
(1.55, 0.5)
(0.5, 0.5)

x1 1.3
x0 0.6 1.55 x2 2.05

b c

(0.8, –1.0)
If we use the Newton-Raphson method to find the roots of f(x) = 0 using x0, x1 and x2
respectively as initial guesses, the roots obtained would be
(a) 1.3, 0.6 and 0.6 respectively (b) 0.6, 0.6 and 1.3 respectively
(c) 1.3, 1.3 and 0.6 respectively (d) 1.3, 0.6 and 1.3 respectively

26. Ans. (d)

Starting from x 0 ,
1 − 0.5
slope of line a = = –1
0 − 0.5
y-intercept = 1
Eqn, of a is y = mx + c = –1x + 1
This line will cut x axis (i.e., y = 0), at x = 1
Since x = 1 is > than x = 0.8, a perpendicular at x = 1 will cut the line c and not line b.
∴ root will be 1.3
Starting from x1 ,
the perpendicular at x1 is cutting line b and root will be 0.6.
Starting from x 2 ,
1 − 0.5
Slope of line d = =1
2.05 − 1.55
Equation of d is y – 0.5 = 1(x – 1.55)
i.e. y = x – 1.05
This line will cut x axis at x = 1.05
Since x = 1.05 is > than x = 0.8, the perpendicular at x = 1.05 will cut the line c and not
line b. the root will be therefore equal to 1.3. So starting from x 0 , x1 and x 2 the roots
will be respectively 1.3, 0.6 and 1.3.

∫ xe
x
27. The minimum Number of equal lenth subintervals needed to approximater dx to an
1

Page 174 of 192

S K Mondal's

1
accuracy of at least × 10 −6 using the trapezoidal rule is [CS: GATE-2008]
3
(a) 1000e (b) 1000 (c) 100e (d) 100

27 Ans. (a)
Here, the function being integrated is
f(x) = xex
f(x) = xex + ex = ex (x + 1)
f ′ (x) = xex + ex + ex = ex(x + 2)
Truncation Error for trapezoidal rule
= TE (bound)
h3
= max|f ′′( ξ)|.N i
12
Where Ni is number of subintervals
b−a
Ni =
h
h3 b−a
⇒ TE = max|f ′′( ξ)|.
12 h
h2
= (b − a) max|f ′′( ξ)|1 ≤ ξ ≤ 2
12
h2
= (2 − 1) [e2 (2 + 2)]
12
h2 2 1
= e = × 10 −6
3 3
−6
10
⇒ h2 = 2
e
10−3
⇒ h=
e
b−a
Ni =
h
2 −1
= = 1000 e
⎛ 10−3 ⎞
⎜ ⎟
⎝ e ⎠

Page 175 of 192

S K Mondal's

16. Transform Theory

Previous years GATE Questions

EC All GATE Questions

n
⎛1⎞
1. Let x(n) = ⎜ ⎟ u(n), y(n) = x2(n) and Y(ejw) be the Fourier transform of y(n). Then Y(ej0) is
⎝2⎠
[EC: GATE-2005]
1 4
(a) (b) 2 (c) 4 (d)
4 3

1. Ans. (a)
n
⎛1⎞
x(n) = ⎜ ⎟ u(n)
⎝2⎠
2n
⎛1⎞
∴ y(n) = ⎜ ⎟ u2 (n)
⎝2⎠
n
⎛1⎞
2n
⎛ ⎛ 1 ⎞2 ⎞
y(n) = ⎜ ⎟ u(n) = ⎜ ⎜ ⎟ ⎟ u(n)
⎝2⎠ ⎝⎝ 2 ⎠ ⎠
n
⎛1⎞
∴ y(n) = ⎜ ⎟ u(n)
⎝4⎠
1
∴ y(e10) =
4

•
2. The signal x(t) is described by [EC: GATE-2008]

⎧1 for − ≤ t ≤ + 1
x(:) = ⎨
⎩0 otherwise
Two of the angular frequencies at which its Fourier transform becomes zero are
(a) π , 2π (b) 0.5 π, 1.5 π
(c) 0, π (d) 2π, 2.5 π

2. Ans. (a)
⎡1 −1 < + < 1
Given : x(t) = ⎢
⎣0 otherwise
Fourier transform is
1
1 − i st 1
∫−1 e dt = − i s [e ]−1
− i st

Page 176 of 192

S K Mondal's

1 i st 2
= s
[e − e− i st ] = [sin st]
i s
= 0 for s = π and 2π

3. Consider the function f(t) having Laplace transform

ω
F(s) = 2 0 2 Re[s] > 0
s + ω0
The final value of f(t) would be [EC: GATE-2006]

(a) 0 (b) 1
(c) –1 ≤ f(∞)≤ 1 (d) ∞

3. Ans. (c)
f(t) = L–1 f(x)
= sin w0 t
As –1 ≤ sin θ ≤ 1
Thus, –1 ≤ f(∞) ≤ 1

f(t) 2π
T=
ω0
1
ωt
0
T
–1

t
4. Given that F(s) is the one-sided Laplace transform of f(t), the Laplace transform of ∫ f( τ) d τ
0

is [EC: GATE-2009]
s
1 1
(a) sF(s) – f(0) (b)
2
F(s) (c) ∫ F( τ) d τ
0
(d)
2
[F(s) − f(0)]

4. Ans. (b)
4
1
∫ f( τ) d τ =
0 s
f(s) ……(Lapalace formule)

⎡ 3s + 1 ⎤
5. Given f(t) = L–1 ⎢ 3 ⎥ . If lim f (t ) = 1, then the value of K is [EC: GATE-2010]
⎢⎣ s + 4s + ( K − 3 ) s ⎥⎦
2 t →∞

(a) 1 (b) 2 (c) 3 (d) 4

5. Ans. (d)

Page 177 of 192

S K Mondal's

⎪⎧ 3s + 1 ⎪⎫
f ( t ) = L−1 ⎨ 3 ⎬
⎪⎩ s + 4s + ( K − 3 ) s ⎪⎭
2

F (s ) = L ⎡⎣f ( t ) ⎤⎦

=
( 3s + 1)
s + 4s 2 + ( K − 3 ) s
3

lim f ( t ) = lim SF ( s ) = 1
t →∞ s →0

⇒ lim 2
( 3s + 1) =1
s →0 s + 4s + ( K − 3 ) s

⇒ K −3 = 1 ⇒ K = 4

5 6 5 6
(a) |z|< (b) |z|> (c) <|z|< (d)
6 5 6 5
6
<|z|< ∞
5

6. The region of convergence of Z-transform of the sequence

n n
⎛5⎞ ⎛6⎞
⎜ ⎟ u(n) − ⎜ ⎟ u( − n − 1) must be
⎝6⎠ ⎝5⎠

6. Ans. (c)
n n
⎛5⎞ ⎛6⎞
f(n) = ⎜ ⎟ u(n) − ⎜ ⎟ u( − n − 1)
⎝6⎠ ⎝5⎠
n −n
⎛6⎞ ⎛5⎞
Now, ⎜ ⎟ = ⎜ ⎟
⎝ ⎠
5 ⎝6⎠
n −n
5 ⎛6⎞ 5 ⎛5⎞
∴ ⎜ ⎟ = .⎜ ⎟
6 ⎝5⎠ 6 ⎝6⎠
n −n − 1
⎛6⎞ ⎛5⎞ ⎛5⎞
or ⎜ ⎟ = ⎜ ⎟⎜ ⎟
⎝5⎠ ⎝6⎠ ⎝6⎠
∴ f(n) =
n −n − 1
⎛5⎞ 5 ⎛5⎞
⎜ ⎟ u(n) − ⎜ ⎟ u( − n − 1)
⎝6⎠ 6 ⎝6⎠
∴ F(z) =
−1
⎛ 5 −1 ⎞ 5 ⎛ 5 −1 ⎞ −1
⎜1 − z ⎟ − ⎜1 − z ⎟ .z
⎝ 6 ⎠ 6⎝ 6 ⎠
6 5
Hence, region of convergence, |z|< and |z|< .
5 6
5 6
For two terms <|z|<
6 5
[EC: GATE-2005]

7. Consider the z-transform X(z) = 5z2 + 4z-1 + 3; 0 < |z| < ∝ . The inverse z-transform x[n] is
[EC: GATE-2010]
(a) 5 δ[n + 2] + 3 δ[n] + 4 δ[n – 1] (b) 5 δ[n – 2] + 3 δ[n] + 4 δ[n + 1]

Page 178 of 192

S K Mondal's

(c) 5 u[n + 2] + 3 u[n] + 4 u[n – 1] (d) 5 u[n – 2] + 3 u[n] + 4 u[n + 1]

7. Ans. (a)
x(z) = 5z2 + 4z-1 + 3
0<IZl < ∞
x[n] = 5 δ[n + 2] + 4 δ[n – 1] + 3 δ[n]

ME 20 Years GATE Questions

8. If f(t) is a finite and continuous function for t, the Laplace transformation is given by
∞
F = ∫ e − st f(t) dt. For f(t) = cos h mt, the Laplace transformation is…..[ME: GATE-1994]
0
s
8. Ans. 2
s − m2

w
9. The Laplace transform of cos ωt is . [ME: GATE-1995]
δ + ω2
2

(a) True (b)False

9. Ans. (b)False
w
Laplace transform of cos ωt is .
δ − ω2
2

10. (s+1)-2 is the Laplace transform of [ME: GATE-1998]

(a) t2 (b) t3 (c) e-2t (d) te-t

10. Ans.(d)
1
L(t) =
s2
By first shifting theorem
1
L(e − t .t)=
(s + 2)2

11. Laplace transform of (a + bt)2 where ‘a’ and ‘b’ are constants is given by:
[ME: GATE-1999]
2 2
1 a 2ab 2b a 2ab b2
2
(a) (a+bs)2 (b) (c) + 2 + 3 (d) + 2 + 3
(a+bs)2 s s s s s s
11. Ans.(c)
(a + bt)2 = a2 + b2 t 2 + 2abt.
1 Ln
Laplace transform of 1= Laplace transform of t n =
s sn + 1
a2 2b2 2ab
∴ L (a+bt)2 = + 3 + 2
s s s

Page 179 of 192

S K Mondal's

12. The Laplace transform of the function sin2 2t is [ME: GATE-2000]

(a) (1/2s)-s/[2(s2+16)] (b) s/(s2+16)
(c) (1/s)-s/(s2+4) (d) s/(s2+4)
12. Ans.(a)
1 − cos 4t
sin2 2t=
2
⎧1 − cos 4t ⎫ 1 ⎧ 1 s ⎫ ⎧1 s ⎫
∴ L. ⎨ ⎬= ⎨ − 2 ⎬=⎨ − 2 ⎬
⎩ 2 ⎭ 2 ⎩ s s + 16 ⎭ ⎩ 2s (s + 16) ⎭

13. Laplace transform of the function sin ωt [ME: GATE-2003]

s ω s ω
(a) 2 (b) 2 (c) 2 (d) 2
s +ω 2
s + ω2 s − ω2 s − ω2
13. Ans. (b)
ω
L[sin ωt] = 2
s + ω2

⎧0, for t<a

14. A delayed unit step function is defined as u(t-a)= ⎨ . Its Laplace transform is
⎩1, for t ≥ a
e-es ees eas
(a) a.e-as (b) (c) (d)
s s s
14. Ans. (d)
∞ ∞ ∞ ∞
a
⎡ e − st ⎤ e − as
L[U(t − a)] = ∫ e − st U(t − a)dt, = ∫ e − st .0.dt+ ∫ e −st .1.dt, =0.∫ e −st dt, = ⎢ ⎥ =
0 0 0 a ⎣ −s ⎦ a s

15. If F(s) is the Laplace transform of function f (t), then Laplace transform
t
of ∫ f (τ )dτ is
0
[ME: GATE-2007]

1 1
(a) F(s) (b) F(s) - f(0) (c) sF ( s ) − f (0) (d) ∫ F (s ) ds
s s
15. Ans. (a)
⎡t ⎤ 1
L ⎢ ∫ f(t) dt ⎥ = F(s)
⎢⎣ 0 ⎥⎦ s

1
16. The Inverse Laplace transform of is [ME: GATE-2009]
(S + S )
2

(a) 1 + et (b) 1-et (b) 1- e-t (d) 1 + e-t

16. Ans. (c)

Page 180 of 192

S K Mondal's

⎛ 1 ⎞
L−1 ⎜ 2 ⎟=?
⎝s +s⎠
1 1 1 1
= = −
s + s s(s + 1) s s + 1
2

⎛ 1 ⎞ ⎛ 1⎞ ⎛ 1 ⎞
L−1 ⎜ 2 ⎟ =L−1 ⎜ ⎟ − −L−1 ⎜ ⎟ =1-e− t
⎝ s + s ⎠ ⎝ ⎠
s ⎝ s + 1 ⎠
[Using standard formulae ] Standard formula:
⎛ 1⎞ ⎛ 1 ⎞ ⎛ 1 ⎞
L−1 ⎜ ⎟ = 1 ⇒ L−1 ⎜ ⎟=e
− at
⇒ L−1 ⎜ ⎟=e
at

⎝s⎠ ⎝ s + a ⎠ ⎝ s − a ⎠

1
17. The Laplace transform of a function f(t) is . The function f(t) is
s ( s + 1)
2

(a) t-1+e-t (b) t+1+e-t (c) -1+e-t (d) 2t+et

[ME: GATE-2010]
17. Ans. (a)
1
L[ f (t )] =
S ( S + 1)
2

⎧ 1 ⎫
f (t ) = L−1 ⎨ 2 ⎬
⎩ S ( S + 1) ⎭
⎧ 1 ⎫ −t
L−1 ⎨ ⎬=e
⎩ S + 1⎭
⎧ 1 ⎫ t −t
L−1 ⎨ ⎬ = ∫ e dt = 1 − e
−t

⎩ S ( S + 1) ⎭ 0
⎧ 1 ⎫ t
⎬ = ∫1 − e = t −1 + e
−1 −t −t
L ⎨ 2
⎩ S ( S + 1) ⎭ 0

CE 10 Years GATE Questions

18. If L defines the Laplace Transform of a function, L [sin (at)] will be equal to
a a
(a) 2 (b) 2 [CE: GATE – 2003]
s − a2 s + a2
s s
(c) 2 2
(d) 2
s +a s − a2
18. Ans. (b)
∞

∫e
− st
L [f (t)] = f(t) dt
0
∞

∫e
− st
⇒ L [sin (at)] = sin(at) dt
0

a
=
s2 + a 2

Page 181 of 192

S K Mondal's

19. Laplace transform for the function f(x) = cosh (ax) is [CE: GATE – 2009]
a s
(a) 2 2
(b) 2
s −a s − a2
a s
(c) 2 2
(d) 2
s +a s + a2
19. Ans. (b)
It is a standard result that
s
L (cosh at) = .
s − a2
2

Q3. There are two containers, with one containing 4 Red and 3 Green balls and the other
containing Blue and 4 Green balls. One bal is drawn at random form each container.
The probability that one of the ball is Red and the other is Blue will be
(a) 1/7 (b) 9/49 (c) 12/49 (d) 3/7 [CE-
2011]
Ans. (c)

EE All GATE Questions

Statement for Linked Answer Question (20) and (21)
⎡0 1 ⎤ ⎡ 1⎤
A state variable system X(t)= ⎢ ⎥ X ( t ) + ⎢ ⎥ u ( t ) , with the initial condition X(0)[-1 3]T and
⎣0 −3 ⎦ ⎣0 ⎦
the unit step input u(t) has
20. The state transition equation [EE: GATE-2005]

⎡ 1 ⎤ ⎡ 1 −t ⎤
1 (1 − e −3 t )⎥ 1 (e − e −3 t )⎥
(a) ⎢ 3 (b) ⎢ 3
⎢ ⎥ ⎢ ⎥
⎣⎢0 e −3 t ⎦⎥ ⎣⎢0 e −t ⎦⎥
⎡ ⎤
(c) ⎢ 1
1 −t
3
(e − e −3 t )⎥ ⎡1
(d) ⎢
(1 − e )⎤⎥
−t

⎢ ⎥ ⎢⎣0 e −t ⎥⎦
⎢⎣0 e −3 t ⎥⎦
20. Ans. (a)

Page 182 of 192

S K Mondal's

−1
⎡s 1 ⎤ Adj (sI − A)
( sI − A ) = ⎢
−1
⎥ =
⎣ 0 s + 3⎦ sI − A
⎡ s + 3 0 ⎤ ⎡ s + 3 −1⎤
⎢ −1 s ⎥ ⎢ 0 s ⎥⎦
=⎣ ⎦=⎣ .
⎡s 1 ⎤ s (s + 3)
⎢ 0 s + 3⎥
⎣ ⎦
⎡1 −1 ⎤
⎢s s (s + 3) ⎥
=⎢ ⎥
⎢ 1 ⎥
⎢⎣ 0 s + 3 ⎥⎦
∴ φ ( t ) = L−1 ( sI − A )
−1

⎡ 1 ⎤
⎢ 1 (1 − e −3t ) ⎥
= 3
⎢ ⎥
⎣ 0 e −3 t ⎦

21. The state transition equation [EE: GATE-2005]

⎡t − e − t ⎤ ⎡t − e − t ⎤
(a) X ( t ) = ⎢ − t ⎥ (b) X ( t ) = ⎢ −3t ⎥
⎣ e ⎦ ⎣ 3e ⎦
⎡t − e ⎤
−3 t
⎡t − e −3t ⎤
(c) X ( t ) = ⎢ −3 t ⎥
(d) X ( ) ⎢ −t ⎥
t =
⎣ 3e ⎦ ⎣ e ⎦
21. Ans. (c)
zero state response =L−1φ ( s ) BU ( S )
⎡1 −1 ⎤
⎢ s s(s + 3) ⎥ ⎡ 1⎤ 1
= L−1 ⎢ ⎥⎢ ⎥
⎢ 1 ⎥ ⎣0 ⎦ s
⎢⎣ 0 s + 3 ⎥⎦
⎡1⎤
−1 ⎢ 2 ⎥ ⎡t ⎤
=L s =⎢ ⎥
⎢ ⎥ ⎣0 ⎦
⎢⎣ 0 ⎥⎦
State transition equation
=zero input response+zero state response.
∴ X ( t ) = φ ( X ) X (0) + t
⎡ −1 + 1 − e −3 t ⎤ ⎡ t ⎤ ⎡t − e −3 t ⎤
=⎢ −3 t ⎥
+⎢ ⎥=⎢ −3 t ⎥
⎣ 0 + 3e ⎦ ⎣0 ⎦ ⎣ 3e ⎦

⎛ 1⎞ 1 1
22. Let x(t)= rect ⎜ t − ⎟ (where rect (x) =1 for − ≤ x ≤ and zero otherwise). Then if since
⎝ 2⎠ 2 2
sin(π x )
(x)= , the Fourier Transform of x(t)+x(-t) will be given by [EE: GATE-2008]
πx

⎛ ω ⎞ ⎛ ω ⎞
(a) sinc ⎜ ⎟ (b) 2sinc ⎜ ⎟
⎝ 2π ⎠ ⎝ 2π ⎠

Page 183 of 192

S K Mondal's

⎛ ω ⎞ ⎛ω ⎞ ⎛ ω ⎞ ⎛ω ⎞
(c) 2sinc ⎜ ⎟ cos ⎜ 2 ⎟ (d) sinc ⎜ ⎟ sin ⎜ 2 ⎟
⎝ 2π ⎠ ⎝ ⎠ ⎝ 2π ⎠ ⎝ ⎠

22. Ans. (c)

−1 1
rect ( x ) = 1 for ≤x≤
2 2
⎛ 1⎞
Given x ( t ) = rect ⎜ t − ⎟
⎝ 2⎠
Simpliying x ( t ) with the help of equation (1) .

Page 184 of 192

S K Mondal's
∴ x ( t ) = 1,0 ≤ t ≤ 1
=0, therewise
ω
Now, F ⎡⎣ x ( t ) ⎤⎦ = ∫ω x ( t ) e
− jωt
at
−
1
= ∫ 1.e − jωt at
0

1 1
= (e − jωt )10 = (1 − e − jω )
− jω jω
⎡ jω − jω
⎤
1 ⎢e 2 − e 2 ⎥
=
jω ⎢ jω ⎥
⎣⎢ e ⎦⎥
2

⎡ jω − jω
⎤ − jω
2 ⎢e 2 − e 2 ⎥ .e 2
=
ω⎢ 2j ⎥
⎢⎣ ⎥⎦
ω
sin − jω
∴ F ⎡⎣ x ( t ) ⎤⎦ = 2e 2
ω/2

x ( −t ) = t , −1 ≤ t ≤ 0
= 0, otherwise
∞
F ⎡⎣ x ( t ) ⎤⎦ = ∫ x ( −t )e
− jωt
at
−∞
0
= ∫ 1. e − jωt at
−1

1
( )
0
= e − j ωt
− jω −1

=
1
jω
(
1 − e jω − 1 )
1 ⎡ j2ω − jω
⎤ j2ω
= ⎢ e − e 2
⎥e
jω ⎣ ⎦
⎡ jω − jω
⎤ jω
2 ⎢e 2 − e 2 ⎥e 2
=
ω⎢ 2j ⎥
⎢⎣ ⎥⎦
ω
sin jω
F ⎡⎣ x ( −t ) ⎤⎦ = 2 e2
ω/2
ω
sin
2 ⎡e 2 + e 2 ⎤
− jω jω
∴ F ⎡⎣ x ( t ) + x ( −t ) ⎤⎦ = ⎢ ⎥
ω/2 ⎣ ⎦
ω
sin
= 2 ⎛ 2 cos ω ⎞
ω / 2 ⎜⎝ 2 ⎟⎠
⎛ ω ⎞ ⎛ω ⎞
= 2 sin ⎜ ⎟ cos ⎜ 2 ⎟
⎝ 2π ⎠ ⎝ ⎠

Page 185 of 192

S K Mondal's
23. Let s(t) be the step response of a linear system with zero initial conditions; then
the response of this system to an input u(t) is [EE: GATE-2002]

d ⎡ ⎤
t t
(a) ∫ s(t − τ )u (τ ) dτ
0
(b) ⎢ ∫ s ( t − τ ) u (τ ) dτ ⎥
dt ⎣ 0 ⎦
t
⎡t ⎤ t
(c) ∫ s(t − τ ) ⎢⎣ ∫ u (τ ) dτ ⎥ dτ (d) ∫ s(t − τ ) u (τ ) dτ
2
1 1
0 0 ⎦ 0

23. Ans. (b)

24. Let Y(s) be the Laplace transformation of the function y (t), then final value of the function is
[EE: GATE-2002]
(a) LimY ( s ) (b) LimY ( s )
s →0 s →∞

(c) Lim sY ( s ) (d) Lim sY ( s )

s →0 s →∞

24. Ans. (c)

5
25. Consider the function, F(s) = where F(s) is the Laplace transform of the
s(s + 3s + 2) 2

function f(t).The initial value of f(t) is equal to [EE: GATE-2004]

5 5
(a) 5 (b) (c) (d) 0
2 3
25. Ans. (d)
5
Initial value= Lim F (s ) = Lim 2 =0
S →∞ S →∞ s + 3s + 2

5s 2 + 23s + 6
26. The Laplace transform of a function f(t) is F(s)= . As t → ∞, f(t) approaches
s(s 2 + 2s + 2)
17
(a) 3 (b) 5 (c) (d) ∞ [EE: GATE-2005]
2
5s 2 + 23s + 6
26. Ans. (a) Lt f ( t ) = Lt sF ( s ) = Lt =3
t →∞ t →∞ t →∞ s 2 + 2s + 2

27. If u(t), r(t) denote the unit step an unit ramp functions respectively and u(t)* r(t) their
convolution, then the function u(t+1)* r(t-2) is given by [EE: GATE-2007]
(a) (1/2)(t-1) (t-2)
(b) (1/2)(t-1)(t-2)
(c) (1/2)(t-1)2u(t-1)
(d) None of these
27. Ans. (c)
⎡ 1 s ⎤
L ⎢ u ( t + 1) =
⎣ s
( )
e ⎥
⎦
1 − 2 se
L ⎡⎣ r ( t − 2 ) ⎤⎦ = 2 e
s
⎡1 1 ⎤ ⎡ e −s ⎤
∴ L− 1 ⎢ e s 2 e − 2 s ⎥ = L− 1 ⎢ 3 ⎥
⎣s s ⎦ ⎣s ⎦
1
( t − 1) u ( t − 1)
2
=
2

dy ( t )
28. A function y(t) satisfies the following differential equation + y (t ) = δ (t )
dt

Page 186 of 192

S K Mondal's
Where δ ( t ) is the delta function. Assuming zero initial condition, and denoting the unit
step function by u ( t ) , y ( t ) can be of the form [EE: GATE-2008]
(a) et (b) e-t (c) etu(t) (d) e-tu(t)
28. Ans. (d)
dy ( t )
+ y (t ) = δ t
dt
Taking Laplace transfrom of both sides, we have
sy(s) -y(o)+y(0)=1
⇒ (s + 1)y ( s ) − 0 = 1
1
⇒ y (s ) =
s +1
Taking inverse Laplace transform, we get
y(t)=e-t u ( t )

29. The Laplace transform of g(t) is [EE: GATE-2010]

1 1
(a) (e3 s − e5 s ) (b) (e−5 s − e−3 s )
s s
e −3s 1
(c) (1 − e−2 s ) (d) (e5 s − e3s )
s s
29. Ans. (c)

Common Data for Questions 30 and 31:

Given f(t) and g(t) as shown below:

30. g (t) can be expressed as [EE: GATE-2010]

⎛t ⎞
(a) g (t ) = f (2t − 3) (b) g (t ) = f ⎜ − 3 ⎟
⎝2 ⎠
⎛ 3⎞ ⎛ t 3⎞
(c) g (t ) = f ⎜ 2t − ⎟ (d) g (t ) = f ⎜ − ⎟
⎝ 2⎠ ⎝2 2⎠
30. Ans. (d)

31. The Laplace transform of g(t) is [EE: GATE-2010]

1 1
(a) (e3 s − e5 s ) (b) (e−5 s − e−3 s )
s s
e −3s 1
(c) (1 − e−2 s ) (d) (e5 s − e3s )
s s
31. Ans. (c)

32. If u(t) is the unit step and δ (t) is the unit impulse function, the inverse z-transform of
1
F(z)= for k>0 is [EE: GATE-2005]
z +1

Page 187 of 192

S K Mondal's k
(a) ( −1) δ ( k ) (b) δ ( k ) − ( −1)
k

(c) ( −1) u( k ) (d) u(k ) − ( −1)

k k

32. Ans. (b)

1 z + 1− z
F (z) = =
z +1 z +1
z
=1 - .
z − ( −1)
( )
∴ z −1 ⎡⎣F ( z ) ⎤⎦ = 8 ( t ) − −1n
⎡ −1 ⎛ z ⎞ n⎤
⎢∵ z ⎜ z − a ⎟ = a ⎥
⎣ ⎝ ⎠ ⎦

12. The running integrator, given by [EE: GATE-2006]

y ( t ) ∫ x ( t ' ) dt '
t

−∞

(a) has no finite singularities in its double sided Laplace Transfrom Y(s)
(b) Produces a bounded output for every causal bounded input
(c) Produces a bounded output for every anticausal bounded input
(d) has no finite zeroes in its double sided Laplace Transfrom Y(s)

12. Ans. (b)

27. The state transition matrix for the system X = AX with initial state X(0) is
[EE: GATE-2002]
(a) (sI-A)-1
(b) eA tX(0)
(c) Laplace inverse of [(s I-A)-1]
(d) Laplace inverse of [(sI-A)-1X (0)]

27. Ans. (c)

⎡ 0 1⎤
4. Consider the matrix P = ⎢ ⎥ . The value of e is [EC: GATE-2008]
p
⎣ −2 −3⎦
⎡2 e−2 − 3 e−1 e−1 − e−2 ⎤ ⎡ e−1 + e−2 2 e−2 − e−1 ⎤
(a) ⎢ −2 −1 ⎥ (b) ⎢ −1 ⎥
⎣2 e − 2 e 5 e−2 − e−1 ⎦ ⎣2 e − 4 e
−2
3 e−1 + 2 e−2 ⎦

⎡ 5 e−2 + e−1 3 e−1 − e−2 ⎤ ⎡ 2 e−1 + e−2 e−1 − e−2 ⎤

(c) ⎢ −2 −1 ⎥ (d) ⎢ ⎥
⎣2 e − 6 e 4 e−2 + e−1 ⎦ −1
⎣ −2 e − 2 e
−2
− e−1 + 2 e−2 ⎦

4. Ans. (d) eP = L–1[(sI – P)–1]

⎡ 0 1⎤
and P= ⎢ ⎥
⎣ −2 −3⎦
−1
⎡s 1 ⎤
where (sI – P)–1 = ⎢
⎣ 2 s + 3⎥⎦

Page 188 of 192

S K Mondal's
1 ⎡s + 3 1 ⎤
=
(s + 1) (s + 2) ⎢⎣ −2 s ⎥⎦
⎡ s+3 1 ⎤
⎢ (s + 1) (s + 2) (s + 1) (s + 2) ⎥
= ⎢ ⎥
⎢ −2 s ⎥
⎢ (s + 1) (s + 2) (s + 1) (s + 2) ⎥
⎣ ⎦
⎧⎡ 2 1 1 1 ⎤⎫
⎪⎢ s + 1 − s + 2 −
s + 1 s + 2 ⎥ ⎪⎪
⎪
∴ eP = L−1 ⎨ ⎢ ⎥⎬
⎪ ⎢ −2 + 2 2
−
1 ⎥⎪
⎢ s + 2 s + 1 ⎥⎦ ⎭⎪
⎩⎪ ⎣ s + 1 s + 2

⎡ 2 e−1 + e−2 e −1 − e −2 ⎤
= ⎢ −1 −2 ⎥
⎣ −2 e + 2 e 2 e−2 − e−1 ⎦

Q40. Let the Laplace transform of a function f ( t ) which exists for t > 0 be F1 ( s ) and the
Laplace transform of its delayed version f ( t - τ ) be F2 ( s ) . Let F *1 ( s ) be the complex
F2 ( s ) .F *2 ( s )
conjugate F1 ( s ) with the Laplace variable set as s = σ + jω . If G ( s ) = ,
F1 ( s )
2

then the inverse Laplace transform of G ( s ) is

(a) An ideal impulse δ ( t ) (b) an ideal delayed impulse δ ( t - τ )
(c) An ideal step function u ( t ) (d) an ideal delayed step function u ( t - τ )
[EE-2011]
Ans. (b)

IE All GATE Questions

33. If the Fourier transform of x[n] is X(ejω), then the Fourier transform of (–1)n x[n] is
[IE: GATE-2004]
(a) (–j) ω X(ejω) (b) (–1) ω X(ejω)
d
(c) X(ej(ω – π)) (d) (X(e j ω ))
dω
33. Ans. (c)

34. If the waveform, shown in the following figure, corresponds to the second
derivative of a given function f (t), then the Fourier transform of f (t) is

(a) 1 + sin ω (b) 1 + cos ω

2(1 − cos ω) 2(1 + cos ω)
(c) (d) [IE: GATE-2006]
ω2 ω2

Page 189 of 192

S K Mondal's
2
d f(t)
dt2

t
–1 +1

–2
34. Ans. (c)
d 2 f(t)
= δ (t – 1) + δ (t + 1) – 2δ (t)
dt 2
Taking Laplace transform of both sides, we get
s2 F(s) = e–s + es – 2
⇒ (jω) 2 F (jω) = e–jω + ejω – 2
2(1 − cos ω)
⇒ F (jω) =
ω2

35. The Fourier transform of a function g (t) is given as

ω2 + 21
G(ω) = 2
ω +9
Then the function g (t) is given as [IE: GATE-2006]
(a) δ (t) + 2 exp (–3|t|) (b) cos 3ωt + 21 exp (–3t)
(c) sin 3ωt + 7 cos ωt (d) sin 3ωt + 21 exp (3t)
35. Ans. (a)
g(t) = (t) + 2 exp. (–3|t|)
Taking Laplace transform both sides,
0 ∞
G (ω) = 1+2 ∫
−∞
exp (3 t) exp ( − j ω t) . dt + 2 ∫ exp ( −3 t) . exp ( − j ω t) . dt
0
0 ∞
= 1+2 ∫ exp (3 − j ω) t . dt + 2 ∫ exp ( −3 − j ω) t . dt
−∞ 0

2 2
= 1+ +
3 − jω 3 + jω
ω2 + 21
G (ω) =
ω2 + 9

36. The Fourier transform of x(t) = e–at u(–t), where u(t) is the unit step function,
[IE: GATE-2008]

(a) Exists for any real value of a

(b) Does not exist for any real value of a
(c) Exists if the real value of a is strictly negative
(d) Exists if the real value of a is strictly positive
36. Ans. (d)

Page 190 of 192

S K Mondal's
37. The fundamental period of x(t) = 2 sin πt + 3 sin 3πt, with t expressed in seconds, is
[IE: GATE-2009]
(a) 1 s (b) 0.67 s
(c) 2 s (d) 3s
37. Ans. (d)
H.C.F. of 2π and 3π is 6π.
Then, fundamental frequency = 6π
6π
∴ Period, T = = 3 sec
2π

38. u(t) represents the unit step function. The Laplace transform of u(t – τ) is
[IE: GATE-2010]
1 1
(a) (b)
sτ s–τ
e− s τ
(c) (d) e–s τ
s
38. Ans. (c)
f(t) = u(t – τ)
L{f(t)} = L{u(t – τ)}
e− s τ
F(s) =
s

39. A measurement system with input x(t) and output y(t) is described by the different
dy
equation 3 + 5y = 8x. The static sensitivity of the system is [IE: GATE-2010]
dt
(a) 0.60 (b) 1.60 (c) 1.67 (d) 2.67
39. Ans. (d)
3 dy
+ 5 y = 8x
dt
Taking Laplace transform, we have
3sy(s) + 5y(s) = 8X(s)
y(s) [3s + 5] = 8X(s)
y(s) 8
=
x(s) 3s + 5
For static sensitivity, s → 0
Y(s) 8 1 8
∴ = × = = 1.6
X(s) 3 0+ 5 5
3

⎛ 5π ⎞
j⎜ ⎟n
40. The fundamental period of the discrete-time signal x[n] = e ⎝ 6 ⎠ is
[IE: GATE-2008]
6 12
(a) (b) (c) 6 (d) 12
5π 5
40. Ans. (b)
5π
ω =
6
2π 5π
or =
T 6
12
or T=
5
Page 191 of 192
S K Mondal's
2
41. A plant with a transfer function is controlled by a PI controller with Kp = 1 and Ki
s(s + 3)
≥ 0 in a unity feedback configuration. The lowest value of Ki that ensures zero steady state
error for a step change in the reference input is
[IE: GATE-2009]
1 1
(a) 0 (b) (c) (d) 1
3 2
41. Ans. (b)
⎡ k ⎤⎡ 2 ⎤
G’(s) = ⎢k p + i ⎥ ⎢
⎣ s ⎦ ⎣ s(s + 3) ⎥⎦
sR(s) ⎡ 1⎤
ess = lim
s →0 1 + G ′(s) ⎢⎣ R(s) = s ⎥⎦
1
= lim
s →0 ⎡ ki ⎤ ⎡ 2 ⎤
1 + ⎢k p + ⎥ ⎢
⎣ s ⎦ ⎣ s(s + 3) ⎥⎦
s(s + 3)
= lim
s →0 s(s + 3) (k s + k )2
p i

1
Lowest value of ki = for Gs to be zero.
3

Page 192 of 192