ECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.

Similar documents
ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Fall 2017 Exam #1

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1

ECE 301 Fall 2011 Division 1 Homework 5 Solutions

NAME: 13 February 2013 EE301 Signals and Systems Exam 1 Cover Sheet

NAME: 20 February 2014 EE301 Signals and Systems Exam 1 Cover Sheet

LTI Systems (Continuous & Discrete) - Basics

ECE301 Fall, 2006 Exam 1 Soluation October 7, Name: Score: / Consider the system described by the differential equation

CH.3 Continuous-Time Linear Time-Invariant System

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

EE 210. Signals and Systems Solutions of homework 2

Ch 2: Linear Time-Invariant System

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

EECE 3620: Linear Time-Invariant Systems: Chapter 2

ECE 301 Fall 2011 Division 1. Homework 1 Solutions.

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

MAE143 A - Signals and Systems - Winter 11 Midterm, February 2nd

ECE-314 Fall 2012 Review Questions for Midterm Examination II

1.4 Unit Step & Unit Impulse Functions

Classification of Discrete-Time Systems. System Properties. Terminology: Implication. Terminology: Equivalence

University Question Paper Solution

Chapter 3 Convolution Representation

2 Classification of Continuous-Time Systems

Properties of LTI Systems

Math 2114 Common Final Exam May 13, 2015 Form A

Lecture 2. Introduction to Systems (Lathi )

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

Grades will be determined by the correctness of your answers (explanations are not required).

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

Solutions of Chapter 3 Part 1/2

Grades will be determined by the correctness of your answers (explanations are not required).

EE 224 Signals and Systems I Review 1/10

Interconnection of LTI Systems

1.17 : Consider a continuous-time system with input x(t) and output y(t) related by y(t) = x( sin(t)).

信號與系統 Signals and Systems

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

ELEG 305: Digital Signal Processing

Problem Value Score No/Wrong Rec 3

Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.

Problem Value

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

MA162 EXAM III SPRING 2017 APRIL 11, 2017 TEST NUMBER 01 INSTRUCTIONS:

Chapter 3. Discrete-Time Systems

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

Problem Value

Each problem is worth 25 points, and you may solve the problems in any order.

ECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3

ELEN 4810 Midterm Exam

Lecture 2 Discrete-Time LTI Systems: Introduction

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

III. Time Domain Analysis of systems

Module 4 : Laplace and Z Transform Problem Set 4


Chapter 2 Time-Domain Representations of LTI Systems

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Aspects of Continuous- and Discrete-Time Signals and Systems

L2 gains and system approximation quality 1

5. Time-Domain Analysis of Discrete-Time Signals and Systems

I have read and understood the instructions regarding academic dishonesty:

2. Time-Domain Analysis of Continuous- Time Signals and Systems

Chapter 1 Fundamental Concepts

Problem Value

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

Module 4. Related web links and videos. 1. FT and ZT

MATH 251 Examination II April 4, 2016 FORM A. Name: Student Number: Section:

EE361: Signals and System II

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY

Q1 Q2 Q3 Q4 Q5 Total

Digital Signal Processing Lecture 3 - Discrete-Time Systems

EC Signals and Systems

6.003 (Fall 2011) Quiz #3 November 16, 2011

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

EE Homework 5 - Solutions

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

The Convolution Sum for Discrete-Time LTI Systems

Quiz. Good luck! Signals & Systems ( ) Number of Problems: 19. Number of Points: 19. Permitted aids:

Chapter 1 Fundamental Concepts

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

EEL3135: Homework #4

信號與系統 Signals and Systems

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Laplace Transforms and use in Automatic Control

Physics I Exam 1 Spring 2015 (version A)

Analog vs. discrete signals

Homework 5 Solutions

Lecture 1: Introduction Introduction

EE123 Digital Signal Processing

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

MTH 133 Final Exam Dec 8, 2014

Transcription:

ECE 301 Division 1 Exam 1 Solutions, 10/6/011, 8-9:45pm in ME 1061. Your ID will be checked during the exam. Please bring a No. pencil to fill out the answer sheet. This is a closed-book exam. No calculators are allowed. Please read the instructions on this page very carefully. Please fill out the following information on your answer sheet: Instructor: Ilya Pollak Course: ECE 301 Date: 10/6/011 Test: 1 sign the answer sheet fill in your last name and the first six letters of your first name fill in your student ID for the section, fill in 0001 You have 1 hour and 45 minutes to complete 15 multiple-choice questions. Each correct answer is worth two points, for a total of 30 points. Please only turn in the answer sheets. There will be no partial credit. Your expected score from guessing is /4 + /10 + /9 + /3 + /3 + /3 + /9 + /7 + /7 + /5 + /3 + /3 + /3 + /8 + /8 6.6 1

For Questions 1 3, let x and y be DT signals, defined for all integer n as follows: x[n] = sin(6πn/7 1) y[n] = n Let S be a DT system whose response to the input signal x is y. Apart from this one input-output pair, nothing else is known about this system. Question 1. Select the correct statement: 1. Both x and y are periodic signals.. Both x and y are not periodic signals. 3. x is periodic and y is not periodic. 4. x is not periodic and y is periodic. Solution. Signal x is a DT sinusoid whose frequency is a rational multiple of π. Therefore, it is periodic. Signal y never repeats itself, i.e., there are no values of n and N 0 such that y[n] = y[n+n]. Therefore, this signal is not periodic. Answer key: 3. Question. Select the correct statement: 1. The fundamental period of x is 6/7.. The fundamental period of x is 7/6. 3. The fundamental period of x is 3/7. 4. The fundamental period of x is 7/3. 5. The fundamental period of x is 6. 6. The fundamental period of x is 7. 7. The fundamental period of x is 3π/7. 8. The fundamental period of x is 7/(3π). 9. The fundamental period of x is undefined. 10. None of the above. Solution. The fundamental period of x is the smallest integer N such that N/(7/3) is an integer. Therefore, N = 7. Answer key: 6. Question 3. Select the correct statement: 1. S is stable and causal.. S is stable and non-causal. 3. S is unstable and causal. 4. S is unstable and non-causal. 5. S is stable, but the given information is not enough to determine whether or not it is causal. 6. S is unstable, but the given information is not enough to determine whether or not it is causal. 7. S is causal, but the given information is not enough to determine whether or not it is stable. 8. S is non-causal, but the given information is not enough to determine whether or not it is stable.

9. The given information is not enough to determine whether or not S is stable, and is not enough to determine whether or not S is causal. Solution. Signal x is bounded whereas signal y is unbounded. Therefore, the system is unstable. On the other hand, nothing can be said about causality. For example, a system S 1 whose output y 1 is determined by y 1 [n] = n regardless of the input, is causal. Consider another system S whose output is determined by { n, if the input is signal x y [n] = x [n + 1], if the input is any signal x x This system is non-causal. Both systems are consistent with the given input-output pair. Therefore, the given information is not enough to determine whether or not S is causal. Answer key: 6. 3

For Questions 4 6, let x 1, x, x 3, y 1, y, and y 3 be CT signals, defined for all real t as follows: x 1 (t) = δ(t) x (t) = u(t) u(t 1) x 3 (t) = u(t 1) u(t ) y 1 (t) = e t u(t) y (t) = u(t) u(t 1) y 3 (t) = u(t) u(t 1) Here, δ is the CT unit impulse and u is the CT unit step. Let S be a CT system whose responses to the input signals x 1, x, x 3 are y 1, y, y 3, respectively. Apart from these three input-output pairs, nothing is known about the system. Question 4. Select the correct statement: 1. System S is linear.. System S is nonlinear. 3. The given information is not enough to determine whether or not the system is linear. Solution. Since no given input is a linear combination of the other inputs, we cannot rule out that the system is linear. On the other hand, just three input-output pairs are not enough to assert that it is linear. Answer key: 3. Question 5. Select the correct statement: 1. There exists a signal h such that the response of system S to any input signal x is the convolution of x with h.. There does not exist a signal h such that the response of system S to any input signal x is the convolution of x with h. 3. The given information is not enough to determine whether or not there exists a signal h such that the response of system S to any input signal x is the convolution of x with h. Solution. Note that the impulse response of the system is y 1. If the convolution relationship were satisfied, then the response to x would therefore be x y 1. But y x y 1. Therefore, the system does not satisfy the convolution relationship. Answer key:. Question 6. Select the correct statement: 1. System S is time-invariant.. System S is time-varying. 3. The given information is not enough to determine whether or not the system is time-invariant. 4

Solution. Since x 3 (t) = x (t 1) for all t but y 3 (t) y 3 (t 1) for t = 0.5, the system cannot be time-invariant. Answer key:. 5

Question 7. Let x[n] = δ[n] + δ[n 1] for all integer n, where δ is the discrete-time unit impulse. Let y[n] = x x[n]. In other words, y is the convolution of x with itself. Select the correct statement: 1. y[n] = δ[n] for all integer n.. y[n] = δ[n + 1] for all integer n. 3. y[n] = δ[n 1] for all integer n. 4. y[n] = δ[n] + δ[n 1] for all integer n. 5. y[n] = δ[n] + δ[n + 1] for all integer n. 6. y[n] = δ[n] + δ[n 1] + δ[n ] for all integer n. 7. y[n] = δ[n] + δ[n + 1] + δ[n + ] for all integer n. 8. y[n] = δ[n 1] + δ[n] + δ[n + 1] for all integer n. 9. None of the above. Solution. (δ + δ 1 ) (δ + δ 1 ) = δ + δ 1 + δ, where δ k [n] = δ[n k]. Hence, y[n] = δ[n] + δ[n 1] + δ[n ]. Answer key: 6. Question 8. Let x[n] = u[n] for all integer n, where u is the discrete-time unit step. Let y[n] = x x[n]. In other words, y is the convolution of x with itself. Select the correct statement: 1. y[n] = δ[n] for all integer n.. y[n] = u[n] for all integer n. 3. y[n] = (u[n]) for all integer n. 4. y[n] = nu[n] for all integer n. 5. y[n] = (n + 1)u[n] for all integer n. 6. y[n] = (n + )u[n] for all integer n. 7. None of the above. Solution. y[n] = k= u[k]u[n k] If n < 0, then the supports of the two unit steps in the summation do not overlap, and y[n] = 0. For n 0, we have: n y[n] = 1 = n + 1. k=0 Putting these together, y[n] = (n + 1)u[n] for all n. Answer key: 5. Question 9. Let x(t) = u(t) for all integer t, where u is the continuous-time unit step. Let y(t) = x x(t). In other words, y is the convolution of x with itself. Select the correct statement: 1. y(t) = δ(t) for all real t.. y(t) = u(t) for all real t. 6

3. y(t) = (u(t)) for all real t. 4. y(t) = tu(t) for all real t. 5. y(t) = (t + 1)u(t) for all real t. 6. y(t) = (t + )u(t) for all real t. 7. None of the above. Solution. y(t) = u(τ)u(t τ)dτ If t < 0, then the supports of the two integrands do not overlap, and y(t) = 0. For t 0, we have: Putting these together, y(t) = tu(t) for all t. Answer key: 4. y(t) = t 0 dτ = t 7

Question 10. For any input signal x, the output of the continuous-time system S is y, where for all real t. Select the correct statement: 1. System S is memoryless and invertible.. System S is memoryless and not invertible. 3. System S has memory and is invertible. 4. System S has memory and is not invertible. 5. None of the above. y(t) = (x(t )), Solution. The system is not memoryless because, for example, the output at time depends on the input at time 4. The system is not invertible since input signals x 1 (t) = and x (t) = produce the same output signal. Answer key: 4. 8

For Questions 11 13, continuous-time system S is such that, for any input signal x, the output of the system is equal to the convolution of the input signal with the continuous-time unit step. Question 11. Select the correct statement: 1. System S is stable.. System S is not stable. 3. Not enough information is given to determine whether or not system S is stable. Solution. The impulse response of the system is the unit step, which is not absolutely integrable. Since the system is LTI, this implies that the system is not stable. Answer key:. Question 1. Select the correct statement: 1. System S is causal.. System S is not causal. 3. Not enough information is given to determine whether or not system S is causal. Solution. The impulse response of the system is the unit step, which is zero for negative time. Since the system is LTI, this implies that the system is causal. Answer key: 1. Question 13. Select the correct statement: 1. System S is memoryless.. System S is not memoryless. 3. Not enough information is given to determine whether or not system S is memoryless. Solution. The system satisfies the following input-output equation: y(t) = x(τ)u(t τ)dτ = t x(τ)dτ. This shows that y at time t depends on values of x at times τ < t. Therefore, the system is not memoryless. Answer key:. 9

Questions 14 and 15 are significantly more involved than Questions 1 13. It might be a good idea to double-check your work on Questions 1 13 before you attempt Questions 14 and 15. For Questions 14 and 15, consider a DT signal y, defined for all integer n as follows: [ 5 + ( 5 1 + ) n 5 y[n] = + 5 ( 5 1 ) n ] 5 u[n], 10 10 where u is the DT unit step signal: u[n] = { 1 for n 0 0 for n < 0 Question 14. The objective of this question is to determine whether or not each of the following three statements is true or false. (a) y[n] is integer for any positive integer n. (b) y[n + 1] > y[n] for any positive integer n. (c) y is a bounded signal. Select the number between 1 and 8 on your answer sheet, corresponding to the correct statement among the following eight statements: 1. (a), (b), and (c) are all true.. (a) and (b) are true, and (c) is false. 3. (a) and (c) are true, and (b) is false. 4. (b) and (c) are true, and (a) is false. 5. (a) and (b) are false, and (c) is true. 6. (a) and (c) are false, and (b) is true. 7. (b) and (c) are false, and (a) is true. 8. (a), (b), and (c) are all false. Solution. Since ( a 1 + ) ( 5 a 1 ) 5 anything of the form y[n] = A is a homogeneous solution to the equation = a 1 + 5 + 1 5 a + (1 + 5)(1 5) = a a 1, 4 ( 1 + ) n ( 5 1 ) n 5 + B (1) y[n] y[n 1] y[n ] = 0. () 10

For A = (5 + 5)/10 and B = (5 5)/10, we have: y[0] = 5 + 5 10 y[1] = 5 + 5 10 1 + 5 5 10 1 + 5 1 = 1 + 5 5 10 1 5 = 5 + 6 5 + 5 + 5 6 5 + 5 0 These two initial conditions, y[0] = y[1] = 1, together with Eq. (), uniquely define the solution for n 0: y[0] = y[1] = 1 y[] = y[0] + y[1] = y[3] = y[1] + y[] = 3 y[4] = y[] + y[3] = 5 y[5] = y[3] + y[4] = 8, etc. = 1 These are the so-called Fibonacci numbers. Since y[0] and y[1] are both integers, and since y[n] = y[n 1] + y[n ] for any n, it follows by induction that y[n] is integer for any positive integer n. Since y[0] and y[1] are both positive, and since y[n] = y[n 1] + y[n ] for any n, it also follows by induction that y[n] > y[n 1] for any n, i.e., that y[n + 1] > y[n] for any n 1. Therefore, it also follows that y[n] = y[n 1] + y[n ] > y[n ] for all n. Since y[0] = 1, this implies, by induction, that y[n] > n/ for all even n, and therefore y is an unbounded signal. Thus, (a) and (b) are both true but (c) is false. Answer key:. Question 15. The objective of this question is to determine whether or not each of the following three statements is true or false. (a) y[3n 1] is an even number for any positive integer n. (b) y[3n ] is an odd number for any positive integer n. (c) y[3n] is an odd number for any positive integer n. Select the number between 1 and 8 on your answer sheet, corresponding to the correct statement among the following eight statements: 1. (a), (b), and (c) are all true.. (a) and (b) are true, and (c) is false. 3. (a) and (c) are true, and (b) is false. 4. (b) and (c) are true, and (a) is false. 5. (a) and (b) are false, and (c) is true. 6. (a) and (c) are false, and (b) is true. 11

7. (b) and (c) are false, and (a) is true. 8. (a), (b), and (c) are all false. Solution. All three statements are true for n = 1 because y[] = is even, and y[1] = 1 and y[3] = 3 are both odd. Suppose that (a), (b), and (c) are all true for n = k. Then they are also all true for n = k + 1, because y[3(k + 1) ] = y[3k + 1] = y[3k] + y[3k 1] = odd + even = odd y[3(k + 1) 1] = y[3k + ] = y[3k + 1] + y[3k] = odd + odd = even y[3(k + 1)] = y[3k + 3] = y[3k + ] + y[3k + 1] = even + odd = odd Therefore, by induction, (a), (b), and (c) all apply for any positive integer n. Answer key: 1. 1