Doctoral Admissions - Department of CSE
Important Dates
Task | Dates |
---|---|
Portal opening date | 07-10-2024 |
Portal Closing date | 25-11-2024 |
Date of Dispatch of Call letter | 29-11-2024 |
Date of Examination | 12/13-12-2024 |
Date of Declaration of Result | 18-12-2024 |
Last Date of Payment of Fee | 03-01-2025 |
Date of Reporting | 06-01-2025 |
Eligibility Criteria Regular full-time PhD
Master’s degree in engineering (M. Tech. / ME / MS (by research)) in CSE/ CCE/ IT/ ECE or any other relevant discipline with a minimum 60 % marks or equivalent CPI/CGPA.
OR
B.Tech. / B.E. in CSE/ ECE/ CCE/ IT or any other relevant discipline with minimum 70% marks or equivalent CPI/CGPA and GATE qualified in relevant discipline.
OR
MCA or M.Sc. in CS/ OR/ Statistics/ Maths or any other relevant discipline with minimum 60% marks or equivalent CPI/CGPA and GATE qualified in relevant discipline.
The students awaiting their qualifying examination results are also eligible to apply. They need to submit the qualifying mark sheets and/or certificates at the time of admission.
Please note that the qualifying degree of applicant should be from an accredited university /deemed-to-be-university or an institution of higher learning of comparable standing. The eligibility criteria given above are the absolute minimum. Institute may prescribe any requirements over and above these. In case the candidates are awarded grades/CPI/CGPA instead of marks, applicant would have to produce the grade-percentage conversion criterion or formula provided by the university/institution from where the applicant has obtained the degree. In case, where, a university/institute does not provide any scheme for converting CPI/CGPA into equivalent marks, UGC and AICTE guidelines would be applicable.
Eligibility Criteria - Part time PhD
The minimum qualification for these candidates is the same as for full-time candidates except experience requirement.
Experience required for admission to part-time Ph.D. Programmes (Engineering) is
- M.E./M.Tech./M.S. (by Research) or equivalent: 01 Years
- B.E./B.Tech. or equivalent: 03 Years
Note: The part-time candidates should submit, a No Objection Certificate (NOC) from the organization, in which s/he is employed, at the time of admissions giving an undertaking that s/he would be released from the normal duties to fulfill the course-work requirement (and qualifier examination, if applicable).
Admission Procedure
Admission to the Ph.D. Programme is offered to eligible candidates on the basis of a written test and an interview. Consequently, all applicants who qualify in the written examination need to appear for the personal interview on the same day or very next day. Candidates who have qualified for national level fellowships like GATE, CSIR/UGC-NET-JRF, JEST (with valid score), DST-INSPIRE, NBHM Ph.D. or other national level exam, in the relevant subject/discipline are exempted from the Institute’s written test. No request for remote interviews will be entertained.
Note: DST-Inspire candidates will have two choices:
Choice 1 (Default choice): To be exempted from the written test: In this case, if finally admitted, they will not be getting any Institute fellowship and their fellowship will be subject to acceptance and approval by DST, whenever it happens. Their admission will be with fellowship status as DST-Inspire Fellowship, from the beginning.
Choice 2: NOT to be exempted from the written test: In this case, if finally admitted, they will be under Institute fellowship category until they get DST-Inspire fellowship. If they get DST-Inspire fellowship, then their fellowship status will be changed from Institute Fellowship to DST-Inspire Fellowship.
Syllabus for Ph.D. Entrance Exam
- Discrete Mathematical Structures: Boolean algebra, Propositional logic, Sets, Relations, Functions, Trees, Graphs: Trees, connectivity, matching, coloring, Combinatorics; Counting: Permutation and combination,
recurrence relation, Discrete Probability, Conditional probability, and Bayes theorem. - Programming and Data Structures: Programming in C, Recursion, Arrays, stacks, queues, linked lists (singly, doubly and circular), trees, binary search trees, binary heaps, graphs.
- Algorithms: Asymptotic worst-case time and space complexity: Big `O’ and other notations, Time Complexity Analysis, Searching, Sorting, Algorithm design techniques (Greedy, Dynamic Programming and Divide‐and‐conquer), Graph traversals: BFS and DFS, Minimum spanning trees: Prim’s and Kruskal’s Algorithms, Single source shortest path: Dijkstra’s Algorithm, All Pair Shortest Path: Floyd-Warshall’s Algorithm.
- Operating System: System calls, processes, threads, inter‐process communication, CPU scheduling, concurrency and synchronization, Deadlock, CPU and I/O scheduling. Memory management and virtual memory, Disk scheduling.
- Databases Management Systems: ER‐model, ER to relational schema mapping, Relational model: relational algebra, tuple calculus, SQL, Different types of constraints, functional dependency, normalizations.
Fellowship
- Students may avail financial assistantship from external funding agencies (such as UGC/CSIR/NBHM/DST/DAE etc.) as well as from industries.
- Financial assistance is available from the Institute to the meritorious students in the form of teaching and research assistantship as per Institute norms, for those candidates who may not have any external fellowship.
- Partial financial support is available to the meritorious students to attend the workshops, short term courses and for paper presentation in refereed quality conferences as per Institute norms.
- The institute fellowship for full time Ph.D. candidates is as follows:
- INR 50000/- per month for three years.
- An extension of a maximum of 6 Months (twice, at most) based on valid reasons.
- Part time candidates are not eligible for the institute fellowship.
Note:
(a) Students are encouraged to avail financial assistantship from external funding agencies also (such as UGC/CSIR/NBHM/DST/DAE etc.) as well as from industries. They may have to be involved in Department as per rules.
Major Research Areas
Research Areas | Topics |
Data Science | Machine Learning, Data Analytics, Data Mining, Recommender Systems, Social Network Analysis, Web Science |
Artificial Intelligence | Human-Computer Interaction, Cognitive Modeling, Intelligent Agent based Modelling, Multi-agent Reinforcement Learning, Distributed Constraint Optimization, Digital Twin, Semantic measures, Knowledge graph |
Computer Vision & Image Processing | Image and Video Processing, Deep Learning, Document Analysis, Depth Estimation, Biomedical Signal Processing, Hyper-spectral Image Analysis, Medical Imaging |
Internet of Things and Cyber Physical Systems | Ubiquitous Computing, Wearable Computing Systems, Ad-hoc Networks, Real-time Scheduling, Network Protocol Design, Network-on-Chip and Communication-Centric Design |
Information & Cyber Security | Blockchain Technology, Cloud Security, Mobile Security, Security & Privacy, Cryptology, Post-Quantum Cryptography, Web Application Security, Application of Machine Learning in Cyber Security |
Software Engineering & Applications | Software Testing, Project Management, Software and Performance Engineering, Software Defect Prediction, Software Quality Assurance |
Theoretical computer science | Biocomputing and Automata Theory, Formal Methods for Program Analysis and Verification |
Natural Language Processing | Large Language Models, Multilingual Models, NLP for Indian Languages, Deep Learning for NLP |
Computational Sciences | Modeling & Simulation of Stochastic Systems, Computational Neuroscience, Queueing Theory, Information Theory |