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


1. 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.

2. 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.

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.