🇮🇳 GATE Electrical Engineering · subject
GATE Electrical Engineering Signals and Systems Syllabus
Every chapter and topic of Signals and Systems examined in GATE Electrical Engineering — 9 chapters, 8 topics and 3 sub-topics, plus 50 flashcards written against it.
Signals and Systems syllabus — full chapter and topic list
Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Signals and Systems in GATE Electrical Engineering, not a summary of it.
-
Representation of Signals
2 topics- Continuous Time Signals
- Shifting and Scaling Properties
- Discrete Time Signals
- Shifting and Scaling Properties
- Continuous Time Signals
-
Systems
1 topic- Linear Time Invariant Systems
- Causal Systems
- Linear Time Invariant Systems
-
Fourier Series
2 topics- Continuous Time Periodic Signals
- Discrete Time Periodic Signals
-
Sampling Theorem
overviewExamined as a single unit within Signals and Systems — no further topic split in the official outline.
-
Applications of Fourier Transform
2 topics- Continuous Time Signals
- Discrete Time Signals
-
Laplace Transform
overviewExamined as a single unit within Signals and Systems — no further topic split in the official outline.
-
Z Transform
overviewExamined as a single unit within Signals and Systems — no further topic split in the official outline.
-
R.M.S. Value
overviewExamined as a single unit within Signals and Systems — no further topic split in the official outline.
-
Average Value Calculation
1 topic- For Any General Periodic Waveform
Signals and Systems flashcards for GATE Electrical Engineering
23 of 50 cards from the Signals and Systems deck — real questions with worked answers.
What is a continuous-time (CT) signal?
A signal $x(t)$ defined for every value of time $t$ over a continuous interval (the independent variable $t$ is real and takes a continuum of values).
What is a discrete-time (DT) signal?
A signal $x[n]$ defined only at discrete instants, i.e. for integer values of $n$. It is often obtained by sampling a CT signal as $x[n]=x(nT_s)$.
Define the continuous-time unit impulse (Dirac delta) by its sifting property.
$\delta(t)$ satisfies $\int_{-\infty}^{\infty} x(t)\,\delta(t-t_0)\,dt = x(t_0)$, with $\int_{-\infty}^{\infty}\delta(t)\,dt = 1$ and $\delta(t)=0$ for $t\neq 0$.
Define the discrete-time unit impulse $\delta[n]$.
$\delta[n]=1$ for $n=0$ and $\delta[n]=0$ otherwise. Its sifting property is $\sum_{k=-\infty}^{\infty} x[k]\,\delta[n-k]=x[n]$.
What is the relationship between the CT unit step $u(t)$ and the unit impulse $\delta(t)$?
$u(t)=\int_{-\infty}^{t}\delta(\tau)\,d\tau$ and conversely $\delta(t)=\dfrac{d\,u(t)}{dt}$.
What is the relationship between the DT unit step $u[n]$ and the unit impulse $\delta[n]$?
$u[n]=\sum_{k=-\infty}^{n}\delta[k]$ and conversely $\delta[n]=u[n]-u[n-1]$ (the first difference).
For a CT signal $x(t)$, what does the time shift $x(t-t_0)$ represent for $t_0>0$?
A delay (shift to the right) by $t_0$; the entire waveform is moved later in time. For $t_0<0$ it is an advance (shift left).
For the time-scaled CT signal $x(at)$, when does it compress and when does it expand?
For $|a|>1$ the signal is compressed (sped up) by factor $a$; for $0<|a|<1$ it is expanded (stretched/slowed). If $a<0$ there is also time reversal.
How do you sketch the transformed signal $x(at+b)$ from $x(t)$ — what is the correct order of operations?
Shift first, then scale: rewrite as $x(a(t+b/a))$. Equivalently, apply time shift by $b$ on $x(t)$ to get $x(t+b)$, then time-scale by $a$. (Doing scaling before shifting requires shifting by $b/a$.)
For DT signals, why is time scaling $x[an]$ fundamentally different from CT scaling?
$n$ must remain an integer, so true compression/expansion isn't continuous. $x[2n]$ is decimation (downsampling, drops samples) and is generally non-invertible; expansion requires upsampling with inserted zeros.
What does the DT time shift $x[n-n_0]$ do for integer $n_0>0$?
It delays the sequence by $n_0$ samples (shifts right). For $n_0<0$ it advances (shifts left). $n_0$ must be an integer.
Give the precedence rule for the DT operation $x[an+b]$.
Shift the sequence by $b$ first to obtain $x[n+b]$, then time-scale (decimate/reverse) by $a$. Both $a$ and $b$ must be integers for the result to remain a valid DT signal.
Define a Linear Time-Invariant (LTI) system.
A system that is both linear (satisfies superposition: additivity and homogeneity) and time-invariant (a time shift of the input produces an identical time shift of the output).
State the superposition (linearity) condition for a system with operator $T\{\cdot\}$.
If $y_1=T\{x_1\}$ and $y_2=T\{x_2\}$, then $T\{a\,x_1+b\,x_2\}=a\,y_1+b\,y_2$ for all constants $a,b$.
State the time-invariance condition for a system.
If input $x(t)$ gives output $y(t)$, then for every $t_0$ the shifted input $x(t-t_0)$ gives output $y(t-t_0)$ (the system's behavior does not change with time).
What completely characterizes an LTI system, and how is the output computed?
The impulse response $h(t)$ (or $h[n]$). The output is the convolution: $y(t)=x(t)*h(t)=\int_{-\infty}^{\infty}x(\tau)h(t-\tau)\,d\tau$, and $y[n]=\sum_{k=-\infty}^{\infty}x[k]h[n-k]$.
Write the CT and DT convolution sum/integral definitions.
CT: $y(t)=\int_{-\infty}^{\infty}x(\tau)\,h(t-\tau)\,d\tau$. DT: $y[n]=\sum_{k=-\infty}^{\infty}x[k]\,h[n-k]$.
List the three algebraic properties of convolution for LTI systems.
Commutative: $x*h=h*x$. Associative: $(x*h_1)*h_2=x*(h_1*h_2)$. Distributive: $x*(h_1+h_2)=x*h_1+x*h_2$ (parallel systems add).
What is a causal system?
A system whose output at any time depends only on present and past inputs, never future inputs. $y(t_0)$ depends only on $x(t)$ for $t\le t_0$.
State the impulse-response condition for an LTI system to be causal.
$h(t)=0$ for all $t<0$ (CT), and $h[n]=0$ for all $n<0$ (DT).
State the impulse-response condition for an LTI system to be BIBO stable.
The impulse response must be absolutely integrable/summable: $\int_{-\infty}^{\infty}|h(t)|\,dt<\infty$ (CT) or $\sum_{n=-\infty}^{\infty}|h[n]|<\infty$ (DT).
Is the system $y(t)=x(t+2)$ causal? Why?
No. The output at time $t$ depends on a future input value $x(t+2)$, which violates causality (it is non-causal / anticipatory).
Define a memoryless (static) system and give an LTI example.
A system whose output at time $t$ depends only on the input at the same time $t$. For an LTI system this means $h(t)=K\delta(t)$, i.e. $y(t)=Kx(t)$.
Planning Signals and Systems for GATE Electrical Engineering
Signals and Systems is about 6% of the GATE Electrical Engineering syllabus by topic count — 8 of 131 topics, spread over 9 chapters. At roughly 45 minutes per topic plus 12 minutes per sub-topic, a first pass runs to about 7 hours.
The heaviest chapters are Representation of Signals (2 topics), Fourier Series (2 topics), Applications of Fourier Transform (2 topics) . Front-load those while your energy is high; the short chapters are better revision filler later.
Work top-down: read the chapter, then tick topics off individually rather than marking the whole chapter done. Sub-topics are where silent gaps hide.
Signals and Systems (GATE Electrical Engineering) FAQ
What is in the GATE Electrical Engineering Signals and Systems syllabus?
Signals and Systems is split into 9 chapters — Representation of Signals, Systems, Fourier Series, Sampling Theorem, Applications of Fourier Transform and Laplace Transform, and 3 more, containing 8 topics and 3 sub-topics in total.
How many chapters are there in Signals and Systems for GATE Electrical Engineering?
9 chapters. Signals and Systems accounts for about 6% of the topics in the whole GATE Electrical Engineering syllabus (8 of 131).
How long should I spend on Signals and Systems for GATE Electrical Engineering?
Budget around 7 hours for a first pass through Signals and Systems — about 45 minutes per topic plus 12 minutes per sub-topic across its 8 topics. Add revision cycles on top.
Are there flashcards for GATE Electrical Engineering Signals and Systems?
Yes — a 50-card Signals and Systems deck. Sample cards are printed on this page, and the full deck is free in the Examius app with spaced repetition scheduling.