sylabbus gate cse 2017 

GATE 2017 syllabus is out. This article would cast light on the syllabus of Computer Science & Information Technology for GATE 2017.

GATE 2017 Computer Science

Section1: 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

 

must read : Best Strategy to prepare Engineering Mathematics for GATE 2017 || Result guaranteed

 

Section 2: Digital Logic

  • Boolean algebra
  • Combinational and sequential circuits
  • Minimization
  • Number representations and computer arithmetic (fixed and floating point)

FREE Daily Quiz on Computers for
GATE-2017 Preparation
 
FREE Daily Quiz on Computers for GATE-2017 Preparation.
Start Quiz  

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

must read : Just 4 Tips ,Problem on Heap Sort Solved || Exam Preparation Simplified

 

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

FREE Daily Quiz on Computers for
GATE-2017 Preparation
 
FREE Daily Quiz on Computers for GATE-2017 Preparation.
Start Quiz  

 

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

 

must read : 5 quick tips to solve questions on Normalization for GATE CS || Exam Preparation Simplified

 

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

Search on PrepLadder