Scribd
Upload
23 views2 pages

Signals and Systems Insem-I 2024 Question Paper

The document outlines an exam for the CT204 Signals & Systems course, scheduled for August 29, 2024, with a duration of 2 hours and a total of 30 marks. It includes questions on input-output relations for systems, signal representation, designing a finite state machine for a tea vending machine, state transition diagrams, function transformations, and properties of a continuous-time system. Each question specifies the marks allocated and requires various analytical and design skills related to signals and systems.

Uploaded by

prakritip007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
23 views2 pages

Signals and Systems Insem-I 2024 Question Paper

The document outlines an exam for the CT204 Signals & Systems course, scheduled for August 29, 2024, with a duration of 2 hours and a total of 30 marks. It includes questions on input-output relations for systems, signal representation, designing a finite state machine for a tea vending machine, state transition diagrams, function transformations, and properties of a continuous-time system. Each question specifies the marks allocated and requires various analytical and design skills related to signals and systems.

Uploaded by

prakritip007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CT204 - Signals &Systems

In Sem l: August 29, 2024


Duration: 2hrs.
Marks, 30

1. Find out the input-output relation for the system H shown below. The system G is
defined as G(r,y) =}y+), and denotes an adder. |Marks 4]

>y

H
Figure 1: System H uses feedback on system G

2. One can represent signals with functions from the set S = f:X Y}, between
appropriate sets X and Yof mathematical entities. Give the appropriate X and Y for
encoding/representing the following signals, and determine whether the set Sfor each
of the following signals can have finite or infinitely many elements. [Marks 6]
(a) Runs scored on every ball of a T20 innings. Assumne zero runs for the
remaining
innings in case an innings gets completed early.
(b) Ranking of the courses in this semester in order of difficulty (highest to
lowest,
assuming no two courses can have the same ranking), among students of your
class.
(c) Colours at every point on the surface of an arbitrary football
(assumed to be a
unit sphere).
3. The DA-IICT administration installs an automatic
tea-vending machine in the canteen.
It has sensors that will detect the type of coin inserted (1, 2 or 5), and
you may assume
that only one coin is inserted at a time. The machine serves one cup of tea for 8 INR,
and it does so as soon as the input sum is greater than equal to 8 INR. It als0 returns
the correct amount of change. You may assume that (a) users are reasonable students,
(b) the machine always has the required coins to return the change, and (c) there is
enough time between two consecutive requests for tea. Design an FSM for such a
vending machine, and represent it as an update table. Name the initial state So, and
thereafter S1, S2,... Write the interpretation of the states you use. Any additional
unreasonable assumption may be penalized. [Marks 5]
4 Consider a state machine where

Inputs (, absent),
Outputs (0, 1,absent ).
States (a,b,e,d, e. f}.
nitalState i,
and the update tunction is eiven bv the tollowine tathle
ienorine stuttering)
(currentSate, inputSymbol) (netStale, ontputsymbol)
(a, ) (b,1)
(b, ) (r.0)
(c, ) (d, 0)
(d.1) (e. )
(e. ) (f.0)
(a,0)

(a) Draw the state transition diagram for this machine.


(b) Findastate machine with three states that simulates this one and that is simulated
by this one. Draw that state machine, and give the simulation relations.
[Marks 5|
5. Figure 2shows graph of afunction: f:(-2,2) cR’|-2,2) CR.

Figure 2:
8:|-4,4) cR+(-44| CRis another function obtained by transforming f. The
transformations are given below.
VtE R, 81() = f(2: + 1)
VER, 82(t) = (f() +f(-)]u(t)
u(t) is the unit step function. Plot graph(g1) and graph(g2).
[Marks 4]
6. Consider acontinuous-time system with input x(t) and output y(t) related by
y(t) = x(sin(1).
[Marks 6]

(a) Is this system causal?


(b) Isthis system linear?
(c) Is this system time-invariant?
(d) Is this system memoryless?

You might also like