Summary Tables and Checklists
Complete Preparation Checklist
Written Exam Preparation Checklist
Data Structures:
Arrays: operations, 2D arrays, pointer arithmetic
Linked Lists: singly, doubly, circular; insert, delete, reverse
Stacks and Queues: operations, applications
Trees: BST, AVL, Heap (min/max), B-trees
Graphs: representation, BFS, DFS, Dijkstra, Prim, Kruskal
Hashing: collision resolution, load factor
Algorithms:
Sorting: bubble, insertion, selection, merge, quick, heap
Searching: linear, binary
Complexity: Big-O, Omega, Theta; Master’s theorem
Dynamic Programming: LCS, knapsack, coin change
Greedy: activity selection, Huffman coding
Divide and Conquer: merge sort, binary search
Mathematics:
Linear Algebra: eigenvalues, eigenvectors, rank, determinant
Calculus: differentiation, integration, limits, ODEs
Probability: conditional probability, Bayes’ theorem, distributions
Discrete Math: sets, relations, logic, graph theory, combinatorics
C Programming:
Output-based: loops, recursion, static variables, pointers
Memory: malloc, calloc, free
Strings: standard functions
Systems (for post-2023):
- OS: scheduling, paging, deadlocks, process management
- DBMS: SQL, normalization, functional dependencies
- CN: OSI model, subnetting, IP fragmentation
Interview Preparation Checklist
Subject Preparation:
Choose 2-3 subjects you know DEEPLY
Prepare to prove, not just state, key results
Practice explaining on paper
Know all edge cases and complexity analyses
Research Motivation:
Articulate WHY you want to do research (specifically)
Name 2-3 IIITH faculty/labs that interest you and why
Know 1-2 papers or projects from those labs
Have a clear research interest area (doesn’t have to be fixed)
Have all academic certificates
Day-Of:
- Join as soon as you get the link and keep waiting
- Relax. Nervousness is normal but breathe
- Think out loud during the interview
- Say “I don’t know” clearly when you don’t, then reason from first principles
- Ask clarifying questions if needed
Timeline: Application to Joining
Please note that the below information is subject to change at the time of your application.
| Month | Activity | Notes |
|---|---|---|
| February | Application opens | Check IIITH website for exact date; typically mid-February |
| March | Application deadline | Submit early to avoid last-minute issues |
| April-May | Written Examination | Usually late April or early May; check admit card for exact date |
| May | Results/Shortlisting | A few weeks after exam |
| May | Personal Interview | Usually May 20-25 at IIITH Hyderabad campus |
| June | Final Selection Announcement | |
| July | Joining | Orientation and bridge courses begin |
—
Subject-Wise Question Count (Approximate)
| Subject | Questions | Marks | Priority |
|---|---|---|---|
| Data Structures (CSE) | 12-15 | 24-30 | Very High |
| Mathematics | 10-15 | 20-30 | High |
| Algorithms (CSE) | 8-12 | 16-24 | High |
| C Programming (CSE) | 8-10 | 16-20 | High |
| OS/DBMS/CN (CSE) | 5-10 | 10-20 | Medium-High |
| Discrete Math (CSE) | 3-6 | 6-12 | Medium |
| Digital Logic (CSE) | 1-3 | 2-6 | Medium |
| Signals & Systems (ECE) | 8-12 | 16-24 | Very High |
| Analog Electronics (ECE) | 8-10 | 16-20 | High |
| Digital Electronics (ECE) | 8-10 | 16-20 | High |
| Network Theory (ECE) | 8-10 | 16-20 | High |
| Communication (ECE) | 3-6 | 6-12 | Medium |