Monday, June 30, 2008

GATE 2009 EC-Electronics and Communication Engineering Syllabus

Electronics and Communication Engineering - EC

 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's 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 AND 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, and 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, Basics of LASERs. Device technology: integrated circuits fabrication process, oxidation, diffusion, ion implantation, photolithography, n-tub, p-tub and twin-tub CMOS process.

 

Analog Circuits: 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.

 

Control 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: 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.

 

Electromagnetics: Elements of vector calculus: divergence and curl; Gauss's and Stokes's 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; S parameters, pulse excitation. Waveguides: modes in rectangular waveguides; boundary conditions; cut-off frequencies; dispersion relations. Basics of propagation in dielectric waveguide and optical fibers. Basics of Antennas: Dipole antennas; radiation pattern; antenna gain.


NOTE:HOW TO PREPARE FOR GATE EXAM?
GATE PRACTICE PAPERS

NOTE:
The Ultimate solution to get rid of all the personal problems:click here to see the solution

Sunday, June 29, 2008

GATE 2009 EE-Electrical Engineering Syllabus

Electrical Engineering - EE

 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's 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.

 

ELECTRICAL ENGINEERING 

Electric Circuits and Fields: Network graph, KCL, KVL, node and mesh analysis, transient response of dc and ac networks; sinusoidal steady-state analysis, resonance, basic filter concepts; ideal current and voltage sources, Thevenin's, Norton's and Superposition and Maximum Power Transfer theorems, two-port networks, three phase circuits; Gauss Theorem, electric field and potential due to point, line, plane and spherical charge distributions; Ampere's and Biot-Savart's laws; inductance; dielectrics; capacitance.

 

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; Fourier, Laplace and Z transforms.

 

Electrical Machines: Single phase transformer - equivalent circuit, phasor diagram, tests, regulation and efficiency; three phase transformers - connections, parallel operation; auto-transformer; energy conversion principles; DC machines - types, windings, generator characteristics, armature reaction and commutation, starting and speed control of motors; three phase induction motors - principles, types, performance characteristics, starting and speed control; single phase induction motors; synchronous machines - performance, regulation and parallel operation of generators, motor starting, characteristics and applications; servo and stepper motors.

 

Power Systems: Basic power generation concepts; transmission line models and performance; cable performance, insulation; corona and radio interference; distribution systems; per-unit quantities; bus impedance and admittance matrices; load flow; voltage control; power factor correction; economic operation; symmetrical components; fault analysis; principles of over-current, differential and distance protection; solid state relays and digital protection; circuit breakers; system stability concepts, swing curves and equal area criterion; HVDC transmission and FACTS concepts.

 

Control Systems: Principles of feedback; transfer function; block diagrams; steady-state errors; Routh and Niquist techniques; Bode plots; root loci; lag, lead and lead-lag compensation; state space model; state transition matrix, controllability and observability.

 

Electrical and Electronic Measurements: Bridges and potentiometers; PMMC, moving iron, dynamometer and induction type instruments; measurement of voltage, current, power, energy and power factor; instrument transformers; digital voltmeters and multimeters; phase, time and frequency measurement; Q-meters; oscilloscopes; potentiometric recorders; error analysis.

 

Analog and Digital Electronics: Characteristics of diodes, BJT, FET; 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; Schmitt trigger; multi-vibrators; sample and hold circuits; A/D and D/A converters; 8-bit microprocessor basics, architecture, programming and interfacing.

 

Power Electronics and Drives: Semiconductor power diodes, transistors, thyristors, triacs, GTOs, MOSFETs and IGBTs - static characteristics and principles of operation; triggering circuits; phase control rectifiers; bridge converters - fully controlled and half controlled; principles of choppers and inverters; basis concepts of adjustable speed dc and ac drives.


NOTE:HOW TO PREPARE FOR GATE EXAM?
GATE PRACTICE PAPERS

NOTE:
The Ultimate solution to get rid of all the personal problems:click here to see the solution

Thursday, June 26, 2008

RESOURCES(Mozilla Firefox Extensions)

1)Stop Autoplay addons.mozilla.org/en-us/firefox/addon/1765
2)PANIC:addons.mozilla.org/en-us/firefox/addon/6367
3)TabRenamizer: addons.mozilla.org/en-us/firefox/addon/2987
4)Fast Video Downloder: addons.mozilla.org/en-us/firefox/addon/3590
5)Download Helper: addons.mozilla.org/en-us/firefox/addon/3006
6)File Uploader: www.fileuploader.com
7)File FTP: addons.mozilla.org/en-us/firefox/addon/684
8)ChatZilla: chatzilla.hacksrus.com
9)News Fox: addons.mozilla.org/en-us/firefox/addon/629
10)Free Access Plus: addons.mozilla.org/en-us/firefox/addon/6139

Tuesday, June 24, 2008


MBA ENTRANCE TESTS in India

MBA Entrance Tests are as follows:
CAT,MAT,XAT,CET,JMET,ATMA......

FOR FURTHER DETAILS CLICK HERE:
http://www.indianmba.com/Entrance_Test/entrance_test.html

thanx for visiting.
PREPARE WELL.
ALL THE BEST.

Saturday, June 14, 2008

MBA ENTRANCE JMET(Joint Management Entrance Test) DETAILS

Application/Registration Process:

There are two different processes by which a candidate can apply/register for JMET 200(9), namely, OFFLINE(by Post) and ONLINE(Internet based). Details of these processes are given under How-to-Apply. The registration-cum-application fee for offline applications is Rs.800/- for General candidates and Rs.400/- for SC/ST candidates. The fee for online application is Rs. 750/- for General candidates and Rs. 350/- for SC/ST candidates. The registration-cum-application fee is not refundable and the application form is not transferable.

Candidates can appear in the examination only against valid admit cards. Candidates generally receive Admit Cards by last week of November. If they do not receive it by December 1, they should contact GATE Office.

Participating Institutes:

Institute Name Management Schools/Department Website

IISc Bangalore Department of Management Studies
IIT Bombay Shailesh J. Mehta School of Management
IIT Delhi Department of Management Studies
IIT Kanpur Department of Industrial & Management Engineering
IIT Kharagpur Vinod Gupta School of Management
IIT Madras Department of Management Studies
IIT Roorkee Department of Management Studies

How to Apply:

There are two different ways by which candidates can apply for JMET, namely Online Registration and Offline Registration. Detailed information about Offline Registration is given below. (for online registration visit respective institute site)

Offline Registration:

Details of the Offline Registration Process:

Application fee: Rs. 800 for general category and Rs. 400 for SC/ST category.
For sending the application by post (OFFLINE submission), JMET 200(9) brochure and application form can be obtained by post from the GATE office of the zone OR in person through cash payment from the Bank (Bank details of respective IISc and IITs are given below) of the zone in which the test city, selected by the candidate, is located. The request, accompanied by two self-addressed slips and a demand draft for Rs.800/- (Rs.400/- for SC/ST categories) drawn in favour of the Institute concerned, has to be sent to the Chairman of the respective GATE office.

The application fee is not refundable.

Paper Structure:

The JMET 2007 will be of 2 hours duration. The test will consist of 150 questions (objective / multiple choice type) in the following sections:

1. Verbal Communication
2. Logical Reasoning
3. Quantitative Ability
4. Data Interpretation

There is negative marking for incorrect answers. For a wrong answer to a question, 25% of the marks allotted to that question will be deducted. Moreover, for a candidate to be qualified in JMET 200(9), he/she should, not only, secure certain minimum marks in the test paper, but also, should necessarily obtain certain minimum marks in each of the four sections stated above.

For sample question on all for sections visit : http://www.iitd.ac.in/jmet/paperstruct.htm

General instructions:

1. You should be in your assigned seat at the Test Centre latest by 10:00 hrs.

2. You should bring the following to the Test Centre:
i) Your Test Admit Card, without which you will not be allowed to take the test.
ii) Pen/ball pen, HB pencil(s), eraser(s) and sharpener(s).

Calculators, electronic diaries, cell phones and similar electronic gadgets will not be allowed in the examination hall.

3. The test begins with the distribution of the Test Booklets. When you get the Test Booklet, make sure that the Booklet is in sealed condition. If the seal is found broken or tampered with, please bring this matter immediately to the notice of the invigilator.

4. Do not break the seal of the Test Booklet till you are told to do so.

5. Without breaking the seal, take out the Objective Response Sheet (ORS) from the Test Booklet and verify that it has the same code printed on it in large letters as on the cover of the Test Booklet. If the two codes do not match, or the Test Booklet does not contain the ORS, the Test Booklet must be exchanged immediately with a new sealed Test Booklet. The candidate must not mark the answers on an ORS having a code different from the code printed on the Test Booklet.

6. Fill in all the information required in the right hand side of the ORS and sign where indicated using pen/ball pen. Use HB pencil for darkening the oval bubbles corresponding to your Registration Number on the ORS. Use extreme caution in filling the appropriate bubbles. Information on the right half of the ORS should be written in ink wherever indicated. No distinctive mark of any sort is to be put anywhere on the ORS.

7. Open the seal of the Test Booklet only after having been instructed to do so by the invigilator. Each section contains several items / questions. You should read the directions for each section of the test carefully.

8. The left hand side of the ORS must be filled in with HB pencil only. The answers to the questions are to be marked by darkening the bubbles corresponding to the letters A, B, C or D. A soft eraser should be used for erasing any darkened bubble if required.

9. Nothing should be written either in ink or in pencil, in the space used for printing the Barcode on the ORS. If the candidate tampers with the Barcode, he/she will be disqualified.

10. All the rough work should be done only on the blank pages of the Test Booklet. No extra papers will be provided.

11. Once the test starts, you will not be allowed to leave the examination hall for any reason till the test is over and all other formalities are completed.

12. You should remain seated after completing the test. The invigilator will collect the ORS. You will be allowed to leave the hall only after the ORS, from all the candidates, in your hall have been collected and accounted for.

Candidates found violating the instructions of the Test / Invigilator, will be disqualified. Any candidate giving assistance or seeking / receiving help from any source in answering questions or copying in any manner in the test will forfeit his/ her chance of being considered for admission.

Note: In all matters concerning JMET 2007, the decision of the Institutes will be final and binding on the applicant.

The test requires knowledge of basic mathematics (arithmetic, algebra, matrices, trigonometry, mensuration, plane and co-ordinate geometry, calculus, set theory, probability and statistics etc.), and English.

NOTE:
The Ultimate solution to get rid of all the personal problems:click here to see the solution

For More Details CLICK HERE: http://www.indianmba.com

GATE 2009 Information Technology(IT) Syllabus

IComputer Science & Information Technology - CS


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.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

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.

Algorithms: 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, NP-complete.

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: 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.

Computer Networks: 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.

Web technologies: HTML, XML, basic concepts of client-server computing.

NOTE:HOW TO PREPARE FOR GATE EXAM?
GATE PRACTICE PAPERS
GATE GUIDE EXCLUSIVELY FOR CS/IT

NOTE:
The Ultimate solution to get rid of all the personal problems:click here to see the solution

GATE 2009 Computer Science(CS) Syllabus

Computer Science & Information Technology - CS


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.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

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.

Algorithms: 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, NP-complete.

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: 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.

Computer Networks: 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.

Web technologies: HTML, XML, basic concepts of client-server computing.

NOTE:HOW TO PREPARE FOR GATE EXAM?
GATE PRACTICE PAPERS
GATE GUIDE EXCLUSIVELY FOR CS/IT

NOTE:
The Ultimate solution to get rid of all the personal problems:click here to see the solution

MBA Entrance Exam CAT 2009 DETAILS

Common Admission Test (CAT)

CAT is an Common Admission Test (CAT) conducted by the IIMs for admission to their Post Graduate Programs in Management (PGP).

The CAT is held once every year around November. Besides the IIMs, many other management institutes accept the CAT score for admission to their management programs.


For CAT 2006 results click here( http://www.indianmba.com/Results/results.html)

CAT 2006 - Structure :

Overall Test: 3 sections, 2 sub-sections per section - 90 questions
Section I: Problem Solving - 30 questions
Section II: Verbal Ability and Reading Comprehension - 30 questions
Section III: Data Interpretation and Logical Reasoning - 30 questions

CAT 2009 SYLLABUS:

Arithmetic:
Number Systems and Number Theory - Practice Questions
Percentages - Details | Sample Test | Practice Questions
Profit and Loss - Details | Sample Test | Practice Questions
Interest - Practice Questions
Speed, Time and Distance - Practice Questions
Pipes and Cisterns - Practice Questions
Races - Practice Questions
Averages - Practice Questions
Ratio, Proportion - Practice Questions
Mixtures and Alligations - Practice Questions

Algebra:
Linear and Quadratic Equation - Practice Questions
Logarithm
Progressions - AP, GP, HP
Binomial Theorem
Inequalities
Permutation & Combination
Probability
Function
Set Theory

Geometry:
Geometry
Co ordinate Geometry
Trigonometry
Mensuration

NOTE:
The Ultimate solution to get rid of all the personal problems:click here to see the solution

For More Details CLICK HERE: http://www.indianmba.com

ALL THE BEST
PREPARE WELL AND GET SUCCESS


Your Ad Here
Custom Search

Enter your email address:

Delivered by FeedBurner