The schedule followed by GO for GATE2021
Please do not listen to what random people say about the schedule. This is a relaxed one and so you should not keep any topics for later thinking you have time.
Advantages of following this schedule:
- It is not the only good schedule possible but is one schedule where subject dependencies are met
- Schedule organized into 4 modules:
- First 6 weeks covering aptitude and discrete mathematics fundamentals – most important
- Next 5 weeks covering a bit of hardware, programming and computer architecture – builds a good system level knowledge
- Next 5 weeks covering more theoretical subjects, probability and OS – building the base of Intelligent Systems
- Final 3 weeks to finish Operating Systems, Computer Networks and Compiler Design
- This schedule is tied to tests which are going to be added on GATE Overflow – subject tests will be added as per the schedule
- Preparation materials including reference links are provided on GO classroom as per the schedule – to access GO classroom just create a new account on the home page of it and subscribe manually to each course
- Even if you are joining late, you can adjust your schedule accordingly - most assignments in GO classroom will allow late submissions and this schedule will be over by November end.
- Extra points to be followed will be updated here.
- GATE CSE Subject page should be used for the subject resources (will be updated as per schedule) and GO classroom has assignments in extra.
Quantitative Aptitude: Ratios, speed-time, directions, work-time, clock, other numericals, deriving conclusion from graphs, pie/bar charts, sequence and series etc.
Discrete Mathematics: Set Theory & Algebra: Sets; Relations; Functions; Mathematical Logic: Propositional Logic; First Order Logic.
Discrete Mathematics: Combinatorics; Counting; generating functions;
June 29-July 5
Discrete Mathematics: Combinatorics; recurrence relations.
Discrete Mathematics: Set Theory & Algebra: Groups; Partial Orders; Lattice.
Revision, Taking Tests.
- If you are scoring below 50% you must seriously evaluate your preparation. 75% or above is good going.
Digital Logic: Boolean algebra. Combinational circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
July 20 - July 26
Digital Logic: Sequential circuits.
Programming and Data Structures: Programming in C. Recursion.
July 27 – August 2
Computer Organization and Architecture: Machine instructions and addressing modes, ALU, data‐path and control unit, Instruction pipelining, Memory hierarchy: Cache and main memory, Secondary storage, I/O interface (Interrupt and DMA mode).
Programming and Data Structures: Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Algorithms: Asymptotic worst case time and space complexity.
Algorithms: Searching, sorting, hashing. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
Revision, Taking Tests.
August 31 - September 7
Algorithms: Graph search, minimum spanning trees, shortest paths.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
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.
September 29-October 5
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.
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.
October 20 - October 26
Linear Algebra: Matrices, determinants, systems of linear equations, Eigen values and Eigen vectors, LU decomposition.
October 27-November 2
Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling,
November 3-November 9
Revision, Taking Tests.
Operating System: Memory management and virtual memory, File systems.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common subexpression
Revision, Solving tests
- Full length mock tests
- Give previous year tests of actual GATE – no mock test will be like an actual GATE
- Time management and reducing careless mistakes must be done
- Closed book revision is important