Contents
Chandigarh University has decided to conduct an entrance cum scholarship test named as Chandigarh University Common Entrance Test (CUCET) for admission to various programs so as to provide an opportunity to bright and inquisitive young minds from across the country to study in most challenging and diverse academic environment.
CUCET Syllabus has been released by the authorities of Chandigarh University. Candidates can check the syllabus of CUCET 2023 to know the subjects, units and topics that have to be studied for the upcoming entrance examination. The subject-wise CUCET syllabus will allow the candidates to become familiar with the topics that they have to prepare to excel in the examination. Read to know more about CUCET Syllabus 2023.
CUCET ME-ECE Syllabus
Section 1:
Networks, Signals and Systems Circuit analysis: Node and mesh analysis, superposition, Thevenin’s theorem, Norton’s theorem, reciprocity. Sinusoidal steady state analysis: phasors, complex power, maximum power transfer.
Time and frequency domain analysis of linear circuits: RL, RC and RLC circuits, solution of network equations using Laplace transform. Linear 2-port network parameters, wye-delta transformation. Continuous-time signals: Fourier series and Fourier transform, sampling theorem and applications.
Discrete-time signals: DTFT, DFT, z-transform, discrete-time processing of continuous-time signals. LTI systems: definition and properties, causality, stability, impulse response, convolution, poles and zeroes, frequency response, group delay, phase delay.
Section 2:
Analog Circuits Diode circuits: – clipping, clamping and rectifiers. BJT and MOSFET amplifiers: biasing, ac coupling, small signal analysis, frequency response. Current mirrors and differential amplifiers. Op-amp circuits: Amplifiers, summers, differentiators, integrators, active filters, Schmitt triggers and oscillators.
Section 3:
Digital Circuits Number representations: binary, integer and floating-point- numbers.
Combinatorial circuits: Boolean algebra, minimization of functions using Boolean identities and Karnaugh map, logic gates and their static CMOS implementations, arithmetic circuits, code converters, multiplexers, decoders.
Sequential circuits: latches and flip-flops, counters, shift-registers, finite state machines, propagation delay, setup and hold time, critical path delay. Data converters: sample and hold circuits, ADCs and DACs.
Semiconductor memories: ROM, SRAM, DRAM. Computer organization: Machine instructions and addressing modes, ALU, data-path and control unit, instruction pipelining.
Section 4:
Communications Random processes autocorrelation and power spectral density, properties of white noise, filtering of random signals through LTI systems.
Analog communications: amplitude modulation and demodulation, angle modulation and demodulation, spectra of AM and FM, superheterodyne receivers. Information theory: entropy, mutual information and channel capacity theorem.
Digital communications: PCM, DPCM, digital modulation schemes (ASK, PSK, FSK, QAM), bandwidth, inter-symbol interference, MAP, ML detection, matched filter receiver, SNR and BER. Fundamentals of error correction, Hamming codes, CRC. (100)
Section 5:
Electromagnetics Maxwell’s equations: differential and integral forms and their interpretation, boundary conditions, wave equation, Poynting vector. Plane waves and properties: reflection and refraction, polarization, phase and group velocity, propagation through various media, skin depth.
Transmission lines: equations, characteristic impedance, impedance matching, impedance transformation, S-parameters, Smith chart. Rectangular and circular waveguides, light propagation in optical fibers, dipole and monopole antennas, linear antenna arrays.