search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

The schedule followed by GATE Overflow for GATECSE 2022

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. 

GATE Overflow Test Series for GATE 2022

Advantages of following this schedule:

  1. It is not the only good schedule possible but is one schedule where subject dependencies are met 
  2. Schedule organized into 4 modules:
    1. First 6 weeks covering aptitude and discrete mathematics fundamentals – most important
    2. Next 6 weeks covering a bit of hardware, programming and computer architecture – builds a good system level knowledge
    3. Next 6 weeks covering more theoretical subjects, probability and OS – building the base of Intelligent Systems
    4. Final 6 weeks to finish DBMS, Operating Systems, Computer Networks and Compiler Design 
  3. This schedule is tied to GATE Overflow Test series – subject tests will be added as per the schedule
  4. Preparation materials including reference links are provided on GO classroom (free for everyone) 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
  5. 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.
  6. Extra points to be followed will be updated here.
  7. GATE CSE Subject page should be used for the subject resources (will be updated as per schedule) and GO classroom has assignments in extra. 

June 1-6

June 7-13

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

June 14-20

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

June 21-27

Discrete Mathematics: Combinatorics; Counting; generating functions; 

June 28-July 4

Discrete Mathematics: Combinatorics;  recurrence relations.

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

July 5-11 

Revision, Taking Tests. 

  • If you are scoring below 50% you must seriously evaluate your preparation. 75% or above is good going.
  • Exam Link: 

July 12-18 

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

July 19 - July 25

Programming and Data Structures: Programming in C. Recursion. 

July 26 – August 1

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

August 2-8

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

August 9-15

Algorithms: Asymptotic worst case time and space complexity. Searching, sorting, hashing. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.

August 16-22

Revision, Taking Tests.

Exam Link: 

August 23-29

Who do not like a break?

No exam 


August 30 - September 5

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

September 6-12

September 13-19

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

September 20-26

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 27 – October 3

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.

October 4-10

Revision, Rest

Exam Link:

October 11-17

Numerical Ability: Analytical Aptitude: Logic: deduction and induction, Analogy, Numerical relations and reasoning
Spatial Aptitude: Transformation of shapes: translation, rotation, scaling, mirroring, assembling, and grouping, Paper folding, cutting, and patterns in 2 and 3 dimensions

October 18-24

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 25-31

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

November 1-7

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

November 8-14

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

November 15-21

Revision, Taking Tests. 

  • Exam Link: 

November 22-28

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

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

November 29 – December 5

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

Revision, Solving tests


December/January

  • Full length mock tests
  • Time management and reducing careless mistakes must be done
  • Closed book revision is important 

Mock Test 1 : December 12 

  • Exam Link:

Mock Test 2 : December 26

  • Exam Link:

Mock Test 3 : January 2

  • Exam Link:

Mock Test 4 : January 9

  • Exam Link:

Mock Test 5 : January 16

  • Exam Link:

Mock Test 6 : January 23

  • Exam Link: 

 

posted May 10 in From GO Admins
edited May 10 by
3,926 views
4
Like
6
Love
0
Haha
1
Wow
0
Angry
0
Sad

7 Comments

Why engineering mathematics and D's algo are kept for last as they need to be cover as early as possible.
Are they last?
what is closed book revision ?
Revising the learned concepts in mind without seeing the book. This is usually followed by students while traveling (those having long travels) or even otherwise at home.
Most of the resource link are not working in classroom.

@mk_007 Can you paste the non working links here?

Sir please keep updating the spreadsheet with links to tests for us
...