GATE EXAM SYLLABUS
Computer Science & Information Technology –CS
ENGINEERING MATHEMATICS
Mathematical Logic:
Propositional Logic; First Order Logic.
Probability:
Conditional Probability; Mean, Median, Mode
and Standard Deviation; Random Variables;Distributions; uniform, normal,
exponential, Poisson, Binomial.
Set Theory & Algebra:
Sets; Relations; Functions; Groups; Partial
Orders; Lattice; Boolean Algebra.
Combinatorics:
Permutations; Combinations; Counting;
Summation; generating functions; recurrence relations;asymptotics.
Graph Theory:
Connectivity; spanning trees; Cut vertices
& edges; covering; matching; independent sets;Colouring; Planarity;
Isomorphism.
Linear Algebra:
Algebra of matrices, determinants, systems of
linear equations, Eigen values and Eigen vectors.
Numerical Methods:
LU decomposition for systems of linear
equations; numerical solutions of non-linear algebraic equations by Secant,
Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and
Simpson’s rules.
Calculus:
Limit, Continuity & differentiability,
Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial
derivatives, Total derivatives, maxima & minima.
COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Digital Logic:
Logic functions, Minimization, Design and
synthesis of combinational and sequential circuits;Number representation and
computer arithmetic (fixed and floating point).
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 in C; Functions, Recursion,
Parameter passing, Scope, Binding;Abstract data types, Arrays, Stacks, Queues,
Linked Lists, Trees, Binary search trees, Binary heaps.
Algorithms:
Analysis, Asymptotic notation, Notions of
space and time complexity, Worst and average case analysis; 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:
Regular languages and finite automata, Context
free languages and Push-down automata,Recursively enumerable sets and Turing
machines, Undecidability.
Compiler Design:
Lexical analysis, Parsing, Syntax directed
translation, Runtime environments, Intermediate and target code generation,
Basics of code optimization.
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.
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 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:
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:
HTML, XML, basic concepts of client-server
computing.
Pattern of GATE 2012 Question paper
ReplyDeleteGeneral Aptitude (GA) Section:
In all papers, GA questions are of multiple choice type, and carry a total of 15 marks. The GA section includes 5 questions carrying 1 mark each (sub-total 5 marks) and 5 questions carrying 2-marks each (sub-total 10 marks)
The pattern of gate question paper depends on the paper code.
For GATE 2012 examination, There will be a total of 65 questions carrying 100 marks For Papers: XE Engineeering Branch
Q.1 to Q.25 (25 questions) one mark each (sub-total 25 marks).
Q.26 to Q.55 (30 questions) two marks each (sub-total 60 marks).
Q.56 – Q.65 General Aptitude (GA). Questions Q.56 – Q.60 (5 questions) carry 1 mark each (sub-total 5 marks) and questions Q.61 – Q.65 (5 questions) carry 2-marks each (sub-total 10 marks).
Questions Q.48 – Q.51 (2 pairs) are common data questions. and Qquestion pairs (Q.52, Q.53) and (Q.54, Q.55) are linked answer questions. The answer to the second question of the linked answer questions depends on the answer to the first question of the pair. If the first question in the linked pair is wrongly answered or is unattempted, then the answer to the second question in the pair will not be evaluated.
NEGATIVE MARKING: Q.1 – Q.25 and Q.56 – Q.60, ⅓ mark will be deducted for each wrong answer.
Q.26 – Q.51 and Q.61 – Q.65, ⅔ mark will be deducted for each wrong answer.
The pairs (Q.52, Q.53), and (Q.54, Q.55) are questions with linked answers. There will be negative marks only for wrong answer to the first question of the linked answer question pair i.e. for Q.52 and Q.54, ⅔ mark will be deducted for each wrong answer.
NOTE: There is no negative marking for Q.53 and Q.55.
Questions on Engineering Mathematics will carry about 15% of the total marks (excluding General Aptitude section)
the easy way to score marks in GATE is in the following areas
ReplyDeleteLinear Algebra,Numerical Methods,Calculus,Digital Logic,Programming and Data Structures,Databases.
these topics could be easy to answer and will have somewhat greater weightage than others so it'll be helpful if we prepare more on these areas.
Hope u got some information guys....
Thank you.