Admission to Ph.D programme in Computer Science in Delhi University is carried out on the basis of entrance test conducted by the University. The entrance test contains two papers in which questions will be asked in objective as well as subjective format. Candidates can expect Post graduate level questions in the exam.

Exam Pattern of Delhi University Ph.D (Computer Science) Entrance Exam

The question book let comprises of two parts such as

• Part A
• Part B

Part A will contain objective type questions whereas Part B contains descriptive questions. Candidates can expect questions from the syllabus prescribed for Master of Computer Applications under University of Delhi.

Detailed Syllabus of Entrance Exam

Programming Fundamentals

• A Brief History of C
• C is middle-level Language
• The Form of a C Program
• Variables, Data Types, Operator & Expression
• Data Declaration & Definition
• Operator & Expression
• C as a Structured Language
• Console input and output
• Formatted Input/ Output
• Control Statement
• Nested switch
• Iteration Statements for loop
• Pointers
• Memory Organization
• Pointer Arithmetic
• Array & String
• Complier Vs Interpreters
• Arguments & local variables
• Storage Class & Scope
• Declaration and Initializing Structure
• Preprocessor Directive Macro Substitution
• File handling
• Void Pointer
• Bitwise Operator
• Graphics In C

Data Structures

• Introduction To Data Structure
• Implementation of Data Structure
• Array as Data Structure
• Polynomial Representation Using Arrays
• Sparse Matrices
• Drawback of Sequential Storage
• Implementation of Linked List
• Other Operation & Applications
• Generalized Linked List
• Operation on Stack
• Static & Dynamic Implementation of a Stack
• Operation on a Queue
• Static & Dynamic Implementation of Queue
• Tree Terminology
• Binary Search Tree Traversal

Database Management System

• Database and Need for DBMS
• Views of data-schemas and instances
• Database Design using ER model
• Relational Model
• Relational Database design
• Storage and File Structure
• Transaction And Concurrency control
• Crash Recovery and Backup
• Security and privacy

Algorithms

• Divide And Conquer
• Greedy Method
• Dynamic Programming
• Backtracking
• Branch and Bound

Computer Networks

• Introduction to Networking
• Common Network Architecture
• The OSI Reference Model
• Local Area Networks
• Broad Band Networks
• IP Addressing & Routing
• Domain Network Services
• Network Applications
• SNMP
• Network Security

Operating Systems

• Operating system functions and characteristics
• Real time systems
• Methodologies for implementation of O/S service system
• Functions of the system
• File access and allocation methods
• Structured Organizations
• Storage allocation methods
• Virtual memory concepts
• Hardware Management
• Deadlock detection and recovery

Candidates are required to secure a minimum of 40% marks in aggregate to clear Paper 1. Those who have secured 98 percentile marks in Paper 2 will be short listed for interview.