GATE 2013 Syllabus for CSE Pdf Free Download:Gate Syllabus for IT 2013:
Gate Syllabus 2013-2014 for CSE and IT having General Aptitude,Engineering Mathematics and Computer Science Engineering & Information Technology Subjects for 100 marks.The total time duration is 3 hours.Totally 65 Multiple choice questions will ask in Gate Question Paper 2013-2014 for CSE and IT.
Section wise Gate Syllabus for CSE and IT:
3.Computer Science Engineering & Information Technology.
critical reasoning and verbal deduction.
Linear Algebra: Matrices and Determinants,Systems of linear equations,Eigen values and eigen vectors.
Calculus:Limit,continuity and differentiability;Partial Derivatives;Maxima and minima; Sequences and series; Test for convergence; Fourier series.
Vector Calculus: Gradient; Divergence and Curl; Line; surface and volume integrals; Stokes, Gauss and Green’s theorems.
Differential Equations: Linear and non-linear first order ODEs; Higher order linear ODEs with constant coefficients; Cauchy’s and Euler’s equations; Laplace transforms; PDEs -Laplace, heat and wave equations.
Probability and Statistics: Mean, median, mode and standard deviation; Random variables; Poisson, normal and binomial distributions; Correlation and regression analysis.
Numerical Methods: Solutions of linear and non-linear algebraic equations; integration of trapezoidal and Simpson’s rule; single and multi-step methods for differential equations.
3.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.