GATE CS Syllabus 2017: As the GATE 2017 Exam date is approaching, it is time for the candidates to start preparing and secure admissions for various postgraduate programs in centrally funded Indian institutions. This year GATE examination will be organised by Indian Institute of Technology Roorkee. The details shall be posted on their official website i.e www.gate.iitr.ernet.in
Computer Science engineering deals with design, implementation, and management of information system of both software & hardware processes. A computer scientist specializes in theory of computation and design of computational systems. CS Engineering is considered the most promising sector with very high growth opportunities.
CS Engineering is one of the branches in GATE which is held in multiple sessions owing to the large number of applicants. Before heading to the GATE CS syllabus and exam pattern, have a look at the eligibility criteria and important dates for GATE 2017.
GATE CS Exam Pattern 2017
- 1 GATE CS Exam Pattern 2017
- 2 GATE CS Syllabus 2017
- 2.1 General Aptitude(GA): Common Syllabus for all papers
- 2.2 Section 1: Engineering Mathematics
- 2.3 Section 2: Digital Logic
- 2.4 Section 3: Computer Organization and Architecture
- 2.5 Section 4: Programming and Data Structures
- 2.6 Section 5: Algorithms
- 2.7 Section 6: Theory of Computation
- 2.8 Section 7: Compiler Design
- 2.9 Section 8: Operating System
- 2.10 Section 9: Databases
- 2.11 Section 10: Computer Networks
- 2.12 Share this:
Before heading to the GATE CS Syllabus, we should have a look at the exam structure and pattern. The exam pattern for computer science paper of GATE 2017 is same as that of previous year’s. There will be a total of 65 questions carrying 100 marks. The question wise break up is as follows:
|Section||Question no.||No. of Questions|
|Technical + Engineering Mathematics||1-55||55|
For an in-depth analysis of the GATE Exam pattern and its marking scheme, follow the link.
GATE CS Syllabus 2017
After getting familiar with the exam pattern for computer science paper of GATE 2017, let’s have a look at the section wise GATE CS syllabus:
General Aptitude(GA): Common Syllabus for all papers
The GATE CS Syllabus consists of GA section which will follow the same pattern of questions and marking scheme for all the papers of GATE 2017. This section is considered to be easy and will test your English skills and general numeric ability.
Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.
Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation.
Section 1: Engineering Mathematics
This section of GATE CS Syllabus consists of testing your practical and theoretical skills that are typically used in the engineering industry.
- Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
- Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
- Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
- 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
Section 2: Digital Logic
- Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Section 3: 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).
Section 4: Programming and Data Structures
- Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Section 5: 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, shortest paths.
Section 6: Theory of Computation
- Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Section 7: Compiler Design
- Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Section 8: Operating System
- Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
Section 9: 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.
Section 10: 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.
Make efficient use of time and start preparing for the GATE examination with the help of this link. We hope this article on the latest GATE CS Syllabus provides you with necessary information. For a comprehensive exam analysis of GATE computer science paper, you can head on to this link.
Stay connected for more information regarding GATE 2017. To excel in Engineering Exams, download the Best GATE Exam Preparation App for free.
If you have any doubts or queries, please post them in the comment section below. For better response, post your queries on OnlineTyari Community.