The schedule followed by GO for GATE2020

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.

Please see here for GO Book for GATECSE 2020

Advantages of following this schedule:

- It is not the only good schedule possible but is one schedule where subject dependencies are met
- You can ask any doubt from the topics already covered in the schedule here with the tag go-classroom and those will be answered with priority
- Preparation materials including reference links are provided on GO classroom as per the schedule
- 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.

**June 10-16**

**June 17-23**

**Quantitative Aptitude: Ratios, speed-time, directions, work-time, clock, other numericals, ****deriving conclusion from graphs, pie/bar charts, sequence and series etc.**

**June 24-30**

**Discrete Mathematics: Set Theory & Algebra: ****Sets; Relations; Functions;** Mathematical Logic: Propositional Logic; First Order Logic.

**July 1-7**

**Discrete Mathematics: Combinatorics; Counting; generating functions; **

**July 8-14**

**Discrete Mathematics: ****Combinatorics; recurrence relations.**

**Discrete Mathematics: Set Theory & Algebra: Groups; Partial Orders; Lattice.**

**July 15-21**

**Revision, Taking Tests. **

**If you are scoring below 50% you must seriously evaluate your preparation.**

**July 22-28**

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

**July 29 - August 4**

**Digital Logic: Sequential circuits. **

**Programming and Data Structures: Programming in C. Recursion. **

**August 5-11**

**Programming and Data Structures: Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.**

**Algorithms: Asymptotic worst case time and space complexity. **

**August 12-18**

**Algorithms: Searching, sorting, hashing. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.**

**August 19-25 **

**Algorithms: Graph search, minimum spanning trees, shortest paths.**

**August 26 - September 1 **

**September 2 - September 8**

**Revision, Taking Tests. **

**September 9-15**

**Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.**

**September 16-22**

**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 23-29**

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

**September 30-October 6**

**Revision, Rest**

**October 7-13**

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

**October 14-20**

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

**October 21 - October 27**

**Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling,**

**October 28-November 3**

**Revision, Taking Tests. **

**November 4-November 10**

**Operating System: Memory management and virtual memory, File systems.**

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

**November 11-17**

**Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.**

**November 18-24**

**Computer Networks: Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.**

**November 25-30**

**Linear Algebra: Matrices, determinants, systems of linear equations, Eigen values and Eigen vectors, LU decomposition.**

**Revision, Solving tests**