Thursday , 23 February 2017
Home » Gate Syllabus » CSE syllabus » Gate syllabus for CSE – 2017
Subscribe Gate 2017 portal to receive Gate exam tips daily.

Gate syllabus for CSE – 2017

Computer Science and Information Technology(CS)
Gate syllabus CSE 2017Gate-syllabus-CSE-2017

Engineering Mathematics

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.

Useful links

Computer Science and Information Technology

Digital Logic:
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

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

Programming and Data Structures:
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

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.

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.

Compiler Design:
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

Operating System:
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

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.

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.

Download Gate 2017 Computer Science Syllabus

 

Useful Links for Gate preparation:

 

You can follow us for all the latest Gate 2017 books, materials, updates, tips etc.

Like us at Facebook                           Follow us at  Twitter

With one click you can share this Gate 2017 CS/IT syllabus with your friends. Stay tuned to receive Gate 2017 updates @gate2017exam.com. ( Book mark the page with Ctrl+D )

All the Best for your GATE 2017!

One comment

  1. I didn’t get the study material kindly mail it on my mailing id 🙂

Leave a Reply

Your email address will not be published. Required fields are marked *

PGlmcmFtZSANCnNyYz0iLy93d3cuZmFjZWJvb2suY29tL3BsdWdpbnMvbGlrZWJveC5waHA/DQpocmVmPWh0dHBzOi8vd3d3LmZhY2Vib29rLmNvbS9HYXRlMjAxN2V4YW1JTkFUSU9OLzt3aWR0aD0zMDAmaGVpZ2h0PTI1MCYNCmFtcDtjb2xvcnNjaGVtZT1saWdodCZzaG93X2ZhY2VzPXRydWUmYm9yZGVyX2NvbG9yJnN0cmVhbT1mYWxzZSZoZWFkZXI9ZmFsc2UmIiBzdHlsZT0iYm9yZGVyOiBub25lOyBoZWlnaHQ6IDI1MHB4OyANCm92ZXJmbG93OiBoaWRkZW47IHdpZHRoOiAyOTVweDsiPg0KPC9pZnJhbWU+
Like us to get all Gate 2017 updates
Click on the empty area to close the popup...