(New page: I think TA's solution #3.b is wrong. I think the graph of x[n-k] is wrong. X-axis should represent n+1, n+2, n+3, ...., n+10. So, the answer should be 0 , n<-10 n+11, -10=<n<-1...)
 
 
Line 7: Line 7:
 
So, the answer should be
 
So, the answer should be
  
0 ,      n<-10
+
<br>y[n]=0 ,      n<-10
n+11,    -10=<n<-1
+
<br>y[n]=n+11,    -10=<n<-1
9-n,    -1=<n=<8
+
<br>y[n]=9-n,    -1=<n=<8
0,      8<n
+
<br>y[n]=0,      8<n
 +
 
 +
<br>TA Comments:  Kim's solution is the right one.  The solutions will be updated.

Latest revision as of 07:27, 10 February 2009

I think TA's solution #3.b is wrong.

I think the graph of x[n-k] is wrong.

X-axis should represent n+1, n+2, n+3, ...., n+10.

So, the answer should be


y[n]=0 , n<-10
y[n]=n+11, -10=<n<-1
y[n]=9-n, -1=<n=<8
y[n]=0, 8<n


TA Comments: Kim's solution is the right one. The solutions will be updated.

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood