#### GATE Computer Science Engineering Exam Pattern and Syllabus 2017

The overall co-ordination and responsibility of conducting GATE 2017 lies with Indian Institute of Technology, Roorkee which is designated as the Organizing Institute (OI) for GATE 2017.

**Exam Pattern**

1. Multiple Choice Questions (MCQ)

2. Numerical Answer Questions.

3. In all the papers, there will be a total of 65 questions carrying 100 marks, out of which 10 questions carrying a total of 15 marks are in General Aptitude (GA).

4. In the paper, the Engineering Mathematics will carry around 15% of the total marks, the General Aptitude section will carry 15% of the total marks and the remaining 70% percentage of the total marks is devoted to the subject of the paper.

5. The questions in a paper may be designed to test the following abilities : Recall, Comprehension, Application and Analysis & Synthesis.

**Exam Syllabus**

__Engineering Mathematics__

Propositional and first order logic. Sets, relations, functions, partialorders and lattices. Groups.Graphs: connectivity,matching,coloring. Combinatorics: counting, recurrence relations, generating functions.

Linear Algebra:

Linear Algebra:

Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Calculus:

Calculus:

Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Probability:

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__

Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture:

Computer Organization and Architecture:

Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Programming and Data Structures:

Programming and Data Structures:

Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms:

Algorithms:

Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis;

Design:

Design:

Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

Theory of Computation:

Theory of Computation:

Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design:

Compiler Design:

Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Operating System:

Operating System:

Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. 39

Databases:

Databases:

ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

Information Systems and Software Engineering:

Information Systems and Software Engineering:

Information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

Computer Networks:

Computer Networks:

ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.

Web technologies:

Web technologies:

HTML, XML, basic concepts of client-server computing.

## 0 comments: