Scribd
Upload
32 views4 pages

75 Days to GATE

The document outlines a 75-day study plan for the GATE exam, detailing various topics and their corresponding importance or focus areas. It includes subjects such as data structures, algorithms, databases, operating systems, and more, with specific references to concepts like Turing machines, SQL, and memory management. The structure suggests a progressive approach to mastering the material in preparation for the exam.

Uploaded by

rahulmishra.alpha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
32 views4 pages

75 Days to GATE

The document outlines a 75-day study plan for the GATE exam, detailing various topics and their corresponding importance or focus areas. It includes subjects such as data structures, algorithms, databases, operating systems, and more, with specific references to concepts like Turing machines, SQL, and memory management. The structure suggests a progressive approach to mastering the material in preparation for the exam.

Uploaded by

rahulmishra.alpha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 4

75 Days for GATE

N 17 75 Reg Exp and FA, CFG PDA


N 18 74 ER‐model Rel model indexing
N 19 73 Pumping Lemma Turing Machine C, Arrays, stacks and queues, Recursion.
N 20 72 7 Undeciedability
N 21 71 Tp Calculus, SQL, Integrity File, Trans. Concrr.
N 22 70 Memory mgt, virtual mem, Deadlock and File 8
N 23 70 Prop and FOL. Sets, relations, functions counting 21
N 24 69 Patl orders, lattices, groups, Graphs Recurrence LL, trees, BST , binary heaps and graphs
N 25 68 15 16
N 26 67 14 OS
N 27 66 13
N 28 65 OS GA 1 and GA 2
N 29 64 7,8
N 30 63 DBMS Sequential ckt, Arithmetic
D1 62 FLAT
D2 61 1,2
D3 60 FLAT PDS
D4 59 PDS PDS
D5 58 PDS Pipelining, MI addressing Mode & CU.
D6 57 Bool. algebra, Combinational and Miniz Hashing, Graph, MST, shortest paths and DP
D7 56 Sorting, time and space complexity, greedy divide ‐and ‐conquer and Searching
D8 55 ALU, data‐path, Memory hierarchy, I/O interface
D9 54 Matrices Probbility and Statistics
D 10 53
D 11 52
D 12 51 AIML 5,6
D13 50 22 11, 12
D14 49 19,20
D15 48 FLAT
D16 47 DSA
D17 46 DM, Mathematics, General Apt
D18 45 OS, COA
D19 44 DBMS Algorithms
D20 43 Gen APTI
D21 42 25 26
D22 41 27 28
D23 40 29 30
D24 39 32 31
D25 38 33 34
D26 37 35 36
D27 36
D28 35 FT 1
D29 34 FT 2
D30 33 FT 3
D31 32 FT 4
J1 31 FT 5
J2 30 FT 6
J3 29 FT 7
J4 2 FT 8
J5 27 FLAT
J6 26 COA
J7 25 OS
J8 24 DBMS
J9 23 DM
J10 22 Maths
J11 21 DSA
J12 20 DLD
J13 19 GS
J14 18 GM 1
J15 17 GM 2
J16 16 GM 3
J17 15 GM 4
J18 14 DSA FLAT
J19 13 COA OS
J20 12 DLD DBMS
J21 11 DM Computer Networks
J22 10 GS CD
J23 9
J24 8 Test 1 Test 4
J25 7 Test 2 Test 5
J26 6 Test 3 Test 6
J27 5
J28 4
J29 3
Hari Naam Kirtan
J30 2
J31 1
0
queues, Recursion.
dability

1
y heaps and graphs
6
S

d GA 2

t, Arithmetic

DS
DS
essing Mode & CU.
shortest paths and DP
d Searching

6
12

thms

6
8
0
1
4
6
AT
S
MS
Networks
D

t4
t5
t6

You might also like