Like most of the qualifier tests GATE is also having eligibility criteria. One must meet the following requirements to be eligible for taking GATE examination.

• Minimum Academic Qualification:
  One must be studying 3rd or higher years of any undergraduate degree or has completed any degree in Engineering/ Technology/ Architecture/ Science/ Commerce/ Arts which is approved by government.
• Age Limit:
  There is no age limit.

From the date of announcement of results the score (GATE 2021 score) will be valid for 3 YEARS.

Qualifying GATE can unlock gates to many opportunities. Because, GATE score is a mandatory requirement for getting an admission into postgraduate programs such as Master’s and Doctoral in India. Moreover, it can make one to stand out when it comes to financial assistance and government scholarships / assistantships. Though it depends on the admission criteria of an institute. As some of the Public Sector Undertakings (PSUs) use GATE score for hiring people. Apparently, A valid and high GATE score will be very useful for getting into a PSU. Besides, several Indian and foreign universities use it for admissions.

Dr. Jagadeesh Kakarla currently working as an Assistant professor in Department of Computer Science & Engineering at centrally funded institute. He started youtube channel to provide a quality education to everyone for free of cost. "Learn your favourite CSE Courses For free from the Best! "with this objective we started Parnika Tutorials with quality GATE Videos on various subjects of CS / IT

1. Engineering Mathematics
   • Discrete Mathematics:
     One and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, 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:
     PropositionalLimits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
   • Probability and Statistics:
     PropositionalRandom variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.


2. Digital Logic
   Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
   


3. Computer Organization and Architecture
   Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining, pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).


4. Programming and Data Structures
   Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).


5. Algorithms
   Searching, sorting, hashing. Asymptotic worst-case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths


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.


7. Compiler Design
   Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimization, Data flow analyses: constant propagation, liveness analysis, common subexpression Elimination.


8. Operating System
   System calls, processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.


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.


10. Computer Networks
    • Concept of layering:
      OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching
    • Data link layer:
      framing, error detection, Medium Access Control, Ethernet bridging
    • Routing protocols:
      Shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT)
    • Transport layer:
      flow control and congestion control, UDP, TCP, sockets
    • Application layer protocols:
      DNS, SMTP, HTTP, FTP, Email

IIT Delhi. (n.d.)..GATE Official Website, IIT Delhi..Retrieved on November 13, 2020 from. http://gate.iitd.ac.in/
Eligibility. (2020, August, 7). GATE 2021 Official Website - IIT BOMBAY.. https://gate.iitb.ac.in/eligibility.php
Information Brochure..(2020,.September,.9). GATE 2021 Official Website - IIT BOMBAY.. https://gate.iitb.ac.in/brochure.php
IIT Bombay. (2020). Information Brochure 2021 (Version 3.0)..IIT Bombay... https://drive.google.com/file/d/1-XqQ2FP5kh1vp-aQ3FhAvTqjFGp5H-IN/view.