GATE 2011 Syllabus for Computer Science and Information Technology is as follows


General Aptitude (GA)
Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction. Numerical Ability: Numerical computation, numerical estimation, numerical reasoning and data interpretation.

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.

Shortest paths. B and B+ trees). XML. Binding. Flow and error control techniques. data flow diagrams. firewalls. Deadlock. Protection and security. Notions of space and time complexity. Divide-and-conquer. Basics of code optimization. Operating System: Processes. Asymptotic notation. Binary search trees. Binary heaps. Synchronization. Relational model (relational algebra. planning and managing the project. Application layer protocols (icmp. implementation. digital signature. Routing algorithms. File structures (sequential files. Runtime environments. Worst and average case analysis. Abstract data types. requirement and feasibility analysis. Searching. pop. indexing. Concurrency. Transactions and concurrency control. NP-complete. process life cycle. dns. Compiler Design: Lexical analysis. Theory of Computation: Regular languages and finite automata. Query languages (SQL). Recursively enumerable sets and Turing machines. gateways. upper and lower bounds. Spanning trees. Asymptotic analysis (best. Token ring). Scope. Algorithms: Analysis. http). Queues. Computer Networks: ISO/OSI stack. LAN technologies (Ethernet. Sorting. testing. Hashing. NP. normal forms). Stacks. Basic concepts of hubs. Connected components. Information Systems and Software Engineering: information gathering. Tree and graph traversals. Arrays.Programming and Data Structures: Programming in C. tuple calculus). Databases: ER-model. Database design (integrity constraints. Dynamic programming. Inter-process communication. Design: Greedy approach. smtp. File systems. process specifications. NP-hard. Threads. Linked Lists. Congestion control. average cases) of time and space. Undecidability. Intermediate and target code generation. worst. I/O systems. input/output design. Memory management and virtual memory. Functions. design. maintenance. basic concepts of client-server computing . Trees. Context free languages and Push-down automata. switches. Web technologies: HTML. TCP/UDP and sockets. Parsing. Parameter passing. Network security basic concepts of public key and private key cryptography. Basic concepts of complexity classes P. CPU scheduling. IP(v4). Syntax directed translation. and routers. ftp. Recursion. coding.

Sign up to vote on this title
UsefulNot useful