IITG Admissions (2022-2023)

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:

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]

Regular Ph.D.

Joint Doctoral Programme

[Scroll to Top]

Admission Process

Ph.D. admission interview date: 6th -7th December 2022.

Mode of interview: In person (offline)

Selection Process: Written test followed by interview of the shorlisted candidate after the written test.

[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]

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]