Welcome to the Doctoral Programme

Syllabus for Ph.D. Entrance Exam

The entrance examination shall contain both objective and subjective type of questions. The syllabus for the written entrance examination shall consist of 50% of research aptitude/methodology and 50% shall be subject-specific. Research aptitude/methodology part shall be of generic nature, intended to assess the research aptitude of the candidate. This part primarily shall contain questions to test research aptitude, reasoning ability, graphical analysis, analytical and numerical ability, data interpretation, quantitative aptitude of the candidate. While, subject-specific syllabus for each branch is given below:

Computer Science & Engineering

Computer Science & Engineering

  • Computer Programmeming: Fundamental Programmeming constructs, Decision and control statements, Arrays, Strings, Functions, Recursion, Dynamic memory allocation, Composite data types (Structures and Unions)
  • Discrete Mathematical Structures: Boolean algebra, Propositional and first order logic, Sets, Relations, Functions, Partial orders and lattices, Groups and Rings, Trees, Graphs (Connectivity, Matching, Coloring), Combinatorics (Counting, Recurrence relations, Generating functions)
  • Data Structures: Time and Space complexity of algorithms, Asymptotic analysis, Big `O’ and other notations, Stacks, Queues, Linked lists (Singly, Doubly and Circular), Trees, Binary search trees, AVL tree, Heaps, Hashing and Graphs
  • Algorithms: Complexity analysis, Searching, Sorting, Algorithm design techniques (Greedy, Dynamic Programmeming and Divide‐and‐conquer), Graph search, Minimum spanning tree, Shortest path
  • Computer Organization and Architecture: Machine instructions and addressing modes. ALU, Data‐path and Control unit, Instruction pipelining, Memory hierarchy (Cache, Main memory and Secondary storage), I/O interface (Interrupt and DMA mode)
  • Operating Systems: Processes, Threads, Inter‐process communication, Concurrency and Synchronization, Deadlock, CPU scheduling, Memory management and Virtual memory
  • Database Management Systems: ER‐model, Relational model, Relational algebra, Tuple calculus, SQL, Integrity constraints, Normal forms, File organization, Indexing, Transactions and Concurrency control
  • Computer Networks: OSI Reference Model and TCP/IP Network Architecture, Ethernet and WiFi, Access Control, Flow and Error control, Network devices, Switching, IPv4, IPv6, Routing algorithms, TCP/UDP and Sockets, Congestion control, Application layer protocols (DNS, SMTP, POP, FTP, HTTP)
  • Theory of Computation: Regular expressions and finite automata, Context-free grammars and push-down automata, Regular and context-free languages, Turing machine and Undecidability
Electronics & Communication Engineering
Mechanical & Mechatronics Engineering
Physics
Mathematics
Humanities and Social Sciences (HSS)