Вы находитесь на странице: 1из 1

8/18/2014 GATE 2014 2015 Exam Syllabus for Computer Science (CSE) & IT PDF Download

http://www.engineersinstitute.com/gate_2014-15-syllabus_computer_science_cse.php 1/2
HOME | ABOUT | PUBLICATION | FEE | FACILITY | FAQ | SITEMAP | CONTACT | RULES AND REGULATIONS | BLOG Copyri ght by Engi neers i nsti tute of Indi a 2012
Quick Query
ESE2014 Solution
About GATEExam
GATE2015 Eligibilty & Pattern
GATE2015 Syllabus & Analysis
GATEReference Books
GATEPrevious Papers
GATE2015 Schedule
GATEDetail Solution
GATECutoff Details
About PSUs
PSUs Eligibilty
PSUs Pattern
PSUs Syllabus
PSUs ExamSchedule
PSUs Previous Papers
PSUs Ref erence Books
GATE2013 Cutof f f or PSU's
Others Links
Tell Your Friends
Follow @gatecoachingdel
gate 2015 Syllabus For Computer Science - CSE & IT

gate 2015 Syllabus for Computer Sciense- CS and we also provide details about the topics which you have to
studied by the aspirants f or Gate Computer Science Engineering - CS exams. Candidates may note that the
Syllabus f or GATE Computer Science Engineering - CSE will be arranged topic wise and students have to
studied and prepare according to the given Pattern. All the Details are mention about the Syllabus f or the gate 2015
Computer Science Engineering Papers - CS

Engineering Mathematics

Mathematical Logic: Propositional Logic; First Order Logic.
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions;
unif orm, normal, exponential, Poisson, Binomial.
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Combinatorics: Permutations; Combinations; Counting; Summation; generating f unctions; recurrence relations;
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 f or 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
Calculus: Limit, Continuity & dif f erentiability, Mean value Theorems, Theorems of integral calculus, evaluation of
def inite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical
reasoning and verbal deduction.

Computer Science and Information Technology
Digital Logic: Logic f unctions, Minimization, Design and synthesis of combinational and sequential circuits; Number
representation and computer arithmetic (f ixed and f loating point).
Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path,
CPU control design, Memory interf ace, I/O interf ace (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 f inite automata, Context f ree 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 f orms), Query languages (SQL), File structures (sequential f iles, indexing, B and B+ trees), Transactions and
concurrency control.
Information Systems and Software Engineering: inf ormation gathering, requirement and f easibility analysis,
data f low diagrams, process specif ications, input/output design, process lif e 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, f tp, http); Basic concepts of hubs, switches, gateways, and routers. Network security basic concepts of
public key and private key cryptography, digital signature, f irewalls.
Web technologies: HTML, XML, basic concepts of client-server computing.

To know more about gate 2015, gate 2015 Syllabus visit at http://www.engineersinstitute.com/

Registration Form
Regular Course
5th & 20th Aug. 2014
Weekend Course
2nd & 9th Aug. 2014
GATE2015 Crash Course
20th Oct. 2014
GATEScore counselling
IES 2015-16
About IES
IES 2015 Eligibilty
IES 2015 Pattern
IES 2015 Syllabus
IES 2015 ExamSchedule
IES Previous Papers
IES Ref erence Books
IES-ESECutof f Marks
IES Selection List
IES Tentative vacancy
IES Solution
JTO Eligibilty
JTO Syllabus
JTO Previous Papers
JTO 2008 Cut-of f
JTO 2008 Solution
JTO Sample paper
DRDO Eligibilty
DRDO Syllabus
DRDO Examination Pattern
DRDO Previous Papers
DRDO Sample Paper
+17 Recommend this on Google