Discrete-Time Systems 5.

1. u[ n] + u[ -n] is equal to x[n]

3
(A) 2 (B) 1 + d[ n]
2
(C) 2 + d[ n] (D) 1
1
n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
2. The even part of a function x[ n] = u[ n] - u[ n - 4 ] is
1
(A) {1 + d[ n] - u[ n - 4 ] - u[ -n - 4 ]}
2 y[n]
1
1
(B) { u[ n + 3] - u[ n - 4 ] + d[ n]} -6 -5 -4 -3 -2 -1
n
2 1 2 3 4 5 6
-1
1
(C) { u[ n] + u[ -n] - u[ n - 4 ] - u[ -n - 4 ]}
2 Fig. P5.2.6–11

(D) Above all

6. x[2 n]
3. The energy of signal Ad[ n] is
x[n]
A2
(A) A 2
(B) 3
2
2
A2 (A)
(C) (D) 0 1
4 n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6

4. The energy of signal nu[ n] is

x[n]
n( n + 1) n( n + 1)(2 n + 1)
(A) (B) 3
2 6
2
2 (B)
æ n( n + 1) ö 1
(C) ç ÷ (D) ¥
è 2 ø n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6

5. The power of signal u[ n] is

x[n]
(A) n (B) 1 3
1
(C) (D) ¥ (C)
2
2 1
n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
Statement for Q.6–11:

x[ n] and y[ n] are given in fig. P5.2.6–11 y[n]

(D) 1
respectively. Choose the sketch for the signal given in
n
question. -6 -5 -4 -3 -2 -1 1 2 3 4 5 6

www.nodia.co.in
259 Discrete-Time Systems Chap 5.2

7. y[1 - n] 9. x[ 3n - 1]
y[n]
1 x[n]
(A) 1 2 3 4 5 6
n
9
-6 -5 -4 -3 -2 -1 6
-1
(A)
3
n
y[n] -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
1
(B) 1 2 3 4 5 6
n x[n]
-6 -5 -4 -3 -2 -1
-1 9
6
(B)
y[n] 3
2 n
(C) -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
1
n
x[n]
-6 -5 -4 -3 -2 -1 1 2 3 4 5 6
2
y[n] (C)
1
-6 -5 -4 -3 -2 -1 1 2 3 4 5 6
n n
(D) -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
-1

-2
x[n]
2
8. x[ n - 2 ] + y[ n + 2 ] (D)
1
n
3 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
2

(A) 1
-2
n
-6 -5 -4 -3 -1 1 2 3 4 5 6 10. x[ 3 - n] y[ -n]
-1
x[n]
2
2 (A)
1
(B) 1
2 n
n -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
-6 -5 -4 -3 -2 -1 1 3 4 5 6
-1

x[n]
2
4 (B)
1
3
n
2 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
(C) 1
-6 -5 -4 -3 -2
n
-1 1 2 3 4 5 6 x[n]
-1 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6
n
(C)
-1
-2
4
3

2 x[n]
(D) 1 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6
n
3 4 5 6
(D)
n
-6 -5 -4 -3 -2 -1 1 2 -1
-1
-2

www.nodia.co.in
Chap 5.2 Discrete-Time Systems 260

11. x[ n + 2 ] y[ n - 2 ] æ pn ö æ pn ö æ pn p ö
14. x[ n] = cos ç ÷ - sin ç ÷ + 3 cos ç + ÷
è 2 ø è 8 ø è 4 3ø
x[n]
3 (A) periodic with period 16
2 (B) periodic with period 4
(A)
1
(C) periodic with period 2
n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 (D) Not periodic

x[n] æn ö
j ç - p÷
3 15. x[ n] = 2 e è6 ø

2 (A) periodic with 12p (B) periodic with 12

(B)
1
(C) periodic with 11p (D) Not periodic
n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
16. The sinusoidal signal has fundamental period
N = 10 samples. The smallest angular frequency, for
-6 -5 -4 -3 -2 -1 1 2 3 4 5 6
n which x[ n] is periodic, is
-1 1
(A) rad/cycle (B) 10 rad/cycle
(C) -2 10
-3 p
(C) 5 rad/cycle (D) rad/cycle
5

-6 -5 -4 -3 -2 -1 1 2 3 4 5 6 17. Let x[ n], - 5 £ n £ 3 and h[ n], 2 £ n £ 6 be two

n
finite duration signals. The range of their convolution
-1
(D) is
-2
(A) -7 £ n £ 9 (B) -3 £ n £ 9
-3
(C) 2 £ n £ 3 (D) -5 £ n £ 6

Statement for Q.12–15: Statement for Q.18–26:

A discrete-time signal is given. Determine the x[ n] and h[ n] are given in the question. Compute
period of signal and choose correct option. the convolution y[ n] = x[ n] * h[ n] and choose correct
option.
pn æ pn 1 ö
12. x[ n] = cos + sin ç + ÷
9 è 7 2ø 18. x[ n] = {1, 2, 4}, h[ n] = {1, 1, 1, 1, 1}
(A) periodic with period N = 126 (A) {1, 3, 7, 7, 7, 6, 4}
(B) periodic with period N = 32 (B) {1, 3, 3, 7, 7, 6, 4}
(C) periodic with period N = 252 (C) {1, 2, 4}
(D) Not periodic (D) {1, 3, 7}

19. x[ n] = {1, 2, 3, 4, 5}, h [ n] = {1}

æ nö æ pn ö
13. x[ n] = cos ç ÷ cos ç ÷
è8ø è 8 ø (A) {1, 3, 6, 10, 15} (B) {1, 2, 3, 4, 5}
(C) {1, 4, 9, 16, 20} (D) {1, 4, 6, 8, 10}
(A) Periodic with period 16p
(B) periodic with period 16( p + 1) 20. x[ n] = {1, 2, -1}, h [ n] = x [ n]
(C) periodic with period 8 (A) {1, 4, 1} (B) {1, 4, 2, -4, 1}
(D) Not periodic (C) {1, 2, -1} (D) {2, 4, -2}

www.nodia.co.in
261 Discrete-Time Systems Chap 5.2

21. x[ n] = {1, -2, 3}, h [ n] = {0, 0, 1, 1, 1, 1} (B) {4, -19, 36, -25}
­ ­ ­
(A) {1, -2, 4, 1, 1, 1} (C) {1, 4, -3, 6, 4}
­ ­
(B) {0, 0, 3} (D) {1, 4, -3, 6, 4}
­ ­
(C) {0, 0, 3, 1, 1, 1, 1}
­ ì 1, n = -2, 0, 1
ï
26. x[ n] = í 2, n = -1
(D) {0, 0, 1, -1, 2, 2, 1, 3}
ï0 elsewhere
­ î
h (n) = d[ n ] - d[ n - 1] + d[ n - 4]
22. x[ n] = {0, 0, 1, 1, 1, 1}, h[ n] = {1, -2, 3}
(A) d[ n ] - 2 d[ n - 1 ] + 4 d[ n - 4 ] + d[ n - 5 ]
­ ­
(B) d[ n + 2 ] + d[ n + 1 ] - d[ n ] + 2 d[ n - 3 ] + d[ n - 4 ] + d[ n - 5 ]
(A) {0, 0, 1, -1, 2, 2, 1, 3}
­ (C) d[ n + 2 ] - d[ n + 1 ] + d[ n ] + 2 d[ n - 3 ] - d[ n - 4 ] + 2 d[ n - 5 ]

(B) {0, 0, 1, -1, 2, 2, 1, 3} (D) d[ n ] + 2 d[ n - 1 ] + 4 d[ n - 5 ] + d[ n - 5 ]

­
Statement for Q.27–30:
(C) {1, -2, 3, 1, 1, 2, 1, 1}
­ In question y[ n] is the convolution of two signal.
(D) {1, -2, 3, 1, 1, 1, 1} Choose correct option for y[ n].
­
27. y[ n] = ( -1) n * 2 n u[2 n + 2 ]
23. x[ n] = {1, 1, 0, 1, 1}, h[ n] = {1, -2, - 3, 4} 4 4
­ ­ (A) (B) u[ -n + 2 ]
6 6
(A) {1, -1, - 2, 4, 1, 1} 8 8
­ (C) ( -1) n u[ -n + 2 ] (D) ( -1) n
3 3
(B) {1, -1, - 2, 4, 1, 1}
­ 1
28. y[ n] = u[ n] * u[ n + 2 ]
4n
(C) {1, -1, - 5, 2, 3, -5, 1, 4}
­ æ1 1 ö æ 1 12 ö
(A) ç - n ÷u[ n] (B) ç - n ÷u[ n + 2 ]
è3 4 ø è3 4 ø
(D) {1, -1, - 5, 2, 3, -5, 1, 4}
­ æ 4 1 æ 1 ön ö æ 16 1 ö
(C) ç - ç ÷ ÷u[ n + 2 ] (D) ç - n ÷u[ n + 2 ]
ç 3 12 è 4 ø ÷ è 3 4 ø
è ø
24. x[ n] = {1, 2, 0, 2, 1}, h[ n] = x[ n]
­
29. y[ n] = 3n u[ -n + 3] * u[ n - 2 ]
(A) {1, 4, 4, 4, 10, 4, 4, 4, 1}
­ ì 3n
ïï , n £5 ì 3n , n £5
ï
(B) {1, 4, 4, 4, 10, 4, 4, 4, 1} (A) í 2 (B) í 83
ï 83 , ïî 2 , n³6
­ n³6
ïî 2
(C) {1, 4, 4, 10, 4, 4, 4, 1}
­ ì 3n ì 3n
ïï , n £5 ïï , n £5
(D) {1, 4, 4, 10, 4, 4, 4, 1} (C) í 2 (D) í 6
ï 81 , n³6 ï 81 , n³6
­ ïî 2 ïî 2

25. x[ n] = {1, 4, -3, 6, 4}, h[ n] = {2, -4, 3}

30. y[ n] = u[ n + 3] * u[ n - 3]
­ ­
(A) ( n + 1) u[ n] (B) nu[ n]
(A) {2, 4, -19, 36, -25, 2, 12}
­ (C) ( n - 1) u[ n] (D) u[ n]

www.nodia.co.in
262 Discrete-Time Systems Chap 5.2

31. The convolution of x[ n] = cos ( 2p n) u[ n] and 37. x[ n] as shown in fig. P5.2.37

h[ n] = u[ n - 1] is f [ n]u[ n - 1]. The function f [ n] is
5

ì 1, n = 4 m + 1, 4 m + 2
(A) í +
î 0, n = 4 m, 4 m + 3 x[n] 10 y[n]

ì 0, n = 4 m + 1, 4 m + 2 Fig. P5.2.37
(B) í
î 1, n = 4 m, 4 m + 3
(A) P, Q, R, S (B) Q, R, S
ì 1, n = 4 m + 1, 4 m + 3 (C) P, R, S (D) P, Q, S
(C) í
î 0, n = 4 m, 4 m + 2
38. x[ n] as shown in fig. P5.2.38
ì 0, n = 4 m + 1, 4 m + 3
(D) í
î 1, n = 4 m, 4 m + 2 x[n]
+ y[n]
+

Statement for Q.32–38: Fig. P5.2.38

Let P be linearity, Q be time invariance, R be (A) P, Q, R, S (B) P, Q, R

causality and S be stability. In question discrete time (C) P, Q (D) Q, R, S
input x[ n] and output y[ n] relationship has been given.
In the option properties of system has been given. Statement for Q.39–41:
Choose the option which match the properties for Two discrete time systems S1 and S2 are
system. connected in cascade to form a new system as shown
in fig. P5.2.39–41.
32. y[ n] = rect ( x[ n])
(A) P, Q, R (B) Q, R, S
x[n] S2 S1 y[n]
(C) R, S, P (D) S , P, Q

Fig. P5.2.39–41.
33. y[ n] = nx[ n]
(A) P, Q, R, S (B) Q, R, S 39. Consider the following statements
(C) P, R (D) Q, S (a) If S1 and S2 are linear, the S is linear
n +1 (b) If S1 and S2 are nonlinear, then S is nonlinear
34. y[ n] = å
m = -¥
u[ m ]
(c) If S1 and S2 are causal, then S is causal

(A) P, Q, R, S (B) R, S (d) If S1 and S2 are time invariant, then S is time

invariant
(C) P, Q (D) Q, R
True statements are :
35. y[ n] = x[ n]
(A) a, b, c (B) b, c, d
(A) Q, R, S (B) R, S, P (C) a, c, d (D) All
(C) S, P, Q (D) P, Q, R
40. Consider the following statements
36. x[ n] as shown in fig. P5.2.36 (a) If S1 and S2 are linear and time invariant, then
interchanging their order does not change the system.
x[n] 2 y[n] (b) If S1 and S2 are linear and time varying, then
interchanging their order does not change the system.
Fig. P5.2.36
True statement are
(A) P, Q, R, S (B) Q, R, S (A) Both a and b (B) Only a
(C) P, Q (D) R, S (C) Only b (D) None

www.nodia.co.in
Chap 5.2 Discrete-Time Systems 263

41. Consider the statement (D) Above all

(a) If S1 and S2 are noncausal, the S is non causal
45. The system shown in fig. P5.2.45 is
(b) If S1 and/or S2 are unstable, the S is unstable.
+ y[n]
x[n] 1 D D y[n-2]
True statement are : 4
+
(A) Both a and b (B) Only a 1
+ 4
(C) Only b (D) None +
-1
2
42. The following input output pairs have been
Fig. P5.2.45
observed during the operation of a time invariant
system : (A) Stable and causal

x1 [ n] = {1, 0, 2} S
¬¾ ® y1 [ n] = {0, 1, 2} (B) Stable but not causal

­ ­ (C) Causal but unstable

S
x2 [ n] = {0, 0, 3} ¬¾® y2 [ n] = {0, 1, 0, 2} (D) unstable and not causal
­ ­
S 46. The impulse response of a LTI system is given as
x3[ n] = {0, 0, 0, 1} ¬¾® y3[ n] = {1, 2, 1}
n
­ ­ æ 1ö
h[ n] = ç - ÷ u[ n].
è 2ø
The conclusion regarding the linearity of the
system is The step response is
n +1 n
(A) System is linear 1 æç æ 1ö ö
÷u[ n] 1 æç æ 1ö ö
÷u[ n]
(A) 2 -ç- ÷ (B) 2 -ç- ÷
3è ç è 2ø ÷ 3è ç è 2ø ÷
(B) System is not linear ø ø
n +1 n
(C) One more observation is required. 1 æç æ 1ö ö
÷u[ n] 1 æç æ 1ö ö
÷u[ n]
(C) 2 + ç- ÷ (D) 2 + ç- ÷
(D) Conclusion cannot be drawn from observation. 3 çè è 2ø ÷
ø 3 çè è 2ø ÷
ø

43. The following input output pair have been 47. The difference equation representation for a
observed during the operation of a linear system: system is
S
x1 [ n] = { -1, 2, 1} ¬¾ ® y1 [ n] = {1, 2, - 1, 0, 1} 1
y[ n] - y[ n - 1] = 2 x[ n], y [ -1] = 3
­ ­ 2
S
x2 [ n] = {1, - 1, - 1} ¬¾ ® y2 [ n] = { - 1, 1, 0, 2}
The natural response of system is
­ ­ n n
3æ 1ö 2æ 1ö
x3[ n] = {0, 1, 1} ¬¾®S
y3[ n] = {1, 2, 1} (A) ç - ÷ u[ n] (B) ç - ÷ u[ n]
2è 2ø 3è 2 ø
­ ­ n n
3æ 1ö 2æ1ö
(C) ç ÷ u[ n] (D) ç ÷ u[ n]
The conclusion regarding the time invariance of 2 è2 ø 3è2 ø
the system is
(A) System is time-invariant 48. The difference equation representation for a

(B) System is time variant system is

(C) One more observation is required y[ n] - 2 y[ n - 1] + y[ n - 2 ] = x[ n] - x[ n - 1]

(D) Conclusion cannot be drawn from observation If y[ n] = 0 for n < 0 and x[ n] = d[ n], then y[2 ]
will be
44. The stable system is
(A) 2 (B) -2
(A) y[ n] = x[ n] + 11
. y[ n - 1]
(C) -1 (D) 0
1
(B) y[ n] = x[ n] - ( y[ n - 1] + y[ n - 2 ])
2 49. Consider a discrete-time system S whose response
(C) y[ n] = x[ n] - (15
. y[ n - 1] + 0.4 y[ n - 2 ]) to a complex exponential input e jpn 2
is specified as

www.nodia.co.in
Chap 5.2 Discrete-Time Systems 264

S : e jpn 2
Þ e jp3n 2

The system is
Solutions
(A) definitely LTI
(B) definitely not LTI
1. (B)
(C) may be LTI
u[n]
(D) information is not sufficient. 1
n
50. Consider the two system -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
u[-n]
ì x[ n + 1], n ³0 1
S1 : y[ n] = í
î x[ n], n £ -1 n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
ì énù u[n] + u[-n]
ï x , n even
S2 : y[ n] = í êë 2 úû
2

ï 0, n odd
1
î
n
-6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
The invertible system is
Fig. S5.2.1
(A) S1 (B) S2
(C) Both S1 and S2 (D) None of the above 2. (D) All describe the even part of x

¥ ¥
Statement for Q.51–52: 3. (A) E = å | Ad[ n]| = A 2 å (1) = A 2
2

-¥ 0
Consider the cascade of the following two system
S1 and S2 , as shown in fig. P5.2.51–52 ¥ ¥
4. (D) E = å |nu[ n]| = å n2 = ¥
2

-¥ 0
v[n]
x[n] S2 S1 y[n]
1 n=N
N +1 1
å (u[ n])
2
Fig. P5.2.51–52 5. (C) P = Lim = =
N ®¥ 2N + 1 n =- N 2N + 1 2
1
S1 : Causal LTI v[ n] = v[ n - 1] + x[ n] 6. (B) Let v[ n] = x[2 n], v[0 ] = x[0 ] = 0
2
v[1] = x[2 ] = 1, v[2 ] = x[ 4 ] = 0
S2 : Causal LTI y[ n] = ay[ n - 1] + bv[ n]
v[ -1] = x[ -2 ] = 1, v[ -2 ] = x[ -4 ] = 0
The difference equation for cascaded system is
So x[ n] = {3, 2, 1, 0, 1, 2, 3}
1 3 ­
y[ n] = - y[ n - 2 ] + y[ n - 1] + x[ n]
8 4 x[2 n] = {2, 0, 2}
­
51. The value of a is
1 7. (A) y[ n] = {-1, -1, -1, -1, 0, 1, 1, 1, 1}
(A) (B) 1 ­
4
y[ n + 1] = {-1, -1, -1, -1, 0, 1, 1, 1, 1}
(C) 4 (D) 2 ­
y[ -n + 1] = {1, 1, 1, 1, 0, -1, -1, -1, -1}
52. The value of b is ­
1
(A) (B) 1
4 8. (C) x[ n - 2 ] = {3, 2, 1, 0, 1, 2, 3}
(C) 4 (D) 2 ­
y[ n + 2 ] = {-1, -1, -1, -1, 0, 1, 1, 1, 1}
­
**********
x[ n - 2 ] + y[ n + 2 ]
= { -1, -1, -1, -1, 0, 4, 3, 2, 1, 1, 2, 3}
­

www.nodia.co.in
265 Discrete-Time Systems Chap 5.2

9. (C) x[ n - 1] = {3, 2, 1, 0, 1, 2, 3} 19. (C) y[ n] = {1, 2, 3, 4, 5}

­ 1 2 3 4 5
x[ 3n - 1] = {1, 2} 1 1 2 3 4 5
­
Fig. S5.2.19
10. (D) x[ 3 - n] = {3, 2, 1, 0, 1, 2, 3}
­ 20. (B) y[ n] = {1, 4, 2, –4, 1}
y[ -n] = {1, 1, 1, 1, 0, -1, -1, -1, -1} 1 2 -1
­
1 1 1 -1
x[ 3 - n] y[ -n] = {0, -2, - 1, 0, -1}
­ 2 2 4 -2

11. (D) x[ n + 2 ] = {3, 2, 1, 0, 7, 2, 3} 3 -1 -2 -1

­
Fig. S5.2.20
y[ n - 2 ] = {-1, - 1, - 1, - 1, 0, 1, 1, 1, 1}
­
21. (D)
x[ n + 2 ] y[ n - 2 ] = {0, -1, - 2, - 3, 0 .....}
­ 0 0 1 1 1 1

1 0 0 1 1 1 1
12. (A) Both signal are periodic,
N1 = 18 , N 2 = 14, -2 0 0 -2 -2 -2 -2

N = LCM(18, 14) =126

3 0 0 3 3 3 3

æNö Fig. S5.2.21

13. (D) cos ç ÷ is not periodic. So x[ n] is not periodic.
è 8 ø y[ n] = {0, 0, 1, -1, 2, 2, 1, 3}
­
14. (A) N1 = 4, N 2 = 16, N 3 = 8,
N = LCM(4, 16, 8) =16 22. (A)

2p 1 p 0 0 1 1 1 1
15. (D) = Þ N = , Not periodic.
N 6 3 1 0 0 1 1 1 1

2pm -2 0 0 -2 -2 -2 -2
16. (D) W = The smallest value of W is attained
N
3 0 0 3 3 3 3
2p p
with m = 1, W = = rad/cycle.
10 5 Fig S5.2.22

y[ n] = {0, 0, 1, -1, 2, 2, 1, 3}
17. (B) L1 = N1 + M1 , L2 = N 2 + M 2 ­
N1 = -5, N 2 = 3, M1 = 2, M2 = 6
23. (D)
18. (A)
1 1 0 1 1
1 1 1 1 1
1 1 1 0 1 1
1 1 1 1 1 1
-2 -2 -2 0 -2 -2
2 2 2 2 2 2
-3 -3 -3 0 -3 -3
4 4 4 4 4 4
4 4 4 0 4 4
Fig. S5.2.18
Fig. S5.2.23
y[ n] = {1, 3, 7, 7, 7, 6, 4} y[ n] = {1, -1, - 5, 2, 3, -5, 1, 4}
­

www.nodia.co.in
Chap 5.2 Discrete-Time Systems 266

24. (B) y[ n] = {1, 4, 4, 10, 4, 4, 4, 1} 28. (C) For n + 2 < 0 or n < - 2, y [ n] = 0

­ n+2
1 4 1 1
for n + 2 ³ 0 or n ³ - 2, y[ n] = å4k
k=0
= -
3 12 4 n
,

1 2 0 2 1 æ 4 1 æ 1 ön ö
Þ y[ n] = ç - ç ÷ ÷u[ n + 2 ]
ç 3 12 è 4 ø ÷
1 1 2 0 2 1
è ø
2 2 4 0 4 2
n -2
3n
0 0 0 0 0 0
29. (D) For n - 2 £ 3 or n £ 5 , y[ n] = å3
k=¥
k
=
6
3
81
2 2 4 0 4 2
for n - 2 ³ 4 or n ³ 6, y[ n] = å3
k = -¥
k
=
2
,

ì 3n
1 1 2 0 2 1
ïï , n £5
Fig. S5.2.24 Þ y[ n] = í 6
ï 81 , n³6
ïî 2
25. (A) y[ n] = {2, 4, -19, 36, -25, 2, 12}
­
30. (A) For n - 3 < - 3 or n < 0, y[ n] = 0
n -3

1 4 -3 6 4 for n - 3 ³ - 3 or n > 0, y[ n] = å 1 = n + 1,
k = -3
2 2 8 -6 12 8
y[ n] = ( n + 1) u[ n]
-4 -4 -16 12 -24 -16
31. (A) For n - 1 < 0 or n <1 , y[ n] = 0
3 3 12 -9 18 12 n -1
æp ö
For n -1 ³ 0 or n ³ 1, y[ n] = å cos ç k ÷
Fig. S5.2.25 k=0 è2 ø
ì 1, n = 4 m + 1, 4 m + 2
Þ y[ n] = í
26. (B) x[ n] = {1, 2, 1, 1}, h[ n] = {1, -1, 0, 0, 1} n = 4 m, 4 m + 3
î 0,
­ ­

32. (B) y1 [ n] = rect ( v[ n]) , y2 [ n] = rect ( kv[ n])

1 2 1 1
y2 [ n] ¹ k y1 [ n] (Not Homogeneous not linear)
1 1 2 1 -1
y1 [ n] = rect ( v[ n]), y2 [ n] = rect ( v[ n - no ])
-1 -1 -2 -1 -1 y1 [ n - no ] = rect ( v[ n - no ]) = y2 [ n] (Time Invariant)
At any discrete time n = no , the response depends only
0 0 0 0 0
on the excitation at that discrete time. (Causal)
0 0 0 0 0 No matter what values the excitation may have the
response can only have the values zero or one.
1 1 2 1 1
(Stable)
Fig. S5.2.26
33. (C) y1 [ n] = nv[ n] , y2 [ n] = nkv[ n]
y[ n] = {1, 1, -1, 0, 0, 2, 1, 1}
­ ky1 [ n] = y2 [ n] (Homogeneous)
y[ n ] = d[ n + 2 ] + d[ n + 1 ] - d[ n ] + 2 d[ n - 3 ] + d[ n - 4 ] + d[ n - 5 ] Let x1 [ n] = v[ n] then y1 [ n] = nv[ n]
Let x2 [ n] = w[ n] then y2 [ n] = nw[ n]
¥ ¥ k
æ 1ö Let x3[ n] = v[ n] + w[ n]
27. (D) y[ n] = å ( -1) k
2n -k = 2n å ç- ÷
k=n -2 k=n -2 è 2ø Then y3[ n] = n( v[ n] + w[ n]) = nv[ n] + nw[ n]
n -2
= y1 [ n] + y2 [ n] (Additive)
æ 1ö
n
2 ç- ÷ Since the system is homogeneous and additive, it is
= è 2ø =
8
( -1) n
1 also linear.
1+ 3
2 y1 [ n - no ] = ( n - no) v[ n - no ] ¹ yn [ n] = nv[ n - no ]

www.nodia.co.in
267 Discrete-Time Systems Chap 5.2

(Time variant) At any discrete time, n = no , the response depends

At any discrete time, n = no the response depends only only on the excitation at that time. (Causal)
on the excitation at that same time. (Causal) If the excitation is bounded, the response is bounded.
If the excitation is a constant, the response is (Stable).
unbounded as n approaches infinity. (Unstable)
37. (B) y1 [ n] = 10 v[ n] - 5, y2 [ n] = 10 kv[ n] - 5
n +1 n +1
y2 [ n] ¹ ky1 [ n]
34. (C) y1 [ n] = å v[ m ] , y2 [ n ] = å kv[ m ] (Not Homogeneous so not linear)
m = -¥ m = -¥
y1 [ n] = 10 v[ n] - 5, y2 [ n] = 10 v[ n - no ] - 5
y2 [ n] = ky1 [ n] (Homogeneous) y1 [ n - no ] = 10 v[ n - no ] - 5, = y2 [ n] (Time Invariant)
n +1 n +1
y1 [ n] = å
n = -¥
v[ m ], y2 [ n ] = å w[ m ]
n = -¥
At any discrete time, n = no the response depends only
on the excitation at that discrete time and not on any
n +1
y3[ n] = å ( v[ n] + w[ m ])
m = -¥
future excitation. (Causal)
If the excitation is bounded, the response is bounded.
n +1 n +1
= å v[ m ] + å w[ n] = y [ n] + y [ n]
m = -¥ m = -¥
1 2 (Additive) (Stable).

Since the system is homogeneous and additive it is 38. (B) y[ n] = x[ n] + y[ n - 1],

also linear y[ n - 1] = x[ n - 1] + y[ n - 2 ]
n +1 n +1
y1 [ n] = å v[ n] ,
m = -¥
y2 [ n ] = å v[ m - n ]
m = -¥
o
y[ n] = x[ n] + x[ n - 1] + y[ n - 2 ], Then by induction
¥
n -no +1 n +1 y[ n] = x[ n - 1] + x[ n - 2 ] + K x[ n - k] + K = å x[ n - k]
y1 [ n - no ] = å v[ m ]
m = -¥
= å v[ q - n ] = y [ n]
q = -¥
o 2
-¥ n
k=0

Let m = n - k then y[ n] = å x[ m ] = å x[ m ]
(Time Invariant) m =n m = -¥
n n
At any discrete time, n = no , the response depends on y1 [ n] = å v[ m ] ,
m = -¥
y2 [ n ] = å kv[ m ] = ky [ n]
m = -¥
1
the excitation at the next discrete time in future.
(Anti causal) (Homogeneous)
n ¥ n
If the excitation is a constant, the response increases y3[ n] = å (v[ m ] + w[ m ]) = å v[ m ] + å w[ m ]
m = -¥ m = -¥ m = -¥
without bound. (Unstable)
= y1 [ n] + y2 [ n] (Additive)
35. (A) y1 [ n] = v[ n] , y2 = kv[ n] = k v[ n] System is Linear.
¥ n

ky1 [ n] = k v[ n] ¹ y2 [ n] (Not Homogeneous Not linear) y1 [ n] = å v[ m ]

m = -¥
, y2 = å v[ n - n ]
m = -¥
o

y1 [ n] = v[ n] , y2 [ n] = v[ n - no ] y1 [ n] can be written as
n -no n
y1 [ n - no ] = v[ n - no ] = y2 [ n] (Time Invariant)
y1 [ n - no ] = å v[ m ] = å v[ q - n ] = y [ n]
m = -¥ q = -¥
o 2

At any discrete time n = no , the response depends only

on the excitation at that time (Causal) (Time Invariant)

If the excitation is bounded, the response is bounded. At any discrete time n = no the response depends only
on the excitation at that discrete time and previous
(Stable).
discrete time. (Causal)
36. (B) y[ n] = 2 x 2 [ n] If the excitation is constant, the response increase
without bound. (Unstable)
Let x1 [ n] = v[ n] then y1 [ n] = 2 v 2 [ n]
Let x2 [ n] = kv[ n] then y2 [ n] = 2 k2 v 2 [ n]
39. (C) Only statement (b) is false. For example
ky[ n] ¹ y2 [ n] (Not homogeneous Not linear) S1 : y[ n] = x[ n] + b ,
Let x1 [ n] = v[ n] then y1 [ n] = 2 v 2 [ n] S2 : y[ n] = x[ n] - b , where b ¹ 0
Let x2 [ n] = v[ n - no ] then y2 [ n] = 2 v 2 [ n - no ] S{x[ n]} = S2 {S1 {x[ n]}} = S2 {x[ n] + b} = x[ n]
y1 [ n - no ] = 2 v[ n - no ] = y2 [ n] (Time invariant) Hence S is linear.

www.nodia.co.in
Chap 5.2 Discrete-Time Systems 268

40. (B) For example 46. (A) For n < 0 = s[ n] = 0

S1 : y[ n] = nx[ n] n k
1 æç
n
ö
å æç - 2 ö÷ æ 1ö
1 ÷
For n ³ 0, s[ n] = = 2 + ç- ÷
S2 : y[ n] = nx[ n + 1] k=0 è ø 3 çè è 2ø ÷
ø
If x[ n] = d[ n] then S2 {S1 {d[ n]}} = S2 [0 ] = 0,
S1 {S2 {d[ n]}} = S1 {d[ n + 1]} = -d [ n + 1] ¹ 0 1
47. (C) Characteristic equation r - =0
2
41. (D) S1 : y[ n] = x[ n + 1] non causal æ1ö
n
æ1ö
-1
3
y ( n ) [ n] = Cç ÷ , y[ -1] = 3 = Cç ÷ , C= ,
S2 : y[ n] = x[ n - 2 ] causal è2 ø è2 ø 2
n
S : y[ n] = x[ n - 1] which is causal (false) 3æ 1ö
Þ y ( n ) [ n] = ç ÷ u[ n]
S1 : y[ n] = e x [ n ] stable, 2 è2 ø
S2 : y[ n] = ln ( x[ n]) unstable
But S : y[ n] = x[ n] stable (false) 48. (D) For n = 0, y[0 ] = x[0 ] - x[ -1]
For n = 1, y[1] = 2 y[0 ] + x[1] - x[0 ]
42. (B) System is not linear. This is evident from Þ y[1] = x[0 ] + x[1] - 2 x[ -1]
observation of the pairs For n = 2, y[2 ] = 2 y[1] - y[0 ] + x[2 ] - x[1]
x3[ n] Û y3[ n] and x2 [ n] Û y2 [ n ] y[2 ] = x[0 ] + x[1] + x[2 ] - 3 x[ -1]
If the system were linear y2 [ n] would be of the form y[2 ] = d[0 ] + d[1] + d[2 ] - 3d[ -1] = 0
y2 [ n] = {3, 6, 3}
­ 49. (B) The input e jpn 2
must produce the output in the
jpn 2
form Ae . The output in this case is e j 3pn 2
. This
43. (B) Since system is linear x1 [ n] + x2 [ n] = d[ n].
violates the Eigen function property of LTI system.
The impulse response of the system is Therefore, S is definitely not LTI system.
y1 [ n] + y2 [ n] = {0, 3, –1, 2, 1}
If the system were time invariant, the response to 50. (B) S2 is Invertible System y[ n] = x[2 n] , S1 is not
x3[ n] would be x3[ n] * ( y1 [ n] + y2 [ n]) = {3, 2, 1, 3, 1} invertible because d[ n] , 2 d[ n] etc. result in y[ n] = 0.
­
But this is not the case. 51. (A) y[ n] = ay[ n + 1] + bv[ n],
1 a
44. (B) For (A) a = -11
. greater than 1 so unstable. v[ n] = y[ n] - y[ n - 1],
b b
For (B) a12 = -0.25 ± j0.66. Its magnitude are less than 1 a
v[ n - 1] = y[ n - 1] - y[ n - 2 ]
one so stable. b b
1
For (C) a12 = -1153
. , - 0.3469 Weighting the previous equation by and subtracting
2
One magnitude is greater than one so unstable.
from the one before
1 1 a 1 a
45. (A) The difference equation is v[ n] - v[ n - 1 ] = y[ n] - y[ n - 1 ] - y[ n - 1 ] + y[ n - 2]
2 b b 2b 2b
1 1 1
y[ n] = x[ n] + y[ n - 1] - y[ n - 2 ] 1 æa 1 ö a
4 4 2 x[ n] = y[ n] - ç + ÷ y[ n - 1] = y[ n - 2 ]
b è b 2b ø 2b
4 y [ n] - y [ n - 1] + 2 y [ n - 2 ] = x [ n]
æ 1ö a
Eigen values are y[ n] = ç a + ÷ y[ n - 1] - y[ n - 2 ] + bx[ n]
è 2ø 2
4 a 2 - a + 2 = 0, a12 = 0.125 ± j0.696
1
Its magnitude are less than 1. Thus system is stable. Comparing a = , b = 1
4
1
y[ n] = ( x[ n] + y[ n - 1] + 2 y [ n - 2 ])
4 52. 52. (B) b = 1.
Response at time, n, depends on the excitation at time
n and the responses at previous time. It does not
depend on any future values of the excitation. **********

www.nodia.co.in