SlideShare une entreprise Scribd logo
1  sur  3
Télécharger pour lire hors ligne
Proposed Syllabus for Ph.D. Entrance Test

                                     Basic Mathematics

1. Set theory
        Venn diagram, set operations, mathematical induction,
        functions and relations.

2. Algebra and linear algebra
       Theory of equations, complex numbers, matrices and
       determinants, partial fractions.

3. Real analysis
        Limit, continuity, differentiation, integration, differential
        equations, series and sequences and their convergence.

4. Complex analysis
      Analytic functions, Cauchy-Riemann equations, complex
      integration, Cauchy's theorem and formula, power series
      and their convergence, Taylor and Laurent series, beta
      and gamma functions, Laplace and Fourier transforms.

5. Combinatorics
      Sum and product rules, permutation, combination,
      recurrence relations, pigeon-hole principle, principle
      of inclusion and exclusion.

6. Probability and statistics
       Mean, median, mode, basic notion of probability,
       expectation, variance and standard deviation, discrete
       and continuous probability distributions, binomial, Poisson
       and normal distributions, conditional probability and
       Bayes theorem.


                                        Digital Logic

Switching theory: Boolean algebra, logic gates, and switching functions, truth tables and
switching expressions, minimization of switching functions, Karnaugh map and Quine-
McCluskey method

Combinational logic circuits: Realization of Boolean functions using NAND/NOR gates,
Decoders, multiplexers. logic design using ROMs
Sequential circuits: Clocks, flip-flops, latches, counters and shift registers, finite-state
machine model, synthesis of synchronous sequential circuits, minimization and state
assignment

Data path, control path partition-based design.




                                 Basics of Programming

The student should be familiar with the basic concepts of programming and should be
able to write programs involving these concepts in any one of the following languages: C,
C++ or Java.
 • Conditional constructs, iteration (loops), function call or method call, Recursion,
     Recursive decomposition of a problem.

Asymptotic analysis, notions of space and time complexity.

Notion of abstract data type.

Parameter passing mechanism, scope, binding.

Arrays, lists, stacks, queues, binary tree, heap, binary search tree, graph.

Searching: linear search, binary search, hashing.

Sorting including selection sort, insertion sort, mergesort, quicksort. Heapsort.

Representation and traversal of graphs.



                                    Logical Reasoning


Verbal reasoning:
   a) Analogy: A particular relationship is given and another similar relationship has to
      be identified from the alternatives provided.
   b) Classification: Assort the items of a given group on the basis of certain common
      quality they possess and then spot the odd option out.
   c) Series Completion: Given a series of numbers or letters, it is required to either
      complete the series or find out the wrong part in the series.
d) Logical Deduction: Given a brief passage, it is required to identify the correct or
      incorrect logical conclusions.

Non-verbal reasoning:
   a) Pattern Perception: A certain pattern is given and generally a quarter is left
      blank. It is required to identify the correct quarter from the given four alternatives.
   b) Figure Matrix: More than one set of figures is given in the form of a matrix, all
      of them following the same rule. The candidate is required to follow the rule and
      identify the missing figure.
   c) Rule Detection: Given a particular rule and sets of figures, it is required to select
      a set of figures which obeys the rule and forms the correct series.

Contenu connexe

Tendances

Supervised Corpus-based Methods for Word Sense Disambiguation
Supervised Corpus-based Methods for Word Sense DisambiguationSupervised Corpus-based Methods for Word Sense Disambiguation
Supervised Corpus-based Methods for Word Sense Disambiguationbutest
 
Gate 2014 syllabus
Gate 2014 syllabusGate 2014 syllabus
Gate 2014 syllabusabhi_java
 
Computational methods couurseout line
Computational methods couurseout lineComputational methods couurseout line
Computational methods couurseout lineTemesgen Geta
 
Basic Foundations of Automata Theory
Basic Foundations of Automata TheoryBasic Foundations of Automata Theory
Basic Foundations of Automata Theorysaugat86
 
8 polynomial functions
8   polynomial functions8   polynomial functions
8 polynomial functionsKathManarang
 
How the philosophy of mathematical practice can be logic by other means (bris...
How the philosophy of mathematical practice can be logic by other means (bris...How the philosophy of mathematical practice can be logic by other means (bris...
How the philosophy of mathematical practice can be logic by other means (bris...Brendan Larvor
 
Mc0082 theory of computer science
Mc0082  theory of computer scienceMc0082  theory of computer science
Mc0082 theory of computer sciencesmumbahelp
 
Point-free semantics of dependent type theories
Point-free semantics of dependent type theoriesPoint-free semantics of dependent type theories
Point-free semantics of dependent type theoriesMarco Benini
 
Dialectica amongst friends
Dialectica amongst friendsDialectica amongst friends
Dialectica amongst friendsValeria de Paiva
 
Discrete Mathematics Lecture Notes
Discrete Mathematics Lecture NotesDiscrete Mathematics Lecture Notes
Discrete Mathematics Lecture NotesFellowBuddy.com
 
Proof-Theoretic Semantics: Point-free meaninig of first-order systems
Proof-Theoretic Semantics: Point-free meaninig of first-order systemsProof-Theoretic Semantics: Point-free meaninig of first-order systems
Proof-Theoretic Semantics: Point-free meaninig of first-order systemsMarco Benini
 
Machine Learning Unit 3 Semester 3 MSc IT Part 2 Mumbai University
Machine Learning Unit 3 Semester 3  MSc IT Part 2 Mumbai UniversityMachine Learning Unit 3 Semester 3  MSc IT Part 2 Mumbai University
Machine Learning Unit 3 Semester 3 MSc IT Part 2 Mumbai UniversityMadhav Mishra
 
Point-free foundation of Mathematics
Point-free foundation of MathematicsPoint-free foundation of Mathematics
Point-free foundation of MathematicsMarco Benini
 
Going Without: a modality and its role
Going Without: a modality and its roleGoing Without: a modality and its role
Going Without: a modality and its roleValeria de Paiva
 
Artifact3 allen
Artifact3 allenArtifact3 allen
Artifact3 allenallent07
 
Reflections on understanding in mathematics
Reflections on understanding in mathematicsReflections on understanding in mathematics
Reflections on understanding in mathematicsLamrabet Driss
 
Intro to Discrete Mathematics
Intro to Discrete MathematicsIntro to Discrete Mathematics
Intro to Discrete Mathematicsasad faraz
 

Tendances (18)

Supervised Corpus-based Methods for Word Sense Disambiguation
Supervised Corpus-based Methods for Word Sense DisambiguationSupervised Corpus-based Methods for Word Sense Disambiguation
Supervised Corpus-based Methods for Word Sense Disambiguation
 
Gate 2014 syllabus
Gate 2014 syllabusGate 2014 syllabus
Gate 2014 syllabus
 
Computational methods couurseout line
Computational methods couurseout lineComputational methods couurseout line
Computational methods couurseout line
 
Basic Foundations of Automata Theory
Basic Foundations of Automata TheoryBasic Foundations of Automata Theory
Basic Foundations of Automata Theory
 
8 polynomial functions
8   polynomial functions8   polynomial functions
8 polynomial functions
 
How the philosophy of mathematical practice can be logic by other means (bris...
How the philosophy of mathematical practice can be logic by other means (bris...How the philosophy of mathematical practice can be logic by other means (bris...
How the philosophy of mathematical practice can be logic by other means (bris...
 
Mc0082 theory of computer science
Mc0082  theory of computer scienceMc0082  theory of computer science
Mc0082 theory of computer science
 
Point-free semantics of dependent type theories
Point-free semantics of dependent type theoriesPoint-free semantics of dependent type theories
Point-free semantics of dependent type theories
 
CourseInformation
CourseInformationCourseInformation
CourseInformation
 
Dialectica amongst friends
Dialectica amongst friendsDialectica amongst friends
Dialectica amongst friends
 
Discrete Mathematics Lecture Notes
Discrete Mathematics Lecture NotesDiscrete Mathematics Lecture Notes
Discrete Mathematics Lecture Notes
 
Proof-Theoretic Semantics: Point-free meaninig of first-order systems
Proof-Theoretic Semantics: Point-free meaninig of first-order systemsProof-Theoretic Semantics: Point-free meaninig of first-order systems
Proof-Theoretic Semantics: Point-free meaninig of first-order systems
 
Machine Learning Unit 3 Semester 3 MSc IT Part 2 Mumbai University
Machine Learning Unit 3 Semester 3  MSc IT Part 2 Mumbai UniversityMachine Learning Unit 3 Semester 3  MSc IT Part 2 Mumbai University
Machine Learning Unit 3 Semester 3 MSc IT Part 2 Mumbai University
 
Point-free foundation of Mathematics
Point-free foundation of MathematicsPoint-free foundation of Mathematics
Point-free foundation of Mathematics
 
Going Without: a modality and its role
Going Without: a modality and its roleGoing Without: a modality and its role
Going Without: a modality and its role
 
Artifact3 allen
Artifact3 allenArtifact3 allen
Artifact3 allen
 
Reflections on understanding in mathematics
Reflections on understanding in mathematicsReflections on understanding in mathematics
Reflections on understanding in mathematics
 
Intro to Discrete Mathematics
Intro to Discrete MathematicsIntro to Discrete Mathematics
Intro to Discrete Mathematics
 

En vedette

Iiit b newsletter-may-09
Iiit b newsletter-may-09Iiit b newsletter-may-09
Iiit b newsletter-may-09bikram ...
 
Msphd appljul09
Msphd appljul09Msphd appljul09
Msphd appljul09bikram ...
 
Pgdsd applicationform
Pgdsd applicationformPgdsd applicationform
Pgdsd applicationformbikram ...
 
Gatemetiral2010 cseset 1
Gatemetiral2010 cseset 1Gatemetiral2010 cseset 1
Gatemetiral2010 cseset 1bikram ...
 
Gatemetiral2010 cseset 3
Gatemetiral2010 cseset 3Gatemetiral2010 cseset 3
Gatemetiral2010 cseset 3bikram ...
 
Msphdbrochure iit m
Msphdbrochure iit mMsphdbrochure iit m
Msphdbrochure iit mbikram ...
 
Syllabi ice_2007
Syllabi  ice_2007Syllabi  ice_2007
Syllabi ice_2007bikram ...
 

En vedette (10)

Pg brochure
Pg brochurePg brochure
Pg brochure
 
Iiit b newsletter-may-09
Iiit b newsletter-may-09Iiit b newsletter-may-09
Iiit b newsletter-may-09
 
Msphd appljul09
Msphd appljul09Msphd appljul09
Msphd appljul09
 
Pgdsd applicationform
Pgdsd applicationformPgdsd applicationform
Pgdsd applicationform
 
Nicpaper2009
Nicpaper2009Nicpaper2009
Nicpaper2009
 
Gatemetiral2010 cseset 1
Gatemetiral2010 cseset 1Gatemetiral2010 cseset 1
Gatemetiral2010 cseset 1
 
Gatemetiral2010 cseset 3
Gatemetiral2010 cseset 3Gatemetiral2010 cseset 3
Gatemetiral2010 cseset 3
 
Msphdbrochure iit m
Msphdbrochure iit mMsphdbrochure iit m
Msphdbrochure iit m
 
Ii tcutoff
Ii tcutoffIi tcutoff
Ii tcutoff
 
Syllabi ice_2007
Syllabi  ice_2007Syllabi  ice_2007
Syllabi ice_2007
 

Similaire à Proposed entrancetestsyllabus

Sample m.tech(cs)07
Sample m.tech(cs)07Sample m.tech(cs)07
Sample m.tech(cs)07bikram ...
 
Sample m.tech(cs)07
Sample m.tech(cs)07Sample m.tech(cs)07
Sample m.tech(cs)07bikram ...
 
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkkOBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkkshesnasuneer
 
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkkOBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkkshesnasuneer
 
BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R
BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R
BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R UVCE
 
AI 바이오 (4일차).pdf
AI 바이오 (4일차).pdfAI 바이오 (4일차).pdf
AI 바이오 (4일차).pdfH K Yoon
 
A level further mathematics zimsec syllabus cambridge zimbabwe
A level further mathematics zimsec syllabus cambridge zimbabweA level further mathematics zimsec syllabus cambridge zimbabwe
A level further mathematics zimsec syllabus cambridge zimbabweAlpro
 
Computer Science-Gate Syllabus
Computer Science-Gate SyllabusComputer Science-Gate Syllabus
Computer Science-Gate Syllabusindrasir
 
PowerPoint Presentation - Conditional Random Fields - A ...
PowerPoint Presentation - Conditional Random Fields - A ...PowerPoint Presentation - Conditional Random Fields - A ...
PowerPoint Presentation - Conditional Random Fields - A ...butest
 
M phil
M philM phil
M philpeeroz
 
Algebra 1 Course Statement
Algebra 1 Course StatementAlgebra 1 Course Statement
Algebra 1 Course Statementmlynczyk
 

Similaire à Proposed entrancetestsyllabus (20)

C ssample08
C ssample08C ssample08
C ssample08
 
C ssample08
C ssample08C ssample08
C ssample08
 
GATE Aptitude
GATE AptitudeGATE Aptitude
GATE Aptitude
 
Sample m.tech(cs)07
Sample m.tech(cs)07Sample m.tech(cs)07
Sample m.tech(cs)07
 
Sample m.tech(cs)07
Sample m.tech(cs)07Sample m.tech(cs)07
Sample m.tech(cs)07
 
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkkOBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
 
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkkOBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
OBJECTRECOGNITION1.pptxjjjkkkkjjjjkkkkkkk
 
BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R
BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R
BU (UVCE)5th Sem Electronics syllabus copy from Lohith kumar R
 
Mcs exam en
Mcs exam enMcs exam en
Mcs exam en
 
AI 바이오 (4일차).pdf
AI 바이오 (4일차).pdfAI 바이오 (4일차).pdf
AI 바이오 (4일차).pdf
 
A level further mathematics zimsec syllabus cambridge zimbabwe
A level further mathematics zimsec syllabus cambridge zimbabweA level further mathematics zimsec syllabus cambridge zimbabwe
A level further mathematics zimsec syllabus cambridge zimbabwe
 
RS
RSRS
RS
 
Computer Science-Gate Syllabus
Computer Science-Gate SyllabusComputer Science-Gate Syllabus
Computer Science-Gate Syllabus
 
PowerPoint Presentation - Conditional Random Fields - A ...
PowerPoint Presentation - Conditional Random Fields - A ...PowerPoint Presentation - Conditional Random Fields - A ...
PowerPoint Presentation - Conditional Random Fields - A ...
 
1st sem
1st sem1st sem
1st sem
 
1st sem
1st sem1st sem
1st sem
 
Calculus volume 1
Calculus volume 1Calculus volume 1
Calculus volume 1
 
M phil
M philM phil
M phil
 
Algebra 1 Course Statement
Algebra 1 Course StatementAlgebra 1 Course Statement
Algebra 1 Course Statement
 
Mca syllabus
Mca syllabusMca syllabus
Mca syllabus
 

Plus de bikram ...

Faculty wise course of study
Faculty wise course of studyFaculty wise course of study
Faculty wise course of studybikram ...
 
Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010bikram ...
 
Paper computer
Paper computerPaper computer
Paper computerbikram ...
 
Sample0 mtechcs06
Sample0 mtechcs06Sample0 mtechcs06
Sample0 mtechcs06bikram ...
 
Intphd syllabus
Intphd syllabusIntphd syllabus
Intphd syllabusbikram ...
 
Iisc 2006 quen paper
Iisc 2006 quen paperIisc 2006 quen paper
Iisc 2006 quen paperbikram ...
 
Me prospectus dce
Me prospectus dce Me prospectus dce
Me prospectus dce bikram ...
 
Prospectus 2010 11
Prospectus 2010 11Prospectus 2010 11
Prospectus 2010 11bikram ...
 
Ii sc bangalore_primer
Ii sc bangalore_primerIi sc bangalore_primer
Ii sc bangalore_primerbikram ...
 
Jnu intake2010
Jnu intake2010Jnu intake2010
Jnu intake2010bikram ...
 
Brochure 2010-11 mnit
Brochure 2010-11 mnitBrochure 2010-11 mnit
Brochure 2010-11 mnitbikram ...
 

Plus de bikram ... (20)

Faculty wise course of study
Faculty wise course of studyFaculty wise course of study
Faculty wise course of study
 
Call letters
Call lettersCall letters
Call letters
 
Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010Iitr ph d_appln_form_2010
Iitr ph d_appln_form_2010
 
Paper maths
Paper mathsPaper maths
Paper maths
 
Advertisement
AdvertisementAdvertisement
Advertisement
 
Paper computer
Paper computerPaper computer
Paper computer
 
Pgcs syllabus
Pgcs syllabusPgcs syllabus
Pgcs syllabus
 
Sample0 mtechcs06
Sample0 mtechcs06Sample0 mtechcs06
Sample0 mtechcs06
 
Mtc ssample05
Mtc ssample05Mtc ssample05
Mtc ssample05
 
Mtechcs2k4
Mtechcs2k4Mtechcs2k4
Mtechcs2k4
 
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
 

Proposed entrancetestsyllabus

  • 1. Proposed Syllabus for Ph.D. Entrance Test Basic Mathematics 1. Set theory Venn diagram, set operations, mathematical induction, functions and relations. 2. Algebra and linear algebra Theory of equations, complex numbers, matrices and determinants, partial fractions. 3. Real analysis Limit, continuity, differentiation, integration, differential equations, series and sequences and their convergence. 4. Complex analysis Analytic functions, Cauchy-Riemann equations, complex integration, Cauchy's theorem and formula, power series and their convergence, Taylor and Laurent series, beta and gamma functions, Laplace and Fourier transforms. 5. Combinatorics Sum and product rules, permutation, combination, recurrence relations, pigeon-hole principle, principle of inclusion and exclusion. 6. Probability and statistics Mean, median, mode, basic notion of probability, expectation, variance and standard deviation, discrete and continuous probability distributions, binomial, Poisson and normal distributions, conditional probability and Bayes theorem. Digital Logic Switching theory: Boolean algebra, logic gates, and switching functions, truth tables and switching expressions, minimization of switching functions, Karnaugh map and Quine- McCluskey method Combinational logic circuits: Realization of Boolean functions using NAND/NOR gates, Decoders, multiplexers. logic design using ROMs
  • 2. Sequential circuits: Clocks, flip-flops, latches, counters and shift registers, finite-state machine model, synthesis of synchronous sequential circuits, minimization and state assignment Data path, control path partition-based design. Basics of Programming The student should be familiar with the basic concepts of programming and should be able to write programs involving these concepts in any one of the following languages: C, C++ or Java. • Conditional constructs, iteration (loops), function call or method call, Recursion, Recursive decomposition of a problem. Asymptotic analysis, notions of space and time complexity. Notion of abstract data type. Parameter passing mechanism, scope, binding. Arrays, lists, stacks, queues, binary tree, heap, binary search tree, graph. Searching: linear search, binary search, hashing. Sorting including selection sort, insertion sort, mergesort, quicksort. Heapsort. Representation and traversal of graphs. Logical Reasoning Verbal reasoning: a) Analogy: A particular relationship is given and another similar relationship has to be identified from the alternatives provided. b) Classification: Assort the items of a given group on the basis of certain common quality they possess and then spot the odd option out. c) Series Completion: Given a series of numbers or letters, it is required to either complete the series or find out the wrong part in the series.
  • 3. d) Logical Deduction: Given a brief passage, it is required to identify the correct or incorrect logical conclusions. Non-verbal reasoning: a) Pattern Perception: A certain pattern is given and generally a quarter is left blank. It is required to identify the correct quarter from the given four alternatives. b) Figure Matrix: More than one set of figures is given in the form of a matrix, all of them following the same rule. The candidate is required to follow the rule and identify the missing figure. c) Rule Detection: Given a particular rule and sets of figures, it is required to select a set of figures which obeys the rule and forms the correct series.