PhD (Computer Science)

Minimum Eligibility

A minimum of 17 years of regular education (12 years of regular schooling + a 3-year Bachelor’s degree and a 2-year Master’s degree or 4-year Bachelor’s degree + a 1 year Master’s degree leading to leading to a Master’s degree in Computer Science or allied* disciplines) from an institution recognized by the government of any of the SAARC countries, with a minimum of 60% marks or an equivalent grade. Applicants with 12 years of regular schooling + an integrated Bachelor's and Master's degree of at least 5 years duration are also eligible.

*Indicative List of Allied Disciplines:

1. Computer Engineering, 2. Computer Science and Engineering, 3. Computer Applications, 4. Information Technology.

Admission Procedure : will be of 2 phases, an Entrance Test followed by an Interview. The Entrance Test will carry a weightage of 70 marks and the interview will carry a weightage of 30 marks. A minimum of 50% marks will have to be secured separately, in both the written test and the interview, in order to be eligible for admission.

Format of the Entrance Test Paper

The duration of the Entrance Test will be 2 hours and the question paper will consist of 70 multiple choice questions in two parts, Part A and Part B.

PART A: will have 25 multiple choice questions of one mark each and will test the knowledge of the candidate in Mathematics. All questions will be compulsory. The areas from which questions may be asked are.

Discrete Mathematics: Sets, Relations, Functions, Boolean Algebra, Propositional logic, First Order Predicate Logic, Lattice.

Combinatorics: Permutations, Combinations, Counting, Summation, Recurrence Relations, Binomial Theorem, Exponential Series, Pigeonhole Principle.

Probability and Statistics: Conditional Probability, Mean, Median, Mode, Standard Deviation, Variance, Covariance, Random Variable, Distributions (Uniform, Normal, Exponential, Poisson, Binomial).

Vector Analysis: Rectangular Cartesian Co-ordinates, Equations of a Line, Mid-point, Intersections etc., Equations of a Circle, Distance Formulae, Pair of Straight Lines, Addition and Subtraction of Vectors, Scalar and Vector, Product of Two Vectors, Scalar Triple Product, Vector Triple Product.

Matrices: Basic Concepts, Types of Matrices, Determinants, Transpose, Inverse and Rank of a Matrix, Matrix Algebra, Systems of Linear Equations, Eigen Values and Eigen Vectors.

Part B: will have 45 multiple choice questions of one mark each and will test the knowledge of the candidate in Computer Science. The areas from which questions may be asked are.

Programming in C: Data Types & Qualifiers, Identifiers, Control Structures, Array and Pointers, Array of Pointers, Pointers to Array, Ragged Array, Strings, Structure, Union, Functions, Recursion, File Handling, Macros, Enumeration.

Data & File Structures: Arrays, Sparse Matrix, Linked Lists, Doubly Linked Lists, Circular Linked Lists, Stack, Queue, Priority Queue, Postfix and Prefix Representation and Evaluation, Tree, Binary Search Tree, Heap Tree, AVL Trees, B Tree, B+ Tree, Graph Representation, Properties and Traversals, Inverted List, Multi-List, Hashing and Tables.

Design & Analysis of Algorithms: Asymptotic Notations, Asymptotic Analysis (best, worst, average cases) of Time and Space, Sorting, Searching, Recursion, Graph (Spanning tree, connected component, shortest path), Divide-and-Conquer Approach, Greedy Approach, Dynamic Programming, Complexity Classes - P, NP, NP-hard and NP-Complete.

Operating Systems: Processes, Threads, Inter-Process Communication, Concurrency, Synchronization (Semaphores, Critical Regions, Mutual Exclusion), Deadlock Handling (Bankers Algorithm), CPU Scheduling, Memory Management and Virtual Memory (Paging and Segmentation), File Systems, I/O systems, Protection and Security, UNIX and Windows, Basic UNIX Commands, Shell Programming.

Computer Networks: Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN), OSI Model, TCP/IP Model, Encoding and Modulation, Multiplexing, Switching, Transmission Media, Flow Control, Error Detection and Correction, Multiple Access Protocols, IP Addresses, Routing Algorithms, Multicasting, Congestion Control, QoS, TCP/UDP, Application Layer Protocols.

Database Management System: ER Model, Relational Model (Relational Algebra, Tuple and Domain Calculus), Database Design (Integrity Constraints, Normal Forms), SQL/PL-SQL, Transactions and Concurrency Control, Distributed Databases, File Organization and Indexing.

Computer Architecture and Organization: Subsystems of a Computer, Instruction Formats, Addressing Modes, Processor Datapath Design, Control Unit Design, Pipelining, Memory Organization, I/O Organization, Interrupts and DMA, Parallelism.

Negative Marks for Wrong Answers

If the answer given to any of the Multiple Choice Questions is wrong, ¼ of the marks assigned to that question will be deducted.

Interview: Candidates up to five times the number of seats available will be short-listed for interview on the basis of their performance in the entrance test subject to a minimum cut off. If candidates from outside India are unable to travel to New Delhi, they can seek permission for an interview through telephone/Skype/satellite. The final merit list will be drawn by adding together the marks of the Entrance Test and the Interview.

Separate merit lists will be made for (a) candidates from all SAARC countries other than India, and (b) candidates from India. Candidates will be offered admission from these two lists, according to merit, depending on the number of seats available.

Sample Questions

^ Back to Top