GATE EXAMINATION INFO

COURSE FOR COMPUTER SCI.
1) basic mathematics ::
Mathematical Logic: Propositional Logic, First-order Logic — Probability: Random variables and expectation, Conditional probability, Independent random variables, Distributions (Uniform, Normal, Exponential, Poisson, Binomial) —

Discrete Mathematics: Sets, Relations, Functions, Groups, Lattice, Boolean algebra, Induction, Recurrence relations — Combinatorics: Permutations, Combinations, Counting, Summation —
Elementary graph theory: Basic properties, Connectivity, Covering and matching, Planarity — Elementary concepts of Linear and Matrix Algebra — Numerical methods: Classical algorithms for interpolation and root finding.

2)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.

3) 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.

4) system software ::

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.

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 2 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.

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 1^st 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

More post regarding are welcomed..