GATE SYLLBUS FOR- COMPUTER SCIENCE AND INFORMATION TECNOLOGY

GENERAL APTITUDE(GA)

     Veeval Ability:
English grammer
Sentence completion
verbal analgies
word group
instructions
critical reasoning and verbal deduction

  Numerical Ability:
Numerical computation
Numerical estimation
Numerical reasoning and data interpretation

ENGINEERING MATHEMATICS

  Mathematic Logic:
Propositional Logic
First Order Logic

  Probability:
conditional probability
Mean
Median
Mode and Standerd Deviation
Random Variables
Distributions
uniform
normal
exponential
Poisson
Binomial

  Set Theory & Algebra:
sets
Relation
Functions
Groups
Partial orders
Lattice
Boolean Algebra

  Cominatories:
Permutations
Combinations
Counting
Summations
generating functions
recurrence relations
asymptotic

  Graph Theory:
connectivity
spanning trees
cut vertices &adges
covering
matching
independent sets
Colorring
Planarity
Isomorphism

  Linear Algebra: 
Algebra of matrices
Determinants
system of linear equation
Eigen values and Eigen vectors

  Numerical methods:
LU decomposition for systems of linear equations
numerical solution of non-linear
algebraic equation by secant
Bisection and newton-Raphson Method
Numerical integration by trapezoidal and Simpsion Rules

  Calculus:
Limit
Continuty & differentiability
Mean value Theorems
theorms of integral calculua
Evaluation of definite & improper integrals
Partial derivatives
maxima & minima

TECHNICAL SECTION

  Digital Logic:
Logic Function
Minimization
Design and synthesis of combinational and sequetial circuit
Number representation and computer arithmetic(fixed and floatin point)

  Computer Organigation & Architecture:
Machine instructions and addressing mode
ALU and data-path
cou control design
Memory inteface
I/o interface(Interrupt and Dma mode)
Instruction pipelining
Cache and main memory
Secondray storage
  Programing and Data Structure:
Programming in C:
Function
Recurtion
Parameter Passing
Scope
Binding
Abstract Data types
Arrays
Stacks
Queues
Link List
Tree
Binary search Tree
Binar Heap

  Alorithms:
Analysis
Asymptoic notation
Notions of space and time complexity
Worst and average case analysis
Design:greedy approach
Dynamic programming
Divide-and-concqure
Tree and graph traversal
Connected components
Spanning Trees
Sortest path
Hashing
Sorting
Searching
Asmptotic analysis(best,wrost,average cases) space and time
upper and lower bounds
basic concepts oof complexity classes-P,NP,NP-hard,NP-complet

  Theory of Computation:
regular language and finite automata
Context free languages and Push-down autometa
Recursively enumerable sets and turing machine
Undecidability

  Compilar Design:
Lexical analysis
PArsing
Syntx directed translation
Runtime envirements
Tntermediate and targe code generation
Basics of code optimization

  Operating system:
process
Threads
Inter-process communication
Concurrency
Synchronization,
Deadlock
CPU scheduling
Memory management and vertual memory
File systems
I/o system
Protection And security

  Databases:
ER-model
Relational model(relationa algebra,tuple calculus)
Datbase Design(intrigrity constraints,normals forms)
querry language(SQL)
File Structure(sequential file,indexing,B and B+ Tree)
Transactions and cocurrency control

  Information System and Software Engineering:
Information gathering
requirement and feasibilit analysis
        data flow diagrams
process specifications
input/output design
process file cycle
planning and managing the project
Design
Coding
Testing
Implimentation
Manitenance

  Computer Networks:
ISO/OSI stack
LAN technogies(Ethernet , Token ring )
Flow and error control techniques
Routing algorithms
Congestion control
TCP/UDP and sockets
IP(v4)
Aplication layer protocal(icmp,dns,smtp,pop,ftp,http);
basic concepts hubs
Switches
gateways,and router
Network security-basic concepts of public key and private key cryptography
digital Signature
firewalls

  Web Technologies:
        HTML
XML
basicept of client-server computing.