SlideShare una empresa de Scribd logo
1 de 3
Descargar para leer sin conexión
Tata Institute of Fundamental Research
                 Homi Bhabha Road, Mumbai 400005

        School of Technology and Computer Science

                   Instructions for the written test

     There are two streams in the School of Technology and Computer
  Science:
    1. Computer Science.
    2. Systems Science.

      Topics covered in the two streams, as well as some sample questions,
  are given below.

      The question paper will have three parts. Part A is common to both
  the streams. It will test the general mathematical aptitude of the candi-
  date. There is no prescribed sylabus for Part A. Part B will be oriented
  towards the topics listed under ‘Computer Science’ below; and Part C will
  be oriented towards topics listed under ‘Systems Science’ below. Only one
  of Parts B, C, should be attempted. The duration of the written test will
  be three hours. The test will be of multiple choice type, with negative
  marking for incorrect answers. The use of calculators will not be allowed
  during the test.

                           Computer Science

1. Discrete Mathematics: Sets and Relations, Combinatorics (Counting) and Ele-
   mentary Probability Theory, Graph Theory, Propositional and Predicate Logic.

2. Formal Languages, Automata Theory and Computability.

3. Data Structures and Algorithms: Arrays, Lists and Trees, Sorting and Search-
   ing, Graph algorithms, Complexity of problems and NP-completeness.

4. Fundamentals of Programming Languages and Compilers: Control structures,
   Parameter passing mechanisms, Recursion, Parsing and type checking, Memory
   management.

5. Operating Systems and Concurrency

6. Switching Theory and Digital Circuits

7. Theory of Databases


                                     1
Sample Questions [Computer Science]

1. A function f : {0, 1}n → {0, 1} is called symmetric if for every x1 , x2 , . . . , xn ∈
   {0, 1} and every permutation σ of {1, 2, . . . , n}, we have

                        f (x1 , x2 , . . . , xn ) = f (xσ(1) , xσ(2) , . . . , xσ(n) ).

   The number of such symmetric functions is:
                                   n                  n
   (a) 2n+1    (b) 2n      (c) 22 /n!         (d) 22        (e) n!

2. Let r, s and t be regular expressions. Which of the following is wrong?
   (a) (r + s)∗ = (r∗ s∗ )∗ (b) r(s + t) = rs + rt
   (c) (r + s)∗ = (s + r)∗ (d) (rs + r)∗ r = r(sr + r)∗                        (e) All are correct.

3. Consider the following program
   x:=0; y:=1; z:=1;
   while y <= N do
   begin
   x:=x+1; y:=y+z+2; z:=z+2;
   end
   Which of the following holds on termination of the program?
                                   √
   (a) (x + 1)2 = N        (b) x = N
   (c) x2 = N      (d) x2 ≤ N < (x + 1)2      (e) x2 < N ≤ (x + 1)2 .

4. The maximum height of a rooted binary tree (all nodes have either two children
   or none) with N nodes is
   (a) N (b) log N (c) (N − 1)/2 (d) (N 2 )/2 (e) N (N − 1)/2.

5. If a graph G has n vertices and m edges then the depth first traversal of G can
   be carried out in time
   (a) O(n + m)                              (b) O(nm) but not O(n + m)
   (c) O(n2 ) but not O(n + m)                (d) O(n)       (e) O(m)

                                  Systems Science

1. Engineering Mathematics: Complex Analysis, Linear Algebra, Elementary Nu-
   merical Analysis, Basic Optimization Theory and Algorithms, Introduction to
   Probability Theory and Statistics.

2. Electrical and Computer Sciences: Introduction to Signals and Linear Systems
   Analysis, Control Systems, Digital Signal Processing, Basic Circuit Theory,
   Introduction to Digital Communications, Digital Computer Fundamentals, In-
   troduction to Computer Programming.


                                                  2
Sample Questions [Systems Science]

1. The probability density of a random variable is
                            f (x) = ax2 exp−kx (k > 0, 0 ≤ x ≤ ∞)
   Then, the coefficient a equals
   (a) k 3 /2           (b) k 3          (c) k 2          (d) k         (e) 2k/π.
2. Discrete sequences x(n) is non-zero for 0 ≤ n ≤ Nx and y(n) for 0 ≤ n ≤ Ny .
   The sequence z(n) is obtained by convolving x(n) and y(n). z(n) assumes
   nonzero values for N1 ≤ n ≤ N2 , where N1 and N2 can be expressed in terms
   of Nx and Ny as,
    (a)   N1    = 0; N2 = M AX(Nx , Ny )
    (b)   N1    = Nx ; N2 = Ny
    (c)   N1    = M IN (Nx , Ny ); N2 = Nx + Ny
    (d)   N1    = 0; N2 = Nx + Ny
    (e)   N1    = M IN (Nx , Ny ); N2 = M AX(Nx , Ny )
3. This is a portion of FORTRAN-77 program for assigning values to a N × N
   matrix A:
   DO I=1,N
          DO J=I,N
                  A(I,J) = ABS(I−J)+1
          ENDDO
   ENDDO
   What is the matrix A called ?
   (a) Anti-symmetric             (b) Sparse         (c) Upper triangular       (d) Toeplitz
   (e) Irregular.
4. logb (logb x) equals
    (a)   (ln ln x − ln ln b)/ ln b
    (b)   (ln x − ln b)/ ln b
    (c)   (ln ln x − ln ln b)
    (d)   (ln x − ln b)/[(ln x)(ln b)]
    (e)   None of the Above.
5. The Laplace Transform G(s) of the transfer function of a linear time invariant
   system is given by
                                               1
                                G(s) =
                                         (s + a)2 + b2
   For the system to be stable it is necessary that
   (a) a < 0        (b) a ≥ 0       (c) a = b       (d) b = 0     (e) a = −b.


                                                3

Más contenido relacionado

La actualidad más candente

 Igcse mathematics additional standards
 Igcse   mathematics additional standards Igcse   mathematics additional standards
 Igcse mathematics additional standards
Ross
 
Matrices & determinants
Matrices & determinantsMatrices & determinants
Matrices & determinants
indu thakur
 
Linear Algebra and Matrix
Linear Algebra and MatrixLinear Algebra and Matrix
Linear Algebra and Matrix
itutor
 

La actualidad más candente (18)

Matrices
Matrices Matrices
Matrices
 
Matrices and determinants
Matrices and determinantsMatrices and determinants
Matrices and determinants
 
 Igcse mathematics additional standards
 Igcse   mathematics additional standards Igcse   mathematics additional standards
 Igcse mathematics additional standards
 
Alin 2.2 2.4
Alin 2.2 2.4Alin 2.2 2.4
Alin 2.2 2.4
 
My Lecture Notes from Linear Algebra
My Lecture Notes fromLinear AlgebraMy Lecture Notes fromLinear Algebra
My Lecture Notes from Linear Algebra
 
Graphs linear equations and functions
Graphs linear equations and functionsGraphs linear equations and functions
Graphs linear equations and functions
 
Ppt presentasi matrix algebra
Ppt presentasi matrix algebraPpt presentasi matrix algebra
Ppt presentasi matrix algebra
 
Matrices and System of Linear Equations ppt
Matrices and System of Linear Equations pptMatrices and System of Linear Equations ppt
Matrices and System of Linear Equations ppt
 
Integrated Math 2 Section 8-5
Integrated Math 2 Section 8-5Integrated Math 2 Section 8-5
Integrated Math 2 Section 8-5
 
matrices and algbra
matrices and algbramatrices and algbra
matrices and algbra
 
Matrices & determinants
Matrices & determinantsMatrices & determinants
Matrices & determinants
 
Linear Algebra and Matrix
Linear Algebra and MatrixLinear Algebra and Matrix
Linear Algebra and Matrix
 
Matrix algebra
Matrix algebraMatrix algebra
Matrix algebra
 
Presentation on matrix
Presentation on matrixPresentation on matrix
Presentation on matrix
 
Matrices and determinants
Matrices and determinantsMatrices and determinants
Matrices and determinants
 
Lecture 07 graphing linear equations
Lecture 07 graphing linear equationsLecture 07 graphing linear equations
Lecture 07 graphing linear equations
 
Matrices and determinants-1
Matrices and determinants-1Matrices and determinants-1
Matrices and determinants-1
 
Matrices
MatricesMatrices
Matrices
 

Destacado

Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010
bikram ...
 
Bit mesra eligibility criteria for m. tech programmes
Bit mesra eligibility criteria for m. tech programmesBit mesra eligibility criteria for m. tech programmes
Bit mesra eligibility criteria for m. tech programmes
bikram ...
 
Cloud computing(bit mesra kolkata extn.)
Cloud computing(bit mesra kolkata extn.)Cloud computing(bit mesra kolkata extn.)
Cloud computing(bit mesra kolkata extn.)
ASHUTOSH KUMAR
 
Faculty wise course of study
Faculty wise course of studyFaculty wise course of study
Faculty wise course of study
bikram ...
 

Destacado (9)

Sports and Adventure club BIT Mesra declaration form
Sports and Adventure club BIT Mesra declaration formSports and Adventure club BIT Mesra declaration form
Sports and Adventure club BIT Mesra declaration form
 
Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010
 
Bit mesra eligibility criteria for m. tech programmes
Bit mesra eligibility criteria for m. tech programmesBit mesra eligibility criteria for m. tech programmes
Bit mesra eligibility criteria for m. tech programmes
 
Call letters
Call lettersCall letters
Call letters
 
Advertisement
AdvertisementAdvertisement
Advertisement
 
Cloud computing(bit mesra kolkata extn.)
Cloud computing(bit mesra kolkata extn.)Cloud computing(bit mesra kolkata extn.)
Cloud computing(bit mesra kolkata extn.)
 
Pgcs syllabus
Pgcs syllabusPgcs syllabus
Pgcs syllabus
 
Paper maths
Paper mathsPaper maths
Paper maths
 
Faculty wise course of study
Faculty wise course of studyFaculty wise course of study
Faculty wise course of study
 

Similar a Paper computer

Nbhm m. a. and m.sc. scholarship test september 20, 2014 with answer key
Nbhm m. a. and m.sc. scholarship test september 20, 2014 with answer keyNbhm m. a. and m.sc. scholarship test september 20, 2014 with answer key
Nbhm m. a. and m.sc. scholarship test september 20, 2014 with answer key
MD Kutubuddin Sardar
 
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Cemal Ardil
 

Similar a Paper computer (20)

Ee693 sept2014midsem
Ee693 sept2014midsemEe693 sept2014midsem
Ee693 sept2014midsem
 
ISI MSQE Entrance Question Paper (2008)
ISI MSQE Entrance Question Paper (2008)ISI MSQE Entrance Question Paper (2008)
ISI MSQE Entrance Question Paper (2008)
 
Signal Processing Assignment Help
Signal Processing Assignment HelpSignal Processing Assignment Help
Signal Processing Assignment Help
 
kactl.pdf
kactl.pdfkactl.pdf
kactl.pdf
 
AsymptoticAnalysis.ppt
AsymptoticAnalysis.pptAsymptoticAnalysis.ppt
AsymptoticAnalysis.ppt
 
Nbhm m. a. and m.sc. scholarship test september 20, 2014 with answer key
Nbhm m. a. and m.sc. scholarship test september 20, 2014 with answer keyNbhm m. a. and m.sc. scholarship test september 20, 2014 with answer key
Nbhm m. a. and m.sc. scholarship test september 20, 2014 with answer key
 
Answers withexplanations
Answers withexplanationsAnswers withexplanations
Answers withexplanations
 
Asymptotic analysis
Asymptotic analysisAsymptotic analysis
Asymptotic analysis
 
Section6 stochastic
Section6 stochasticSection6 stochastic
Section6 stochastic
 
A Mathematically Derived Number of Resamplings for Noisy Optimization (GECCO2...
A Mathematically Derived Number of Resamplings for Noisy Optimization (GECCO2...A Mathematically Derived Number of Resamplings for Noisy Optimization (GECCO2...
A Mathematically Derived Number of Resamplings for Noisy Optimization (GECCO2...
 
Mtc ssample05
Mtc ssample05Mtc ssample05
Mtc ssample05
 
Mtc ssample05
Mtc ssample05Mtc ssample05
Mtc ssample05
 
Cs6402 design and analysis of algorithms may june 2016 answer key
Cs6402 design and analysis of algorithms may june 2016 answer keyCs6402 design and analysis of algorithms may june 2016 answer key
Cs6402 design and analysis of algorithms may june 2016 answer key
 
Banco de preguntas para el ap
Banco de preguntas para el apBanco de preguntas para el ap
Banco de preguntas para el ap
 
AlgorithmAnalysis2.ppt
AlgorithmAnalysis2.pptAlgorithmAnalysis2.ppt
AlgorithmAnalysis2.ppt
 
Randomized algorithms ver 1.0
Randomized algorithms ver 1.0Randomized algorithms ver 1.0
Randomized algorithms ver 1.0
 
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
 
Tucker tensor analysis of Matern functions in spatial statistics
Tucker tensor analysis of Matern functions in spatial statistics Tucker tensor analysis of Matern functions in spatial statistics
Tucker tensor analysis of Matern functions in spatial statistics
 
01 - DAA - PPT.pptx
01 - DAA - PPT.pptx01 - DAA - PPT.pptx
01 - DAA - PPT.pptx
 
Ee693 questionshomework
Ee693 questionshomeworkEe693 questionshomework
Ee693 questionshomework
 

Más de bikram ...

Sample m.tech(cs)07
Sample m.tech(cs)07Sample m.tech(cs)07
Sample m.tech(cs)07
bikram ...
 
Sample0 mtechcs06
Sample0 mtechcs06Sample0 mtechcs06
Sample0 mtechcs06
bikram ...
 
Intphd syllabus
Intphd syllabusIntphd syllabus
Intphd syllabus
bikram ...
 
Iisc 2006 quen paper
Iisc 2006 quen paperIisc 2006 quen paper
Iisc 2006 quen paper
bikram ...
 
Me prospectus dce
Me prospectus dce Me prospectus dce
Me prospectus dce
bikram ...
 
Prospectus 2010 11
Prospectus 2010 11Prospectus 2010 11
Prospectus 2010 11
bikram ...
 
Ii sc bangalore_primer
Ii sc bangalore_primerIi sc bangalore_primer
Ii sc bangalore_primer
bikram ...
 
Jnu intake2010
Jnu intake2010Jnu intake2010
Jnu intake2010
bikram ...
 
Brochure 2010-11 mnit
Brochure 2010-11 mnitBrochure 2010-11 mnit
Brochure 2010-11 mnit
bikram ...
 
Advt mtech 6 nit s
Advt mtech 6 nit sAdvt mtech 6 nit s
Advt mtech 6 nit s
bikram ...
 
Shortlisting criteria iit kgp phd
Shortlisting criteria iit kgp phdShortlisting criteria iit kgp phd
Shortlisting criteria iit kgp phd
bikram ...
 
Shortlisting criteria for m.tech(vdtt) 1
Shortlisting criteria for m.tech(vdtt) 1Shortlisting criteria for m.tech(vdtt) 1
Shortlisting criteria for m.tech(vdtt) 1
bikram ...
 
Rules aandregulationsforms
Rules aandregulationsformsRules aandregulationsforms
Rules aandregulationsforms
bikram ...
 
Schedule jmp10 iit k
Schedule jmp10 iit  k Schedule jmp10 iit  k
Schedule jmp10 iit k
bikram ...
 

Más de bikram ... (20)

Sample m.tech(cs)07
Sample m.tech(cs)07Sample m.tech(cs)07
Sample m.tech(cs)07
 
Sample0 mtechcs06
Sample0 mtechcs06Sample0 mtechcs06
Sample0 mtechcs06
 
Mtechcs2k4
Mtechcs2k4Mtechcs2k4
Mtechcs2k4
 
C ssample08
C ssample08C ssample08
C ssample08
 
Intphd syllabus
Intphd syllabusIntphd syllabus
Intphd syllabus
 
Iisc 2006 quen paper
Iisc 2006 quen paperIisc 2006 quen paper
Iisc 2006 quen paper
 
Me prospectus dce
Me prospectus dce Me prospectus dce
Me prospectus dce
 
Drdo syllabus
Drdo syllabusDrdo syllabus
Drdo syllabus
 
Prospectus 2010 11
Prospectus 2010 11Prospectus 2010 11
Prospectus 2010 11
 
Ii sc bangalore_primer
Ii sc bangalore_primerIi sc bangalore_primer
Ii sc bangalore_primer
 
Info brochure
Info brochureInfo brochure
Info brochure
 
Jnu intake2010
Jnu intake2010Jnu intake2010
Jnu intake2010
 
Courses22008
Courses22008Courses22008
Courses22008
 
Brochure 2010-11 mnit
Brochure 2010-11 mnitBrochure 2010-11 mnit
Brochure 2010-11 mnit
 
Advt mtech 6 nit s
Advt mtech 6 nit sAdvt mtech 6 nit s
Advt mtech 6 nit s
 
M sc adm-2010
M sc adm-2010M sc adm-2010
M sc adm-2010
 
Shortlisting criteria iit kgp phd
Shortlisting criteria iit kgp phdShortlisting criteria iit kgp phd
Shortlisting criteria iit kgp phd
 
Shortlisting criteria for m.tech(vdtt) 1
Shortlisting criteria for m.tech(vdtt) 1Shortlisting criteria for m.tech(vdtt) 1
Shortlisting criteria for m.tech(vdtt) 1
 
Rules aandregulationsforms
Rules aandregulationsformsRules aandregulationsforms
Rules aandregulationsforms
 
Schedule jmp10 iit k
Schedule jmp10 iit  k Schedule jmp10 iit  k
Schedule jmp10 iit k
 

Paper computer

  • 1. Tata Institute of Fundamental Research Homi Bhabha Road, Mumbai 400005 School of Technology and Computer Science Instructions for the written test There are two streams in the School of Technology and Computer Science: 1. Computer Science. 2. Systems Science. Topics covered in the two streams, as well as some sample questions, are given below. The question paper will have three parts. Part A is common to both the streams. It will test the general mathematical aptitude of the candi- date. There is no prescribed sylabus for Part A. Part B will be oriented towards the topics listed under ‘Computer Science’ below; and Part C will be oriented towards topics listed under ‘Systems Science’ below. Only one of Parts B, C, should be attempted. The duration of the written test will be three hours. The test will be of multiple choice type, with negative marking for incorrect answers. The use of calculators will not be allowed during the test. Computer Science 1. Discrete Mathematics: Sets and Relations, Combinatorics (Counting) and Ele- mentary Probability Theory, Graph Theory, Propositional and Predicate Logic. 2. Formal Languages, Automata Theory and Computability. 3. Data Structures and Algorithms: Arrays, Lists and Trees, Sorting and Search- ing, Graph algorithms, Complexity of problems and NP-completeness. 4. Fundamentals of Programming Languages and Compilers: Control structures, Parameter passing mechanisms, Recursion, Parsing and type checking, Memory management. 5. Operating Systems and Concurrency 6. Switching Theory and Digital Circuits 7. Theory of Databases 1
  • 2. Sample Questions [Computer Science] 1. A function f : {0, 1}n → {0, 1} is called symmetric if for every x1 , x2 , . . . , xn ∈ {0, 1} and every permutation σ of {1, 2, . . . , n}, we have f (x1 , x2 , . . . , xn ) = f (xσ(1) , xσ(2) , . . . , xσ(n) ). The number of such symmetric functions is: n n (a) 2n+1 (b) 2n (c) 22 /n! (d) 22 (e) n! 2. Let r, s and t be regular expressions. Which of the following is wrong? (a) (r + s)∗ = (r∗ s∗ )∗ (b) r(s + t) = rs + rt (c) (r + s)∗ = (s + r)∗ (d) (rs + r)∗ r = r(sr + r)∗ (e) All are correct. 3. Consider the following program x:=0; y:=1; z:=1; while y <= N do begin x:=x+1; y:=y+z+2; z:=z+2; end Which of the following holds on termination of the program? √ (a) (x + 1)2 = N (b) x = N (c) x2 = N (d) x2 ≤ N < (x + 1)2 (e) x2 < N ≤ (x + 1)2 . 4. The maximum height of a rooted binary tree (all nodes have either two children or none) with N nodes is (a) N (b) log N (c) (N − 1)/2 (d) (N 2 )/2 (e) N (N − 1)/2. 5. If a graph G has n vertices and m edges then the depth first traversal of G can be carried out in time (a) O(n + m) (b) O(nm) but not O(n + m) (c) O(n2 ) but not O(n + m) (d) O(n) (e) O(m) Systems Science 1. Engineering Mathematics: Complex Analysis, Linear Algebra, Elementary Nu- merical Analysis, Basic Optimization Theory and Algorithms, Introduction to Probability Theory and Statistics. 2. Electrical and Computer Sciences: Introduction to Signals and Linear Systems Analysis, Control Systems, Digital Signal Processing, Basic Circuit Theory, Introduction to Digital Communications, Digital Computer Fundamentals, In- troduction to Computer Programming. 2
  • 3. Sample Questions [Systems Science] 1. The probability density of a random variable is f (x) = ax2 exp−kx (k > 0, 0 ≤ x ≤ ∞) Then, the coefficient a equals (a) k 3 /2 (b) k 3 (c) k 2 (d) k (e) 2k/π. 2. Discrete sequences x(n) is non-zero for 0 ≤ n ≤ Nx and y(n) for 0 ≤ n ≤ Ny . The sequence z(n) is obtained by convolving x(n) and y(n). z(n) assumes nonzero values for N1 ≤ n ≤ N2 , where N1 and N2 can be expressed in terms of Nx and Ny as, (a) N1 = 0; N2 = M AX(Nx , Ny ) (b) N1 = Nx ; N2 = Ny (c) N1 = M IN (Nx , Ny ); N2 = Nx + Ny (d) N1 = 0; N2 = Nx + Ny (e) N1 = M IN (Nx , Ny ); N2 = M AX(Nx , Ny ) 3. This is a portion of FORTRAN-77 program for assigning values to a N × N matrix A: DO I=1,N DO J=I,N A(I,J) = ABS(I−J)+1 ENDDO ENDDO What is the matrix A called ? (a) Anti-symmetric (b) Sparse (c) Upper triangular (d) Toeplitz (e) Irregular. 4. logb (logb x) equals (a) (ln ln x − ln ln b)/ ln b (b) (ln x − ln b)/ ln b (c) (ln ln x − ln ln b) (d) (ln x − ln b)/[(ln x)(ln b)] (e) None of the Above. 5. The Laplace Transform G(s) of the transfer function of a linear time invariant system is given by 1 G(s) = (s + a)2 + b2 For the system to be stable it is necessary that (a) a < 0 (b) a ≥ 0 (c) a = b (d) b = 0 (e) a = −b. 3