Want to crack the GATE?

Welcome to MID Blogs! 

"Competitive exams don't test you but your authenticity of being an aspirant"

The Graduate Aptitude Test in Engineering (GATE) is an examination that primarily tests the comprehensive understanding of various undergraduate subjects in engineering and science for admission into the Masters Program Sector Companies. GATE is conducted jointly by the Indian Institute of Science and seven Indian Institutes of Technologies at Roorkee, Delhi, Guwahati, Kanpur, Kharagpur, Chennai (Madras) and Mumbai (Bombay) on behalf of the National Coordination Board – GATE, Department of Higher Education, Ministry of Human Resources Development (MHRD), Government of India.

The GATE score of a candidate reflects the relative performance level of a candidate. The score is used for admissions to various post-graduate education programs (e.g. Master of Engineering, Master of Technology, Master of Architecture, Doctor of Philosophy) in Indian higher education institutes, with financial assistance provided by MHRD and other government agencies. Recently, GATE scores are also being used by several Indian public sector undertakings for recruiting graduate engineers in entry-level positions.

Top 10 IITs in India:

Eight of the 23 IITs feature in the Top 10 of the MHRD-NIRF 2020 rankings. The MHRD-NIRF ranking is based broadly on five parameters, namely 1) Teaching and Learning Resources, 2) Graduation Outcome, 3) Perception, 4) Outreach and Inclusivity and 5) Research and Professional Practice. 

• IIT Madras, Est 1959 - NIRF Rank 1
• IIT Delhi, Est 1963 - NIRF Rank 2
• IIT Bombay, Est 1958 - NIRF Rank 3
• IIT Kanpur, Est 1959 - NIRF Rank 4
• IIT Kharagpur, Est 1951 - NIRF Rank 5
• IIT Roorkee, Est 2001 - NIRF Rank 6
• IIT Guwahati, Est 1994 - NIRF Rank 7
• IIT Hyderabad, Est 2008 - NIRF Rank 8
• IIT Indore, Est 2009 - NIRF Rank 9
• IIT (BHU) Varanasi , Est 2008 - NIRF Rank 10

GATE 2021 Syllabus for CSE. 

Section 1: 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, 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.

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: AlgorithmsSearching, sorting, hashing. 

Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide?and?conquer. Graph search, minimum spanning trees, and shortest paths.

Section 6: Theory of Computation

Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-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 public key and private key cryptography, digital signatures and certificates, firewalls.