IITG Admissions (2021-2022)

The CSE department has approximately equal number of Ph.D. vacancies in each diverse research areas (like Theoretical Computer Science, Computer Architecture and Embedded Systems, Computer Networks and Security, Machine Learning and Data Mining, Distributed Systems, and Man-Machine Interfaces) and detail of these research area available at https://www.iitg.ac.in/cse/cseresearchgroups
Based on our past experience, most of the Ph.D. applicants mention buzz words as their preferred research areas, so the area wise applicant distribution is skewed. Statistics of the previous admission is given as follows:

50% of applicants applied to one research area.
25% of applicants applied to another research area and
Rest 25% of candidates applied to the other four research areas.

As we invite application for Ph.D. for all the multiple diverse research areas of our department and department has an approximately equal number of Ph.D. vacancies in multiple diverse research areas. If a Ph.D. applicant mentions popular areas as his/her area of interest then his/her chances of getting selected will be less due to heavy competition in that specific research area.
Selection criteria are in general based on performance in tests and/or interviews in basic subjects of CSE (mentioned in the GATE syllabus) and your mentioned research area.

[Scroll to Top]

Shortlisting Criteria

Short-listing Criteria for CSE PhD Admission July 2021:

For all candidates, the eligibility criteria such as Qualifying Degree, Minimum CPI or Percentage of Marks and all other requirements are followed as mentioned in the admission advertisement/notification. Specifically, the criteria is (i) 6.0GPA/60% in M.Tech/M.E for a candidate with ME/MTech as qualifying degree in CS/CSE/IT/M&C, (ii) 7.0GPA/70% in BE/BTech for candidates with BE/B.Tech as qualifying degree in CS/CSE/IT/M&C and (iii) BSc in CS/IT/M&C/Maths/Data Science as major followed by MSc in CS/IT/M&C/Maths/Data Science with 6.0GPA/60% in M.Sc.

In addition, the following criteria have been followed for shortlisting:

For Regular and Fulltime Category Candidates: Either (a) Gate Score cutoffs are 480, 432 and 320 for Non-EWS/EWS, OBC-NCL and ST/SC/PWD candidates, respectively or (b) Candidates with NET-JRF in CS.

For all categories other than Regular and Full time: M.Tech/MS/ME CGPA/Percentage equal or higher than 7.0/70%, 7.0/70%, 6.5/65% for Non-EWS/EWS, OBC, and ST/SC/PWD candidates, respectively and preceding degree BE/BTech/MCA with CGPA/Percentage equal or higher than 6.5/65%, 6.5/65% and 6.0/60% for Non-EWS/EWS, OBC, and ST/SC/PWD candidates, respectively.

[Scroll to Top]

Admission Process

Ph.D. admission interview date: 25th,26th and 27th May 2021

Mode of interview: Online, via video conferencing, using Skype

Every candidate will be allotted to a session (morning or afternoon). The candidate needs to be available online in Skype for the entire allotted session.

You do not need to visit IIT Guwahati, there will not be any written test.

Certificate verification will happen at the time of Admission.

Interview panel may ask you to show any valid ID card and your interview may be recorded.

In the interview, candidates are expected to be asked questions from three basic subjects of Dual (M.Tech. + Ph.D.) syllabus. Candidates are requested fill up the form circulated in the call letter.

The result of the interview will be displayed tentatively within a week on the website of the Academic Section, IIT Guwahati.

[Scroll to Top]

Syllabus

Discrete Mathematics: Propositional Logic; Probability-Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions-Uniform, Normal, Exponential, Poisson, Binomial. Set Theory-Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean algebra. Combinatorics Permutations; Combinations; Counting; Summation; Generating functions; Recurrence relations;Graph Theory-Connectivity; Spanning trees; Cut vertices and edges; Covering; Matching; Independent sets; Coloring; Planarity; Isomorphism.

Programming and Data Structures: Programming in C; Structures, Pointers, Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps, Graphs.

Algorithms: Analysis of algorithms, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis of upper and lower bounds, Basic concepts of complexity classes P, NP, NP-hard, NP-complete.

Formal Languages and Automata Theory: Alphabets, languages, grammars; Finite automata; Regular languages, Regular expressions; Context-free languages: Pushdown automata, Context sensitive languages: Linear bounded automata; Turing machines: recursively enumerable languages; Undecidability; Operations on formal languages and their properties; Chomsky hierarchy; Decision questions on languages.

Computer Organization and Architecture: Logic functions, Minimization, Combinational and sequential circuits; Representation of fixed and floating point numbers; Computer arithmetic. Machine instructions and addressing modes, RISC and CISC paradigms, Instruction pipelining; Memory interface; Memory hierarchy -Cache memory, main memory, secondary storage; I/O transfer techniques: Program controlled, Interrupt controlled, DMA transfer.

Operating Systems: Processes, Threads, Inter-process communication, Concurrency: Mutual exclusion;Synchronization; Semaphores, Deadlock management, CPU scheduling, Memory Management: Allocation, Protection, Paging, Segmentation; Virtual Memory concepts. File Management, File Systems: Allocation, Free space management, Directory management, I/O Management: Device drivers,Disk scheduling algorithms.

Computer Networks: Basics of digital communications, Guided and unguided media, ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IPv4and IPv6, Interconnection devices -Hubs, Switches, Gateways, and Routers; Application layer protocols.

[Scroll to Top]

The benefit of joining Ph.D. CSE @ IIT Guwahati

The benefit of joining Ph.D. CSE @ IIT Guwahati are (a) Scholarship for Ph.D. is higher than M.Tech, (b) Ph.D. is a highest academic degree and it gets the highest respect in the community, you may not require any other degree (intermediate M Tech degree) after this, (c) you can proudly put Dr before your name. (d) you have options to choose both industry job as well as the stable academic job, (e) will be able to do high-quality publications in the reputed journals/conferences, (f) eligible for PMRF and Industry fellowships during the Ph.D., (g) for a sincere and hardworking student, one can finish Ph.D. in within four to five years.

List of Ph.D. alumni and their placement detail are available at http://www.iitg.ac.in/cse/researchscholarscompleted

Detail about Ph.D. program CSE @IIT Guwahati available http://www.iitg.ac.in/cse/phdcse

[Scroll to Top]

Admissions to the Dual (M.Tech. + Ph.D.) Programme, July 2021

Shortlisting Criteria

Short-listing Criteria for CSE Dual (MTech + PhD) Admission July 2021:

For all candidates, the eligibility criteria such as Qualifying Degree, Minimum CPI or Percentage of Marks and all other requirements are followed as mentioned in the admission advertisement/notification. Specifically, the criteria are BE/B.Tech other than CS/IT/M&C with minimum CGPA 7.0, 6.5 for non-EWS/EWS/OBC, SC/ST/PwD, respectively. In addition, Gate score Cut-offs are 480, 432, and 321 for Non-EWS/EWS, OBC-NCL, and ST/SC/PWD categories, respectively.

[Scroll to Top]

Admission Process Dual (M.Tech. + Ph.D.)

Dual (M.Tech. + Ph.D.) admission interview date: 26th and 27th May 2021

Mode of interview: Online, via video conferencing, using Skype

Every candidate will be allotted to a session (morning or afternoon). The candidate needs to be available online in Skype for the entire allotted session.

You do not need to visit IIT Guwahati, there will not be any written test.

Certificate verification will happen at the time of Admission.

The interviews panel may ask you to show any valid ID card and your interview may be recorded.

In the interview, candidates are expected to be asked questions from three basic subjects of Dual (M.Tech. + Ph.D.) syllabus. Candidates are requested fill up the form circulated in the call letter.

The result of the interview will be displayed tentatively within a week in the website of Academic Section, IIT Guwahati.

[Scroll to Top]

Syllabus Dual (M.Tech. + Ph.D.)

Engineering Mathemetics:

Numerical Ability: Numerical computation, Numerical estimation, Numerical reasoning and data interpretation.
Set Theory&Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
LinearAlgebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
NumericalMethods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.
Probability and Statistics: Sampling theorems, Conditional probability, Mean,median, mode and standard deviation, Random variables, Discrete and continuous distributions, Poisson, Normal and Binomial distribution, Correlation and regression analysis.

Data Structures and Algorithms: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps, Sorting and Searching. Hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide and conquer. Graph search, minimum spanning trees, and shortest paths.

Digital Logic: Boolean algebra, minimization of Boolean functions; logic gates; digital IC families (DTL, TTL, ECL, MOS, CMOS). Combinatorial circuits: arithmetic circuits, code converters, multiplexers, decoders, PROMs and PLAs, latches and flip-flops, counters and shift-registers. Sample and hold circuits, ADCs, DACs. Semiconductor memories. Microprocessor(8085): architecture, programming, memory and I/O interfacing.

Operating Systems: Processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

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).

Databases: ER-model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.

Computer Networks: Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.

Formal Language, Automata Theory and ToC: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

Programming in C/C++: Programming using basic data structures

[Scroll to Top]

Admissions to the M.Tech. Programme, July 2021

Admission Procedure

Candidates will be shortlisted based on the GATE score.

List of shortlisted candidates along with shortlisting criteria will be available on the M.Tech. admission page soon.

Based on GATE score and eligibility of the candidates, ranked list of candidates will be prepared. The admission offer will be available only through the COAP portal

[Scroll to Top]

Shortlisting Criteria

Eligibility of candidates as per minimum eligibility norms for the M. Tech. CSE program is as follows: (i) Bachelor’s degree in Engineering / Technology or equivalent in CS/IT/M&C or MSc (Computer Science/Information Technology) or MCA. (ii) The qualifying marks are 6.0/60% CPGA/Percentage for General, EWS and OBC category, and 5.5/55% CGPA/percentage for ST/SC/PWD category of candidates.

For regular M.Tech. Admissions through COAP: GATE CS score cut-off of 630, 567, and 415 for non-EWS/EWS, OBC and ST/SC/PWD, respectively.

[Scroll to Top]