Important topics to prepare for GATE Computer Science Paper

GATE Computer Science Syllabus has 11 Subjects. Preparing all 11 subjects according to the weightage of previous years
analysis will help you to score better in GATE Exam. Some topics of subjects are having more weightage of marks in GATE
Exam. So it is very important to know those topics where the questions have been asked regularly in the previous GATE papers.
Based on the analysis of previous year GATE papers, important topics are listed below.

Programming & Data Structure

Regularly covered topics in GATE: Questions were asked from the following topics in all the previous GATE
Papers.
o Recursive programs
o Trees and graphs
Maximum weightage topics in previous GATE: The following topics were having highest weightage in GATE paper.
These topics can be assumed as very important than other topics.
o Trees
Difficult level topics in GATE: Tough questions in GATE are possible from the following topics.
o Recursive functions, and pointers
Easy level topics in GATE: Easy questions in GATE are possible from the following topics.
o Stacks, Queues, and trees.

Algorithms

Regularly covered topics in GATE:

o Algorithm Analysis, Heap trees, Sorting and Graph Algorithms
Maximum weightage topics in previous GATE:
o Sorting algorithms
Difficult level topics in GATE:
o Divide and conquer and Greedy algorithms
Easy level topics in GATE:
o Searching and sorting algorithms
Other Important topics covered in GATE:
o Divide and conquer and dynamic programming algorithms

Operating Systems

Regularly covered topics in GATE:

o CPU Scheduling Algorithms, Paging, Semaphores, and page replacement algorithms
Maximum weightage topics in previous GATE:
o Page replacement algorithms and paging
Difficult level topics in GATE:
o Semaphore, Paging and Segmentation
Easy level topics in GATE:
o CPU Scheduling, Page replacement
Other Important topics covered in GATE:
o Disk scheduling algorithms, and Deadlock

Engineering Mathematics

Regularly covered topics in GATE:

o Matrix determinant, eigen values, propositional logic, predicate logic
o Conditional probability, Graph connectivity, relations
Maximum weightage topics in previous GATE:
o Mathematical logic, linear algebra
Difficult level topics in GATE:
o Probability and predicate logic
Easy level topics in GATE:
o Propositional logic, Linear algebra, Graph theory
Other Important topics covered in GATE:
o Groups, functions, lattice theory and counting

Digital Logic
 Regularly covered topics in GATE:
o Combinational circuits: Multiplexer, decoder and demultiplexer
o Minimization and Counters
Maximum weightage topics in previous GATE:
o Combinational circuits
Difficult level topics in GATE:
o Sequential circuits
Easy level topics in GATE:
o Minimization and combinational circuits
Other Important topics covered in GATE:
o Number system, fixed and floating point registers, registers.

Computer Architecture & Organization

Regularly covered topics in GATE:

o Pipelining, cache organization, Addressing modes
Maximum weightage topics in previous GATE:
o Cache organization
Difficult level topics in GATE:
o Cache organization, Pipelining, I/O Data transfer
Easy level topics in GATE:
o Addressing modes and Machine cycles

Databases

Regularly covered topics in GATE:

o Relational Algebra, SQL, Serializability
Maximum weightage topics in previous GATE:
o Relational, tuple, SQL queries
Easy level topics in GATE:
o Normalization, Transactions, Relational algebra, SQL, ER-diagrams

Computer Network

Regularly covered topics in GATE:

o IP Addressing, TCP and UDP, Application protocols, Congestion control
Maximum weightage topics in previous GATE:
o IP Addressing and TCP
Easy level topics in GATE:
o Routing Algorithms, IP addressing, Ethernet
Other Important topics covered in GATE:
o Encyption and Decryption algorithms

Theory of Computation

Regularly covered topics in GATE:

o DFA, Regular expression, Closure properties, Undecidability
Maximum weightage topics in previous GATE:
o Regular languages, Undecidability
Difficult level topics in GATE:
o Undecidability
Easy level topics in GATE:
o Regular expressions, closure properties
Other Important topics covered in GATE:
o CFL, DCFL, formal grammars, CNF

Compiler Design

Regularly covered topics in GATE:

o LL(1), LR parsers
Maximum weightage topics in previous GATE:
o Parsing
Easy level topics in GATE:
 o Lexical Analysis, Syntax Analysis, Intermediate code generation, SDTs
Other Important topics covered in GATE:
o Run time environments

General Aptitude

Important topics covered in GATE:

o Sentence completion and word analogies
o Numerical computation and data interpretation