Syllabus for Computer Science and Information Technology
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.
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.
Pattern of Question Papers
i) Multiple choice questions carrying 1 or 2 marks each; Each of the multiple choice objective questions in all papers and sections will contain four answers, of which one correct answer is to be marked.
(ii) Common data questions (which are also multiple choice questions), where two successive questions use the same set of input data;
(iii) Linked answer questions (which are also multiple choice questions), where the answer to the first question in the pair is required to answer its successor;
(iv) Numerical answer questions, where the answer is a number, to be entered by the candidate using the mouse and a virtual keypad that will be provided on the screen
Marking Scheme
For 1 mark multiple choice questions, 1/3 mark will be deducted for a wrong answer. Likewise, for 2 marks multiple choice questions, 2/3 mark will be deducted for a wrong answer. However, for the linked answer question pair, where each question carries 2 marks, 2/3 mark will be deducted for a wrong answer to the first question only. There is no negative marking for wrong answer to the second question of the linked answer question pair. If the first question in the linked pair is wrongly answered or is unattempted, then the answer to the second question in the pair will not be evaluated. There is no negative marking for numerical answer type questions (numerical answer type questions will appear only in the papers for which the exam is ONLINE only).
General Aptitude (GA) Questions
In all papers, GA questions are of multiple choice type, and carry a total of 15 marks. The GA section includes 5 questions carrying 1 mark each (sub-total 5 marks) and 5 questions carrying 2 marks each (sub-total 10 marks).
Question papers
These papers would contain 25 questions carrying one mark each (sub-total 25 marks) and 30 questions carrying two marks each (sub-total 60 marks). Out of these, two pairs of questions would be common data questions, and two pairs of questions would be linked answer questions. In the ONLINE papers, the question paper will consist of questions of multiple choice type and numerical answer type. For multiple choice type questions, each question will have four choices for the answer. For numerical answer type questions, each question will have a number as the answer and choices will not be given. The answer is to be entered using the mouse and a virtual keypad that will appear on the screen.
For more information go to the official website of Gate 2013 cunducted by IIT Bombay GATE 2013 .
Important date for Gate 2013 is Schedule
No comments:
Post a Comment