Guru Gobind Singh Indraprastha University CET 2010
Guru Gobind Singh Indraprastha University founded by Government of NCT of Delhi beneath the commissariat of Guru Gobind Singh Indraprastha University Act, 1998 read with its Amendment in 1999. The University is accepted by University Grants Commission (UGC), India under section 12B of UGC Act.
CET 2010 Eligibility
The students require have attained a lower limit of 55% aggregate marks in the subjects like Physics, Chemistry and Mathematics in their 10+2 system examinations of CBSE or an equal board.
GGSIPU 2010 CET Application Form
For the convenience to the applicants as well as their parents / guardians, the University is also furnishing the facility of On-Line Submission of Application Form of CET – 2010. The Application Form along with the Common Entrance Test Fee of Rs. 1000/- and Rs. 100/- as postage and handlings can be presented by Online is 21st April, 2010. The Admit Cards will, however, be sent only by recorded post.
SYLLABUS OF CET 2010
Matrix algebra, systems of linear equations, eigen values and eigen vectors.
Mean value theorems, Theorems of integral calculus, Evaluation of definite and
improper integrals, Partial Derivatives, Maxima and minima, Multiple integrals, Fourier series.Vector identities, Directional derivatives, Line, Surface and Volume integrals, Stokes, Gauss and Green’s theorems.
First order equation (linear and nonlinear), higher order linear differential equations with constant coefficients, Method of variation of parameters, Cauchy’sand Euler’s equations, Initial and boundary value problems, Partial Differential Equations and variable separable method.
Analytic functions, Cauchy’s integral theorem and integral formula, Taylor’s and Laurent’ series, Residue theorem, solution integrals.
Probability and Statistics
Sampling theorems, Conditional probability, Mean, median, mode and standard deviation, Random variables, Discrete and continuous distributions, Poisson, Normal and Binomial distribution, Correlation and regression analysis.
Solutions of non-linear algebraic equations, single and multi-step methods for differential equations.
Fourier transform, Laplace transform
Network graphs: matrices associated with graphs; incidence, fundamental cut set
and fundamental circuit matrices. Solution methods: nodal and mesh analysis. Network
theorems: superposition, Thevenin and Norton’s maximum power transfer, Wye-Delta
transformation. Steady state sinusoidal analysis using phasors. Linear constant coefficient
differential equations; time domain analysis of simple RLC circuits, Solution of network
equations using Laplace transform: frequency domain analysis of RLC circuits. 2-port networkparameters: driving point and transfer functions. State equations for networks.
Electronic Devices and Analog Circuits
Energy bands in silicon, intrinsic and extrinsic silicon.Carrier transport in silicon: diffusion current, drift current, mobility, and resistivity. Generationand recombination of carriers. p-n junction diode, Zener diode, tunnel diode, BJT, JFET, MOScapacitor, MOSFET, LED, p-I-n and avalanche photo diode, Basics of LASERs. Device technology: integrated circuits fabrication process, oxidation, diffusion, ion implantation, photolithography,n-tub, p-tub and twin-tub CMOS process. Small Signal Equivalent circuits of diodes, BJTs,MOSFETs and analog CMOS. Simple diode circuits, clipping, clamping, rectifier. Biasing and bias stability of transistor and FET amplifiers. Amplifiers: single-and multi-stage, differential and operational, feedback, and power. Frequency response of amplifiers. Simple op-amp circuits.Filters. Sinusoidal oscillators; criterion for oscillation; single-transistor and op-amp configurations. Function generators and wave-shaping circuits, 555 Timers. Power supplies.Digital circuits: Boolean algebra, minimization of Boolean functions; logic gates; digital IC families (DTL, TTL, ECL, MOS, CMOS). Combinatorial circuits: arithmetic circuits, code converters,
Multiplexers, decoders, PROMs and PLAs. Sequential circuits: latches and flip-flops, counters and shift-registers. Sample and hold circuits, ADCs, DACs. Semiconductor memories.Microprocessor(8085): architecture, programming, memory and I/O interfacing.
Signals and Systems
Definitions and properties of Laplace transform, continuous-time and discrete-time Fourier series, continuous-time and discrete-time Fourier Transform, DFT and FFT,z-transform. Sampling theorem. Linear Time-Invariant (LTI) Systems: definitions and properties;causality, stability, impulse response, convolution, poles and zeros, parallel and cascade structure, frequency response, group delay, phase delay. Signal transmission through LTI systems.
Random signals and noise: probability, random variables, probability density
Function, autocorrelation, power spectral density. Analog communication systems: amplitude and angle modulation and demodulation systems, spectral analysis of these operations, superheterodyne receivers; elements of hardware, realizations of analog communication systems; signal-to-noise ratio (SNR)calculations for amplitude modulation (AM) and frequency modulation (FM) for low noise conditions. Fundamentals of information theory and channel capacity theorem. Digital communication systems: pulse code modulation (PCM), differential pulse code modulation (DPCM), digital modulation schemes: amplitude, phase and frequency shift keying schemes (ASK, PSK, FSK), matched filter receivers, bandwidth consideration and probability of error calculations for these schemes. Basics of TDMA, FDMA and CDMA and GSM.
Computer Organization and Architecture
Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structures
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Analysis, Asymptotic notation, Notions of space and time complexity, Worst and
Average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NP-hard, and NP-complete.
Processes, Threads, Inter-process communication, Concurrency,Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
ER-model, Relational model (relational algebra, tuple calculus), Database design
(Integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.
Information Systems and Software Engineering
information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation,maintenance.
ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error Control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP (v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security basic concepts of public key and private key cryptography, digital signature, firewalls.
Address Kashmiri Gate, Delhi-110403
Phone Number 23900104, 23900105