Complete Syllabus for M.E. Computer Science & M.E. Software Systems
For all the above tests, the questions are of objective type (multiple-choice questions); each question with four answer choices, only one being the correct choice. Each correct answer fetches 3 marks, while each incorrect answer has a penalty of 1 mark. No marks are awarded or deducted for questions not attempted. While the candidate can skip a question, the computer will not allow the candidate to choose more than one option as the correct answer. All the questions and instructions for the test will be in English only.
Calculus: Functions and graphs; limit and continuity; Applications of Derivatives, Applications of Definite Integrals, Convergence of Infinite sequences and series, Maclaurin and Taylor series. Functions of several variables, Limits and Continuity in Higher Dimensions, Partial derivatives, The chain rule Directional Derivatives and Gradient vectors, Tangent planes and Normal lines, Extreme values and saddle points, Double Integrals, Triple Integrals, Line and surface Integrals, Conservative fields, Curl and divergence Theorems of Green, Gauss and Stokes.
Linear Algebra: Matrix Algebra, Row reduction method, Rank and inverse of a matrix, System of linear equations, Vector space; basis and dimension; linear transformation; range and kernel of a linear transformation; Eigenvalues and eigenvectors.
Complex Variables: Analytic functions, Cauchy's theorems; Cauchy's integral formula, Taylor Series and Laurent Series; Calculus of residues and applications.
Probability and Statistics: Sample space and events, Conditional probability and independence; Random variables and probability distributions; Independent random variables; Mathematical expectation; mean and variance; Geometric, Binomial, Poisson's, Exponential, Gamma and Normal distributions; sum of independent random variables; law of large numbers; Central limit theorem, Marginal and conditional distributions; Sampling distribution, Point estimation, Statistical intervals based on a Single sample, Tests of hypotheses based on a single sample, test for mean using normal and Students t-distribution Correlation and linear regression.
Differential Equations: First order differential equations (linear and nonlinear), higher order linear differential equations with constant coefficient, method of variation of parameters, Cauchy-Euler's equation Fourier Series, Laplace Transform, Initial and boundary value problems, Partial differential equations Method of separation of variables.
Numerical Methods: Solution of nonlinear algebraic equations: Newton's method, Secant method, Fixed point iteration method, method of false position, Solution of system of linear equations: Direct methods & Iterative methods, LU decomposition, Integration by Trapezoidal and Simpson's rule.
This test is designed to assess the test takers' general proficiency in the use of English language as a means of self-expression in real life situations and specifically to test the test takers' knowledge of basic grammar, their vocabulary, their ability to read fast and comprehend, and also their ability to apply the elements of effective writing.
The test is given to the candidates to judge their power of reasoning spread in verbal and nonverbal areas. The candidates should be able to think logically so that they perceive the data accurately, understand the relationships correctly, figure out the missing numbers or words, and to apply rules to new and different contexts. These indicators are measured through performance on such tasks as detecting missing links, following directions, classifying words, establishing sequences, and completing analogies.
Principles of Counting, Recurrence Relations, Sets, Functions, Relations, Propositional Logic and Predicate Logic, Strings and Languages.
Mott, Kandel, and Baker. Discrete Mathematics for Computer Scientists & Mathematicians, PHI 2003.
Harry Lewis and Christos Papadimitriou. Elements of the Theory of Computation 2nd Edition, Pearson Education.
Regular Languages, Regular Expressions, Finite Automata (deterministic and non-deterministic), Grammar, Context Free Grammar, Context Free Languages, Push Down Automata (deterministic and non-deterministic), Proving languages to be regular vs. not-regular and context free vs. not-context free, Turing Machines, Universal Turing Machine, Recursive and Recursively Enumerable Languages, Decidability and Un-decidability.
Harry R. Lewis and Christos H. Papadimitriou. Elements of the Theory of Computation 2nd Edition, Pearson Education.
Abstract Data Types and Data Structures. Algorithm Analysis and Order Notation.
Sorting and Searching – Algorithms and Complexity; Design and Implementation Techniques.
Linear Data Structures – Lists and Representation; Access-Restricted Lists; Queries, Design, and Implementation.
Dictionary Data Type: Lists, Hash Tables, Search Trees – Height Balancing; Queries, Design, and Implementation.
Non-linear Data Structures and Partially Ordered Data: Trees – Representation, Applications, and Traversal; Graphs – Representation, Connectivity, Traversal, and Paths; Design and Implementation
Michael T. Goodrich, Roberto Tamassia. Algorithm Design. Wiley Student Edition.
Cormen T.H., Leiserson, C.E., Rivest, R.L., and C. Stein. Introduction to Algorithms, MIT Press, 2nd Ed.
Algorithm Design Techniques: Top-Down Design (Divide-and-Conquer, Greedy); Bottom-Up Design(Dynamic Programming); Randomization.
Analysis and Complexity: Analysis of Algorithms; Complexity of Problems – Lower Bound Analysis; Non-deterministic Algorithms, Complexity Classes and Reductions, NP-completeness / NP-hardness.
Handling Hard Problems: Search – Backtracking, Branch-and-Bound; Introduction to Approximation Algorithms.
Cormen T.H., Leiserson, C.E., Rivest, R.L., and C. Stein. Introduction to Algorithms, MIT Press, 2nd Edition.
Combinational Logic Design, Adders, Multiplexers, De-Multiplexers, Encoders, Decoders. Sequential Logic Design, Counters, Registers., Programmable Logic Devices and Logic Families., 8085, 8086 architecture and assembly programming, Memory interfacing, Programmable peripheral devices and Interfacing (8253, 8255, 8259, 8251).
Digital Design by M. Morris Mano, 5th edition, Pearson Education, Delhi, 2012.
The Intel Microprocessors by Barry B Brey, 8th edition, PHI, 2014.
Tasks, Processes, and Threads, Process States & Transitions, Process organization, Process Scheduling. Concurrency, Mutual Exclusion, Process synchronization, Deadlock and Deadlock handling, Memory allocation, Paging and Segmentation, Locality, Virtual memory, Frame allocation and Page replacement algorithms. Thrashing, File systems - Interface, Structure and Implementation, I/O system, Secondary Storage and Mass Storage Structure.
Silberschatz, A and Galvin, P.B. "Operating System Concepts", 9th edition, Addison Wesley, 2012.
Instruction Set Architecture - RISC & CISC processors, Computer Arithmetic & Control Unit., Cache Memory & Main Memory, I/O, Secondary Memory, RAID System, Bus & Interconnections., Pipelining, and Instruction-Level Parallelism.
Hennessey & Patterson: Computer Organization & Design: Hardware-Software Interface, 5th edition, MK/Elsevier, NY, 2013.
Concept of autonomous computing nodes in Computer Networks, Concept of Services, Interfaces & Protocols in Network Architectures; Classification of Networks: LAN MAN, WAN, SAN, PAN, Network Topologies: Bus, Star, Ring, Tree etc., The IEEE 802 Workgroup and select standards: IEEE 802.1, IEEE 802.2, IEEE 802.3 (& Variants): Ethernet, Error Control, Flow Control, Bridges, Basics of Wi-Fi & IEEE 802.11 (WLAN), Protocols at the Network / Internet Layer: IPv4, IPv6, ICMP(v4), IGMP (v4), ICMPv6, IP Addressing Schemes, IP Sub-netting: FLSM, VLSM, Unicast Routing Algorithms & Protocols: Distance Vector Routing (RIP), Link-State Routing (OSPF), Multicast Routing: PIM-SM, PIM-DM, MOSPF, DVMRP, Path-Vector Routing (BGP), Mobile IP(v4) and Mobile IPv6, Transport Layer Protocols: TCP, UDP, Ports, Sockets, Flow Control, Congestion Control & Avoidance, Application Layer Protocols: HTTP, FTP, DNS, DHCP, SMTP, POP, IMAP, Elementary aspects of Network Security: Integrity, Privacy, Confidentiality, Protection, Authentication, Role of Cryptography, Non-Repudiation, Digital Signatures & Certificates, Intrusion Detection Systems, Firewalls
1. James F. Kurose & Keith W. Ross: Computer Networking: A Top-Down Approach, 7th Edition, Pearson Education Inc. Boston, 2016.
2. Larry L. Peterson & Bruce S. Davie: Computer Networks: A Systems Approach, 5th Edition, MorganKaufmann / Elsevier, New Delhi, 2012, reprint 2016.
3. Andrew S. Tanenbaum & David J. Wetherall: Computer Networks, 5th Edition, Pearson, New Delhi, 2014.
Data Modeling – ER Model, Relational Model, Object-oriented Model, Object-relational Model., Query Languages – Relational Algebra, Relational Calculus, & SQL, Normalization & Indexing – Functional Dependencies (FDs), Closure of set of FDs, Attribute Closure, Cannonical Cover, Normal forms up to 4NF. Primary, Clustering, & Secondary Indices, Tree-based and Hash-based Indexing, Multi-Dimensional Indexing, Query Evaluation & Optimization: Algorithms for evaluation of relational operators, Cost-based & heuristic query optimization techniques, Transaction Management – Concurrency: Locking & Timestamping & Crash Recovery: Log-based & Shadow Paging.
1. Silberschatz, Korth & Sudarshan. Database System Concepts – 3rd edn, Mc-Graw Hill, 2011
2. Garcia-Molina, Ullman, Widom, The Complete Book - Database Systems, 2nd edn, Pearson Education, 2009
Overview of Compiler, phases of compiler, Lexical Analysis, Parsing (Top-down and Bottom-up Parsing), Abstract Syntax tree, Symbol Tables, Semantic Analysis. Types inferencing and Type Checking. Syntax Directed Translation. Intermediate Code, Code Generation – Basic Blocks and Flow Graphs, Register Allocation and Assignment, Code Generation Techniques.
1. Aho, A. V., Sethi, R., and Ullman, J. D., Compilers - Principles, Techniques and Tools, Addison-Wesley, 1988. (Indian reprint 2000).
2. Sethi, R., Programming Languages - Concepts & Constructs, 2nd Ed., Addison-Wesley, 1996. (Indian reprint 1999).
Control Constructs: Conditionals, Loops, and Jumps, Tuples, Unions, and Lists, Functions and Variables, Recursion, Memory Allocation model, Dynamic Memory Allocation – Pointers and Address Arithmetic, Dynamically Allocated Data and Linked Lists.
Brian W. Kernighan & Dennis M. Ritchie – The C Programming Language, Prentice Hall, Inc., 1988.
User Defined Types, Access Restricted Lists (Stacks/Queues). Binary Trees, Macros and Preprocessing, Modular Programming – Separate Compilation and linking. Libraries, File and I/Q operations, String Processing.
Brian W. Kernighan & Dennis M. Ritchie – The C Programming Language, Prentice Hall, Inc., 1988.
Basics of OOP – Objects and Classes, and Delegation, Inheritance and Dynamic Binding. Types and Polymorphism. Templates/Generics. Software Lifecycle, Development Methodologies, Software Requirements Analysis and Modeling, Object Oriented Design, Design Patterns. Architectural Design, Modeling for Design. Software Testing and Quality.
Herbert Schildt., Java: The Complete Reference, 9th Edition, 2014. Oracle Press.
Database Modeling & Design – ER modeling, Normalization Techniques, Database Querying – SQL.
Database System Concepts. Silberschatz, Korth and Sudarshan. 6th Ed. McGraw Hill, 2016.
Number Representations and Boolean algebra, Logic Gates, Combinational and Sequential Circuits, Computer Organization: Instruction Set. Computer Arithmetic, Control and Memory Organization, Operating Systems – Basics, Processes and Threads, Operating systems – Memory Hierarchy, Virtual Memory, Secondary Storage, File Systems, Local Area Networks and Ethernet, Internetworking: TCP/UDP and IP, World Wide Web: Client – Server Systems, HTTP, HTML, XML, Web-based Systems.
R. E. Bryant and David O' Hallaron, "Computer. Systems: A Programmer's Perspective,", 2nd edition, Prentice-Hall, 2011.
| Aspect | Test I | Test II (CS) | Software Systems |
|---|---|---|---|
| Duration | 45 min | 105 min | 60 min |
| Questions | 30 | 70 | 50 |
| Maximum Marks | 90 | 210 | 150 |
| Required For | All HD programmes | M.E. Computer Science | M.E. Software Systems |
| GATE Accepted? | N/A | Yes (CS paper) | No – HD Test Only |
| Eligibility | All applicants | CS / IT degree or equivalent | Any degree + specific prior prep |
| Campuses | – | Pilani, Goa, Hyderabad | Pilani, Goa, Hyderabad |
Candidates admitted through GATE/GPAT will be eligible for GATE/GPAT scholarship provided by AICTE/PCI. In addition, candidates admitted through GATE/GPAT route will be eligible for a tuition fee waiver amounting to Rs. 13,400/- per month (during the semester) over and above the GATE/GPAT scholarship.
* GPAT Scholarship is exclusively applicable to students admitted to the Pilani Campus only.
Candidates admitted through the BITS HD Test route will be eligible for a stipend of Rs. 13,400/- per month (during the semester).
All candidates receiving fee waiver or stipend will need to contribute to graduate student teaching assistantship of 8-10 hours of work per week.