**GATE: Graduate Aptitude Test in Engineering(GATE) **is all India basis examination which is conducted by all IITs joint initiative every year of February. If you want to get a Masters in Engineering/Technology in IITS then you have to score well to get a chance.GATE is an entrance examination for IIT M.Tech admissions.GATE scores are also considered as a compulsory criterion for many PSUs nowadays.

## What is the Exam pattern of GATE? |

First of all the duration of this exam is 3 hours. There are two types of questions. One is MCQ(Multiple Choice Questions)and other is NAT(Numerical Answer Type Questions). The total number of questions are 65 questions with total 100 marks Gate question paper consists of three sections.

1)General Aptitude

2)Engineering Mathematics

3)Subject-specific sections

## What is your syllabus for Computer Science/Information Technology? |

Many of you are thinking that why I am giving only the syllabus of Computer Science/Information Technology. There are so many streams are Engineering. And from all background students can prepare for GATE. But the point is that I am from a Computer Science background and I did the Exam two times. So I know very well the syllabus of Computer stream.

**Syllabus:** There are ten sections of the syllabus for Computer Science including Engineering Mathematics.

**Section1:** Engineering Mathematics

Discrete Mathematics: Propositional and first-order logic. Sets, relations, functions, partial

orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:

counting, recurrence relations, generating functions.

Linear Algebra: Matrices, determinants, the system of linear equations, eigenvalues and

eigenvectors, LU decomposition.

Calculus: Limits, continuity, and differentiability. Maxima and minima. Mean value

theorem. Integration.

Probability: Random variables. Uniform, normal, exponential, Poisson and binomial

distributions. Mean, median, mode and standard deviation. Conditional probability and

Bayes theorem.

Computer Science and Information Technology

**Section 2:** Digital Logic

Boolean algebra. Combinational and sequential circuits. Minimization. Number

representations and computer arithmetic (fixed and floating-point).

**Section 3:** Computer Organization and Architecture

Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction

pipelining. Memory hierarchy: cache, main memory, and secondary storage; I/O

interface (interrupt and DMA mode).

**Section 4:** Programming and Data Structures

Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search

trees, binary heaps, graphs.

**Section 5:** Algorithms

Searching, sorting, hashing. Asymptotic worst-case time and space complexity.

Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.

Graph search, minimum spanning trees, shortest paths.

**Section 6:** Theory of Computation

Regular expressions and finite automata. Context-free grammars and push-down

automata. Regular and context-free languages, pumping lemma. Turing machines and

undecidability.

**Section 7:** Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate

code generation.

**Section 8:** Operating System

Processes, threads, inter‐process communication, concurrency, and synchronization.

Deadlock. CPU scheduling. Memory management and virtual memory. File systems

**Section 9:** Databases

ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,

normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and

concurrency control.

**Section 10:** Computer Networks

Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,

switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP

and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).

Basics of Wi-Fi. Network security: authentication, basics of a public key and private key

cryptography, digital signatures, and certificates, firewalls.

## From which subject I should start my preparation? |

At the initial stage, you should focus only on your preparation. So you should start from the easy subject so that you can easily remember the topics. This will help you to build confidence. But if you start a difficult subject it can ruin your confidence level and it will hamper your preparation strategy.

## What are the key points you should remember for GATE preparation? |

1)Understand the GATE syllabus

2)Plan the GATE preparation

3)Gather important resources

4)Study good and relevant books

5)Start your preparation with dedication

6)Make revision notes

7)Practice Quizzes/tests

8)Solve previous year papers

9)Revise regularly

10)Attempt online quizzes/tests to know your performance before the exam

## What is your Eligibility Criteria? |

If you are first-class Engineering graduate then you are eligible to seat GATE Exam.