Video Lecture Series on Mathematics - III by Dr.P.N.Agrawal, Department of Mathematics, IIT Roorkee.

1 - Solution of ODE of First Order and First Degree [53:50]
2 - Linear Differential Equations of the First Order [50:03]
3 - Approximate Solution of An Initial Value [49:50]
4 - Series Solution of Homogeneous Linear [1:01:15]
5 - Series Solution of Homogeneous Linear [50:56]
6 - Bessel Functions and Their Properties [51:10]
7 - Bessel Functions And Their Properties(Contd..) [52:31]
8 - Laplace Transformation [53:26]
9 - Laplace Transformation(contd..) [55:58]
10 - Applications Of Laplace Transformation [59:53]
11 - Applications Of Laplace Transformation(Contd.) [59:23]
12 - One Dimensional Wave Equation [54:08]
13 - One Dimensional Heat Equation [55:28]

These video lectures are delivered by Prof P.N.Agrawal, Department of Mathematics, IIT Roorkee as a part of NPTEL project. After listening to these videos courses kindly post your comments and doubts.

Detailed Syllabus

COURSE OUTLINE

Sl no.	Topics and Contents	No of lectures	No of Modules
1	Complex Numbers and Complex Algebra: Geometry of complex numbers, Polar form, Powers and roots of complex numbers.	1	1
2	Complex Functions: Limits of Functions, Continuity, Differentiability, Analytic functions, Cauchy-Riemann Equations, Necessary and Sufficient condition for analyticity, Properties of Analytic Functions, Laplace Equation, Harmonic Functions, Finding Harmonic Conjugate functions	5	1
3	Elementary Analytic Functions: Exponential, Trigonometric, Hyperbolic functions and its properties. Multiple valued function and its branches - Logarithmic function and Complex Exponent function.	4	1
4	Complex Integration: Curves, Line Integrals (contour integral) and its properties. Line integrals of single valued functions, Line integrals of multiple valued functions (by choosing suitable branches). Cauchy-Goursat Theorem, Cauchy Integral Formula, Liouville, FTA, Max/Min Modulus Theorems.	5	1
5	Power Series: Convergence (Ordinary, Uniform, Absoulte) of power series, Taylor and Laurent Theorems, Finding Laurent series expansions.	2	1
6	Zeros, Singularities, Residues: Zeros of analytic functions, Singularities and its properties, Residues, Residue Theorem, Rouche’s Theorem, Argument Principle.	2	1
7	Applications of Contour Integration: Evaluating various type of indefinite real integrals using contour integration method.	4	1
8	Conformal Mapping and its applications: Mappings by elementary functions, Mobius transformations, Schwarz-Christofel transformation, Poisson formula, Dirichlet and Neumann Problems.	5	1
9	Solution in Series: Second order linear equations with ordinary points, Legendre equation, Second order equations with regular singular points, The method of Frobenius, Bessel equation.	4	1
10	Properties of Legendre Polynomials and Bessel Functions	2	1
11	Fourier Series: Orthogonal Family, Fourier Series of 2? periodic functions, Formula for Fourier Coefficients, Fourier series of Odd and Even functions, Half-range series, Fourier series of a T-periodic function, Convergence of Fourier Series, Gibb’s Phenomenon, Differentiation and Integration of Fourier series, Complex form of Fourier series.	4	1
12	Fourier Transforms: Fourier Integral Theorem, Fourier Transforms, Properties of Fourier Transform, Convolution and its physical interpretation, Statement of Fubini’s theorem, Convolution theorems, Inversion theorem, Laplace Transform.	4	1
13	Second order PDE: Second order PDE and classification of 2nd order quasi-linear PDE (canonical form)	1	1
14	Wave Equation: Modeling a vibrating string, D’Alembert’s solution, Duhamel’s principle for one-dimensional wave equation.	2	1
15	Heat Equation: Heat equation, Solution by separation of variables.	2	1
16	Laplace Equation: Laplace Equation in Cartesian, Cylindrical polar and Spherical polar coordinates, Solution by separation of variables.	3	1
17	Solution by Transform Methods: Solutions of PDEs by Fourier and Laplace Transform methods.	2	1

Video Lecture Series on Mathematics - II by Dr.Tanuja Srivastava, Department of Mathematics, IIT Roorkee

1 -Differential Equation Part - 1
2 -Differential Equation Part - 2
3 - Differential Equation of First Order
4 - Linear Differential Equation of Second Order Part - 1
5 - Linear Differential Equation of Second Order Part - 2
6 - Euler Cauchy Equation
7 - Higher Order Linear Differential Equations
8 - Higher Order Non Homogeneous Linear Differential Equation
9 - Boundary Value Problems
10 - Strum Liouville Boundary Value Problem
11 - Fourier Series Part - 1
12 - Fourier Series Part - 2
13 - Convergence and Sum of Fourier Series
14 - Fourier Integrals
15 - Fourier Transforms
16 - First Order Partial Differential Equations
17 - Partial Differential Equations
18 - Second Order Partial Differential Equations
19 - Second Order Partial Differential Equations
20 - Solution of One Dimensional Wave Equation

21 - Complex Integration
22 - Solution of Homogeneous and Non Homogeneous
23 - Contour Integration
24 - Fourier Integral and Transform Method
25 - Three Dimensional Laplace Equation
26 - Numerical Method for Laplace and Poisson
27 - Solution of Dirichlet Problem
28 - ADI Method for Laplace and Poisson Equation

29 - Cauchy's Integral Theorem

30 - Cauchy's Integral Formula
31 - Application of Cauchy Integral Formula
32 - Residue Integration Method
33 - Zeros, Singularities and Poles
34 - Residue Theorem
35 - Evaluation of Real Integrals
36 - Evaluation of Real Improper Integrals
37 - Evaluation of Real Improper Integrals - 2
38 - Evaluation of Real Improper Integrals - 3
39 - Evaluation of Real Improper Integrals - 4
40 - Evaluation of Real Integrals - Revision
41 - Matrix Algebra Part - 1
42 - Matrix Algebra Part - 2

43 - Determinants Part - 1
44 - Determinants Part - 2
45 - Lec 5 Solution of System Equation

46 - Linear Algebra Part-1
47 - Linear Algebra part - 2

Video Lecture series on Mathematics-1 by Prof S.K.Ray, Department of Mathematics and Statistics IIT Kanpur

1 - Real Number [56:59]

2 - Sequences I [54:48]
3 - Sequences II [44:02]
4 - Sequences III [52:02]
5 - Continuous Function [55:09]
6 - Properties of Continuous Function [01:01:04]
7 - Uniform Continuity [59:46]
8 - Differntiable Functions [55:21]
9 - Mean Value Theorem [50:18]
10 - Maxima - Minima [54:44]
11 - Taylor's Theorem [53:09]
12 - Curve Sketching [46:04]
13 - Infinite Series I [53:52]
14 - Infinite Series II [51:25]
15 - Tests of Convergence [55:48]

16 - Power Series [53:19]
17 - Riemann Integral [53:43]
18 - Riemann Integrable Functions [59:42]
19 - Applications of Riemann Integral [52:05]

20 - Length of a curve [57:52]
21 - Line Integrals [56:20]
22 - Functions of Several Variables [56:22]
23 - Differentiation [01:00:19]
24 - Derivatives [55:20]
25 - Mean Value Theorem [52:01]
26 - Maxima Minima [57:10]
27 - Method of Lagrange Multipliers [50:02]
28 - Multiple Integrals [52:16]
29 - Surface Integrals [59:53]
30 - Green's Theorem [52:34]
31 - Stokes Theorem [53:56]
32 - Guass Divergence Theorem [36:41]

Video lecture for Design and Analysis of Algorithms

Design and Analysis of Algorithms

1 - Overview of the course [51:51]
2 - Framework for Algorithms Analysis [56:21]
3 - Algorithms Analysis Framework - II [53:11]
4 - Asymptotic Notations [53:25]
5 - Algorithm Design Techniques : Basics [46:23]
6 - Divide And Conquer-I [52:09]
7 - Divide And Conquer -II Median Finding [52:55]
8 - Divide And Conquer -III Surfing Lower Bounds [56:48]
9 - Divide And Conquer -IV Closest Pair [1:03:38]
10 - Greedy Algorithms -I [51:18]
11 - Greedy Algorithms - II [53:58]
12 - Greedy Algorithms - III [50:43]
13 - Greedy Algorithms - IV [36:44]
14 - Pattern Matching - I [54:08]
15 - Pattern Matching - II [45:02]
16 - Combinational Search and Optimization I [54:40]
17 - Combinational Search and Optimization II [54:08]
18 - Dynamic Programming [52:18]
19 - Longest Common Subsequences [58:58]
20 - Matric Chain Multiplication [51:25]
21 - Scheduling with Startup and Holding Costs [54:01]
22 - Average case Analysis of Quicksort [48:16]
23 - Bipartite Maximum Matching [51:29]
24 - Lower Bounds for Sorting [48:39]
25 - Element Distinctness Lower Bounds [54:26]
26 - NP-Completeness-I -Motivation [58:15]
27 - NP - Compliteness - II [1:16:38]
28 - NP-Completeness - III [57:23]
29 - NP-Completeness - IV [1:10:10]
30 - NP-Completeness - V [41:18]
31 - NP-Completeness - VI [40:57]
32 - Approximation Algorithms [55:02]
33 - Approximation Algorithms [58:12]
34 - Approximation Algorithms for NP [53:38]

Video lecture for Database Design

Database Design

1 - Introduction to Database Management System [53:32]
1a - Conceptual Designs [53:40]
2 - Conceptual Designs [54:00]
3 - Relational Model [51:34]
4 - Relational Model [54:09]
5 - Structured Query Language [52:13]
6 - Structured Query Language II [54:57]
7 - ER Model to Relational Mapping [51:06]
8 - Functional Dependencies and Normal Form [57:52]
9 - ER Model to Relational Model Mapping [50:52]
10 - Storage Structures [54:55]
11 - Indexing Techniques Single Level [56:52]
12 - Indexing Techniques Multi-Level [56:25]
13 - Constraints and Triggers [57:30]
14 - Query Processing and Optimization [56:41]
15 - Query Processing and Optimization II [56:55]
16 - Query Processing and Optimization - III [57:19]
17 - Transaction Processing Concepts [55:31]
18 - Transaction Processing and Database Manager [51:47]
19 - Foundation for Concurrency Control [57:45]
20 - Concurrency Control Part - I [58:25]
21 - Concurrency Control Part - 2 [59:08]
22 - Concurrency Control Part - 3 [57:48]
23 - Concurrency Control Part - 4 [58:58]
24 - Distributed Transaction Models [58:25]
25 - Basic 2-Phase and 3-phase commit protocol [57:12]
26 - Concurrency Control for Distributed Transaction [58:23]
27 - Introduction to Transaction Recovery [55:23]
28 - Recovery Mechanisms II [57:10]
29 - Recovery Mechanisms III [55:43]
30 - Introduction to Data Warehousing and OLAP [57:49]
31 - Introduction to Data Warehousing and OLAP [58:11]
32 - Case Study : MYSQL [57:55]
33 - Case Study ORACLE and Microsoft Access [57:52]
34 - Data Mining and Knowledge Discovery [54:46]
35 - Data Mining and Knowledge Discovery Part II [57:59]
36 - Object Oriented Databases [57:49]
37 - Object Oriented Databases II [56:39]
38 - XML - Introductory Concepts [57:51]
39 - XML Advanced Concepts [57:40]
40 - XML Databases [58:12]
41 - Case Study - Part One Database Design [53:43]
42 - Case Study - Part 2 Database Design [58:36]

Video lecture for Operating System

Operating System

1 - Introduction to Operating System [51:42]
2 - Mutual Exclusion with Busy Wait [51:42]

Video Lecture Series on Computer Networks by Prof. S.Ghosh,Department of Computer Science & Engineering, I.I.T.,Kharagpur.

1 - Emergence of Networks & Reference Models [59:48]
2 - Network Topology [59:49]
3 - Physical Medium - I [59:52]
4 - Physical Medium - II [59:55]
5 - Multiplexing (Sharing a Medium) [59:53]
6 - Telecom Networks [59:54]
7 - Switches - I [59:50]
8 - Pocket Switches [59:44]
9 - SONET/SDH [59:59]
10 - Fiber Optic Components [59:51]
11 - Routing and Wavelength Assignment [59:53]
12 - Protection and Restoration [59:48]
13 - Multiple Access [59:50]
14 - Token Based Mac [59:52]
15 - Data Link Protocols [59:53]
16 - Error Control [59:49]
17 - Stop & Wait Protocol [59:50]
18 - Satellite Communication [59:51]
19 - Ethernet - CSMA/CD [59:46]
20 - Modern Ethernet [59:52]
21 - Local Internetworking [59:49]
22 - Cellular Networks [59:51]
23 - Wireless Network [59:54]
24 - ATM : Asynchronous Transfer Mode [59:49]
25 - ATM Signaling, Routing and LAN Emulation [59:41]
26 - Introduction to Routing [59:47]
27 - RIP - Distance Vector Routing [59:45]
28 - IP version 4 [59:39]
29 - IP Version 6 & Mobile IP [59:46]
30 - UDP & Client Server [59:53]
31 - TCP [59:51]
32 - IP Multicasting [59:55]
33 - DHCP and ICMP [59:53]
34 - DNS & Directory [59:49]
35 - Congestion Control [59:48]
36 - QOS & Multimedia [59:55]
37 - Network Management [59:55]
38 - Security [59:50]
39 - FTP - SMTP [59:40]
40 - HTTP [59:48]
These video lectures are delivered by IIT professors as a part of NPTEL project.

Detailed Syllabus

Overview of OSI reference model. Topology design, Media Access Control Level, Services, Problems and protocols, Practical local area network design and implementation. IEEE LAN Standards, Logical Link Control protocols, HDLC, ALOHA, SLOTTED ALOHA, FDDI, Client Server model and related softwares.

Network Layer level services, problems and protocols. WAN, MAN, interconnection networks related softwares, TCP/IP, Novel NetWare, Routers, Bridges and Gateways their Practical implementation aspects. X.25, Internet and related softwares NETSCAPE and MOSAIC.

Transport layer, services, problems and their protocol.

Brief functioning of upper layers, E-mail and other application.

Video Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi

Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi

1 - Introduction to Data Structures and Algorithms [53:31]
2 - Stacks [01:04:09]
3 - Queues and Linked Lists [01:00:35]
4 - Dictionaries [53:43]
5 - Hashing [01:01:22]
6 - Trees [43:14]
7 - Tree Walks / Traversals [51:10]
8 - Ordered Dictionaries [56:17]
9 - Deletion [58:32]
10 - Quick Sort [58:44]
11 - AVL Trees [53:41]
12 - AVL Trees [01:00:19]
13 - Trees [49:11]
14 - Red Black Trees [01:04:33]
15 - Insertion in Red Black Trees [48:34]
16 - Disk Based Data Structures [42:36]
17 - Case Study: Searching for Patterns [01:02:01]
18 - Tries [01:01:35]
19 - Data Compression [45:46]
20 - Priority Queues [49:46]
21 - Binary Heaps [41:52]
22 - Why Sorting [48:27]
23 - More Sorting [58:00]
24 - Graphs [56:45]
25 - Data Structures for Graphs [57:48]
26 - Two Applications of Breadth First Search [53:24]
27 - Depth First Search [53:46]
28 - Applications of DFS [59:32]
29 - DFS in Directed Graphs [53:08]
30 - Applications of DFS in Directed Graphs [38:45]
31 - Minimum Spanning Trees [58:51]
32 - The Union [55:14]
33 - Prims Algorithm for Minimum Spanning Trees [01:01:15]
34 - Single Source Shortest Paths [58:58]
35 - Correctness of Dijkstras Algorithm [55:59]
36 - Single Source Shortest Paths [57:42]
These video lectures are delivered by IIT professors as a part of NPTEL project.

Detailed Syllabus

Data Structures

Course objective: The objective of the course is to familiarize students with basic data structures and their use in fundamental algorithms.

Course contents:
Introduction to object oriented programming through stacks,
queues and linked lists.
Dictionaries: skip-lists, hashing, analysis of collision resolution techniques.
Trees, traversals, binary search trees, optimal and average BST’s. 2-4 trees and red-black trees. Tries and pattern matching.
Priority queues and binary heaps. Sorting: merge, quick, radix, selection, heap.
Graphs, Breadth first search and connected components. Depth first search in
directed and undirected graphs and strongly connected components.
Spanning trees: Prim's and Kruskal’s algorithm, union-find data structure. Dijkstra’s
algorithm for shortest paths, shortest path tree.
Directed acyclic graphs: topological sort and longest path.

Lecture outline with topics	no. of lectures
Introduction to object oriented programming through stacks, queues and linked lists	4
Dictionaries: skip-lists, hashing, analysis of collision resolution techniques Trees, traversals, binary search trees, optimal and average BST’s trees and red-black trees	5 6 4
Tries and pattern matching. Priority queues and binary heaps	5
Sorting: merge, quick, radix, selection, heap	3
Introduction to Graphs, Breadth first search and connected components	3
Depth first search in directed and undirected graphs and strongly connected components	3
Spanning trees: Prim's and Kruskal's algorithm, union-find datastructure.	4
Dijkstra's algorithm for shortest path. shortest path tree. Shortest and longest paths in directed acyclic graphs	5

Video Lecture Series on Digital Systems Design by Prof.D.Roychoudhury, Department of Computer Science and Engineering,IIT Kharagpur.

1 - Introduction to Digital Systems Design
------------------------------------------
1 - Introduction to Digital Systems Design [59:57]
2 - Introduction [59:55]
3 - Digital Logic - I [59:55]
4 - Digital Logic - II [59:55]
5 - Digital Logic - III [1:00:00]

2.- Digital Logic
-------------------
6 - Boolean Algebra [59:56]
7 - Boolean Algebra [1:00:03]
8 - Boolean Function Minimization [59:56]
9 - Boolean Function Minimization [59:50]
10 - Boolean Function Minimization [59:58]
11 - Hazzard Covers by K - Map [59:55]

3 - Combinational Circuit Design
---------------------------------------
12 - Combinational Circuit Design [59:51]
13 - Design of ADDER Circuits [1:00:00]
14 - Design of Subtractor Circuits [1:00:05]
15 - Digital of Common Digital Elements [59:51]
16 - Design of Complex Combinational Circuits [1:00:03]
17 - Design of Combinational Circuits [59:56]
18 - Combinational Logic Problem Design [59:54]
19 - Combinational Logic Design [59:57]
20 - Logic Design with PLA [59:55]

4 - Sequential Circuit Design
-----------------------------
21 - Synchronous Sequential Circuit Design [59:54]
22 - Design of Sequential Modules [59:56]
23 - Design of Registers and Counter [01:00:02]
24 - Finite State Machine Design [59:54]
25 - Finite State Machine Design and Optimization [59:58]

5 - Design of Programmable Logic
----------------------------------------
26 - Programmable Logic Devices [59:50]
27 - Programmable Logic Devices [59:57]
28 - Programmable Logic Devices [59:58]
29 - Design of Arithmetic Circuits [58:28]
30 - Design of Arithmetic Circuits [59:54]
31 - Design of Memory Circuits [01:00:02]

6 - Digital Computing
--------------------------

32 - Algorithmic State Machines Chart [59:55]
33 - Design of Computer Instruction Set and the CPU [59:55]
34 - Design of Computer Instruction Set and the CPU [01:00:02]
35 - Design of Computer Instruction Set and the CPU [01:00:02]
36 - Design of Computer Instruction Set and the CPU [59:59]
37 - Design of Computer Instruction Set and the CPU [59:55]
38 - Design of Computer Instruction Set and the CPU [59:58]
39 - Design of a Micro Programmed CPU [59:55]
40 - Digital System Design Current State of the Art [59:51]

Lecture Series on Computer Architecture by Prof. Anshul Kumar, Department of Computer Science & Engineering ,IIT Delhi.

Structure of Gate

Structure of Gate Keep track of everchanging GATE Syllabus. Inform the same to others too. The GATE 2008 examination consists of a single paper of 3 hours duration and carries a maximum of 150 marks. The question paper of GATE 2009 will be fully objective type. Candidates have to mark the correct choice by darkening the appropriate bubble against each question on an Objective Response Sheet (ORS). There will be negative marking for wrong answers. The deduction will be 25% of the marks allotted. A candidate will have to choose any one of the papers listed below: Paper Code Paper Code Aerospace Engg. AE Information Technology IT Agricultural Engg. AG Mathematics MA Architecture and Planning AR Mechanical Engg. ME Civil Engg. CE Mining Engg. MN Chemical Engg. CH Metallurgical Engg. MT Computer Science & Engg. CS Physics PH Chemistry CY Production & Industrial Engg. PI Electronics & Communication Engg. EC Pharmaceutical Sciences PY Electrical Engg. EE Textile Engg. & Fibre Science TF Geology & Geophysics GG Engineering Sciences XE Instrumentation Engg. IN Life Sciences XL Papers XE and XL are of general nature and will comprise the following Sections: Engineering Sciences (XE) Life Sciences (XL) Section Code Section Code Engg. Mathematics (Compulsory) (A) Chemistry (Compulsory) (J) Computational Science (B) Biochemistry (K) Electrical Sciences (C) Biotechnology (L) Fluid Mechanics (D) Botany (M) Materials Science (E) Microbiology (N) Solid Mechanics (F) Zoology (O) Thermodynamics (G) PolymerScience and Enginerring (H) Food Technology (H) Candidates appearing in XE or XL papers are required to answer three sections . Sections (A) and (H) are compulsory in XE and XL respectively. Candidates can choose any two out of the remaining sections mentioned against the respective papers. The choice of the appropriate paper is the responsibility of the candidate. However, some guidelines are suggested below: Candidates are expected to appear in a paper appropriate to the discipline of their qualifying degree. However, the candidates are free to choose any paper according to their admission plan, keeping in mind the eligibility criteria of the admitting institute.

List of Colleges Providing M.Tech\M.E. Degree

List of Colleges Providing M.Tech\M.E. Degree The ethos of Engineering is not new to the Indian subcontinent. The Rustless Wonder- the Iron Pillar at Delhi, in the memory of Chandra Gupta Vikramaditya, is testimony to the advances made in metallurgy some 2000 years back. But yes the study of engineering was confined to few and the scope of engineering was certainly limited. But with the onset of development fuelled by science and technology and the growth of service sector Engineering as a career has attracted the student fraternity of the country in a big way. Number of aspirants taking the engineering exams are testimony to the fact. A large number of students take the Engineering Entrance Examination but few are aware of the various career options that engineering as a profession offers. NNE for the sake of apprising students of the same has compiled a list of various engineering options having a great deal of potential Agricultural Engineering Aeronautical Engineering Architecture Automobile Engineering Biomedical Engineering Biotechnology Ceramic Technology Chemical Engineers Civil Engineering Computer Engineering Environmental Engineering Electrical Engineering Electronics Engineering Genetic Engineering Industrial & Production Engineering Instrumentation Engineering Marine Engineering Mechanical Engineering Metallurgical Engineering Mining Engineering Petroleum Engineering Plastic Technology Polymer Engineering Rubber Technology Space Technology Textile Industry

GATE 2010 :- Some tips for preparation

After pursuing engineering, all engineering students stand at the crossroad of making a decisive choice so as to explore interesting avenues as a choice for their careers. A majority of people opt for mainly two things that are management or M.Tech. With the current economic scenario of the India, there are various colleges that are not able to give 100% placement to their students. This results in candidates making a tough choice between management and M.Tech. In order to get admission in M.Tech the examination that holds significant importance on national as well as international level is GATE. So, if you are the one seeking admission in post-graduation programmes in reputed engineering colleges and institutes in India, you need to crack GATE. Graduate Aptitude Test in Engineering (GATE), is an All-India examination that holds high significant and is conducted in eight zones across India by the GATE committee. The main objective of GATE test is to identify the quality of students and assess their potential to continue higher education. By conducting GATE, it becomes easy to evaluate the students on the required skill scale and consistency to pursue higher studies in the field of engineering. With the cut-throat competition, even those who save more than 85% in the GATE examination, lag behind in getting admissions into the reckoned institutions such as NITs and IITs. The questions of GATE are usually the derivation of fundamentals and preparation of GATE is an ongoing process and is supposed to take place in varied stages. Prepare your best with the fundamentals and then test yourself those fundamentals. There are students who prepare at home with the number of book options available in the market today. Then there are few aspirants who opt for correspondence coaching courses. A coaching material cannot be assessed until one goes through the same word by word. Hence GATE aspirants can go by some tips of their seniors. Those who are getting regular classroom coaching need to check whether the institute suits their requirement or not by considering some of the following parameters: • Distinct Study Material- Now-a-days all the coaching institutes offer study material for assistance in studies. But if this material simply copy paste or re-write of materials taken from other books then these hold minimal importance. In comparison to all this, there are several standard books on each subject by good authors which can make your study enjoyable as well as interesting. • Compilation of quality books- While studying theory, conceptualization and building application capabilities, and one needs good collection of books, which can really put our brain on exercise. Ensure that your coaching institute has a collection of good and informative books. • Flexibility- There are aspirants who have slow or fast grasping power than the average. In such cases, it is better to ascertain the model that suits your needs and provide enough guidance to you at the same time. • Tests and Evaluation Model- Ensure and track your progress through a set of tests and evaluation as this is the most crucial part of the preparation. This is the main area where the students fail due to lack of essential test and evaluation material. Gateprep is specially designed for GATE aspirants. It aims to facilitate engineering graduates or those perusing their B Sc eventually getting M Tech degrees from one of the premier institution of the country like the IITs, IISc & Tata Institute. It is one of the premier interactive educational website solving students examination related queries. Filed under: gate | Tagged: gate, Gate-2010, iit, m.tech, PREPERATION

GATE PREVIOUS YEAR QUESTION PAPER DOWNLOAD

Computer Science (CSE) :

CS2008 - DOWNLOAD
CS2009 - DOWNLOAD
CS1991 ...................................................CS formulas
CS1992
CS1993
CS1994
CS1995
CS1996
CS1997
CS1998
CS1999
CS2000
CS2001
CS2002
CS2003
CS2004
CS2005
CS2006

Electronics And communication (ECE):

Electrical And Electronics (EEE):

Information Technology (IT):

Mechanical (Mech):

Physics :

SBI EXAM FULL QUESTION PAPER

SBI EXAM QUESTION PAPER FULL -->

General Awareness:

SBI General Awareness
SBI General Awareness 2009 (Clerk)
SBI GA JULY 2008 paper
SBI GA JULY 2008 II paper
SBI GA OCT 2008 (Probationary Officers)
SBI GA JUL 2008 with ANSWER (Probationary Officers)

General English:

SBI ENG paper JULY 2008
SBI ENG II paper JULY 2008
SBI PO ENG paper JULY 2008 (Probationary Officers)

Quantitative Aptitude

SBI Quantitative aptitude

Reasoning Ability and Marketing Aptitude:

Computer knowledge:

SBI Computer Knowledge
SBI Computer Knowledge I
SBI Comp Knowledge OCT 2008 (Probationary Officers)

FREE EBOOKS FOR GATE EXAM 2013

I have posted the ebooks which are free to download and here you can find books on electronics,computer science,embedded system,VLSI,wireless communication,C&C++,Digital electronics...I will update the post so keep watching it.Thank you

DSP:

1. Intergated circuit
2. DSP BASICs
2. DSP basics II
3. Digital Color-Image Processing
4. DSP Handbook
5. Introduction to DSP
6. Embedded processor & DSP selection guide
7. Time Digital Signal Processing - Based on the TMS320C6000

Embedded system:

1. Introduction to Embedded System Design using Field Programmable Gate Arrays
2. The Art of Designing Embedded Systems, Second Edition
3. Principles of Embedded Networked Systems Design
4. Embedded Microcontroller Interfacing for M-CORE Systems
5. Hands-On ZigBee: Implementing 802.15.4 with Microcontrollers
6. Embedded Design using Rabbit 3000 Microprocessor: Interfacing, Networking, and Application Development
7. Embedded Microprocessor System
8. Embedded C
9. Analog Interfacing to Embedded Microprocessor Systems.pdf
10. Distributed Embedded Control Systems

C & C++:

1. ANSI/ISO C++ Professional Programmer's Handbook-Danny Kalev
2. Common-Sense C: Advice and Warnings for C and C++ Programmers-Paul Conte
3. C Programming for Scientists and Engineers (Manufacturing Engg Series)-Robert L. Wood

Wireless:

1. Wireless LAN Radios: System Definition to Transistor Design-Arya Behzad
2. Computational Electronics-Stephen M. Goodnick
3. Fundamentals Of Power Electronics With MATLAB-Randall Shaffer
4. The Future of Wireless Communications-William Webb
5. Next Generation Wireless LANs: Throughput, Robustness, and Reliability in 802.11n-Eldad Perahia
6. Smart Antennas For Wireless Communications (Professional Engineering)-Gross, Frank
7. Fundamental of Wireless Communication
8. Transceiver Systems Design
9. Wireless Sensor Network Designs.pdf

VlSI:

1. Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication-Hubert Kaeslin
2. Practical Problems in VLSI Physical Design Automation-Sung Kyu Lim
3. Principle Of CMOS vlsi design- Weste Eshraghim

DIGITAL:

1. Foundations of Analog and Digital Electronic Circuits-Anant Agarwal
2. Electrical circuits-DC
3 .Engineering Digital Design
4 .Introduction to Digital Electronics -John Crowe, Barrie Hayes-Gill
5. Performance Audio Power Amplifiers
6. Digital Consumer Technology Handbook

EMF:

1. EMFT Book.pdf

Sampling:

1. Sampling and quantization
2. Signal processing with C++ n java.

Communication:

1. Telecommunications.pdf
2. Communication System

Processor:

1. The rise of media processors.pdf
2. Intel Processor
3. Microprocessor

Microcontroller:

1. PIC_MicroController_Project_Book.rar

Links:

BRILLIANT GATE MATERIAL FOR GATE 2013

FOR CSE DOWNLOAD HERE

FOR PREVIOUS YEAR QUESTION DOWNLOAD HERE

TELL UR FRIENDS TO TAKE THESE MATERIAL FOR GATE 2010

ALL THE BEST FOR UR EXAM(FEB 14,2010)

GATE NEW QUESTION PATTERN 2011

GATE 2010 pattern is officially released . Few changes are made in paper pattern .They are as follows.

1. GATE 2010 will be conducted by IIT Guwahati

2. The pattern is set to change again from the previous pattern.55 questions technical + 10 questions General Aptitude - 100 marks

3. GATE Score will be valid for two years. Once again. (officially not confirmed)

4. Now you can give the exam in 3rd year itself.(confirmed)

5. GATE 2010 - Pharmacy still remains unincluded.(confirmed) There is news that Pharmacy exam will be taken up by AICTE.
6. GATE 2010 examination for Mining Engineering (MN) and Textile Engineering and Fibre Science (TF) papers will be computer based ONLINE examination.

7. GATE Board is currently in discussion whether to extend the validity of GATE 2009 score to 2010. But they have not decided yet. It will be decided by December.

Information Brochure and Application Form can be obtained on cash payment of Rs 1000/- (Rs 500/- for SC/ST/PD) from the designated Bank Branches.

Paper Pattern

Q.1 to Q.25: Will carry one mark each (sub-total 25 marks).

1/3 mark will be deducted for each wrong answer.
Q.26 to Q.55: Will carry two marks each (sub-total 60 marks) 2/3 mark will be deducted for each wrong answer.

Q.48 through Q.51 (2 pairs) will be common data questions. Each question will carry two marks 2/3 mark will be deducted for each wrong answer.

Question pairs (Q.52, Q.53) and (Q.54, Q.55) will be linked answer questions.

The answer to the second question of the last two pairs will depend on the answer to the first question of the pair.

If the first question in the linked pair is wrongly answered or is un-attempted, then the answer to the second question in the pair will not be evaluated. Each question will carry two marks

There will be negative marks only for wrong answer to the first question of the linked answer question pair i.e. for Q.52 and Q.54, 2/3 mark will be deducted for each wrong answer. There is no negative marking for Q.53 and Q.55.

Q.56 to Q.60 : From General Aptitude (GA) will carry one mark each (sub-total 5 marks).

1/3 mark will be deducted for each wrong answer.
Q.61 to Q.65 : From GA will carry two marks each (sub-total 10 marks) 2/3 mark will be deducted for each wrong answer.

All the papers bearing the codes AE, AG, BT, CE, CH, CS, EC, EE, IN, ME, MN, MT, PI and TF will contain few questions on Engineering Mathematics carrying 15 marks.
GATE Forms will be available from 22 September. At select banks and from IIT/IISc counters.

General Aptitude Syllabus :
Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.

Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation.

SBI CLERK 2009 QUESTION & ANSWER FREE DOWNLOAD

SBI REASONING CLERK 2009

1. If it is possible to make only one meaningful word with the Third, Seventh, Eighth and Tenth letters of the word COMPATIBILITY, which of the following would be the last letter of that word ? If no such word can be made, give ‘X’ as your answer and if more than one such word can be formed, give your answer as ‘Y’.
(A) I
(B) B
(C) L
(D) X
(E) Y
Ans : (B)

2. Four of the following five are alike in a certain way and so form a group. Which is the one that does not belong to that group ?
(A) Stem
(B) Tree
(C) Root
(D) Branch
(E) Leaf
Ans : (B)

3. How many meaningful three letter English words can be formed with the letters AER, using each letter only once in each word ?
(A) None
(B) One
(C) Two
(D) Three
(E) Four
Ans : (D)

4. In a certain code FINE is written HGPC.
How is SLIT written in that code ?
(A) UTGR
(B) UTKR
(C) TUGR
(D) RUGT
(E) None of these
Ans : (E)

5. If ‘Apple’ is called ‘Orange’, ‘Orange’ is called ‘Peach’, ‘Peach’ is called ‘Potato’, ‘Potato’ is called ‘Banana’, ‘Banana’ is called ‘Papaya’ and ‘Papaya’ is called ‘Guava’, which of the following grows underground ?
(A) Potato
(B) Guava
(C) Apple
(D) Banana
(E) None of these
Ans : (D)

6. If the digits in the number 86435192 are arranged in ascending order, what will be the difference between the digits which are second from the right and fourth from the left in the new arrangement ?
(A) One
(B) Two
(C) Three
(D) Four
(E) None
Ans : (D)

7. Each vowel of the word ADJECTIVE is substituted with the next letter of the English alphabetical series, and each consonant is substituted with the letter preceding it. How many vowels are present in the new arrangement ?
(A) None
(B) One
(C) Two
(D) Three
(E) None of these
Ans : (C)

8. If in a certain language LATE is coded as 8&4$ and HIRE is coded as 7*3$ then how will HAIL be coded in the same language ?
(A) 7&8*
(B) &7*8
(C) 7*&8
(D) 7&*8
(E) None of these
Ans : (D)

9. How many such pairs of letters are there in word ENGLISH, each of which has as many letters between its two letters as there are between them in the English alphabets ?
(A) None
(B) One
(C) Two
(D) Three
(E) More than three
Ans : (E)

10. In a certain code ‘na pa ka so’ means ‘birds fly very high’, ‘ri so la pa’ means ‘birds are very beautiful’ and ‘ti me ka bo’ means ‘the parrots could fly’. Which of the following is the code for ‘high’ in that language ?
(A) na
(B) ka
(C) bo
(D) so
(E) None of these
Ans : (A)

Directions—(Q. 11–15) In each of the questions below are given three statements followed by two conclusions numbered I and II. You have to take the given statements to be true even if they seem to be at variance from commonly known facts. Read both the conclusions and then decide which of the given conclusions logically follows from the given statements disregarding commonly known facts.

Read the statements and the conclusions which follow it and
Give answer—
(A) if only conclusion I is true.
(B) if only conclusion II is true.
(C) if either conclusion I or conclusion II is true.
(D) if neither conclusion I nor conclusion II is true
(E) if both conclusions I and II are true.

11. Statements : All stars are suns.
Some suns are planets.
All planets are satellites.
Conclusions :
I. Some satellites are stars.
II. No star is a satellite.
Ans : (C)

12. Statements : All fishes are birds.
All birds are rats.
All rats are cows.
Conclusions :
I. All birds are cows
II. All rats are fishes
Ans : (A)

13. Statements : All curtains are rods.
Some rods are sheets.
Some sheets are pillows.
Conclusions :
I. Some pillows are rods.
II. Some rods are curtains.
Ans : (B)

14. Statements : Some walls are windows.
Some windows are doors.
All doors are roofs.
Conclusions :
I. Some doors are walls.
II. No roof is a window.
Ans : (D)

15. Statements : All switches are plugs.
Some plugs are bulbs.
All bulbs are sockets.
Conclusions :
I. Some sockets are plugs.
II. Some plugs are switches.
Ans : (E)

Directions—(Q. 16–20) Study the sets of numbers given below and answer the questions, which follow :
489 – 541 – 654 – 953 – 983

16. If in each number, the first and the last digits are interchanged, which of the following will be the second highest number ?
(A) 489
(B) 541
(C) 654
(D) 953
(E) 783
Ans : (C)

17. If in each number, all the three digits are arranged in ascending order, which of the following will be the lowest number ?
(A) 489
(B) 541
(C) 654
(D) 953
(E) 783
Ans : (B)

18. Which of the following numbers will be obtained if the first digit of lowest number is subtracted from the second digit of highest number after adding one to each of the numbers ?
(A) 1
(B) 2
(C) 3
(D) 4
(E) 5
Ans : (A)

19. If five is subtracted from each of the numbers, which of the following numbers will be the difference between the second digit of second highest number and the second digit of the highest number ?
(A) Zero
(B) 3
(C) 1
(D) 4
(E) 2
Ans : (B)

20. If in each number the first and the second digits are interchanged, which will be the third highest number ?
(A) 489
(B) 541
(C) 654
(D) 953
(E) 783
Ans : (D)

Directions—(Q. 21–25) Read the following information carefully and answer the questions, which follow :
‘A – B’ means ‘A is father of B’
‘A + B’ means ‘A is daughter of B’
‘A ÷ B’ means ‘A is son of B’
‘A × B’ means ‘A is wife of B’

21. Which of the following means P is grandson of S ?
(A) P + Q – S
(B) P ÷ Q × S
(C) P ÷ Q + S
(D) P × Q ÷ S
(E) None of these
Ans : (C)

22. How is P related to T in the expression ‘P + S – T’ ?
(A) Sister
(B) Wife
(C) Son
(D) Daughter
(E) None of these
Ans : (A)

23. In the expression ‘P + Q × T’ how is T related to P ?
(A) Mother
(B) Father
(C) Son
(D) Brother
(E) None of these
Ans : (B)

24. Which of the following means T is wife of P ?
(A) P × S ÷ T
(B) P ÷ S × T
(C) P – S ÷ T
(D) P + T ÷ S
(E) None of these
Ans : (E)

25. In the expression ‘P × Q – T’ how is T related to P ?
(A) Daughter
(B) Sister
(C) Mother
(D) Can’t be determined
(E) None of these
Ans : (D)

Directions—(Q. 26–30) In each of these questions a group of letters is given followed by four combinations of number/symbol lettered (A), (B), (C) & (D). Letters are to be coded as per the scheme and conditions given below. You have to find out the serial letter of the combination, which represents the letter group. Serial letter of that combination is your answer. If none of the combinations is correct, your answer is (E) i.e. None of these :

Letters # Q M S I N G D K A L P R B J E
Number/ Symbol # 7 @ 4 # % $ 6 1 2 £ 5 * 9 8 3

Conditions :
(i) If the first letter is a consonant and the last a vowel, both are to be coded as the code of the vowel.
(ii) If the first letter is a vowel and the last a consonant, the codes for the first and the last are to be interchanged.
(iii) If no vowel is present in the group of letters, the second and the fifth letters are to be coded as ©.

27. IJBRLG
(A) #89*£$
(B) #89*£#
(C) $89*£#
(D) $89*£$
(E) None of these
Ans : (C)

28. BARNIS
(A) 92*#%4
(B) 924#*%
(C) 92*#%9
(D) 42*#%4
(E) None of these
Ans : (E)

29. EGAKRL
(A) #£$21*
(B) £$21*3
(C) £$21*#
(D) #£$21#
(E) None of these
Ans : (B)

Directions—(Q. 31–35) Study the following information carefully to answer these questions.
Eight persons A, B, C, D, E, F, G and H work for three different companies namely X, Y and Z. Not more than three persons work for a company. There are only two ladies in the group who have different specializations and work for different companies. Of the group of friends, two have specialization in each HR, Finance and Marketing. One member is an engineer and one is a doctor. H is an HR specialist and works with a Marketing specialist B who does not work for company Y. C is an engineer and his sister works in company Z. D is a specialist in HR working in company X while her friend G is a finance specialist and works for company Z. No two persons having the same specialization work together. Marketing specialist F works for company Y and his friend A who is a Finance expert works for company X in which only two specialists work. No lady is a marketing specialist or a doctor.

31. For which of the following companies does C work ?
(A) Y
(B) X
(C) Z
(D) Data inadequate
(E) None of these
Ans : (A)

32. Which of the following represents the pair working in the same company ?
(A) D and C
(B) A and B
(C) A and E
(D) H and F
(E) None of these
Ans : (E)

33. Which of the following combination is correct ?
(A) C–Z-Engineer
(B) E–X–Doctor
(C) H–X–HR
(D) C–Y–Engineer
(E) None of these
Ans : (D)

34. Who amongst the friends is a doctor ?
(A) H
(B) E
(C) C
(D) Either E or C
(E) None of these
Ans : (B)

35. Which of the following pairs represents the two ladies in the group ?
(A) A and D
(B) B and D
(C) D and G
(D) Data inadequate
(E) None of these
Ans : (C)

Directions—(Q. 36–40) In each of the questions given below which one of the five answer figures on the right should come after the problem figures on the left, if the sequence were continued ?

Ans : 36. (C) 37. (E) 38. (D) 39. (A) 40. (D)