Wednesday, October 21, 2009

Gate Detail

GATE - Graduate Aptitude Test in Engineering

The Graduate Aptitude Test in Engineering (GATE) all -India Examination conducted by Indian Institutes of Technology and Indian Institute of Science, on behalf of the National Coordinating Board - GATE, Ministry of Human Resources Development (MHRD), Government of India.

We are providing detailed information for SYLLABUS and Structure of GATE , Question Paper Structure , General Information about GATE . Get information about GATE Eligibility , How to Apply for GATE , Important Dates For GATE.

We are providing GATE Sample Papers For GATE Exams , Some Tips & Tricks , GATE Exam Cities , Discipline Codes , College Code , GATE Score and many more information about GATE.

OBJECTIVES OF GATE

  • Identify, at the National level, meritorious and motivated candidates for admission to Postgraduate Programmes in Engineering, Technology, Architecture, Science and Pharmacy.
  • Serve as a mandatory qualification for the MHRD scholarship/assistantship.
  • Serve as benchmark of normalization of the Undergraduate Engineering Education in the
    country.

Why should we take GATE:

To pursue M.Tech program in a leading institute of the country. The benefits of M.Tech are:

  1. More and better companies are coming for Campus Placement in leading Institutes
  2. Higher salaries are being offered for M.Tech as compared to B.E.
  3. M.Tech degree leads to specialization and furthering of interest in a certain area which may lead to Ph.D
  4. M.Tech degree is a must for those wishing to apply for Faculty/Research positions in educational Institutes/R&D centers.
  5. Scholarship is paid during M.Tech, so no headache to parents for financial requirements.
  6. The M.Tech program is a 3 semester (18 months) program; so get more time to work out career opportunities.
  7. MOST IMPORTANTLY to get to be a part of any Nationally reputed Educational Institute and enjoy learning and research.

Important Dates:

  1. Availability of GATE forms: October, 1st week
  2. Last Date for filling up forms: November, 1st week
  3. Exam Date: 2nd Sunday of February
  4. Results: March 31st

General Information and Results are also published on the Web.

Examination Details:

  1. The examination is a single paper of 3 hours duration and generally consists of Section A (Objective Type) which is of 75 marks and Section B (Problem Type) which is of 75 marks. Total: 150 marks.
  2. You have to opt for your subject and study as per the syllabus mentioned in the GATE brochure (available in the Library).
  3. The subjects of our interest are Computer Science and Engineering, Electronics & Communication Engineering., Electrical Engineering and Instrumentation Engineering. Other subjects are also available such as Mathematics, Physics, etc (consult the GATE brochure).
  4. Generally a large number of students appear for the Computer Science subject in order to do a M.Tech in Computer Science.
  5. Old question papers are available in the shops.
  6. Results of qualified candidates in GATE will give All India Rank and indicate percentile score. For example, a percentile score of 99 means you are in the top 1% category of the candidates who appeared for GATE.
  7. Candidates who get less than 70 percentile get no score card.
  8. GATE scores are valid for 1 years. You may reappear the GATE exam if you are not satisfied with the earlier score and the new score (if better than the old one) will be used for admission purposes.

After the Exam, what next:

  1. After publication of GATE results, students must apply to individual Institutes to get their application forms.
  2. Institutes advertise M.Tech admissions in leading newspapers from 1st April till end July. However some Institutes do not advertise and therefore students have to get the forms themselves.
  3. In the application forms, you have to mention your GATE score alongwith other details.
  4. The concerned Institute may conduct written test and/or interview for the purpose of admission.
  5. General thumb rules: If your Gate score in Computer Science is 96 percentile or more then you can try for IITs, if between 85 - 96 percentile, then apply for top RECs, JADAVPUR, SHIBPUR, ROORKEE, etc. If less than 85, you have to look for appropriate institutes.

Scholarship:

During the pursuit of M.Tech, you are paid a scholarship of Rs. 5000.00 per month by the Government of India. This amount is enough for living expenses including purchase of books, etc. The scholarship is paid for the entire 18 months M.Tech period.

SPECIAL:

I encourage 4th year students to also appear GATE alongwith Final Year students since:

  1. GATE score is valid for 1 years.
  2. The syllabus as required by GATE is generally over by 5th semester.
  3. Anyway, it will be a good try ! If it is a bad score you can always try again.

Important Books

Hi Guys This may help you to prepare for gate easily. HA HA HA, Tehse files are excellant for your preparation

http://www.ziddu.com/download/7015417/Chapter8.WAP.Concepts.pdf.html

http://www.ziddu.com/download/7015418/Chapter1.Analysis.Design.and.Algorithm.pdf.html

http://www.ziddu.com/download/7015419/Chapter6.Mobile.Computing.Concepts.pdf.html

http://www.ziddu.com/download/7015420/Chapter5.Networks.Types.and.Topologies.Concepts.pdf.html

http://www.ziddu.com/download/7015421/Chapter2.Operating.System.Concepts.pdf.html

http://www.ziddu.com/download/7015422/Chapter7.Compiler.Design.Concepts.pdf.html

http://www.ziddu.com/download/7015423/Chapter3.Lexical.Analysis.pdf.html

http://www.ziddu.com/download/7015424/Chapter4.Database.Management.System.Concepts.pdf.html

Comment this page


Gate Previous Year Question Papers

Hi guys This helps you to know previous gate question ans answers. This may gives you to score good marks in gate and also you improve your skill level. You can do it else No one can do it.

These are the Links for question and answer

http://www.ziddu.com/download/4986848/GATE-CS-2009_prsolutions08.pdf.html
http://www.ziddu.com/download/6134124/CS-GATE-09-key.pdf.html
http://www.ziddu.com/download/7015453/CS1998.pdf.html

http://www.ziddu.com/download/7015454/CS1995.pdf.html

http://www.ziddu.com/download/7015455/CS1992.pdf.html

http://www.ziddu.com/download/7015456/CS2000.pdf.html

http://www.ziddu.com/download/7015457/CS1993.pdf.html

http://www.ziddu.com/download/7015458/CS1991.pdf.html

http://www.ziddu.com/download/7015459/CS1994.pdf.html

http://www.ziddu.com/download/7015460/CS1997.pdf.html

http://www.ziddu.com/download/7015461/CS1999.pdf.html
http://www.ziddu.com/download/7015462/CS1996.pdf.html


http://www.ziddu.com/download/7015473/IT2005.pdf.html

http://www.ziddu.com/download/7015474/CS2001.pdf.html

http://www.ziddu.com/download/7015475/CS2004.pdf.html

http://www.ziddu.com/download/7015476/CS2003.pdf.html

http://www.ziddu.com/download/7015477/CS2002.pdf.html

http://www.ziddu.com/download/7015478/IT2004.pdf.html

http://www.ziddu.com/download/7015479/CS2005.pdf.html

Comment this page


gate computer science Syllabus

Hi guys, I think you are very eager to get gate information. This blog helps you to know the detail of gate syllabus and some more updated events. You can prepare yourself for gate and do your best. You may be last but not be Least. This blog used to know computer science detail sorry for other department guys. I dont know more about other department.

CSE- Computer Science Englineering OR 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, Algorithm design by induction), 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.

Programming Methodology: Scope, binding, parameter passing, recursion, C programming – data types and declarations, assignment and control flow statements, 1-d and 2-d arrays, functions, pointers, concepts of object-oriented programming - classes, objects, inheritance, polymorphism, operator overloading.

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, shell programming.

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: E-R diagrams, relational model, database design, integrity constraints, normal forms, query languages (SQL), file structures (sequential, indexed), b-trees, transaction and concurrency control.

Data Communication and Networks: ISO/OSI stack, transmission media, data encoding, multiplexing, flow and error control, LAN technologies (Ethernet, token ring), network devices – switches, gateways, routers, ICMP, application layer protocols – SMTP, POP3, HTTP, DNS, FTP, Telnet, network security – basic concepts of public key and private key cryptography, digital signature, firewalls

Web technologies: Proxy, HTML, XML, basic concepts of

cgi-bin programming.


Comment this page