1. MPhil/PhD in Computer Science
Minimum Eligibility
12 years of regular schooling + a 3 or 4 year Bachelor’s degree and a Master’s degree
leading to an MSc/MTech degree in Computer Science or allied* disciplines from an
institution recognized by the government of any of the SAARC countries with the
following minimum eligibility marks criteria:
I. For candidates from the annual system: 55% and above
II. For candidates from the semester system (percentage): 60% and above
III. For candidates from the GPA semester system, the formula for determining
percentage is as follows:
Percentage = CGPA obtained X 100 / Maximum GPA obtainable
Such candidates are required to have a minimum of 65% marks or above.
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 Technology 3. Computer Applications 4. Information Science 5. Information Technology 6.
Software Systems 7. Software Engineering 8. Software Technology 9. ElectronicsEngineering 10. Electronicsand Communication
Engineering 11. Electrical & Electronic Engineering 12. Physics/ Applied Physics 13. Statistics/ Applied Statistics 14.Mathematics/
AppliedMathematics 15. Instrumentation Engineering
Admission Procedure : will consist 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 3 hours and the question paper will consist of
70 multiple choice questions in two parts, Part A and Part B.
PART A: will have 30 multiple choice questions of one mark each and will test
the knowledge of the candidate in Mathematics and Computer Science of the under-
graduate level. All questions will be compulsory. The area from which questions may be
asked will include the following:
Discrete Mathematics: Sets, Relations, Functions, Boolean Algebra, Propositional logic,
First order Predicate Logic
Combinatorics: Permutations, Combinations, Counting, Summation, Recurrence
Relations
2. Probability and Statistics: Conditional Probability, Mean, Median, Mode, Standard
Deviation, Variance, Covariance, Random Variable, Distributions (Uniform, Normal,
Exponential, Poisson, Binomial).
Optimization: Linear Programming Problem and its Duality, Non-Linear Programming
Problem, Unconstrained Optimization, Convex Programming problems, KKT conditions.
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 and Determinants: Algebra of Matrices, Determinants, Systems of Linear
Equations, Eigen Values and Eigen Vectors.
Programming in C: Elements of C, Identifiers, Data Types, Control Structures, Iteration,
Structured Data Types: Array, Structure, Union, Strings, Pointers, Functions, Parameter
Passing to Functions, Recursion.
Digital Logic Design: Number System, Data Representation and Computer Arithmetic,
Logic Gates, Combinational and Sequential Circuits.
Part B: will have 40 multiple choice questions of one mark each and will test the
knowledge of the candidate in Computer Science. All questions will be compulsory.
Questions will focus on the following areas of the M Tech/MCA/MSc level:
Data & File Structures: Arrays, Linked Lists, Doubly Linked Lists, Circularly Linked Lists,
Queues, Priority Queues, Stacks, Postfix, Prefix Representation and Evaluation, Trees,
Binary Search Trees, Heaps, Graphs, Records, Sequential Direct, Indexed Sequential,
Relative Files, Inverted Lists, Multilist, Hashing, AVL Trees, B- Tree, B+ Tree.
Design & Analysis of Algorithms: Asymptotic Notation, Asymptotic Analysis (best, worst,
average cases) of Time and Space, Sorting, Searching, Recursion, Graph (Spanning
tree, connected component, shortest path), Divide-and-Conquer, Greedy Approach,
Dynamic Programming, Basic Concepts of Complexity classes; P, NP, NP-hard, 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 Variables and 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, IPv4, IPv6, Routing Algorithms, Multicasting,
Congestion Control,
3. QoS, TCPIUDP, Application Layer Protocols (icmp, dns, smtp, pop, ftp, http).
Software Engineering: System Development Life Cycle (Steps, Water Fall Model,
Prototypes, Spiral model), Software Metrics(Software Project Management),Software
Design(System Design, Detailed Design, Function Oriented Design, Object Oriented
Design, User Interface Design, Design Level Metrics), Coding and Testing (testing level
metrics, software quality and reliability).
Database Management System: ER-model, Relational Model (relational algebra, tuple
and domain calculus), Database Design (integrity constraints, normal forms), Structured
Query Language, Transactions and Concurrency Control, Distributed Databases.
Computer Architecture and Organization: Subsystems of a Computer, Instructions
Formats, Assembly Programming, Information Representation, Computer Arithmetic,
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 four 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.
MPhil/PhD Computer Science Entrance Test Paper for the year 2015
8826998024
Phd coordinator shardi university delhi
