Scribd
Upload
50 views2 pages

Syllabus and Sample Questions

The document outlines the syllabus and sample questions for PhD admission at the Indian Institute of Technology Hyderabad's Department of Computer Science and Engineering. It includes topics in Data Structures, Algorithms, Programming, Probability, Linear Algebra, Discrete Mathematics, and other areas aligned with the GATE CS syllabus. Sample interview questions are provided across various subjects to assist candidates in their preparation.

Uploaded by

amrita26121999
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views2 pages

Syllabus and Sample Questions

The document outlines the syllabus and sample questions for PhD admission at the Indian Institute of Technology Hyderabad's Department of Computer Science and Engineering. It includes topics in Data Structures, Algorithms, Programming, Probability, Linear Algebra, Discrete Mathematics, and other areas aligned with the GATE CS syllabus. Sample interview questions are provided across various subjects to assist candidates in their preparation.

Uploaded by

amrita26121999
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Indian Institute of Technology Hyderabad

Department of Computer Science and Engineering


=========================================================
Syllabus and Sample Questions for PhD Admission

Syllabus:
We will use the same syllabus for both the written tests and interviews. However, please note
that in the interview we may ask questions from your research area that are not covered in the
syllabus given here. For more details about your interview preparation, please check here. The
syllabus is nearly identical to the GATE CS syllabus. However, we have listed some of the topics
in detail.

Data Structures and Algorithms:


●​ Data structures: arrays, stacks, queues, recursion, linked lists, binary trees, binary
search trees, min/max heaps, graphs, searching, sorting, and hashing.
●​ Algorithms: asymptotic notations, time and space complexity, divide and conquer,
greedy method, dynamic programming, graph traversals, minimum spanning trees, and
shortest paths.
Programming:
●​ Basic programming knowledge in C/C++.

Probability, Linear Algebra, and Discrete Mathematics:


1.​ Discrete Mathematics: Propositional and first-order logic. Sets, relations, functions,
partial orders, and lattices. Monoids, Groups. Graphs: connectivity, matching, coloring.
Combinatorics: counting, recurrence relations, generating functions.
2.​ Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and
eigenvectors, LU decomposition.
3.​ Probability and Statistics: Random variables. Uniform, normal, exponential, Poisson,
and binomial distributions. Mean, median, mode, and standard deviation. Conditional
probability and Bayes theorem.

Follow the GATE CS syllabus from this link for the following topics:
1.​ Digital Design
2.​ Computer Organization and Architecture
3.​ Theory of Computation
4.​ Compiler Design
5.​ Operating System
6.​ Databases
7.​ Computer Networks.
Sample Interview Questions

Data Structures:

1.​ Given a binary tree, how do you determine if the tree is a binary search tree?
2.​ Implement a first-in first-out (FIFO) queue using only two stacks. The implemented
queue should support all the functions of a normal queue. Follow up: Can you
implement the queue such that each operation is amortized O(1) time complexity?
3.​ How do you convert a max heap into a min-heap?

Discrete Structures:
1.​ Prove that for every positive integer N, there are N consecutive composite integers.
2.​ Show that given any 17 numbers it is possible to choose 5 whose sum is divisible by 5.

Probability and Linear Algebra


1.​ When you throw a dice two times, the probability that the second number is greater than
the first?
2.​ Let A be an N x N square matrix. What can we say about the rank of a matrix if the
determinant of A is 0?

Computer Networks
1.​ How would a layer-3 router find a possible link failure in the rest of the network?
2.​ How does a TCP sender infer packet loss in the network?

Computer Architecture:
1.​ What is a data hazard in pipelining? How forwarding can reduce the overhead of data
hazard? Can you give an example, in terms of RISC-V ISA, when forwarding cannot
resolve the issues of data hazard?
2.​ What is the difference between capacity misses and conflict misses in terms of cache
memory?

DBMS:
1.​ Give an example of BCNF decomposition which does not preserve functional
dependencies.
2.​ What is the advantage of clustered indexing over non-clustered indexing?
3.​ Explain a technique to implement natural join between two tables T1 and T2 when both
the tables are sorted on the common attributes.

=====================================================
All the best!!

For any other queries, please contact, PhD Admission Committee, Department of CSE, IIT
Hyderabad, Kandi, Sangareddy, 502284, [email protected]

You might also like