Gate Syllabus - Electrical Engineering

Section 1: 

Engineering Mathematics Linear Algebra: 

Matrix Algebra, Systems of linear equations, Eigenvalues, Eigenvectors. Calculus: 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 integral, Surface integral, Volume integral, Stokes’s theorem, Gauss’s theorem, Green’s theorem. Differential equations: First order equations (linear and nonlinear), Higher order linear differential equations with constant coefficients, Method of variation of parameters, Cauchy’s equation, Euler’s equation, Initial and boundary value problems, Partial Differential Equations, Method of separation of variables. Complex variables: Analytic functions, Cauchy’s integral theorem, Cauchy’s integral formula, Taylor series, Laurent series, Residue theorem, Solution integrals. Probability and Statistics: Sampling theorems, Conditional probability, Mean, Median, Mode, Standard Deviation, Random variables, Discrete and Continuous distributions, Poisson distribution, Normal distribution, Binomial distribution, Correlation analysis, Regression analysis. Numerical Methods: Solutions of nonlinear algebraic equations, Single and Multi‐step methods for differential equations. Transform Theory: Fourier Transform, Laplace Transform, z‐Transform. 

Electrical Engineering :


 Section 2: 


Electric Circuits Network graph, KCL, KVL, Node and Mesh analysis, Transient response of dc and ac networks, Sinusoidal steady‐state analysis, Resonance, Passive filters, Ideal current and voltage sources, Thevenin’s theorem, Norton’s theorem, Superposition theorem, Maximum power transfer theorem, Two‐port networks, Three phase circuits, Power and power factor in ac circuits. 

Section 3:


  Electromagnetic Fields Coulomb's Law, Electric Field Intensity, Electric Flux Density, Gauss's Law, Divergence, Electric field and potential due to point, line, plane and spherical charge distributions, Effect of dielectric medium, Capacitance of simple configurations, Biot‐Savart’s law, Ampere’s law, Curl, Faraday’s law, Lorentz force, Inductance, Magnetomotive force, Reluctance, Magnetic circuits,Self and Mutual inductance of simple configurations. 

Section 4:


 Signals and Systems Representation of continuous and discrete‐time signals, Shifting and scaling operations, Linear Time Invariant and Causal systems, Fourier series representation of continuous periodic signals, Sampling theorem, Applications of Fourier Transform, Laplace Transform and z-Transform. 

Section 5:


Electrical Machines Single phase transformer: equivalent circuit, phasor diagram, open circuit and short circuit tests, regulation and efficiency; Three phase transformers: connections, parallel operation; Auto‐transformer, Electromechanical energy conversion principles, DC machines: separately excited, series and shunt, motoring and generating mode of operation and their characteristics, starting and speed control of dc motors; Three phase induction motors: principle of operation, types, performance, torque-speed characteristics, no-load and blocked rotor tests, equivalent circuit, starting and speed control; Operating principle of single phase induction motors; Synchronous machines: cylindrical and salient pole machines, performance, regulation and parallel operation of generators, starting of synchronous motor, characteristics; Types of losses and efficiency calculations of electric machines.

Section 6:


 Power Systems Power generation concepts, ac and dc transmission concepts, Models and performance of transmission lines and cables, Series and shunt compensation, Electric field distribution and insulators, Distribution systems, Per‐unit quantities, Bus admittance matrix, GaussSeidel and Newton-Raphson load flow methods, Voltage and Frequency control, Power factor correction, Symmetrical components, Symmetrical and unsymmetrical fault analysis, Principles of over‐current, differential and distance protection; Circuit breakers, System stability concepts, Equal area criterion. 

Section 7: 


Control Systems Mathematical modeling and representation of systems, Feedback principle, transfer function, Block diagrams and Signal flow graphs, Transient and Steady‐state analysis of linear time invariant systems, Routh-Hurwitz and Nyquist criteria, Bode plots, Root loci, Stability analysis, Lag, Lead and Lead‐Lag compensators; P, PI and PID controllers; State space model, State transition matrix. 

Section 8:


 Electrical and Electronic Measurements Bridges and Potentiometers, Measurement of voltage, current, power, energy and power factor; Instrument transformers, Digital voltmeters and multimeters, Phase, Time and Frequency measurement; Oscilloscopes, Error analysis. 

Section 9: 


Analog and Digital Electronics Characteristics of diodes, BJT, MOSFET; Simple diode circuits: clipping, clamping, rectifiers; Amplifiers: Biasing, Equivalent circuit and Frequency response; Oscillators and Feedback amplifiers; Operational amplifiers: Characteristics and applications; Simple active filters, VCOs and Timers, Combinational and Sequential logic circuits, Multiplexer, Demultiplexer, Schmitt trigger, Sample and hold circuits, A/D and D/A converters, 8085Microprocessor: Architecture, Programming and Interfacing. 

Section 10:


 Power Electronics Characteristics of semiconductor power devices: Diode, Thyristor, Triac, GTO, MOSFET, IGBT; DC to DC conversion: Buck, Boost and Buck-Boost converters; Single and three phase configuration of uncontrolled rectifiers, Line commutated thyristor based converters, Bidirectional ac to dc voltage source converters, Issues of line current harmonics, Power factor, Distortion factor of ac to dc converters, Single phase and three phase inverters, Sinusoidal pulse width modulation.

Comments

Post a Comment

Popular posts from this blog

Show that number of pendant vertices in a binary tree is (n+1)/2 ,where n is the number of vertices in the tree.

Image
The number of vertices of odd degree in an undirected graph is even,(N-1) is even.  Therefore, n is odd. Let p be the number of pendant vertices. 2+p+3(n- p-1) = 2(n-1) or, 3n-2n-3+4 = 2p or, 2p = n+1 or, P = (n+1)/2 Hence, the number of pendant vertices is (n+1)/2. Also, see : 1.)  Graph Theory and Tree 2.)  The Reflection about line yx is.......... 3.)  Prove that a simple graph with n vertices and k components can have at most 1/2(n-k)(n-k-1) edges. 4.)  Show for what condition rotation and scaling are commutative. 5.) Vector in R space 6.) Prove that every tree has at most one perfect matching. 7.)  Prove that every tree with 2 or more vertices is 2-chromatic. 8.)  Show that every Bi-partite graph is 2 chromatic. 9.) Prove that the number of circular permutations of n different objects is (n-1)! . 10.)  State the "Pigeon Hole Principle" and the " Generalised pigeon Hole principle".
Read more

Prove that every tree with 2 or more vertices is 2-chromatic.

Image
Since a tree is connected and has no cycle if one starts coloring any one vertex with a specific color and keeps on coloring every alternate vertex with another color, the entire graph can be colored with only two colors and since there is one and only one path between any two vertices in a tree, no two vertices will have the same color. Hence every Tree with 2 or more vertices is 2-Chromatic.    [Proved]                                                                 FIG (I)                                                                  FIG (II)
Read more

Top 5 websites to learn coding Online

Image
Now, A Days Technology became our Daily Life partner. Sometimes we people are wondering how this page, website, Blog ,Game works .Then,Our Mind  starts searching for Real phenomenon .How this site works ,why this website is different from others,How the widget is different from others ,How e-commerce website works. So, The answer of all of the above is "CODING". Being a programmer ,i think without Coding Digital Word is Nothing. So, you need to learn Coding if you are interested in Digital world. Myths about coding is that It is Hard to Understand & Hard to Write.There is nothing like this.Just you have to do some basic Homework daily and continuation in learning.Learn Coding like a Interesting Puzzle and solve like a "SUDUKO" Game. Let's Start: Kids Section: For kids Go for  Tynker   (Android/IOS) and  Hopscotch   (IPAD) .These sites are the best tutor of kids ,they teach coding in the form of Games & Puzzles.
Read more