Slide :

Electrical Engineering BHANWAR SINGH 66 1000

CHOUDHARY

Computer Science and JAYADEEP SUDHAKAR 93.67 1000

Information MORE
Technology

Electronics and SIDDHARTH 90 1000

Communication SABHARWAL
Engineering

Slide :
BRANCH MARKS RANK
ECE 74 16
ECE 68.33 56
ECE 68 62

Slide :
BRANCH MARKS RANK
EEE 66 1
EEE 54.33 45
EEE

Slide :
BRANCH MARKS RANK
CSE 93.67 1
CSE 92 2
CSE 88.67 4
CSE 83.33 25
CSE 78 50
CSE 74.33 102
CSE 71.33 156
CSE 70.33 186

Slide :
BRANCH MARKS RANK
CSE 81 1
CSE 70 10

Slide :
 ROUTINE
ROUTINE

DROPPER STUDENTS
 Follow GW classes regular
 Solve DPP
 Solve PYQ on daily basis
 Revised more on no class day
 Take weekly Test proper
 Start Topic/Subject wise GW test series

COLLEGE STUDENTS
 Revising short notes during college hours.
 Complete college assignments and lab
reports in college itself.
 During break time Solve practice problems
 On weekends cover more syllabus Slide :
 PREPARATION
SCHEDULE

-Morning- -Evening-
Mathematics- 2 to 3 hrs daily Technical Subject- 4 to 5 hrs daily
Aptitude- 1 to 2 hrs daily

Slide :
 ihB ges'kk etcwr j[kuh pkfg,] D;ksafd
'kkcklh vkSj /kks[kk nksuksa ihNs ls gh
feyrs gSaA

ftr vkSj gkj vkidh lksp ij fuHkZj djrh gSaA

eku yks rks gkj gksxh vkSj
Bku yks rks thr gksxh

Slide :
 RESOURCE
USE FOR
PRACTICE

Class Subject
Notes Weekly
DPPs PYQs Test
Problems Test
Series

Slide : 1
 SHORT REVISION

WEEKLY REVISION

REVISION
STRATEGY MONTHLY REVISION
THROUGH QUESTION

SHORT NOTES

Slide : 1
 Subject Maximum Marks Easy to Get
Engineering Mathematics 13 10
General Aptitude 15 12
Control systems 8 6
Network Theory 8 6
Digital Electronics 8 6
Signals & Systems 8 6
Electronics devices & circuits 10 6
Analog Electronics 10 6
Communication Systems 12 8
EMFT 8 6
TOTAL 100 72

Slide : 1
 DIGITAL ELECTRONICS
 Hold time & Setup time
 Counter
 ADC DAC
CONTROL SYSTEMS  Combinational Circuit
 Nyquist
 State Space Analysis
 Steady state Error
 Compensator NETWORK THEORY
 Theorems
 Transient
 Two Part Network
SIGNAL AND SYSTEMS
 KCL, KVL
 Z - transform
 Fourier Transform
 DTFT / FFT
 Laplace Transform
Slide : 1
ELECTRONICS ANALOG
DEVICES AND CIRCUIT

 MOS Capacitor  Clipper - Clamper

 Diode  MOSFET
 Solar Cell  BJT
 PN junction diode  OP-AMP

COMMUNICATIONS ELECTRO
MAGNETIC FIELD

 AM, FM  Transmission Line

 Probability of Error  Wave Guide
 Random Variables
Slide : 1
 Uk la?k”kZ u rdyhQ
rks D;k et+k gS thus esa

cM+s cM+s rqQku Fke

tkrs gSa
tc vkx yxh gks lhus
esaA

Slide : 1
 Subject Maximum Marks Easy to Get
Engineering Mathematics 13 10
General Aptitude 15 12
Control systems 10 8
Network Theory 10 7
Digital Electronics 3 3
Signals & Systems 7 5
Measurements 2 2
Analog Electronics 5 3
Electrical Machines 13 6
EMFT 3 2
Power Systems 11 7
Power Electronics 11 7
TOTAL 100 70+
Slide : 1
  Basics
 Theorems
 Transients
NETWORK THEORY  Two port networks
 Steady State analysis

 SFG/ Block Reduction

 Time response analysis
CEONTROL SYSTEM  Stability/ Root locus
 Frequency response analysis
 State Space Analysis

 Basics
POWER ELECTRONICS  Rectifiers
 Choppers
 Inverters

 DC Machines
 Transformer
ELECTRICAL MACHINES  Induction machines
 Synchronous Machines

Slide : 1
  Transmission Line
 Fault Analysis
 Load Flow Study
POWER SYSTEMS  Stability
 Protection

 Matrix
 Calculus
ENGINEERING MATHS  Probability
 Differential equations
 Complex Variables

 Basics
SIGNALS & SYSTEMS  Fourier transform
 Laplace transform
 Z -transform

 Quant
 Reasoning
GENERAL APTITUDE  English

Slide : 1
  Diode
ANALOG ELECTRONICS  BJT
 Op- amp

 Boolean Algebra
DIGITAL ELECTRONICS  Sequential circuits
 Combinational circuits

 Electrostatics
EMFT  Magnetostatics

MEASUREMENTS  Analog meters

 Power-Energy Measurement

Slide : 1
 Subject Maximum Marks Easy to Get
General Aptitude 15 12
Programming & DS 9 6
Algorithms 8 5
Digital Logic 4 3
Operating Systems 9 7
Computer Organization 7 5
Computer Networks 11 8
Data base management systems 6 5
Theory of computation 9 6
Compiler design 5 3
Engineering Mathematics 17 12
& Discreate Mathematics
TOTAL 100 70+

Slide : 2
PROGRAMMING & DS ALGORITHMS OPERATING SYSTEMS
 Recursion  Time & Space Complexity  CPU Scheduling
 Pointers  Sorting Algorithms  Synchronization
 Tree  Dynamic Programming  Paging
 Stacks & Queue

DIGITAL LOGIC COMPUTER ORGANIZATION

 Number System  Cache memory
 Combinational Circuit  Pipelining
(MUX, parallel adder)  Instruction
 Sequential Circuit (FF, Counter)

Slide : 2
COMPUTER NETWORKS DATA BASE MANAGEMENT SYSTEMS
 IP Addressing (Subnetting, Supernetting)  Normalization
 Flow Control  Transaction and Concurrency
 IPv4 Header & Fragmentation  SQL and Relation Algebra
 Application layer protocol

THEORY OF COMPUTATION COMPILER DESIGN DISCRETE MATHEMATICS

 Regular Expression & FA  Parsing  Graph Theory
 CFL & PDA  Syntax directed Translation  Group Theory
 Turing Machine & Decidability  Code Optimization  Quantifier in logic
 Generating Function/Recurrence Relation

Slide : 2
Slide : 2