# C put er Sci nce and 22/ 12m at i n Technol gy ( C | G ATE 2013 om e 12/ I nf or o o S

)

Organising Institute:

Indian Institute of Technology Bombay GATE 2013 Graduate Aptitude Test in Engineering 2013 Home News Pre-Exam Exam Post-Exam FAQ About GATE Contact Us

Syllabus for Computer Science and 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
w w gat e. i b. ac. i / gat e2013/ cs- syl bus/ w. t n a l 1/ 3

normal forms).C put er Sci nce and 22/ 12m at i n Technol gy ( C | G ATE 2013 om e 12/ I nf or o o S) of definite & improper integrals. digital signature. Flow and error control techniques. Minimization. Context free languages and Push-down automata. Parameter passing. Secondary storage. Programming and Data Structures: Programming in C. IP(v4). i b. Number representation and computer arithmetic (fixed and floating point). Recursively enumerable sets and Turing machines. requirement and feasibility analysis. Memory interface. TCP/UDP and sockets. Cache and main memory. Design: Greedy approach. Parsing. Dynamic programming. NP-complete. I/O interface (Interrupt and DMA mode). Asymptotic notation. Query languages (SQL). XML. Operating System: Processes. Web technologies: HTML. Computer Organization and Architecture: Machine instructions and addressing modes. pop. Compiler Design: Lexical analysis. planning and managing the project. Routing algorithms. Shortest paths. basic concepts of client-server computing. http). Syntax directed translation. data flow diagrams. Searching. Congestion control. Linked Lists. implementation. Scope. Computer Networks: ISO/OSI stack. B and B+ trees). input/output design. NP-hard. Basic concepts of hubs. I/O systems. Information Systems and Software Engineering: information gathering. Sorting. Binary search trees. Basics of code optimization. coding. switches. Concurrency.syl bus/ w. maintenance. Synchronization. testing. indexing. design. LAN technologies (Ethernet. w w gat e. Token ring). Tree and graph traversals. and routers. ALU and data-path. Algorithms: Analysis. Database design (integrity constraints. NP. Total derivatives. Stacks. i / gat e2013/ cs. Notions of space and time complexity. tuple calculus). ac. Relational model (relational algebra. Runtime environments. Threads. Queues. upper and lower bounds. Transactions and concurrency control. smtp. Abstract data types. Connected components. process life cycle. Instruction pipelining. Recursion. you implicitly agree to the terms and conditions. Hashing. Worst and average case analysis. gateways. Divide-and-conquer. Application layer protocols (icmp. By accessing any information provided in this website. Asymptotic analysis (best. Theory of Computation: Regular languages and finite automata. Undecidability. Deadlock. File structures (sequential files. Network security – basic concepts of public key and private key cryptography. process specifications. ftp. Spanning trees. worst. Binary heaps. Arrays. Functions. t n a l 2/ 3 . Design and synthesis of combinational and sequential circuits. average cases) of time and space. Databases: ER-model. maxima & minima. Trees. Binding. Protection and security. Intermediate and target code generation. Basic concepts of complexity classes – P. Memory management and virtual memory. Partial derivatives. COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Digital Logic: Logic functions. CPU scheduling. dns. CPU control design. firewalls. Inter-process communication. File systems.

ac.C put er Sci nce and 22/ 12m at i n Technol gy ( C | G ATE 2013 om e 12/ I nf or o o S) WordPress Themes w w gat e. i / gat e2013/ cs.syl bus/ w. i b. t n a l 3/ 3 .