Applications are invited from eligible candidates for admission to the Doctoral Program for the Autumn Semester 2013-14, commencing in July 2013.
The doctoral program leading towards the award of the degree of Doctorate of Philosophy (PhD) provides the students an opportunity for a career in academia or in R&D establishments. DA-IICT aspires to take a leading role in the research areas related to Information and Communication Technology (ICT). The research interests of faculty members are widely spread in the areas of ICT and Humanities, Social Sciences, Design and Arts.
| Tuition Fee
Rs. 15,000 per Semester
| Registration Fee
|| Rs. 2,500 per Semester
| Caution Deposit
|| Rs. 5,000 (Refundable at the end of the Program)
At the time of admission an amount of Rs. 20,000 (Rs.15,000 towards Tuition Fee for the First Semester and Rs. 5,000 towards Caution Deposit) will have to be paid by the candidates.
Conventionally the duration of this program varies from 3 to 5 years. The program comprises both course and research work; the amount of coursework one has to undergo depends on the candidates' past background and the research one is engaged in. The research work to be undertaken for PhD must include original contribution to the knowledge reserve culminating in a thesis to be submitted for the doctoral degree.
The detailed Program structure, academic requirement, and comprehensive examination information can be found on Institute website at
A. Candidates willing to pursue research in the ICT and related domain must possess the following qualification:
M.Tech. / M.E. in Information and Communication Technology related areas such as ICT, Computer Science, Information Technology, Communication Technology, Electronics and Communications, Electrical Engineering, Telecommunications, Instrumentation, Bioinformatics, Biomedical Engineering and allied disciplines.
- B.Tech. / B.E. in Information and Communication Technology related areas such as ICT, Computer Science, Information Technology, Communication Technology, Electronics and Communications, Electrical Engineering, Telecommunications, Instrumentation, Bioinformatics, Biomedical Engineering and allied disciplines. GATE in respective area will be preferable.
- M.C.A. / M.Sc. in Computer Science, Information Technology, Mathematics, Statistics, Physics, and Electronics. MS/MSc degree from DA-IICT may also apply.
Candidate interested in pursuing PhD in ICT and related areas must have at least 60% marks in the qualifying degree.
Candidates with an MSc or MCA degree (or MS/MSc Degree of DA-IICT), unless they have a subsequent M Phil degree, will be considered equivalent to candidates with a B Tech / BE degree and will need to fulfill additional course and research requirements.
B. Candidates in the field of Arts, Humanities, Social Sciences, Mathematics, and Sciences and interested in these areas must have an M Phil degree in the desired area with at least 60% marks.
The decision of the concerned authorities of DA-IICT regarding eligibility of any candidate shall be final.
Candidate interested in pursuing Ph.D. in ICT and related areas must have at least 60% marks or equivalent in the qualifying degree, and must satisfy the following criteria:
- Educational qualifications as mentioned in category A or B above with 3 years of relevant experience.
- Candidates sponsored by an R&D organization with whom DA-IICT has established over 5 years of cooperative research programme or has signed an MOU.
- Candidate intends to apply in this category should forward his/her application through proper channel, that is, a forwarding certificate/letter by the head of the department/institute.
DA-IICT reserves right to relax eligible criteria for the sponsored category for deserving candidates based on candidates research profile and experience. The decision of the concerned authorities of DA-IICT regarding eligibility of any candidate shall be final.
Candidates will be selected through an Entrance Test followed by an interview. The entrance test will be used to shortlist the candidates to be interviewed.
Candidates must submit a research statement of approximately 1000 words. A list of published papers if any could be included. The research statement will be discussed at the time of personal interview.
Candidates are advised to look at profile of several research groups available at DA-IICT. One can have a look at the individual research profile of the faculty members.
The Entrance Test will next be conducted in First or Second week of July, 2013 at DA-IICT, Gandhinagar. The interview of the short-listed candidates will be taken immediately after the entrance test.
DA-IICT is an associate institution of Network Engineering Institutions (NEI). During the regular PhD admission interview, students will be given option to choose NEI’s PhD program based on students’ performance and research profile. If a regular PhD student enrolls in NEI’s PhD program and later is found not suitable, s/he can continue in regular PhD program at DA-IICT. For details about the PhD program under NEI - Click here
Candidates will be required to download the application form by clicking on the link given below. Admission fee is Rs. 1000/-. Candidates must send the completed application form along with a demand draft of Rs. 1000/- in favour of “DA-IICT” to the address given below.
Candidates need to indicate their research interests in the online application form. Candidates may provide more than one interests. Candidates are advised to look at profile of several research groups available at this website, for identifying the group that has closest match with their own research interests.
List of Faculty
Click here to apply online/ download application form
The application form and the demand draft have to be sent to:
Dhirubhai Ambani Institute of Information and Communication Technology,
Near Indroda Circle, Gandhinagar – 382 007, Gujarat
Tel: (079) 30520000
Fax: (079) 30520010
Candidates are advised to write their name and the program applied for (PhD) at the reverse of the DD. The institute takes no responsibility for loss of DD in transit.
All those admitted as full-time PhD students will be eligible for financial support in the form of Teaching Assistantship (TA) / Research Assistantship (RA). The assistantship is Rs. 15,000/- per month at the beginning and may rise upto a maximum of Rs. 25,000/- per month based on the research performance of the candidate. Students having qualifying degree as B Tech / BE or equivalent will be entitled to less stipend. The assistantship would be incremented to Rs. 18,000/- after clearing the comprehensive examination. For deserving candidates, the starting figure of the assistantship may be higher. The responsibilities associated with the teaching / research assistantship includes conducting laboratory courses and tutorials for undergraduate students, assisting in teaching, academic administration and forming research proposals.
This prestigious fellowship provides substantial financial and other benefits to full-time students pursuing a PhD program in selected areas.
- The scheme is open for fresh admissions in the PhD program. Students who are already admitted are not eligible.
- Students who are within 28 years of age, who have a first class throughout their education, and who wish to pursue research in broad areas of Computer Engineering, Computer Science, Information Systems, Information Technology and Software Engineering.
Period: For a maximum of four years or submission of thesis for PhD, whichever is earlier.
Stipend: Rs. 18,000 per month for the first two years and Rs.20,000 per month for the next two years.
- A student enrolled as TCS Research Scholar is eligible to receive support for paper presentation in one International refereed conference, held outside India, and two National/International refereed conferences, held in India, during his/her tenure.
- A TCS Research Scholar is eligible to continue as a Teaching Assistant of the institute: in that case he/she would be eligible for additional stipend of Rs. 7,500 per month from the institute, over and above the stipend provided by the Fellowship.
Selection: Institute will invite applications from students who are offered PhD admission, and recommend suitable candidates to TCS. TCS reserves the right of final selection.
Students admitted with MTech / ME/ MPhil degree
- Minimum total credit 72
- Minimum course credit 12
- Minimum research credit 48
- Minimum no. of courses 04
- Minimum residency 02 semesters
- Maximum duration 06 years
- Minimum CPI (for graduation) 7.0 / 10.0
Students admitted with B Tech / BE / MSc/ MCA degree
- Minimum total credit 96
- Minimum course credit 36
- Minimum research credit 48
- Minimum no. of courses 12
- Minimum residency 04 semesters
- Maximum duration 07 years
- Minimum CPI (for graduation) 7.0 / 10.0
Students registered for the Ph D Program must pass a comprehensive examination designed to test the overall comprehension of the student in the relevant subjects.
Students admitted with M Tech / ME / MPhil degree may appear for the examination after completing first semester but before starting fourth semester.
Students admitted with B Tech / BE /MSc / MCA degree may appear for the examination after completing second semester but before starting fifth semester.
Students should have CPI 7.0 / 10.0 or more to appear for the comprehensive examination.
Student will get two chances to pass the comprehensive examination
Student who fails to clear the comprehensive examination in two attempts will have to discontinue from the PhD Program.
Equivalent to 12 units. Post-Graduate Committee may permit for a maximum of 15 units or a minimum of 9 units.
Pattern:The test contains both objectives and subjective questions. Questions are designed to test the clarity of understanding and reasoning ability of the candidate in the subject areas which are essential during doctoral work in ICT. The question paper consists of two parts (Part I and Part II). Part I is a mandatory objective section that tests basic mathematical ability and reasoning of the candidate. Part II is subjective and has four sections A (Mathematics and Physics), B (Computer Science and Information Technology), C (Electronics and Communication Engineering) and D (Bioinformatics and Biomedical Engineering). Part II tests the in depth knowledge of the candidate in a particular area. Candidates are expected to answer at least one section from Part II. A sample copy of a PhD exam can be found here
The question paper consists of two parts (Part I and Part II).
PART – I
Mathematical Aptitude and Reasoning (10-15 Objective Questions)
Elementary questions from the following topics Mathematical Logic, Set Theory and Algebra, Combinatorics, Linear Algebra, Calculus, Probability and Statistics, Reasoning ability.
PART – II (Subjective 5-10 questions from each of Sections A,B,C,D)
Section A (Mathematics and Physics)
Elementary set theory, finite, countable and uncountable sets, Real number system as a complete ordered field, Sequences and series, convergence, limsup, liminf, Continuity, uniform continuity, differentiability, mean value theorem. Sequences and series of functions, uniform convergence. Riemann sums and Riemann integral, Improper Integrals. Monotonic functions, types of discontinuity, functions of bounded variation, Functions of several variables, directional derivative, partial derivative.
Vector spaces, subspaces, linear dependence, basis, dimension, algebra of linear transformations. Algebra of matrices, rank and determinant of matrices, linear equations.
Eigenvalues and eigenvectors, Cayley-Hamilton theorem. Matrix representation of linear transformations. Change of basis, canonical forms, diagonal forms, triangular forms, Jordan forms. Inner product spaces, orthonormal basis.
Eigenvalues and eigenvectors, Cayley-Hamilton theorem. Matrix representation of linear transformations.
Change of basis, canonical forms, diagonal forms, triangular forms, Jordan forms. Inner product spaces, orthonormal basis.
Algebra of complex numbers, the complex plane, polynomials, Power series, transcendental functions such as exponential, trigonometric and hyperbolic functions. Analytic functions, Cauchy-Riemann equations. Contour integral, Cauchy’s theorem, Cauchy’s integral formula, Liouville’s theorem, Maximum modulus principle, Schwarz lemma, Open mapping theorem. Taylor series, Laurent series, calculus of residues.
Permutations, combinations, pigeon-hole principle, inclusion-exclusion principle, derangements. Fundamental theorem of arithmetic, divisibility in Z, congruences, Chinese Remainder Theorem, Euler’s Phi function, primitive roots. Groups, subgroups, normal subgroups, quotient groups, homomorphisms, cyclic groups, permutation groups, Cayley’s theorem, class equations, Sylow theorems. Rings, ideals, prime and maximal ideals, quotient rings, unique factorization domain, principal ideal domain, Euclidean domain. Polynomial rings and irreducibility criteria. Fields, finite fields, field extensions.
Ordinary Differential Equations(ODEs):
Existence and Uniqueness of solutions of initial value problems for first order ordinary differential equations, singular solutions of first order ODEs, system of first order ODEs. General theory of homogenous and non-homogeneous linear ODEs, variation of parameters, Sturm-Liouville boundary value problem, Green’s function.
Partial Differential Equations(PDEs):
Lagrange and Charpit methods for solving first order PDEs, Cauchy problem for first order PDEs. Classification of second order PDEs, General solution of higher order PDEs with constant coefficients, Method of separation of variables for Laplace, Heat and Wave equations.
Numerical solutions of algebraic equations, Method of iteration and Newton-Raphson method, Rate of convergence, Solution of systems of linear algebraic equations using Gauss elimination and Gauss-Seidel methods, Finite differences, Lagrange, Hermite and spline interpolation, Numerical differentiation and integration, Numerical solutions of ODEs using Picard, Euler, modified Euler and Runge-Kutta methods.
Probability and Statistics:
Probability space, conditional probability, Bayes theorem, independence, Random variables, joint and conditional distributions, standard probability distributions and their properties, expectation, conditional expectation, moments; Weak and strong law of large numbers, central limit theorem; Sampling distributions, UMVU estimators, maximum likelihood estimators.
ewton’s laws of motion and applications, Kepler’s laws, Gravitational Law and field, Conservative and non-conservative forces. System of particles, Centre of mass, equation of motion of the CM, conservation of linear and angular momentum, conservation of energy. Elastic and inelastic collisions. Rigid body motion, fixed axis rotations, moments of Inertia.
Electricity and Magnetism:
Coulomb's law, Gauss's law. Field and Boundary Conditions, Laplace equation, Conductors, capacitors, dielectrics, dielectric polarization, volume and surface charges, electrostatic energy. Biot-Savart law, Ampere's law, Lenz's law, Faraday’s law of electromagnetic induction, Displacement current, Maxwell's equations and plane electromagnetic waves.
Lorentz Force and motion of charged particles in electric and magnetic fields.
Reflection and refraction of light. Wave equation, Superposition of waves, traveling and standing waves in one-dimension. Energy density and energy transmission in waves.
Group velocity and phase velocity, Two wave and multiple wave interference, Fraunhofer diffraction, Diffraction gratings. Polarization: linear, circular and elliptic polarization. Double refraction and optical rotation.
Blackbody radiation, photoelectric effect, Bohr's atomic model, X-rays. Wave-particle duality, Uncertainty principle, Schrodinger equation and application to simple examples like particle in a box, potential barrier, square potential, harmonic oscillator, hydrogen atom.
Computer Science and Information Technology
Data Structures and Algorithms:
Functions, Recursion design and iterative design, Parameter passing (by value and by reference); Abstract data types: Arrays and linked lists; Stacks, Queues, Trees, Binary search trees, Binary heaps.
Analysis of algorithms (worst-case, best-case and average running time), space requirement, Growth of functions and Asymptotic notation, Complexity of a computational problem vs. complexity of an algorithm for the problem. Design techniques: Divide-and-Conquer, Greedy approach, Dynamic programming; Tree Traversals (In-order, pre-order and post-order walks on binary search trees) and graph traversals (breadth-first search, depth-first search) Minimum Spanning trees and algorithms for finding them in connected weighted undirected graphs (Prim's and Kruskal's algorithms); Shortest paths in weighted graphs (Dijkstra's algorithm and BFS); Sorting, Searching and rank-finding algorithms for totally ordered sets.
Theory of Computation:
Alphabet, states, transitions and formal languages. Regular languages and corresponding deterministic finite state automata (DFAs), non-deterministic finite state automata (NFAs) and the equivalence of the DFA and NFA classes. Using pumping lemma to prove that a given formal language is not regular. Constructing regular languages in symbolic form (regular expressions/ regular sets/ patterns) from automata and vice-versa.
Subroutine calls/return, subroutine implementation using stacks, assembly process. Pipelining. I/O fundamentals: programmed I/O, interrupts, and DMA; I/O bus operation; Processes; threads. Inter-process communication; concurrency, synchronization. Deadlocks. Process management. Memory management and virtual memory. File systems; I/O systems. UNIX system calls.
ISO/OSI stack. LAN technologies (Ethernet, Token ring). Flow and error control techniques. Routing algorithms. Congestion control. TCP/UDP and sockets. IP(v4), ICMP. Application layer protocols (dns, smtp, pop, ftp, http). Basic concepts of hubs, switches, gateways, and routers.
Electronics and Communication Engineering
Nodal and mesh analysis, Superposition, Thevenin’s and Norton’s theorems; maximum power transfer. Steady state sinusoidal analysis using phasors. Linear constant coefficient differential equations; time and frequency domain analysis of simple RLC circuits. Semicondcutor devices and their characteristics: PN junctions, BJTs, MOSFETs. Simple diode circuits, clipping, clamping, rectifiers. Biasing and bias stability of transistor and FET amplifiers. Amplifiers: single-and multi-stage, differential and operational. Frequency response of amplifiers. Simple op-amp circuits. Simple filters. Sinusoidal oscillators; criterion for oscillation; single-transistor and op-amp configurations.
Boolean algebra, minimization of Boolean functions; logic gates; digital IC families (DTL, TTL, ECL, MOS, CMOS). Combinatorial circuits: arithmetic circuits, code converters, decoders & encoders, multiplexers & de-multiplexers, decoders. Sequential circuits: latches and flip-flops, counters and shift-registers, register-file / memory. Finite State Machines (Moore and Mealy).
Signals and Systems:
Introductions to Signals, Systems. Properties of Systems, convolution sum/integral, Fourier analysis and Laplace and Z-transform. Distortion in LTI systems, Group Delay, Phase, FIR and IIR filter design, DFT and FFT. Sampling and quantization of the signal, Uniform and non uniform quantizers, Basics of PCM, DM.
Electrostatic Fields, Electric Fields in Material Space, Electrostatic Boundary Value Problems, Magnetostatic Fields, Magnetic Forces, Time Varying Field & Maxwell's Equations, Propagation of EM Waves, Plane Waves, Wave Impedance, EM Wave Equation, EM Energy and Power Flow, Poynting Theorem, Waveguides, Coaxial cable, Antennas and Radiating Systems. Single and Multi-port Networks, S-Parameters and Scattering Matrix, Transmission Line, Reflection coefficient, Standing Wave Ratio, Impedance matching
Probability and random variables:
Probability, Random variable, Probability distributions (discrete and continuous), Expectation of random variables
Analog and Digital Communication:
Analog Modulation techniques like AM, FM and PM, Basics of Digital Modulation Schemes like ASK, PSK, QAM, etc.
Bioinformatics and Biomedical Engineering
Molecular Biology and Genetics:
Molecular structure of genes and chromosomes; DNA replication and control; Transcription and its control; Translational processes; Regulatory controls in prokaryotes and eukaryotes; Mendelian inheritance; Gene interaction; Complementation; Linkage, recombination and chromosome mapping; Extrachromosomal inheritance; Chromosomal variation; Population genetics; Transposable elements, Molecular basis of genetic diseases and applications.
The origin of immunology; Inherent immunity; Humoral and cell mediated immunity; Primary and secondary lymphoid organ; Antigen; B and T cells and Macrophages; Major histocompatibility complex (MHC); Antigen processing and presentation; Synthesis of antibody and secretion; Molecular basis of antibody diversity; Polyclonal and monoclonal antibody; Complement; Antigen-antibody reaction; Regulation of immune response; Immune tolerance; Hyper sensitivity; Autoimmunity; Graft versus host reaction.
Recombinant DNA Technology:
Restriction and modification enzymes; Vectors: plasmid, bacteriophage and other viral vectors, cosmids, Ti plasmid, yeast artificial chromosome; cDNA and genomic DNA library; Gene isolation; Gene cloning; Expression of cloned gene; Transposons and gene targeting; DNA labeling; DNA sequencing; Polymerase chain reactions; DNA fingerprinting; Southern and northern blotting; In-situ hybridization; RAPD; RFLP; Site-directed mutagenesis; Gene transfer technologies; Gene therapy.
Major bioinformatics resources (NCBI, EBI, ExPASy); Sequence and structure databases; Sequence analysis (biomolecular sequence file formats, scoring matrices, sequence alignment, phylogeny); Genomics and Proteomics (Large scale genome sequencing strategies; Comparative genomics; Understanding DNA microarrays and protein arrays); Molecular modeling and simulations (basic concepts including concept of force fields).
Control Systems and Process Control:
Feedback principles. Signal flow graphs. Transient Response, steady-state-errors. Routh and Nyquist criteria. Bode plot, root loci. Time delay systems. Phase and gain margin. State space representation of systems. Mechanical, hydraulic and pneumatic system components. Synchro pair, servo and step motors. On-off, cascade, P, P-I, P-I-D, feed forward and derivative controller, Fuzzy controllers.
Analytical, Optical and Biomedical Instrumentation:
Mass spectrometry. UV, visible and IR spectrometry. X-ray and nuclear radiation measurements. Optical sources and detectors, LED, laser, Photo-diode, photo-resistor and their characteristics. Interferometers, applications in metrology. Basics of fiber optics. Biomedical instruments, EEG, ECG and EMG. Clinical measurements. Ultrasonic transducers and Ultrasonography. Principles of Computer Assisted Tomography.
Note: Candidates having qualifying degree in Humanities/Social Sciences/Arts will not be required to appear in the entrance test based on syllabus as given on this page. They will be asked to appear for interview and/or additional presentations/assignments.
DA-IICT accepts on-line applications for the PhD program throughout the year. The entrance test and interview are conducted at least twice in the year. Applicants who wish to be considered for the 2013-14 Autumn Semester must adhere to the following dates:
Filling of online Application Forms: Commences on
23 April, 2013
Filling of online Application Forms: Closes on
23 May, 2013
Last Date for receiving completed Application Form
24 May, 2013
Entrance test & Interviews
|1st or 2nd week of July 2013
|Commencement of session
||3rd or 4th week of July 2013