Syllabus: 1. Verbal Aptitude

SYLLABUS
GENERAL APTITUDE
1. Verbal Aptitude
 Basic English grammar:
Tenses, articles, adjectives, prepositions, conjunctions, verb-noun
agreement, and other parts of speech
 Basic vocabulary:
Words, idioms, and phrases in context Reading and
comprehension Narrative sequencing.
2. Quantitative Aptitude
 Data interpretation:
Data graphs (bar graphs, pie charts, and other graphs
representing data), 2- and 3-dimensional plots, maps, and tables
 Numerical computation and estimation:

Ratios, percentages, powers, exponents and logarithms,
permutations and combinations, and series Mensuration and geometry
Elementary statistics and probability.
3. Analytical Aptitude
 Logic:
Deduction and induction
 Analogy
 Numerical relations and reasoning

4. Spatial Aptitude
 Transformation of shapes:
Translation, rotation, scaling, mirroring, assembling, and grouping
Paper folding, cutting, and patterns in 2 and 3 dimensions.
ENGINEERING MATHEMATICS
1. Discrete Mathematics:
 Propositional and first order logic.
 Sets, relations, functions, partial orders and lattices. Groups.
 Graphs:
1. Connectivity, matching, coloring.
 Combinatory:
Counting, recurrence relations, generating functions.
2. Linear Algebra:
 Matrices, determinants, system of linear equations, eigenvalues and
eigenvectors, LU decomposition.
3. Calculus:
 Limits, continuity and differentiability.
 Maxima and minima.
 Mean value theorem.
 Integration.
4. Probability:
 Random variables.
 Uniform, normal, exponential, Poisson and binomial distributions.
 Mean, median, mode and standard deviation.
 Conditional probability and Bayes theorem.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
1. Digital Logic:
 Boolean algebra.
 Combinational and sequential circuits.
 Minimization.
 Number representations and computer arithmetic (fixed and floating point).
2. Computer Organization and Architecture:

 Machine instructions and addressing modes.
 ALU, data, path and control unit.
 Instruction pipelining.
 Memory hierarchy:
Cache, main memory and secondary storage; I/O interface (interrupt
and DMA mode).
3. Programming and Data Structures:

 Programming in C.
 Recursion.
 Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps,
graphs.
4. Algorithms:
 Searching, sorting, hashing.
 Asymptotic worst case time and space complexity.
 Algorithm design techniques:

Greedy, dynamic programming and divide and conquer.
Graph search, minimum spanning trees, and shortest paths.
5. 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 undesirability.
6. Compiler Design:
 Lexical analysis, parsing, syntax-directed translation.
 Runtime environments.
 Intermediate code generation.
7. Operating System:
 Processes, threads, inter-process communication, concurrency and
synchronization.
 Deadlock.
 CPU scheduling.
 Memory management and virtual memory.
 File systems.
8. 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.

9. 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).
 Basics of Wi-Fi.
 Network security:
Authentication, basics of public key and private key cryptography,
digital signatures and certificates, firewalls.
SUBJECTS GATE GATE GATE GATE GATE GATE GATE GATE GATE
2012 2013 2014 2015 2016 2017 2018 2019 2020
Engineering 18% 13% 23% 19% 13.75% 8% 7% 6% 5%

Mathematics*
Discrete 10% 9% 12.7% 11% 3.5% 7% 12% 5% 10%

Mathematics &
Graph Theory
Design & Analysis 8% 8% 8% 7.5% 10.75% 5.5% 7% 7% 6%

Algorithms
Programming & 19% 18% 13% 18% 10.75% 14.5% 10% 12% 12%
Data Structure
Digital Logic 4% 3% 5% 7% 5% 5% 4% 9% 4%
Computer 6% 11% 8% 5% 7% 9% 11% 3% 11%

Organization*
Theory Of 5% 8% 6% 6% 9.25% 9.5% 7% 8% 9%

Computation
Compiler design 4% 3% 3% 2% 3.5% 4% 6% 6% 4%
Operating Systems* 9% 12% 7% 8% 16.5% 10% 10% 10% 10%
DBMS* 11% 7% 8% 5% 4.75% 6% 4% 8% 8%
Computer Networks 9% 7% 9% 8% 9% 6.5% 7% 10% 6%
General Aptitude* 15% 15% 15% 15% 15% 15% 15% 15% 15%
WEIGHTAGE
SUBJECTS GATE GATE GATE GATE GATE GATE GATE GATE GATE
2012 2013 2014 2015 2016 2017 2018 2019 2020
Engineering 18% 13% 23% 19% 13.75% 8% 7% 6% 5%

Mathematics*
Discrete 10% 9% 12.7% 11% 3.5% 7% 12% 5% 10%

Mathematics &
Graph Theory
Design & Analysis 8% 8% 8% 7.5% 10.75% 5.5% 7% 7% 6%

Algorithms
Programming & 19% 18% 13% 18% 10.75% 14.5% 10% 12% 12%
Data Structure
Digital Logic 4% 3% 5% 7% 5% 5% 4% 9% 4%
Computer 6% 11% 8% 5% 7% 9% 11% 3% 11%

Organization*
Theory Of 5% 8% 6% 6% 9.25% 9.5% 7% 8% 9%

Computation
Compiler design 4% 3% 3% 2% 3.5% 4% 6% 6% 4%
Operating Systems* 9% 12% 7% 8% 16.5% 10% 10% 10% 10%
DBMS* 11% 7% 8% 5% 4.75% 6% 4% 8% 8%
Computer Networks 9% 7% 9% 8% 9% 6.5% 7% 10% 6%
General Aptitude* 15% 15% 15% 15% 15% 15% 15% 15% 15%
CUT-OFF
Year 2020 2019 2018 2017
General 28.5 29.5 25.00 25.00

Syllabus: 1. Verbal Aptitude

Uploaded by

Copyright:

Available Formats

Syllabus: 1. Verbal Aptitude

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus: 1. Verbal Aptitude

Uploaded by

Copyright:

Available Formats

SYLLABUS

 Numerical computation and estimation:

 Numerical relations and reasoning

 Sets, relations, functions, partial orders and lattices. Groups.

 Maxima and minima.

 Mean value theorem.

 Uniform, normal, exponential, Poisson and binomial distributions.

 Mean, median, mode and standard deviation.

 Conditional probability and Bayes theorem.

 Combinational and sequential circuits.

 Number representations and computer arithmetic (fixed and floating point).

2. Computer Organization and Architecture:

 ALU, data, path and control unit.

3. Programming and Data Structures:

 Asymptotic worst case time and space complexity.

 Algorithm design techniques:

 Context-free grammars and push-down automata.

 Regular and context-free languages, pumping lemma.

 Turing machines and undesirability.

 Intermediate code generation.

 Memory management and virtual memory.

 File organization, indexing (e.g., B and B+ trees).

 Transactions and concurrency control.

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

Engineering 18% 13% 23% 19% 13.75% 8% 7% 6% 5%

Discrete 10% 9% 12.7% 11% 3.5% 7% 12% 5% 10%

Design & Analysis 8% 8% 8% 7.5% 10.75% 5.5% 7% 7% 6%

Computer 6% 11% 8% 5% 7% 9% 11% 3% 11%

Theory Of 5% 8% 6% 6% 9.25% 9.5% 7% 8% 9%

Compiler design 4% 3% 3% 2% 3.5% 4% 6% 6% 4%

Operating Systems* 9% 12% 7% 8% 16.5% 10% 10% 10% 10%

DBMS* 11% 7% 8% 5% 4.75% 6% 4% 8% 8%

Computer Networks 9% 7% 9% 8% 9% 6.5% 7% 10% 6%

Engineering 18% 13% 23% 19% 13.75% 8% 7% 6% 5%

Discrete 10% 9% 12.7% 11% 3.5% 7% 12% 5% 10%

Design & Analysis 8% 8% 8% 7.5% 10.75% 5.5% 7% 7% 6%

Computer 6% 11% 8% 5% 7% 9% 11% 3% 11%

Theory Of 5% 8% 6% 6% 9.25% 9.5% 7% 8% 9%

Compiler design 4% 3% 3% 2% 3.5% 4% 6% 6% 4%

Operating Systems* 9% 12% 7% 8% 16.5% 10% 10% 10% 10%

DBMS* 11% 7% 8% 5% 4.75% 6% 4% 8% 8%

Computer Networks 9% 7% 9% 8% 9% 6.5% 7% 10% 6%

General 28.5 29.5 25.00 25.00

You might also like