 |
Web Hosting by Netfirms | Free Domain Names by Netfirms |
|
|
|
 |
|---|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| What is IIM's CAT (Common Admission Test) all about? |
|---|
| CAT - The Common Admission Test to the six IIMs is also the entrance test for few other top B-Schools such as SP Jain, MICA, and T A Pai. CAT tests your skills in five broad areas viz. |
|
| The test comprises between 150 to 200 objective type questions and is usually divided into three to four sections. Each question has a question statement followed by four alternate answer choices and the candidate has to choose the best answer for each of the questions and mark it on a special Optical Reader answer sheet. |
| Over the years, the number of questions being asked in CAT has been decreasing steadily. While the early 90s witnessed 180 to 200 questions, the late 90s, specifically CAT 1999 and CAT 2000 had 165 questions each. CAT 2001, CAT 2002 and CAT 2003 had only 150 questions each and these 150 questions were divided into three sections of 50 questions each. |
| The duration of the test is of 120 minutes. This literally translates to answering a CAT question in 48 seconds. Most successful aspirants do not attempt anything more than 120 plus questions. And quite a lot of them attempt between 85 and 100 questions. The key to success, therefore, lies in two important parameters |
| The accuracy or strike rate |
| Each correct question carries 1 positive mark, while each incorrect question carries negative marks. Though, it is not clearly known what the negative mark, it would not be way off the mark to assume it to be one-third of a mark. Hence, it is important to get a strike rate of over 85% - that is reduce the number of negatives. |
| Smart Selection |
| As it is clear that you will not be generally able to attempt all 150 question, and you skip between 30 and 50 questions, key to success lies in selecting questions properly. Remember, every correct question carries the same 1-mark and each incorrect answer carries a one-third negative. Hence, there are no kudos, nobel prizes or awards waiting for attempting the tough questions. Be smart to choose, the easiest of the questions and the ones that you have practised a lot and smash them. Do not venture into unsafe territories or to questions which you only have a vague idea. |
| CAT and entrance tests of other top B Schools are a unique breed of entrance exams. They focus on testing some of the basic qualities essential for managers - the grit to work hard, smartness to choose the best alternative, quick thinking and above all perseverance. |
| Exams like IIT JEE test the depth of your knowledge, while the Civil Services exams test your width of knowledge. CAT evaluates your presence of mind and the ability to perform under pressure. You cannot prepare for CAT during the last 10 days, as one generally does for semester exams. A minimum of 3 to 9 months of regular preparation is essential. |
| IIM Address book |
|---|
| Indian Institute of Management, Ahmedabad Vastrapur, Ahmedabad 380 015, Gujarat. Phone : (079) 6324632 Fax : (079) 6306896 Website : http://www.iimahd.ernet.in/ |
| Indian Institute of Management, Calcutta Diamond Harbour Road, Joka, Kolkata (Calcutta) 700 104, West Bengal. Phone : (033) 4679178 Fax : (033) 4679178 Website : http://www.iimcal.ac.in/ |
| Indian Institute of Management, Bangalore Bannerghatta Road, Bangalore 560 076 Karnataka. Phone : (080) 6993188 , 6993013 Fax : (080) 6584050 Website : http://www.iimb.ernet.in/ |
| Indian Institute of Management, Indore Rajendra Nagar Indore 452 012, Madhya Pradesh. Phone : (0731) 321971, 321973 Fax : (0731) 321050 Website : http://iimidr.ac.in/ |
| Indian Institute of Management, Kozhikode P. O. Calicut REC, Calicut 673 601, Kerala. Phone (0495) 288106, 287297, 287553 Fax (0495) 288106, 287580 Website : http://www.iimk.ac.in/ |
| Indian Institute of Management, Lucknow Prabandh Nagar, Off Sitapur Road, Lucknow 226 013, Uttar Pradesh. Phone : (0522) 361889, 361891, 361895 Fax : (0522) 361843 Website : http://www.iiml.ac.in/ |
| Graduate Aptitude Test in Engineering (GATE) | ||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
GATE Score Card
|
| CS - COMPUTER SCIENCE AND
ENGINEERING ENGINEERING MATHEMATICS Mathematical Logic: Propositional Logic; First Order Logic. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics. Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima. THEORY OF COMPUTATION Formal Languages and Automata Theory: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Un-decidability; Analysis of Algorithms and Computational Complexity: Asymptotic analysis (best, worst, average case) of time and space, Upper and lower bounds on the complexity of specific problems, NP-completeness. COMPUTER HARDWARE Digital Logic: Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits; Number representation and Computer Arithmetic (fixed and floating point); Computer Organization: Machine instructions and addressing modes, ALU and Data-path, hardwired and micro-programmed control, Memory interface, I/O interface (Interrupt and DMA mode), Serial communication interface, Instruction pipelining, Cache, main and secondary storage. SOFTWARE SYSTEMS Data structures: Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph; Programming Methodology: C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming; Algorithms for problem solving: Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer); Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, Linking (static and dynamic); Operating Systems: Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security. Databases: Relational model (ER-model, relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B+ trees), Transactions and concurrency control; Computer Networks: ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet, Token ring), TCP/UDP, IP, Basic concepts of switches, gateways, and routers. |
| EC - ELECTRONICS AND COMMUNICATION
ENGINEERING ENGINEERING MATHEMATICS Linear Algebra: Matrix Algebra, Systems of linear equations, Eigen values and eigen vectors. 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, Surface and Volume integrals, Stokes, Gauss and Green's theorems. Differential equations: First order equation (linear and nonlinear), Higher order linear differential equations with constant coefficients, Method of variation of parameters, Cauchy's and Euler's equations, Initial and boundary value problems, Partial Differential Equations and variable separable method. Complex variables: 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. Numerical Methods: Solutions of non-linear algebraic equations, single and multi-step methods for differential equations. Transform Theory: Fourier transform, Laplace transform, Z-transform. ELECTRONICS & COMMUNICATION ENGINEERING Networks: 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 network parameters: driving point and transfer functions. State equations for networks. Electronic Devices: Energy bands in silicon, intrinsic and extrinsic silicon. Carrier transport in silicon: diffusion current, drift current, mobility, resistivity. Generation and recombination of carriers. p-n junction diode, Zener diode, tunnel diode, BJT, JFET, MOS capacitor, MOSFET, LED, p-I-n and avalanche photo diode, LASERs. Device technology: integrated circuits fabrication process, oxidation, diffusion, ion implantation, photolithography, n-tub, p-tub and twin-tub CMOS process. Analog Circuits: Equivalent circuits (large and small-signal) of diodes, BJTs, JFETs, and MOSFETs. Simple diode circuits, clipping, clamping, rectifier. Biasing and bias stability of transistor and FET amplifiers. Amplifiers: single-and multi-stage, differential, operational, feedback and power. Analysis of amplifiers; 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. Power supplies. Digital circuits: Boolean algebra, minimization of Boolean functions; logic gates digital IC families (DTL, TTL, ECL, MOS, CMOS). Combinational circuits: arithmetic circuits, code converters, multiplexers and decoders. 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, z-transform. Sampling theorems. Linear Time-Invariant (LTI) Systems: definitions and properties; casuality, stability, impulse response, convolution, poles and zeros 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. Controls Systems: Basic control system components; block diagrammatic description, reduction of block diagrams. Open loop and closed loop (feedback) systems and stability analysis of these systems. Signal flow graphs and their use in determining transfer functions of systems; transient and steady state analysis of LTI control systems and frequency response. Tools and techniques for LTI control system analysis: root loci, Routh-Hurwitz criterion, Bode and Nyquist plots. Control system compensators: elements of lead and lag compensation, elements of Proportional-Integral-Derivative(PID) control. State variable representation and solution of state equation of LTI control systems. Communications: 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. Digital communication systems: pulse code modulation (PCM), differential pulse code modulation (DPCM), delta modulation (DM); digital modulation schemes-amplitude, phase and frequency shift keying schemes (ASK, PSK, FSK), matched filter receivers, bandwith consideration and probability of error calculations for these schemes. Electromagnetics: Elements of vector calculus: divergence and curl; Gauss' and Stokes' theorems, Maxwell's equations: differential and integral forms. Wave equation, Poynting vector. Plane waves: propagation through various media; reflection and refraction; phase and group velocity; skin depth. Transmission lines: characteristic impedance; impedance transformation; Smith chart; impedance matching; pulse excitation. Waveguides: modes in rectangular waveguides; boundary conditions; cut-off frequencies; dispersion relations. Antennas: Dipole antennas; antenna arrays; radiation pattern; reciprocity theorem, antenna gain. |
| IT - INFORMATION
TECHNOLOGY ENGINEERING MATHEMATICS Mathematical Logic: Propositional Logic; First Order Logic. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics. Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima. FORMAL LANGUAGES AND AUTOMATA Regular Languages: finite automata, regular expressions, regular grammar. Context free languages: push down automata, context free grammars COMPUTER HARDWARE Digital Logic: Logic functions, minimization, design and synthesis of combinatorial and sequential circuits, number representation and computer arithmetic (fixed and floating point) Computer organization: Machine instructions and addressing modes, ALU and data path, hardwired and microprogrammed control, memory interface, I/O interface (interrupt and DMA mode), serial communication interface, instruction pipelining, cache, main and secondary storage SOFTWARE SYSTEMS Data structures and Algorithms: the notion of abstract data types, stack, queue, list, set, string, tree, binary search tree, heap, graph, tree and graph traversals, connected components, spanning trees, shortest paths, hashing, sorting, searching, design techniques (greedy, dynamic, divide and conquer), asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, intractability Programming Methodology: C programming, program control (iteration, recursion, functions), scope, binding, parameter passing, elementary concepts of object oriented programming Operating Systems (in the context of Unix): classical concepts (concurrency, synchronization, deadlock), processes, threads and interprocess communication, CPU scheduling, memory management, file systems, I/O systems, protection and security 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. Databases: relational model, database design, integrity constraints, normal forms, query languages (SQL), file structures (sequential, indexed), b-trees, transaction and concurrency control Data Communication: data encoding and transmission, data link control, multiplexing, packet switching, LAN architecture, LAN systems (Ethernet, token ring), Network devices: switches, gateways, routers Networks: ISO/OSI stack, sliding window protocols, routing protocols, TCP/UDP, application layer protocols & systems (http, smtp, dns, ftp), network security Web technologies: three tier web based architecture; JSP, ASP, J2EE, .NET systems; html, XML |
