(Sample Paper) Joint Entrance Screening Test (JEST)
"Theoretical Computer Science Group"
Joint Entrance Screening Test (JEST) is a preliminary
screening test conducted jointly by several premier research institutes. Among
these institutes, The Institute of Mathematical Sciences, Chennai is the only
one that offers a Ph.D. programme in Theoretical Computer Science.
The JEST screening test for entrance to the PhD programme in theoretical
computer science will be held typically on a Sunday in the middle of February
every year. The test focusses on the following areas:
Analytical Reasoning and Deduction, Combinatorics, Data Structures and
Discrete Mathematics, Graph Theory, Principles of Programming.
In each of these areas, familiarity with the basics
(including the necessary simple mathematics) is assumed. There are questions of
both types – some requiring short answers as well as some involving detailed
problem solving. A sample questionnaire is attached.
Some textbooks which may help you prepare for the test are
listed below. You don’t need to read all the books. There is no specified
“portion” for the test; rather, the test is designed to check the applicant’s
understanding of foundational aspects of computing.
1. Elements of Discrete Mathematics, C.L. Liu
2. Discrete Mathematical Structures with Applications to Computer Science,
Jean-Paul Tremblay and Ram P. Manohar
3. Compilers: Principles, Techniques and Tools, Alfred V. Aho, Ravi Sethi and
Jeffrey D. Ullman
4. Fundamentals of Data Structures, Ellis Horowitz and Sartaj Sahni
5. An Introduction to Data Structures with Applications, Jean-Paul Tremblay
and P.G. Sorenson
6. Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaj Sahni and S.
7. The Design and Analysis of Computer Algorithms, Alfred V. Aho, John E.
Hopcroft and Jeffrey D. Ullman