10 views

Uploaded by Narmadha Ramesh

b.stat course details

save

- Presentation 6
- Web_Ch24_update_8-27-09
- Probability,Statistics and numerical Methods.pdf
- 5Enote5 Probability
- Chapter 06 (Part A) PowerPoint.ppt
- Probability and Statistic
- VGSOM Pre-Session Assignment 2010
- Probability Theory and Stochastic Processes
- Statistics Study Guide
- Probability
- CCP303
- Approximating Distributions
- Blast Load-paper 411 1
- c5
- 44852464-Probability-and-Statistics.pdf
- 1994. Business School Prestige Research Versus Teaching
- Grubbs Trom Tang 2006
- Business Mathematics and Statistics E-sample.pdf
- Diagnostics TestPlan
- Assignment 3
- Guo EXAM P
- Comparative
- PS_Kirkland
- Marley Colonius JMP92
- Process Modeling by Statistical Methodes 905331 Lecture 1
- Ref_ Ped Competence.pdf
- Stat
- BBA-ib-2-syl
- Spring 2009 Test 1 Solution
- Fao - Tilmicosin Draft
- Units
- brochure
- dd.pdfd
- Wac Commander.not All Codes Are Working.good Luck
- Units
- Ress Ours
- thalli pogathey yenai nee
- thulli thulli ayya mallai
- nannn
- Bst at Brochure 2012

You are on page 1of 42

Student’s Brochure

B. Stat. (Hons.) Programme

(Effective from 2012-13 Academic Year)

**203 BARRACKPORE TRUNK ROAD
**

KOLKATA 700108

**INDIAN STATISTICAL INSTITUTE
**

B. STAT. (HONS.) PROGRAMME

Contents

1 General Information

1.1 Scope . . . . . . . . . .

1.2 Duration . . . . . . . . .

1.3 Centre . . . . . . . . . .

1.4 Course Structure . . . .

1.5 Satisfactory Conduct . .

1.6 Examination guidelines

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

1

1

1

1

1

1

2

2 Academic Information

2.1 Class Teacher . . . . . . . . .

2.2 Attendance . . . . . . . . . . .

2.3 Examinations and Scores . . .

2.4 Promotion . . . . . . . . . . .

2.5 Repeating a year . . . . . . . .

2.6 Final Result . . . . . . . . . . .

2.7 Award of Certificates . . . . .

2.8 Stipend and contingency grant

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

2

2

3

3

4

5

5

6

6

.

.

.

.

.

7

7

7

8

8

8

.

.

.

.

.

.

3 Miscellaneous

3.1 Prizes and Medals . . . .

3.2 Library Rules . . . . . .

3.3 Hostel Facilities . . . . . .

3.4 Field Training Programme

3.5 Change of Rules . . . . .

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

**4 B. Stat. (Honours) Curriculum
**

5 Elective Courses

5.1 Objectives of the Elective Courses

5.2 Elective Groups . . . . . . . . . .

5.3 Choice of Electives . . . . . . . . .

5.4 Use in Advanced Courses . . . . .

9

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

10

10

10

10

10

6 Optional Courses

11

**7 Detailed Syllabi of the B. Stat. (Hons.) Courses
**

7.1 Statistics Courses . . . . . . . . . . . . . . . . . . .

7.2 Probability Courses . . . . . . . . . . . . . . . . . .

7.3 Mathematics Courses . . . . . . . . . . . . . . . . .

7.4 Computer Science Courses . . . . . . . . . . . . . .

7.5 Elective Courses . . . . . . . . . . . . . . . . . . .

11

11

17

19

23

24

3

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

.

7.6

7.7

Optional Courses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Remedial English Course . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

33

38

(ii) withholding results. The punishment may also take the shape of (i) withholding Stipend/Fellowship or other benefits.) programme has 30 one-semester credit courses. 1 . 1. as given in the curriculum below in Section 4.) programme is currently offered at Kolkata only. programme.4 Course Structure The B.) degree will automatically be admitted to the M. (iii) suspension or expulsion from hostel and the likes.) degree programme offers comprehensive instruction in the theory. 1.) programme is three years (six semesters). There is a study-break of one week before the semestral examination in each semester. Violations of the above will be treated as breach of discipline and unsatisfactory conduct. (Hons. to 5. Stat (Hons. 1.2 Duration The total duration of the B.5 Satisfactory Conduct The students shall observe all rules (inclusive of hostel and mess rules) of the Institute. An academic year. Incidents of ragging will be reported to the police. Stat. withdrawal of stipend and/or expulsion from the hostel/Institute.00 p. Stat. as determined through a test. as well as Computer Science. or take up careers as Statisticians in research institutions and scientific laboratories. in addition to several areas of Mathematics and some basic areas of Computer Science. It also offers Elective Courses in some other subjects as given in Section 5. suspension from the Institute/classes for a limited period and fine. Local laws governing ragging are also applicable to the students of the Institute. They will attract penalties ranging from : withholding promotion/award of degree.1 1. 1. The time-table preferably will not have an off day in the beginning or the end of the week.15 a.m. (Hons. Economics and allied fields. a non-credit course on Remedial English is offered in the first semester of the first year. the students would be able to pursue higher studies in areas of Statistics and Mathematics.3 Centre The B. This course is compulsory for those who are found to have deficiency in English comprehension and writing. Besides the above courses.m. The classes are generally held only on the weekdays from 10. five per semester. (Hons.1 General Information Scope The B. or. Ragging is banned in the Institute and anyone found indulging in ragging will be given punishment such as expulsion from the Institute. government departments or industries. usually starts in July and continues till May.2 should be met. It is so designed that on successful completion. Stat. Attendance requirements in classes detailed in Section 2. Students shall not indulge in rowdyism or any other act of indiscipline or unlawful/unethical/ indecent behavior. Stat. Stat. (Hons. The students successfully completing the requirements for the B. Several groups of three elective courses in natural and social sciences are offered. methods and application of Statistics. consisting of two semesters with a recess in between.

Students are required to take their seats according to the seating arrangement displayed.. Presence of any unsigned or undated sheet in the answer script will render it (i.) 6. If the first offence is in a backpaper examination the student will get Zero in the backpaper. 2. (ii) a student already repeating. Students should ensure that the main answer booklet and any extra loose sheet bear the signature of the invigilator with date. If any student takes a seat not allotted to him/her.e. will have to repeat the corresponding year without stipend. will have to discontinue the programme.1. 2 . even in switched-off mode. as mentioned in Section 2. the teacher(s) of the course. and this may lead to charges of violation of the examination rules. Stat programme. (The other conditions for promotion.e. 5. Any student caught cheating or violating examination rules for the first time will get Zero in that paper. Under no circumstances. the unsigned or undated sheet) to be cancelled. Any discrepancy should be brought to the notice of the invigilator immediately. Even in such cases.e. these articles cannot be shared. books and notes will be allowed inside the examination hall only if these are so allowed by the teacher(s) concerned i. 3. he/she may be asked by the invigilator to hand over the answer script (i. discontinue the examination) and leave the examination hall.1 Academic Information Class Teacher One of the instructors of a class is designated as the Class Teacher. Any student caught cheating or violating examination rules more than two times will be asked to discontinue the programme and leave the Institute.6 Examination guidelines 1. two or more students writing the same paper can go outside together. 7. Further.4 will continue to hold. and to discuss their problems regarding courses. This means that (i) a student not already repeating. Any student caught cheating or violating examination rules for the second time will be denied promotion in that year. students cannot leave the examination hall during the first 30 minutes of any examination. Students are not allowed to carry inside the examination hall any mobile phone with them. 4. Students are required to meet their respective Class Teachers periodically to get their academic performance reviewed.. Any student caught cheating or violating examination rules is not eligible for direct admission to the M. or if the question paper is an open-note/ book one. 2 2.. No student is allowed to leave the examination hall without permission from the invigilator(s). Calculators.

Such a back-paper is called a compulsory back-paper. This is called an optional back-paper. The semestral examination of the Statistics Comprehensive course is conducted in the form of a viva voce. The viva voce is conducted by a panel of at least five teachers (at a time) who taught Statistics courses to the group of students concerned. If a student is absent. home-assignments.) programme if he/she fails the Remedial English course even after these three attempts. see Section 2. Compensatory Examination: The following rule applies to a student who obtains less than 35% 3 . The weights of examinations in a course are announced before the mid-term examination of the semester. If the score of a student in the back-paper examination of Remedial English is below 35%. The minimum composite score to pass a credit or non-credit course is 35%. No back-paper examination is allowed in this course.3 Examinations and Scores There are two formal examinations in each course: mid-semestral (midterm) and semestral (final). Back Paper Examination: If the composite score of a student in a course (other than the Statistics Comprehensive) is above 35% but falls short of 45%. If a student takes more than the allotted quota of backpaper examinations in a given academic year. his/her new composite score in that course will be the higher of the back-paper score and the earlier composite score.8. Failing to do so may result in disciplinary action. In the case of courses involving field work. some weightage is given to the field reports also. quizzes and the practical record book (and/or project work) in that course. (Hons. he/she is allowed to repeat the course in the following year along with the new first year students. a student with composite score less than 35% in any course (other than the Statistics Comprehensive) must take a backpaper examination to improve the score to a maximum of 45%. The ceiling on the total number of backpaper examinations a student can take is as follows: 4 in the first year. he/she must apply for leave to the Dean of Studies or Academic Coordinator.2. the marks of those particular courses will be reverted to their original scores. 3 in the final year. Note that this ceiling is for the entire academic year.2 Attendance Every student is expected to attend all the classes. When a student takes back-paper examination in a course. A student is not allowed to continue in the B. Stat. However. then at the end of that academic year the student should decide which of the optional back-paper examination scores should be disregarded. In such a case. The composite score in a course is a weighted average of the scores in the mid-semestral and semestral examinations. subject to a maximum of 45%. The semestral examination has a weight of at least 50%. A student is also required to furnish proper notice in time and provide satisfactory explanation if he/she fails to take an examination. she/he will have an option to take a back-paper examination to improve the score to a maximum of 45%. where questions are asked on materials from the various Statistics courses taken by the students in the first five semesters. 3 in the second year. 2. Inadequate attendance record in any semester would lead to reduction of stipend in the following semester. At most one back-paper examination is allowed in any course other than the Remedial English Course.

2. On receipt of such application from a student with supporting documents.in at most one course even after the compulsory back paper examination. Also. or repeat the year if the existing rules so allow. and not do both. Supplementary Examination: If a student misses an examination due to medical or family emergencies. The student is not expected to attend the course. A student can appear in at most one compensatory paper every academic year. regardless of the year of study in the programme. A student scoring less than 35% in this examination will have to discontinue the programme. For the back-paper or the compensatory papers. or to take the mid-semestral examination or to do assignments. in consultation with the Teachers Committee. e. then the stipend may be restored but not with retrospective effect. is 45% or 35% respectively. she/he will not be eligible for any prizes or awards. The student should submit a written application to the Dean of Studies for appearing in the supplementary examination. and that the score(s) in non-credit course(s) should be at least 35 4 . but scores 60% or more in average in the remaining courses of that academic year: If such a student is not in the final year of the programme. she/he may be provisionally promoted without stipend or contingency grant to the following year. may decide on the mechanism of conducting a special examination of that particular course along the lines suggested above. Supplementary examinations will be held for mid-semestral. No compensatory paper will be allowed in a course where backpaper is not allowed. within six months of the end of that academic year. The student can either appear in the compensatory paper. projects. The student must inform the Dean of Studies in writing in advance regarding his/her choice. etc. which is a regular (semestral) examination in the corresponding semester of the following year..4 Promotion A student passes a semester of the programme only when he/she secures composite score of 35% or above in every course AND his/her conduct has been satisfactory. subject to the requirement that the paper is cleared through the so-called compensatory examination. If a student successfully clears the examination. The student can score at most 60% in the supplementary examinations to mid-semestral and semestral examinations. back-paper and compensatory examinations within a month of the examination. If a student passes both the semesters in a given year. The compensatory examinations for all subjects will be held once in an academic year. on whether such examination will be allowed. if the conditions stated above are met. enclosing supporting documents. semestral. the Dean of Studies. In case the student in question is in the final year of the programme. Statistics Comprehensive. The student can score at most 35% in such an examination. he/she can appear in the supplementary examination. in consultaion with the relevant Teachers’ Committee. even if these are prescribed for the course in that semester.g. the maximum the student can score in the supplementary examination. along with the regular courses for that semester in the current year. the specific requirements for promotion to the following year are as follows: Average composite score in all the credit courses taken in a year should be at least 45%. Only the score in the semestral examination need be considered for the purpose of evaluation. the Dean of Studies will decide.

) .III. if the student is from such an economically underprivileged background that this step will force the student to discontinue. (ii) average score in the eighteen core1 courses is at least 60%. Nonparametric and Sequential Methods.) . Probability Theory I . while Statistics Comprehensive carries 200 marks.IV. However. Stat. and (iii) the number of composite scores less than 45% is at most one. 1 The eighteen core courses in which a student must have a minimum average score in order to be placed in a particular division are: Analysis I. The repeat year must be the academic year immediately following the year being repeated. Statistics Comprehensive 5 . Stat degree without Honours and has at most eight composite scores (in credit courses) less than 45% in the first two years. (Hons. Parametric Inference. and (iv) the number of composite scores less than 45% is at most six. Stat. A repeating student will not get any stipend or contingency grant or prizes during the repeat year.5 Repeating a year A student fails a year if he/she is not eligible for promotion. However. A student who is going to repeat the first year of the B. a student can repeat only one of the first two years and the final year. Vectors and Matrices I II.First Division (i) Not in the First Division with distinction (ii) the overall average score is at least 60% but less than 75%. A student repeating a year must be assessed for all courses even if the student has passed them in the original year. B. A student who secures B. 2. (ii) the overall average score is at least 45%. (Hons.First Division with distinction – (i) The overall average score is at least 75%. (Hons.2. provided his/her conduct is satisfactory.) . Sample Surveys. If a student fails a year then he/she can repeat the year subject to approval of the Teachers committee. is allowed to repeat the final year. B. Stat. to assess whether the student has an aptitude for the programme. and the student must obtain a minimum of the respective pass marks in such courses in the repeat year. B.) degree in one of the following categories according to the criteria he/she satisfies. (iii) average score in the eighteen core courses is at least 60%. then the student can appeal to the Dean of Studies for financial support. Linear Statistical Models. Stat. The student is awarded the B. The final score in a course being repeated will be the maximum of the scores obtained in the respective two years. and he/she passes all the years. (Hons. Stat (Hons) course should undergo counseling by the Dean of Studies in the presence of his/her parents/guardians.6 Final Result At the end of the third academic year the overall average of the percentage composite scores in all the credit courses taken in the three-year programme is computed for each student. Design of Experiments. and (iv) the number of composite scores less than 45% is at most four. (iii) average score in the eighteen core courses is at least 45%.III. Each of the credit courses carries a total of 100 marks.Second Division (i) Not in the First Division with distinction or First Division. Statistical Methods I .

then he/she is awarded the B. conduct.) programme the student obtains any scholarship with retrospective effect then the student should return the stipend given by the institute.3 and 1. 2. the full value of the stipend is awarded in the following semester.7 Award of Certificates A student passing the B. then she/he can appeal to the Dean of Studies or the Students In-charge. If during the B. as specified below. passes all the courses but does not fulfill the requirements for the award of the degree with Honours.5 1.8 Stipend and contingency grant Other than refundable Library and Hostel deposit and the recurring mess fees there are no fees charged by the institute. Performance in course work If. 2. and attendance. Stat. degree examination is given a certificate which includes (i) the list of all the credit courses taken in the three-year programme along with the respective composite scores. or (iii) the average composite score in all credit courses is less than 45%. The Certificate is awarded in the Annual Convocation of the Institute following the last semestral examination. Students having other Scholarships: If a student is getting a scholarship from another government agency then the stipend will be discontinued. A monthly Stipend of Rs 3000. in any particular semester. if she/he is from such an economically underprivileged background that this step will force him/her to discontinue. or (ii) the composite score in more than one course (two courses in the case of the first semester of the first year) is less than 45%. provided the requirements for continuation in the academic programme (excluding repetition) are satisfied. This is valid initially for the first semester only. Stat. and the number of credit course scores less than 45% 6 . the average composite score is at least 60% and the number of credit course scores less than 45% is at most one in any particular semester (at most two in the first semester of the first year). see Sections 2. 2. If all the requirements for continuation of the programme are satisfied. A student fails if his/her composite score in any credit or non-credit course is less than 35%. for financial support. However. If all the requirements for continuation of the programme are satisfied. no stipend is awarded in the following semester. First Division or Hons.If a student has satisfactory conduct. is awarded at the time of admission to each student. (ii) the list of all non-credit courses passed and (iii) the category (Hons. the average composite score is at least 45% but less than 60%. Failure to do so will be deemed as unsatisfactory conduct and corresponding rules shall apply. degree without Honours. (i) the composite score in any course is less than 35%. A repeating student will not get any stipend or contingency grant or prizes during the repeat year. Stat (hons. The amount of stipend to be awarded in each subsequent semester depends on academic performance. First Division with Distinction or Hons. Second Division or without Honours) of his/her final result.

) programme for at least two months. Contingency grants can be utilised after the first two months of admission. Stat.M. Prof. may withdraw the stipend of a student fully for a specific period if his/her conduct in the campus is found to be unsatisfactory. An yearly contingency grant of Rs 3000 is given to students at the time of admission. All such expenditure should be approved by the Students-In-Charge.R. 3 3.). Contingency grants can be used for purchasing a scientific calculator (or calculator) and other required accessories for the practical class. Conduct The Dean of Studies or the Class Teacher.Iyer Memorial Gold Medal to the outstanding B. Stat. The library rules. (Hons. B.is at most one in any particular semester (at most two in the first semester of the first year). Stat. (Hons. 3. M. 3. 250 in order to avail of the borrowing facility. Note: Once withdrawn. text books and supplementary text books and for getting photocopies of required academic material.) student. Stipends are given after the end of each month for eleven months in each academic year.1 Miscellaneous Prizes and Medals ISI Alumni Association awards Mrs. The first stipend is given two months after admission with retrospective effect provided the student continues in the B. at any time. stipends may be restored in a subsequent semester based on improved performance and/or attendance. (Hons.Sengupta Gold Medal is awarded for an outstanding performance in B. Stat. (Hons. Stipend is fully withdrawn as soon as the requirements for continuation in the academic programme are not met. Only one book is issued at a time to a student. J. All composite scores are considered after the respective back-paper examinations. 4. in consultation with the respective Teachers’ Committee. 7 . A student can borrow at most three books at a time. the stipend is halved in the following semester. Every student is required to bring a scientific calculator for use in the practical classes. no stipend is awarded in the following semester. Attendance If the overall attendance in all courses in any semester is less than 75%. Fine is charged if any book is not returned by the due date stamped on the issue-slip. but no stipend is restored with retrospective effect. Any book from the Text Book Library (TBL) collection may be issued out to a student only for overnight or week-end reference provided at least one copy of that book is left in the TBL.2 Library Rules Every student is allowed to use the reading room facilities in the library and allowed access to the stacks.) students have to pay a security deposit of Rs. and other details are posted in the library.

it may not be possible to accommodate all students in the hostels. However. 3. 605 as caution deposit and Rs.5 Change of Rules The Institute reserves the right to make changes in the above rules.3 Hostel Facilities The Institute has hostels for male and female students in its Kolkata campus.Limited medical facilities are available free of cost at Kolkata campuses. course structure and the syllabi as and when needed. 8 .4 Field Training Programme All expenses for the necessary field training programmes are borne by the Institute. The students have to pay Rs. as per the Institute rules.3. 50 per month as room rent. 3.

practicals. (Honours) Curriculum All the courses listed below are allocated three lecture sessions and one practical/tutorial session per week. All these need not be contact hours. etc. Computer and Elective courses. computer outputs. The practical/tutorial session consists of two periods in the case of Statistics.4 B. The periods are meant to be used for discussion on problems. for special lectures and self study. assignments. Stat. and one period in case of Mathematics and Probability courses. First Year Semester I Analysis I (C) Probability Theory I (C) Vectors and Matrices I (C) Statistical Methods I (C) Introduction to Programming and Data Structures Remedial English (non-credit) Semester II Analysis II (C) Probability Theory II (C) Vectors and Matrices II (C) Statistical Methods II (C) Numerical Analysis Second Year Semester I Analysis III (C) Probability Theory III (C) Statistical Methods III (C) Elements of algebraic structures Semester II Introduction to Markov Chains Discrete Mathematics Statistical Methods IV (C) Economic and Official Statistics and Demography Elective Course II Elective Course I Third Year Semester I Linear Statistical Models (C) Parametric Inference (C) Sample Surveys (C) Statistical Quality Control and Operations Research Elective Course III Semester II Nonparametric and Sequential Methods (C) Design of Experiments (C) Statistics Comprehensive (C) Design and Analysis of Algorithms Optional Course 9 .

10 . It may be helpful to know the M. The secondary objective is to enrich the general scientific knowledge which may be of use later in professional work.Stat.5 5.3 Choice of Electives A Student has to choose one group of elective courses for credit in the beginning of the second year.Stat. each student has to choose one group from the following list.) curriculum has been designed as a part of the five-year programme leading to the M.1 Elective Courses Objectives of the Elective Courses The primary objective is to impart knowledge in natural and social sciences so that the students may learn the language of the scientists and the fundamental concepts in these fields. Once the choice has been made. The Class Teacher may be consulted in order to know the scope of the different specializations offered in the M. Stat. Anthropological and sociological data may be used in courses on multivariate statistical analysis and analysis of categorical data. and develop familiarity with some of the basic and important problems in these fields which call for statistical analysis along with the corresponding techniques used.Stat. degree. Note: The B. Examples from natural and social sciences would generally be discussed in all methodological and modelling courses in statistics. programme. ‘Microeconomics and Macroeconomics’ and ‘Molecular Biology and Agricultural Science’ are desirable respectively for the Finance track and the Biostatistics track under the Applied Statistics specialization in M. curriculum along with the list of specialization courses in order to make decision on the choice of elective courses.4 Use in Advanced Courses The electives ‘Physics I and Physics II’ are desirable for the Probability specialization. 5. it cannot be altered. The choice has to be given in writing to the Dean of Studies within the first four weeks of the first semester.2 Elective Groups For the Electives I and II.Stat. 5. (a) Physics I and Physics II (b) Microeconomics and Macroeconomics (c) Molecular Biology and Agricultural Science For elective III each student can choose any one of the courses from (a) Psychology (b) Anthropology (c) Sociology (d) Geology (e) Physics III (Pre-requisites Physics I and II) 5. Geological data may be used in the courses on multivariate statistical analysis and analysis of directional data. (Hons.

maximum likelihood estimation. Problem of missing data.) Courses Statistics Courses Statistical Methods I History of statistics. Simulation of probability distributions and stochastic models. Applications of simulation techniques.6 Optional Courses In the final semester (Semester VI). Various kinds of statistical problems and studies. finding MLEs using EM algorithm. Stat. Tests of hypotheses: Different types of statistical hypotheses. Fisher’s scoring. (a) Random Graphs (b) Percolation Theory (c) Differential Equations (d) Number Theory (e) Special topics on Algorithm Not all courses can be offered in a particular semester and a student will have to choose one course only from the offered ones. • Statistical Methods III Point estimation: Criteria for good estimates: Unbiasedness. level of significance and power of a test. Methods of estimation: method of moments. Tests for parameters of normal distributions based on single and two populations. measures of non-linear associations. Partial and multiple correlation. Descriptive statistics: measures of location. Multiple regression. Conditional tests. skewness. spread. mean square error. Illustration with specific examples and numerical exercises using statistical packages (such as R). non-central χ2 . Large sample tests for parameters in Binomial and Poisson distributions. 11 . (Hons. simple linear regression and properties. Practicals using statistical packages (such as R). • Statistical Methods II Summarization and analysis of different types of multivariate data. kurtosis. minimum variance. Correlation. Goodness of fit using Pearson’s χ2 and Q-Q plots (applications only). a number of courses will be offered from the following list of Optional Courses. Summarization and analysis of different types of bivariate data. 7 7. Fitting probability distributions and stochastic models to observed data.1 • Detailed Syllabi of the B. Error probabilities. various properties of these measures and their utility. Collection and summarization and presentation of different types of univariate and bivariate data.

Method of least absolute deviation. Basics of non-linear regression. M. C. P. Normal equations. Multiple comparisons. Linear predictor. Introduction to random effect models. Purves: Statistics. 6. Best Linear Unbiased Estimates (BLUEs). Nested models. seasonal/cyclic and random components of a time series. Stuart: The Advanced Theory of Statistics. Elements of Time Series analysis: Trend/secular.M. • Linear Statistical Models Theory of generalized inverse of a matrix. A. Fundamental Theorems of Least Square.F. deviance.S. Kendall: An Introduction to the Theory of Statistics. ANOVA and ANCOVA. F. Probit and logit analysis.U. C. Chatfield: The Analysis of Time Series: An Introduction. t and F distributions.G. Log-linear models. Tanur (ed. correlogram and periodogram. Sample quantiles and their properties. Roberts: Statistics: A New Approach. Resampling techniques such as Jackknife. Keeping: Mathematics of Statistics. canonical link function. χ2 -tests for independence and homogeneity. illustrations. W. Degrees of freedom.E. Reference Texts for Statistical Methods I-IV 1.): Statistics: A Guide to the Unknown.G. Rao: Linear Statistical Inference and its Applications. formulation and illustrations. Yule and M.J. Linear statistical models. moving averages. (6 lectures) Practicals using statistical packages (such as R). 8. G. Likelihood ratio and large-sample tests and confidence intervals. Cross-validation as data analytic tools. Kendall and A. Variance stabilizing transformations. Bickel and K. Wallis and H. 2. link function. Least square estimation. • Statistical Methods IV Statistical methods for estimation and hypothesis testing for parameters in bivariate and multivariate normal distributions. Pisani and R.V. Kenney and E.A. M. Tanner: An Investigation for a Course in Statistics. illustrations. 11. Gauss . Vol. 10. Estimation and testing problems in simple and multiple linear regression. Central and non-central χ2 . Practicals using statistical packages (such as R). Iteratively re-weighted least square estimation and algorithm. R. Testing of linear hypotheses. relationship with tests of hypothesis. Bootstrap. 4. Doksum: Mathematical Statistics. J. J. 5. Cowden: Applied General Statistics. Logistic regression. 3. illustration using logit and probit analysis. Introduction to Generalized Linear Models (GLMs).Confidence intervals: criteria for goodness. D. estimable linear functions. J. pivotal quantities. Maximum likelihood estimation using 12 . Introduction to stochastic models. 1 and 2. 7. Freedman.Markov Theorem. One way and two way classification models. 9. autocorrelation function. Croxton and D. Sampling distributions of sample mean and sample variance.R.

some well-known index number formulae.National Income/GDP. National accounts. Vol. Analysis of income and allied size distributions: Pareto and log-normal distributions. State Statistical Bureaus.construction and applications. Goodness of fit test. Cobb-Douglas and ACMS production functions. environment. R. Selected topics on Statistics (for All India/Different states of India) relating to agriculture and allied areas including meteorology and environment. Measures of fertility and reproduction. different types of index numbers used in India. J. splicing of index numbers. Nelder: Generalized Linear Models. An Integrated Approach. Industry. P.A. Labour. R.H. Reference Texts 1. NSSO. • Economic and Official Statistics and Demography Economic Statistics: Index numbers: Construction of index numbers. Official Statistics: Indian Statistical System: Official Organisations for collecting/compiling/publishing national/state level data on different variables . Level of living. properties. Population. Selected topics from: Purchasing power parity. Labour Bureau. Measures of migration. returns to scale. 2. Measures of mortality. Hocking: Methods and Applications of Linear Models. Engel curve analysis using cross-section and time series data. Life Table . Christensen: Plane Answers to Complex Questions: The Theory of Linear Models. 4. McCullagh and J. registration of vital events. National Accounts and Infrastructure. Education. RBI. Finance including money supply and banking statistics. Employment and other socio-economic variables. population estimates and projections. I.R. Population Census. Jammalamadaka: Linear Models. 8. Industry. Role of Centre and State. chain indices. D. Use of demographic data for policy formulation. problem of construction of index numbers. genesis. R. specific concentration curves. 5. C. Sengupta and S. Rates and ratios. 6. cost minimization. Social Statistics and Trade. demand projection. Standardization of vital rates. Indicators relating to Energy. specification and estimation.census. Practicals using statistical packages (such as R).R. Production analysis: Profit maximization. Planning Commission. Engel curves incorporating household characteristics. cost of living indices. Lorenz curve. 3. International Statistical System: Comparison of major macro variables .iteratively re-weighted least square algorithm. R. Graybill: An introduction to Linear Statistical Models. Stable and stationary population.CSO. Gender. Gini coefficient. Searle: Linear Models. Rao: Linear Statistical Inference. Stapleton: Linear Statistical Models. Prices. F. Health. Demography: Sources of demographic data . Trade. Demand analysis: Classification of commodities. A. 7. S. Population growth curves. 13 .

R. 3. Ramkumar: Technical Demography. convex analysis in optimization theory. lag plot. measurement validity.D. CSO (MOSPI) Publication: Statistical System in India. 2. of India. B. United Nations publications 4. 6. 3. measurement errors and their estimation. 4. Allen: Price Index Numbers. formulation and application of optimization problems. 3. u-chart.D. quality control and quality improvement.H. Saluja: Indian Official Statistical Systems. concept of variations and its impact. M. AOQL ATI. Operations Research (OR): Introduction to Operations Research: Optimization Theory: Mathematical modeling and concept of optimization problems: linear. Shryock: The Methods and Materials in Demography. Polasek: Applied Statistics for Economists. concept of AQL.R.graphical method to solve linear programming problem. acceptance sampling tables. CUSUM chart. np-chart and c-chart.quality planning. Economic Survey. Use of Control Chart: Introduction to control chart. H. X-R chart. Measurement System: Introduction to measurement system. K.R. N. sensitivity analysis. solution procedure of two person 14 . 2. frequency distribution and other QC tools. 5. concept of double and multiple sampling plan.D. Govt. X-s chart. L. average sample number. Cramer: Empirical Econometrics. Kakwani: Income Inequality and Poverty. Techniques and Applications. Reference Texts for Official Statistics 1. Srinivasan: Demographic Techniques and Applications. • Statistical Quality Control and Operations Research Statistical Quality Control (SQC ): Introduction to quality: Concept of quality and its management . relevance of exploratory data analysis. Acceptance Sampling: Introduction to acceptance sampling. R. types of measurement.G. nonlinear and integer programming problems. EWMA X-MR chart. LTPD. producer’s risk and consumer’s risk. Karmel and M.Reference Texts for Economic Statistics 1. linear programming problem . P. 2. RBI: Handbook of Statistics for the Indian Economy (various years) 5. simplex algorithm.S. 4. M. control chart for variables and attributes ¯ ¯ chart. single sampling plan and its OC function. Intrilligator: Econometric Models. acceptance rectification plan concept of AOQ. Klein: An Introduction to Econometrics. p-chart. process capability analysis. Ministry of Finance (various years) Reference Texts for Demography 1. J. Mishra: An Introduction to the Study of Population.S. run plot.

Hillier and Lieberman. Montgomery. G. factorization theorem. Jarvis. introduction to M/M/1 and M/M/C queues. McGraw Hill. and C. Narosa Publishing House (2009).L. Irwin. Belmont. Statistical Quality Control. Defect Prevention . Addison-Wesley 5. N. John Wiley 12. Linear and Nonlinear Programming. Completeness.A. D. 13. Athena. Principles of Quality Control. M. NY: John Wiley & Sons Inc. Reference Texts 1. Ancillarity. Wiley. S. canonical parameters and canonical sufficient statistics. Bayesian techniques. New York. Sherali. minimal sufficiency. Shetty. H. Bazaraa. 1999. Grant & R. relative efficiency. Duncan. S. D. Boston. Chandra. Bertsimas and J. Jayadeva and Aparna Mehra. New York. finite queuing system. Likelihood ratio tests.J. UMPU and LMP tests. New York 7.Y. John Wiley 6.C. Introduction to Statistical Quality Control. priors.Victor E Kane. Marcel Dekker. M. Addison-Wesley. 9. 1984. Second Edition. birth and death process. critical regions.Jerry Banks. Exploratory Data Analysis. nonlinear programming problem and its classification. Ill 3.. Concluding remark: Synthesizing Statistical Quality Control and Operations Research. MA. Tsitsiklis. Queuing Theory: Queuing system in practice and importance in Operations Research. John Wiley & Sons. Linear Programming . M. 2. Hadley. Bhattacharya bounds. illustrations. 11.. Bazaraa and J.G. Linear Programming and Network Flows. Lehmann-Scheffe Theorem. McGraw-Hill. Homewood.D. Basu’s Theorem. application of queuing system and limitation. Inc. Monotone likelihood ratio family of distributions. 15. G. S. Massachusetts. D. Nonlinear Programming: Theory and Algorithms. Reading. Leavenworth. Introduction to Linear Optimization. Exponential families of distributions. Gryne. Luenberger. Tests of Hypotheses: Statistical hypothesis. Neyman-Pearson Lemma and MP test.. Rao-Blackwell theorem. N. posteriors.K. pure birth process. 14. W. • Parametric Inference Basic inference problems. randomization UMP. Cramer-Rao inequality. Addison Wesley. McGraw-Hill. Murty.Y. MA. unbiasedness. UMVUE. Point Estimation: Criteria for goodness: mean square error. Numerical Optimization with Applications. Juran’s Quality Control Handbook-J. Sufficiency. union-intersection principle. Test of multiple hypotheses.E. Introduction to Operations Research. 8. 4.zero-sum games. J. Linear Programming . Reference Texts 15 . Consistency. Bayes’ estimators and Bayesian credible regions. 10. Quality Control and Industrial Statistics . N. optimality conditions and duality theory. Juran & F. M. simple and composite hypothesis. Tukey.S. M. J. Scientific.

Stein’s two stage fixed length confidence interval. Illustrations with Binomial and Normal distributions. 4. R. Cochran: Sampling Techniques. Hollander and D. Wald: Sequential Analysis. Wolfe: Introduction to the Theory of Nonparametric Statistics.R. Hartley-Ross estimator. Acquaintance with National Sample Surveys and other large-scale surveys. 16 .A. multi-stage sampling. Sen. M. tests for independence. Interpenetrating Network of Sub-sampling (IPNS) and half-sampling. 2. G. Kruskal-Wallis test. Reference Texts 1. Yates & Grundy estimator. Concepts of asymptotic relative efficiency of tests. Wasserman: All of Nonparametric Statistics.1. Sampling on successive occasions. • Nonparametric and Sequential Methods Nonparametric Methods: Formulation of the problems. PPS sampling–WR and WOR. Review of order statistics and their distributions. OC function. 3. linear and circular. P. Reference Texts 1. Nonparametric function estimation: histogram. Horvitz & Thompson estimator. Bickel and K. 4. cluster sampling. Lehmann: Testing Statistical Hypotheses. Sequential estimation. frequency polygon.G. Run test. sign test. Drawing simple random samples (SRS) with replacement (WR) and without replacement (WOR) using random numbers. Ratio and Regression estimation for equal and unequal probability sampling. sample size determination. signed rank test. A.J. Properties of good estimators based on different approaches: design. test for symmetry.L. KolmogorovSmirnov goodness of fit test. Doksum: Mathematical Statistics. controlling non-sampling errors. E. Permutation tests.A. ASN. C. unbiased variance estimation. E. estimation. sample. super-population-modeling and model-assisted.L. Stratified sampling. L. Double sampling-non-response and ‘not-at-homes’.L. 3. predictive. Sampling designs and schemes. Sampling strategies. kernel density estimation and regression. A. Casella and R. Estimation of location and scale parameters. W. Wolfe: Nonparametric Statistical Methods. 5. E. • Sample Surveys Concepts of population. Lehmann: Nonparametrics: Statistical Methods Based on Ranks. 5. illustration with examples. Linear rank statistics. Wilcoxon-Mann-Whitney test.H. Sequential Analysis: Wald’s SPRT. Narain. Rao: Linear Statistical Inference and its Applications. Lehmann: Theory of Point Estimation.L. Randles and D. Berger: Statistical Inference. Systematic sampling–equal and unequal probabilities. 2. survey and census.

• Design of Experiments The need for experimental designs and examples. 17 . Reference Texts 1. advantage and analysis. uniformity trials. Project Work involving data collection.E. Polya’s urn scheme. 4. Hedayat. basic principles.2. sample space. Fluctuations in coin tossing and random walks. 2.G. confounding and partial confounding in 2n designs and relative efficiencies of the effects.M. Cassel. 33 experiments. their use and analysis. Dey: Theory of Block Designs. Practicals using statistical packages. B. Dean and D. Montgomery: Design and Analysis of Experiments. Voss: Design and Analysis of Experiments. A. M. Combination of events. D. General full factorial designs. K. randomized block designs and their use. Cox: Experimental Designs. A. independence.N. J. Murthy: Sampling Theory and Methods. Equally Likely Set-up and Combinatorial probability. C. and Sinha. Chaudhuri. use of completely randomized designs. events.. Special Topics assigned by the teacher related to but not restricted to Project Work 7.H.S. (1979). Essentials of survey sampling. M. Split-plot designs. experiments with factors at 3 levels. Use of concomitant variables in orthogonal designs and related analysis. Composite experiments. tests for treatment contrasts. concepts of connectedness and orthogonality of classifications with examples. their use. 5. survey and analysis with credit at least 100 marks.C. Discrete sample spaces and probability models. conditional probability. Sarndal. 3. 4. (2010). Cochran and G. 3. Design and inference in finite population sampling. Designs eliminating heterogeneity in one direction: General non-orthogonal block designs and their analysis under fixed effects model. outcomes. and Wretman. A. 5. C. O. Kempthorne: The Design and Analysis of Experiments. construction of MOLs based on Galois fields. (1977): Foundations of inference in survey sampling. Bayes theorem. A. W. Orthogonal designs eliminating heterogeneity in two or more directions: analysis and use of Latin square designs and mutually orthogonal latin square designs. Missing plot technique.2 • Probability Courses Probability Theory I Elementary concepts: experiments. useful designs using confounding in 32. • Statistics Comprehensive/Statistical Data Analysis/Data Analysis Project Review of data analytic tools.

R. Limit theorems: Monotone Convergence Theorem (MCT). Characteristic function: properties. Functions of more than one discrete random variables. Normal and other densities). Strong Law of large numbers. Cauchy-Schwartz and Chebyshev inequalities. S. Examples of multivariate densities. Multivariate CLT. • Probability Theory III Multivariate distributions and properties. independence. Joint distributions of discrete random variables. Properties of expectation. Distributions of linear and quadratic forms. conditional distributions. Distributions of functions of random vectors and Jacobian formula. illustrations. CLT in i. Chung: Elementary Probability Theory. G. conditional expectation. conditional expectation. Different modes of convergence and their relations. moments. 5. Bivariate Normal distribution. independence. ∞) and basic properties. 2. properties of probability.III 1. Expectation/mean. examples. L. Stone: Introduction to Probability Theory. Moment generating function: properties. Cramer-Wald device. probability generating functions. Slutsky’s Theorem. K. Exponential. Port and C. S. Gamma. Bounded Convergence Theorem (BCT). Variance and moments of random variables. Standard univariate densities (Uniform. Distributions with densities.d. Kolmogorov Maximal inequality.i. W. variance. 4. Reference Texts for Probability Theory I . functions of discrete random variables. Levy continuity theorem (statement only). 3. 18 . finite variance case. Ash: Basic Probability Theory. 1 & 2). Multivariate Normal distribution and properties. Sampling distribution for mean and sample variance. J. moment generating functions. Student-t. Poisson process on [0. Expectation of functions of random variables with densities as integrals. Beta. Distribution of sum of two independent random variables. illustrations. General definition of Expectation. Multivariate densities and multivariate singular distributions.Discrete random variables. First and Second Borel-Cantelli Lemmas. δ-method. Functions of random variables with densities. Standard discrete distributions. Hoel. χ2 . F densities. distribution of sums. • Probability Theory II Uncountable sample spaces and concept of events and random variables. Fatou’s Lemma. bivariate CDFs. Weak Law of large numbers. products and quotients for bivariate continuous distributions. Bivariate continuous distributions. Conditional distributions and independence. (Vols. Introduction to cumulative distribution functions (CDF) and properties. P. M. Dominated Convergence Theorem (DCT). C. Feller: Introduction to the Theory of Probability and its Applications. Conditional and marginal distributions. Ross: A First Course in Probability. Dirichlet density and properties. inversion formula.

binary expansions of real numbers. infinite Taylor expansions. J. Casella: Monte Carlo Statistical Methods. absorbing states. Hoel. bounded and monotone sequences. P. Absorbing chains. Examples including 2-state chain. Kemeny. Periodicity. Port and C. Robert and G. Illustration using card-shuffling and random walks on graphs. relaxation time. W. Maxima and minima of functions. Port and C. limit theorems. the L-C-R circuit. ratio limit theorem.3 • Mathematics Courses Analysis I Real numbers-least upper bounds and greatest lower bounds. Hoel. birth and death chain. Knapp: Finite Markov Chains. W. the tractrix. 3. Sequences-limit points of a sequence. S. Applications of calculus: Forming differential equations for radio-active decay. S. Snell and A. Cauchy sequences and the completeness of R. convergent sequences. limit theorems for aperiodic irreducible chains. Taylor’s theorem-various forms of remainder. Chain Rule. Introduction to concept of mixing behavior of finite state space Markov chains. C. examples. • Introduction to Markov Chains Discrete Markov chains with countable state space. the Brachistochrome. C. strong uniform time. decomposition of state space into irreducible classes.edu/users/aldous/RWG/book 4. 5. 1. Leibnitz formula.J. Introduction to MCMC. Aldous and J. the catenary. Stone: Introduction to Stochastic Processes. Differentiability of functions. Pitman: Probability. J. fundamental matrix. reversible chains. absolute and conditional convergence. Infinite products. uniform continuity. J. Series-convergence and divergence of series. Cauchy product. recurrence and transience. P.stat. L. Various tests for convergence of series. absorption probabilities and mean absorption time. irreducibility. etc. Rolle’s theorem and mean value theorem. Classification of states. card shuffling. Ehrenfest chain. C. ternary. Continuous functions of one real variable-attainment of supremum and infimum of a continuous function on a closed bounded interval. J. G. D. G. Stone: Introduction to Stochastic Processes. cyclic decomposition of a periodic chain. 7. perfect sampling. renewal chain. Feller: Introduction to the Theory of Probability and its Applications. Fill: Reversible Markov Chains and Random Walks on Graphs http://www. cover time. Connection between infinite series and decimal expansions.6. Stationary distributions. random walk. 7. Higher order derivatives. positive and null recurrence. Definition of mixing time. P. 2. Reference Texts 1. 19 . the limit superior and limit inferior of a sequence. G. etc. Vol.berkeley.

improper integrals. Theorems of Green and Stokes. Multiple integrals. 4. Left inverse. complement and projection. 3. Solutions of first order differential equations: homogeneous equations. John: Introduction to Calculus and Analysis. The Jacobian theorem. Column space and row space. Linear transformation and its matrix with respect to a pair of bases. Sequences and Series of functions. I. Computation of definite integrals. LDU-decomposition. Fundamental theorem of calculus. inverse through 20 . determinant of a product. Picard’s theorem for existence and uniqueness of a first order differential equation. Power Series solutions of differential equations with analytic coefficients (examples only). nullity. Maxima and minima. Tom Apostol: Calculus I and II. lower and upper bounds for rank of a product. integrating factors for linear equations. Pointwise and uniform convergence. Line. Partial derivatives. use of partitioned matrices. basis and dimension. 2. Edward D Gaughan: Introduction to Analysis. Power series. rank of a sum. direct sum.• Analysis II Riemann integration. Differential forms. Solutions of exact differential equations. Homogeneous and non-homogeneous systems of linear equations. sum and intersection of subspaces. Courant and F. Continuity. Differentiability. statement of Laplace expansion. Weierstrass approximation theorem. • Vectors and Matrices I Vector spaces over real and complex fields. 5. Elementary operations and elementary matrices. Vol. right inverse and inverse. linear independence. Taylor’s theorem. W. Double sequences. solution set as a translate of a subspace. subspace. surface and volume integrals. Repeated integrals. g-inverse and its elementary properties. R. rank-factorization of a matrix. Fourier series. Reference Texts 1. Term-byterm differentiation and integration. reduction of some second order equations to first order equations. rank of a matrix. integrating factors. Normal form. Echelon form. Hermite canonical form and their use (sweep-out method) in solving linear equations and in finding inverse or ginverse. rank of AA*. • Analysis III Functions of several variables. II. • Vectors and Matrices II Determinant of n-th order and its elementary properties. expansion by a row or column. special linear equations of second order. properties of matrix operations. statement of Cauchy-Binet theorem. Rudin: Principles of Mathematical Analysis. Tom Apostol: Mathematical Analysis. condition for consistency. inverse of a partitioned matrix.

relation between characteristic polynomials of AB and BA when AB is square.classical adjoint. Finite fields. orthogonal complement. algebraic and geometric multiplicities.d. 4. Roots of polynomials. Gauss’ theorem. Splitting fields. and examples of Groups. determinant (as volume). Idempotent matrices. N. Finite direct product. Polynomial rings (over commutative rings). Prime ideals and Integral domains. Applications to elementary number theory. Rings.1-13. 2. F. 3. R. extrema of a p. UFD. norm. cosets.5. 11. Fields. Examples of Isomorphisms and Automorphisms..6. Finite Abelian groups. orthogonality.1).1-11. M. determinant criteria for n. spectral representation of Hermitian and real symmetric matrices. normal subgroups. determinant of a partitioned matrix. orthogonal projector into the column space of A.d. use in classification of conics. norm induced by an inner product. Hohn: Elementary Matrix Algebra. Lagrange’s reduction to diagonal form. characterization of diagonalizable matrices. Jacobson: Basic Algebra I (Chap. Kunze: Linear Algebra. singular value decomposition. 2. Note: Geometric meaning of various concepts like subspace and flat. Subgroups. C. 4. Artin: Algebra (Chap. TIFR pamphlet on Galois Theory. Cramer’s rule. orthogonal projection. Norm and inner product on Rn and Cn . S. N. and Fields. Ideals and quotient rings. Bhimasankaram: Linear Algebra. Only finite-dimensional vector spaces to be covered. Characteristic roots. K.n. and eigenvector should be discussed. matrix version of Fisher-Cochran theorem. quotient groups. Cayley-Hamilton theorem. Square-root method. R. Homomorphism theorems. and p. quadratic form. Orthonormal basis. Reference Texts 1. 13. Hadamard’s inequality. linear independence. 7. Axler: Linear Algebra Done Right! • Elements of Algebraic Structures Definitions. Cyclic groups. E.1-5. category of a quadratic form. 2). Rings.6). quadratic forms. Hoffman and R. P. Sylvester’s law. I. simultaneous diagonalization of two quadratic forms one of which is p. 3. Permutation groups. simultaneous orthogonal diagonalization of commuting real symmetric matrices. Sylow’s theorems and applications. Halmos: Finite Dimensional Vector Spaces. 2. 10. Gram-Schmidt orthogonalization starting from any finite set of vectors. Maximal ideals. eigenvectors. elementary properties. inner product. orthogonal projection into a subspace. orthogonal and unitary matrices. Quadratic form. Herstein: Topics in Algebra (Chap. statement of interlacing theorem. projection. Ramachandra Rao and P. Reference Texts for Vectors and Matrices I-II 1. idea of minimal polynomial. Groups. 5.d. equivalence classes. Rao: Linear Statistical Inference and Its Applications. PID. Field extensions.d. rank and signature. A. 6. 21 . 2. 5. Ideals.

forests. Nesetril: Invitation to Discrete Mathematics. 7. J. Flows . derangement. use of generating functions. S. integer partitioning. Definition of independent sets. Frank Harary: Graph Theory. Generating functions. Graph Theory: Definition of graph and directed graph. cycles. greedy algorithm and Kriskal algorithms. Douglas B. Cayley’s theorem. 8.5. Rotman: A First Course in Abstract Algebra. S. 6. Hamiltonian paths and circuits. Principle of inclusion and exclusion with application to counting derangements. applications to counting permutations. Euler’s theorem for planar graphs. Rehman: Discrete Mathematical Structures. Graham. C. five colour theorem for planar graphs. number of spanning trees. Fred S. Recurrence Relations and its type. Recurrence relation solutions. Patashnika: Concrete Mathematics 4. applications to counting. Lang: Undergraduate Algebra.definitions and examples. Ronald L. 6. Breadth-first-Search (BFS) and Depth-first-search (DFS). Liu: Elements of Discrete Mathematics. four colour theorem (statement only). Catalan numbers. connected components. induced subgraph. 2. integer line and d-dimensional integer lattice. planar graph and chromatic number. J. divide-and-conquer recurrences. Bell numbers and Stirling number of the second kind. 5. • Discrete Mathematics Combinatorics: Sets and Relations. Counting using functions. chromatic number of a finite graph. 7. linear homogeneous recurrences. Rowen: Algebra. Adjacency matrix and number of walks. Examples of graphs. colouring. 22 . Eulerian paths and circuits. C. Martin J. operations. Roberts and B. B. subgraph. trees. connectedness of a graph. definition of degree. Exponential generating functions. C. inhomogeneous recurrences. Matousek and J. Dilworth’s Lemma. 9. 3. Counting. max-flow min-cut theorem. Kolman. West: Introduction to Graph Theory. Planarity -definition and examples. Reinhard Diestel: Graph Theory. minimum spanning tree. definition. Basic Definition. Introduction to Ramsey theory. bipartite graphs. Reference Texts 1. Busby. Knuth and O. R. Pigeonhole principle and its generalization with applications to a variety of problems. shortest path in weighted graphs. Dual of a planar graph. Erickson: Introduction to Combinatorics. Donald E. L. complete graphs. definition. Ross and N. graph isomorphism. recurrences involving convolution and their use in counting. Basics on graph reversal. paths and walk. L. methods of characteristic root. Fibonacci numbers. Tesman: Applied Combinatorics.

peripherals. Linked lists. Stein: Introduction to Algorithms. B. Errors and accuracy. References Texts 1. T. Lagrangian and Newtonian methods. input/output.. I/O devices. Rivest. Runge-Kutta’s methods. W. Computation in Linear Algebra: Numerical solution of system of linear equations and matrix inversion: Gaussian elimination. L. D.. Errors and remainder terms. Floating point arithmetic and propagation of errors. E. square Root. C. iteration. Spline interpolation. algorithm. Gottfried: Programming in C. T. round-off errors. call by reference.parameter passing. R.7. A.. Kernighan and D.4 • Computer Science Courses Introduction to Programming and Data Structures Introduction to number system: binary. Aho. Given’s transformation. B. E. Cormen. Hopcroft and J. Data handling: arrays and pointers. Kruse: Data Structures and Program Design in C. Interpolation with two variables. 4... Reduction to bidiagonal/tridiagonal form: Householder transformation. divided differences. assignment. Functions and Recursion: Function . Standish: Data Structure Techniques. V. hexadecimal. Ritchie: The ‘C’ Programming Language. Sahni: Fundamentals of Data Structures. Numerical solution of ordinary differential equations: one step and multistep methods. Files. Euler’s. structures. M. 23 . Numerical computation of eigenvalues and eigenvectors: Jacobi’s method. Regula Falsi and Newton-Raphson. 5. Improvement of the initial solution using methods of bisection. Interpolation with one variable: finite differences. Data Structures: Queue. Introduction to digital computers: CPU. Order of convergence and degree of precision. Loss of significant digits. Predictor-corrector methods.. expressions. Aitken Neville’s iterative scheme. main memory. procedure call. E. Horowitz and S. power method. Adam’s. Stack. Numerical differentiation. • Numerical Analysis Significant digits. L. Imperative languages: Introduction to imperative language . H. Recursion. 7. Errors.syntax and constructs of a specific language (preferably C). Numerical integration: Newton-Cotes. flow-charts. Orthogonal polynomials and Gaussian quadrature. call by value. Trees. L-U methods. octal. Sturm’s theorem. Ullman: Data Structures and Algorithms. Iterative methods. 6. C. dynamic allocation. 2. Numerical solution of nonlinear equation in one variable: Separation of roots and initial approximation.. A. 3.. storage. Fixed point iterative schemes. conditionals and branching. Finite computational processes and computational errors. Leiserson. variables. Accuracy of quadrature formulae. R. J. Inverse interpolation.

C. Vazirani: Algorithms. J. minimum spanning trees. comparative statics analysis. A. connectivity and traversals (Breadth First Search and Depth First Search). L. other sorting algorithmsradix sort. Conte and C. Ullman: Data Structures and Algorithms. Horowitz. Faddeev and V. E. T. etc. knapsack. Graph Algorithms: Basic definitions. Teukolsky. Computational Geometry: Convex hull. oligopoly.D. G. Faddeeva: Computational Methods in Linear Algebra. k-th largest elements. Cormen. Leiserson.Reference Texts 1. bucketsort. cost curves. Different sorting algorithms .. D.5 • Elective Courses Microeconomics Theory of consumer behavior: Utility theory. U. • Design and Analysis of Algorithms Introduction and basic concepts: Complexity measure and asymptotic notations. 5. S. A.Ullman: The Design and Analysis of Computer Algorithms. A. S. Moler: Computer Solution of Linear Algebraic Systems. V. 4. E. returns to scale. E. Vetterling. law of variable proportions. Flannery: Numerical Recipes in C. mergesort. monopoly. D. Dasgupta. lower bound for sorting. S. Sahni and S. integer multiplication. References Texts 1. 2. Press.B. Kleinberg and E. R. Tardos: Algorithm Design. Hopcroft and J. J. matrix multiplication. consumer demand. 7. S.E. all pair shortest paths in a graph. W. Divide and Conquer: Closest pair of points. W. Theory of cost: concepts of long-run and short-run costs. Rivest. Searching algorithms: Binary search. P. Stein: Introduction to Algorithms. 2. 4. Dynamic Programming: Subset sum. D. J. notions of worstcase and average case complexity. Hopcroft and J. Aho. C. Fast Fourier Transform. heapsort. Selection and Sorting: Finding maximum and minimum. H. T. market demand. hashing. factor markets. directed acyclic graphs and topological ordering. B. Papadimitriou. 24 . etc. de Boor: Elementary Numerical Analysis: An Algorithmic Approach. C. 6. E. clustering. Rajasekaran: Computer Algorithms. H. elasticity of substitution. E. 3. Markets: Perfect competition.V.quicksort.Aho. diameter of a point set. Forsythe and G. Theory of firm: Production function. balanced binary search tree. 7.H.D. use of recurrences in algorithms. Knuth: The Art of Computer Programming Fundamental Algorithms. 3.K. Greedy Algorithms: Shortest paths in a graph.

building material. 2. definition. mine visits. deep seated processes and their products .fiscal and monetary policies for raising employment and output. Introducing topsheets and simple geological maps. Reference Texts 1. coal.P. Zussman: Introduction to the Rock Forming Minerals. R. surface processors . ores etc. Open economy macroeconomics . Quirk: Intermediate Microeconomics 2. N. Quantitative aspects of Geology: Nature and source of geologic data.R. organic evolution. Field Work: basic geologic mapping. The earth: the earth and the solar system. Leeder: Sedimentology and Sediment 25 . 3. cement. Fischer: Macroeconomics. J. Varian: Microeconomic Analysis. Measurement and graphical representation of grain-size and paleocurrent data.folds and faults.A. 2. Suppe: Principles of Structural Geology. origin and types of sedimentary. physical and chemical characteristics of the earth. rocks and fossils. J. etc. Geology vis-a-vis industry (with reference to India): Raw material for steel. H. adjustments in a fixed exchange rate. Frank Press and Raymond Siever: Understanding Earth. Reference Texts 1. fossils and their usage. succession of the through time.A. major developments in the lithosphere.General equilibrium and welfare.determination of exchange rate under perfect capital mobility and flexible exchange rate. Howie and J. • Macroeconomics National income accounting. R. ferro-alloy. major geologic features of the earth’s exterior.weathering and erosion.short-term macroeconomic models: Simple Keynesian model. Mankiw : Macroeconomics. Important Geologic Principles. its relationship with other subjects and its contribution to mankind. Monetary sector and investment function . Practical : Identification of minerals. M. Reference Texts 1. example of such usage. Deer.IS-LM model. gas and water resources. • Geology Theory: Definition and objectives of Geology: different branches of geology. oil. Cu-Al-Pb-Za industries. Dornbusch and S. minerals and rocks. collection of scalar and vector data. absolute and relative time. discussion on effectiveness of fiscal and monetary policies. Time in Geology: Geological time scale. 4. possible applications of various statistical and mathematical tools.. refractory. igneous and metamorphic rocks. W. National income determination .

ancient agriculture.Cereals (Rice. Instant notes on Molecular Biology: P C Turner. ozone depletion. • Molecular Biology Distinguishing characteristics of living and non-living things Cell structure and functions (4 classes) Metabolism of protein. fertilizer application. history of agricultural development in India. weed control.Soil organism. A C McLenan. G I Hickey and H L Fletcher (Viva Publication) 3. causes of climate change and global warming. Meaning and scope of agronomy. Environmental factors in agriculture. carbohydrate and fat Structure and function of DNA and RNA (8 classes) Replication. greenhouse gases.K. meiosis) Definition of gene and genetic code. Climate change and global warming: definitions of terms. cell division (mitosis.Soil formation: genesis and weathering. Irrigation water management: Irrigation: definition and objectives. Climatic requirement. factors affecting ET. Distribution. translation. J. Instant notes on Biochemistry: B D Hames. secondary and micronutrients. Soil requirements. E. weather elements and factors affecting them. Agronomy: Introduction and importance of agriculture. Humus. Agronomic practices (land preparation. Agro-climatic zones of India. Indian mustard). principles of agronomy. Soil organic matter .N. Lentil). Davis: Statistics and Data Analysis in Geology.5. Soil conservation .Soil colour.Primary. influence of soil organic matter on soil physical and chemical properties.soil erosion: types of erosion and method of conservation. density and pore space soil water. irrigation) and harvesting of :. Soil chemical properties . Soil physical properties . Pulses (Moong. Principles of genetics: D P Snustad and M J Simmons (John Wiley & Sons Inc) • Agricultural Science Agroclimatology: Agroclimatology -Definition and scope. Improved varieties. relationship between them Mendel’s Law of genetics and application in human population Practical (8 classes) Reference Texts 1. transcription. Vegetables Solanaceous (Potato). A D Bates and M R H White (Viva publications) 4. control of ET by mulching and use of 26 .C. Weather forecasting system: definition. N M Hooper. Rotations. Soil nutrients . J D Houghton (Viva publications) 2. seed rate & seed treatment. Oilseeds (Groundnut. types of Forecasting. Soil-plant-water relationships. Wheat). Weather and climate. Instant notes on Genetics: P C Winter.Soil acidity. scope and importance. Strategies of using limited water supply. its importance in Agriculture. Clarkson: Invertebrate Palaeontology and Evolution. structure. texture. Soil : Introduction to Soils . 6.

Practical : Estimation of crop yield from yield attributing data. MA.1999. concept and differentiation of inter and mixed cropping. RGR.A. Growth analysis: concept.1953. ATER. Time and method of fertilizer application Farming systems. Brady NC & Weil RR.in/science communication Suggested Readings: 1. Soil physical and chemical analysis like pH. Reference Texts 1. sprinkler and drip irrigation.H. Inc. London. Bates . 2nd Ed. -London 5. Essential Plant nutrient elements (macro and micro) and their sources.Concepts and Applications. CR. 2004.niscair. Potassic and complex fertilizers.. 4. Mavi . The Earth and Its Atmosphere . 3. Manures and Fertilizers: Arnon’s criteria of essentiality of elements. evapotranspiration and crop water requirement.E.J. validity and Limitations in interpreting crop growth and development. relevance in present day context.D. Fertilizers . Micronutrients: Their Behaviour In Soils And Plants . eco-physiological approaches to intercropping. Introduction to Organic Farming concepts. Sehgal J. Yade. polynomial and asymptotic.www.Longman = Publishers. Wiley & Sons. OC.res. stability in different systems through research. Das Dilip Kumar 1997.S.2001-Das Dilip Kumar-The Scientific WorldNetherlands 6. Kalyan Publ.anti-transpirants.R.D. Oxford & IBH. K. Fertilizers scheduling. Principles involved in inter and mixed cropping systems. Fundamentals of Soil Sciences.. intensity of rotation. Pedology. Soil Conditions And Plant Growth-1961= Russal. Introduction to Climatology for the Tropics . etc. CGR. LAI. Phosphatic.Yawalker.Beaf.2008 . Bakle 2. Chemistry of Soil. cropping system and maximising of crop production: New concepts and approaches of farming systems and cropping systems Farming systems: definition and importance. root systems. Crop Crowding Coefficient. Production potential of different components of farming systems. N. 2. Elements of the Nature and Properties of Soils. Agressevity. classification of farming systems according to type of rotation. 9. root-shoot relationship. 2002. FYM.Springer Link Publishers.2007-Basak Ranjan Kumar-Kalyani 7. Methods of irrigation: surface. effective root zone. growth curves: sigmoid. Agricultural Meteorology . LAD. AYL. Green manuring. Introductory Soil Science.Pergamon Press Ltd. recent advances in soil plant-water relationship. Vermocompost. Aggarwal . 8. Nitrogenous. 1994. Organic production requirements Agro-physiological basis of variation in yield.London 4. sub-surface. Oswal MC.W. criteria in assessing the yield advantages. conductivity. Soil Physics.New York. LER.. compost. Manures And Fertilizers.1943-Ruth and Turk-J. P. NAR. Irrigation efficiency and water use efficiency. conjunctive use of water. methods of soil moisture estimation. LAR. Project work 27 . Pearson/Prentice Hall Pub. interaction and mechanism of different production factors. 3.

Manual and Computer-assisted Testing 7.1. Observation and Case study 7.7. Teaching pedagogy 7.3. Experiments on distance.3.5. Theory: 1.2.1.3. Nervous system -neural and synaptic activity. Survey Research Techniques Practical : 28 . Learning 6. shift and fluctuation 4. Laws of learning and learning curve 6.4. Experiments on classical conditioning 6. This will be useful later in their professional work like Human Resource Development.2.1. Experimental and Quasi-experimental Research Designs 7. Marketing Research.2.• Psychology Objective: Objective of the course is to impart knowledge in “Measurement in Psychology” so that the students learn fundamental concepts and develop familiarity with some of the important problems of psychology.1. Information processing model 5. Operant conditioning and reinforcement 6. Scope. brain localization 2. Social Policy Formulation etc. Insight learning 6. Introduction 1. Perceptual organization 4. depth and time perception 4. Memory 5.1. Schools of Psychology . Interviews and discourse analysis 7. School Education.5. Stages of sleep 2.Structural.3. Biological basis of human behavior variation 2. Characteristics of good questionnaire 7. Perceptual process 4. Relationship with other disciplines 2.4.4.6. Experiments in Short and Long term memory 5.2. Behavioural and Gestalt psychology 1. Endocrine gland and stress 2. Heredity and environmental role on changes in behavior 2. Theories of forgetting 6. Methods: 7.3. Introspective.2.1. Definition. Branches 1. Attention: Determinants. Variables and Measurement Scales 7. Drugs and behavior 3. Illusion and hallucination 5.5.3. which call for statistical analysis along with corresponding techniques used.2.

Reference texts 1. 3. . genetic factors. Morgan. and Ferhald. inbreeding.R. Part III 1. Pearson Education. . Biocultural evolution of man : man’s place in the animal kingdom..A. family. Fernald.T. fecundity. 4. . migration. age and sex composition.Psychology: A student’s handbook. (b) Analyzing social cognition data provided by the teacher or collected by students through field work. 2.S. biotic and sociocultural environments. mortality. Demographic studies in anthropology: basic concepts of demography (population structure. 3. monogamy. population growth). Introduction: definition and scope. Gregory. environmental (climatic. 2. 3. Anthropometric measurements and observations: methods of measurement and computation. Munn. Man as a social animal: choice of mate.. anthropological small scale demographic studies. Human variation and adaptation to environment: causes of variation. 6. marriage. Human biological processes: human physical growth. R. role of social factors in influencing genetic and environmental variations.Principles of questionnaire development with empirical studies. growth and development. Quantitative estimation of hemoglobin or packed cell volume. 4. . clan. & Schopler. M. subdivisions of anthropology. J. morbidity. 3. life table. endogamy.: Psychological Testing. 2. evolution of man : his culture and technology.. Eysenck. Measuring blood pressure in man. C. aging and senescence. 5. R. perception. exogamy. Dutta Roy. N. 29 . A. biotic and socio-cultural) determinants of demographic measures.. D. King. Part II 1. J.J. structural and functional specializations of man. kin group.D. fertility. • Introduction to Anthropology Part-I 1.Psychological testing. intelligence.Introduction to Psychology. comparative anatomy of anthropoid apes. Weisz. 2.W . L.L. Anastasi. P. memory. (c) Designing aptitude tests for measurement of IQ and exceptional children.(a) Designing research tool for collection and analysis of data on individual cognition as attention.. Racial anthropology to concepts and methods of Human Population Biology in Biological Anthropology.Introduction to Psychology. interrelationships between anthropology and other biological and social science disciplines. short and long term adaptation to different climatic. social stratification and society.

Culture. Cameron. C. J. Oxford University Press. 1999.). Cambridge University Press.. Anthropology. Max Weber : (a) Types of Authority with Special Reference to Bureaucracy 5.). Molnar. Jurmain. R. Andre Beteille : (a) Caste. Oxford University Press.. Cambridge. A. John Wiley and Sons.. Harrison. 13.E. 2. M. Academic Press.) 1994.W. Pilbeam.. D. Human Variation. Relethford. Growth and Adaptability (3rd Ed). New York. H. New Jersey. Prentice Hall. Cambridge University Press. 14. Stein. L. McGraw-Hill. Anthropology: A Global Perspective (6th Ed.R. Mascie-Taylor. Human Biology: An Introduction to Human Evolution. 1977. H.. Cambridge University Press. Biological Anthropology (5th Ed. Class and Politics 7. J.. 10.L. Trevathan. Now York. Tanner. 2006. C. Bogin.M. Physical Anthropology (9th Ed. DeCorse. Scupin. Cambridge Press. New York. To Be Human.. 3.C. J. Cambridge. W. Rowe. G. W.S. Hauspie. N. 12..A. Park. 11. R. International Edition. 4. Oxford.. Inc. 2009. New York. B. Cambridge. 9. Oxford University Press. New Jersey. Inc. R. Garruto (eds. Origin of Sociology: (a) Contribution of Industrial Revolution 2. Inc. 1975. and Baker. Crews. Central Connecticut State University. Methods in Human Growth Research. Variation. B. 2003. Biological Anthropology and Aging: Perspectives on Human Variation. 7. New Jersey 16. R. Weiner. Nature. Thomas Y. M. and R. C.R. 2011. Konigsberg. Auguste Comte: (a) Positivism (b) The Law of Three Stages of Social Development (c) Social Statics and Social Dynamics 3. Molinari. L.G. Kilgore. J. 1997. 1983.R. Norton & Company. Reconstructing Human Origins: A Modern Synthesis. Crowell. 8. Lourie. Binay Kumar Sarkar: (a) Progress (b) Positivism (B) Sociological Theory: (a) Introduction with definition and characteristics of Modern Sociological Theory (b) Concept of 30 . Harris. Oxford. Physical Anthropology: An Introduction.A. 2005. Mielke. Human Biological Variation. People.). G. 2004. Ember. Allan. W.C. Emile Durkheim: (a) Division of Labour (b) Suicide 4. Warsworth Cengage Learning. Prentice Hall Inc. Applications of Biological Anthropology to Human Affairs. and Ember. Practical Human biology.A. S. Crews. 6. G. Conroy. • Introduction to Sociology (A) Sociological Thought 1. L. Lasker. 1980. 1991.T. 2008. Prentice Hall. 15. Human Senescence: Evolutionary and Biological Perspectives. P.Part IV 1. Karl Marx : (a) Class and Class Struggle (b) Alienation 6. D. W. One week’s training in field work Reference Texts 1. 5.M. M.E.. 1990.. D. New York.N. Ciochon. J. 1981.. P. 17.. Patterns of Human Growth.

Sex and Gender (c) Socialization and Gender Socialization (d) Gender. References: 1. Two Body Central Force Problems: The problem. Data collection: Tools of Data collection . 2. Concepts. The equation of the orbit. Facts. Concept of symmetry: Homogeneity and Isotropy. (C) Indian Society: Perspectives and Structures. Focus Group of Discussion. differences between social survey and social research.H. 6. Sampling : Types of sampling (a) Random (b) Snow ball (c) Stratified (d) Systematic (e) Cluster (f) Judgment • Physics I Classical Mechanics: 1. Experimental methods. 2. Mechanics of a system of particles and conservation laws. Conservative force field. The Kepler orbits. 4. Introduction to Classical Mechanics . Classical Mechanics . 3. Variational Principle and Hamiltonian Mechanics: Some techniques of the calculus of variations.Micro and Macro-level Theory. Hypothesis and Theory. Interview. Research Methodology 4. (D) Gender studies: (a) Nature and Scope of Sociology of Gender (b) Biology. Puranik Electromagnetic Theory I 1.Observation Schedules . Degrees of Freedom. Survey of the elementary principles : Mechanics of a particle. Generalised Coordinates. Types of Social Research: (a) Pure and (b) Applied 3. Conservation Theorems and Symmetry properties.Questionnaire. Vector Analysis: Vector Algebra. Takwale and P. Hamilton’s principle. migration and landless labour (d) Globalisation and its impact on agriculture (F) Methods of Social Research: 1.Statistical methods. Centre of Mass and Relative Coordinates. The equivalent one dimensional problem. The Equations of motion. Definition and meaning of Social Research. Velocity Dependent potentials and the dissipation function. Social Survey. Case Study. Derivation of Lagrange’s equations from Hamilton’s principle. 31 . Crime and Violence (e) Gender and Politics (E) Agrarian Sociology (a) Basic characteristics of peasant and agrarian society (b) Debates on mode of production and agrarian relations including tenancy (c) Rural poverty. 5. Lagrange’s formulation : The basic problem with the constraint forces. Simple applications of the Lagrange’s formulation.R. Vector calculus. Lagrange’s equations of motion of the second kind. Goldstein 2. Principle of virtual work. reduced Mass. Hamilton’s equations for one dimensional system. D’Alembert’s Principle.

K. K. Introduction to Electrodynamics . Electromagnetic waves: Waves in One dimension. References 1. Divergence and Curl of electrostatic fields. Bose-Einstein statistics. Maxwell-Boltzmann statistics. System of quantum harmonic oscillators. Wave Guides. Conservation of momentum. The electric displacement. Quantum Statistical Mechanics: Blackbody radiation. 3. Fermi 2. Para-magnetism.R. Fundamentals of Statistical and Thermal Physics . 2. non-ideal (Van der Waals) gas. 4.D. Electromagnetic Waves in Vacuum. H. J. Ideal gas. specific heat of solids (Einstein approximation). Pathria 3. Classical Electricity and Magnetism . Electrostatics: The Electric Field. Probability calculations. Debye’s Theory. The Auxiliary Field H. Maxwell’s equations. Griffiths 2. References 1. Conductors. 3. Electric Potential. Magneto-statics: The Lorentz Force Law. FermiDirac statistics. Feynman Lectures on Physics. Electrodynamics: Electromotive Force. References 1. The Biot-Savart Law. Classical limits.D.F. non-ideal (Van der Waals) gas. Linear dielectrics. Magnetization. Statistical formulation of mechanical problems: State of a system. Volume II 3. Ideal Bose Gas. kinetic theory of ideal gases. Divergence and Curl of B. 3. postulates. Thermodynamics . its properties and its connection with thermodynamic quantities. Magnetic Vector Potential. Statistical Mechanics . Potentials and Fields: Scalar and Vector potentials. Conservation Laws: Conservation of Charge and Energy. Coulomb gauge and Lorentz Gauge. The method of images. Work and Energy in Electrostatics. Ideal Fermi Gas. Griffiths 32 . 2. Electromagnetic waves in Conductor. Maxwell’s relations and thermodynamic functions. Gibbs paradox. Electromagnetic Induction. Thermodynamics : Laws of thermodynamics. J. ensembles. partition function. Magnetic susceptibility and permeability. Phillips • Physics II Thermodynamics and Statistical Mechanics 1. Panofsky and M. Polarization.2. Electromagnetic waves in Matter. Introduction to Electrodynamics .E. Reif Electromagnetic Theory II 1.W. Gauge Transformations.

bootstrap. Principle of relativity: Galilean Relativity. Conservation Laws. Four velocity and Four momentum and their interpretation.J. Mass formula. Resnick 2. Dynamics. Different resampling schemes: jackknife. Harmonic oscillators. Particle in a Box. The Harmonic Oscillator. state and Observables. etc. case: parametric and non-parametric bootstrap. Crasemann 7. 2.J. Length Contraction. The Lorentz Transformation. consistency and inconsistency of bootstrap. Angular momentum. De Broglie relation. Four vector formalism: Minkowskian four? Dimensional Space Time.• Physics III Special Theory of Relativity 1. sampling distribution and other features of a statistic. The Compton Effect. Eigen value. 5. Bayesian bootstrap.i. Mass energy equations.J. Eigen function. 3. The Free particle. shortcomings of analytic derivations. Bra and Ket notation. Discrete Symmetries. Introduction to Quantum Theory: The Photoelectric Effect. Quantum mechanics . The relativistic velocity addition formula. References: 1.d. The Heisenberg picture. The Diffraction of matter waves. The Schrodinger Equation and its application: Stationary States. half-sampling. Relativistic effects: Time dilatation. The Superposition Principle. Special Theory of Relativity -R. 2. The Schrodinger picture. Details of Spin-1/2 system. The Postulates of special Relativity. Degeneracy.Sakurai 3. The finite square well. The Mathematical Foundations of Quantum Mechanics: Hilbert Space. Operators. Addition of Angular Momentum. 3. Born probability Interpretation. Quantum Mechanics 1. Modern quantum mechanics . 4. Powell and B.6 Optional Courses Optional courses in Statistics • Resampling Techniques Introduction: What is resampling and its purpose? Examples from estimating variance. Symmetry in Quantum Mechanics: Symmetries. Parity or Space Inversion.L. The Heisenberg’s Uncertainty Principle. Significance of Michelson?Morley experiment. Operator Formalism: Creation and annihilation operators. The potential barrier. comparison between bootstrap approximation and normal 33 . Bootstrap in the i. The Statistical Interpretation of matter waves. Principle of complementarity.

Selection. A Statistical Approach to Genetic Epidemiology: Andreas Ziegler and Inke Konig Optional Courses in Probability • Random Graphs 34 . Random Mating. Inbreeding.V. comparison with non-parametric bootstrap. (1995): The jackknife and bootstrap. Resampling in linear models: special emphasis on residual bootstrap and weighted bootstrap. (1992): The bootstrap and Edgeworth expansion. 2. Segregation Analyses. Inheritance of the X-chromosome. (1993): An introduction to the bootstrap. Statistics in Human Genetics: Pak Sham 2. Tests for Genotype and Allelic Association for Population-based data on Binary Traits and Quantitative Traits.C. and Tibshirani R. models: need for other resampling schemes. Basic Quantitative Trait Locus Model. (Lecture Notes in Statistics. 4. (Lecture Notes in Statistics. Shao J. and Bertail P (1995): The weighted bootstrap. Davidson A. Gine E. Vol 98) 7. 6. 5. (1992): When does bootstrap work? Asymptotic results and simulations.d. Hardy-Weinberg Equilibrium. Adjustment of covariates in population-based association analyses. (CBMS-NSF Regional Conference Series in Applied Mathematics. introduction to estimating equation bootstrap and generalized bootstrap. the bootstrap and other resampling plans. concept of robust and efficient resampling schemes.d. Reference Texts 1.approximation.J. 3. Mutation. Mammen E. Vol 1665) 9. Joint genotype distributions of relatives using I-T-O matrices. (Lecture Notes in Mathematics.i.i. Reference Texts 1.. and Wolf M. (1982): The jackknife. Hall P. and Tu D. (1997): Lectures on some aspects of the bootstrap. (1997): Bootstrap methods and their applications. Jackknife in the i. Efron B. No 38) 8. Romano J. and Hinkley D.P. Resampling in non-i. Politis D. Vol 77) • Statistical Methods in Genetics Mendel’s Laws. case: consistency and inconsistency issues. Barbe P.N. Estimation of allele frequencies from genotype and phenotype data (with applications of the EM algorithm). (1999): Subsampling. Efron B.

Thresholds for subgraph containment. the configuration model. phase transition and critical probability. Sub-graph counts and its asymptotic distribution. The methods of moments. Bond percolation in two dimensions: planar duality. Asymptotic equivalence of the two models. Penrose: Random Geometric Graphs. Bollobs and O. The sub-critical phase. Optional Courses in Mathematics 35 . Dense and sparse random graphs. geometric random graphs. M. Two basic models of random graphs (Erd¨os-R´enyi random graphs): binomial random graphs and uniform random graphs. binomial and general case.Some basic probabilistic tools: First and second moment methods and their variations. asymptotic behavior of the radius of an open cluster. Bollobs: Random Graphs. probability of non-existence. Percolation on d-dimensional integer lattice. uniqueness of infinite open cluster. Properties and illustration with examples. Percolation function. 3. Concept of thresholds and proof of every monotone property has a threshold. Other models of random graphs: Albert-Baraba´si model of preferential attachment. Basic idea of amenable and non-amenable graphs. G. Sub-critical. 2. van der Hofstad: Random Graphs and Complex Networks (lecture notes: http://www. The super-critical phase. The FKG inequality for finitely many variables. Differences in percolation properties (statements only). Basic idea of sharp thresholds.nl/ rhofstad/NotesRGCN. The evolution of the sparse random graph. proof that critical probability is 1/2. Grimmett: Percolation.pdf) • Percolation Theory Basic notion of percolation. Azuma’s inequality (statement only).tue. Ric´ınski: Random Graphs. phase transition. Monotonicity property of these graphs. B. 4. Riordan: Percolation. Percolation on trees. S. Reference Texts 1. Connectivity threshold. Russo’s formula. The FKG inequality. 2. Janson. References Texts 1. B. the emergence of the giant component. Chromatic number of dense and sparse random graphs. T. Random regular graphs. critical and super-critical phases. Bond and site percolation on infinite lattice. Differences with percolation on integer lattices. L Ã uczak and A. Increasing events. Concept of pivotal variable. R. Asymptotic of small cycles. Concentration inequalities for sum of independent Bernoulli variables.win.

Euler and Abel summation formulae and average order of magnitude of various arithmetical functions. GCD and LCM. Elementary estimates of π(X) the number of primes up to X. Law of quadratic reciprocity for Legendre symbols. Notion of congruence and residues. multiplicative and completely multiplicative functions. Extension to Jacobi symbols. Statement of the Prime Number Theorem. Prime numbers. The topics in italics are supplementary and depending on the inclination of the instructor and the students. Introduction to chaos. Examples of failure of unique factorization. Existence and uniqueness of solution of x0 = f (x. George F.. 36 . Dirichlet characters and how to construct them. Definition and properties of the Legendre symbol. Notion of “order of magnitude” and asymptotic formulae. Application to linear Diophantine equations. Fermat’s method of infinite descent and application to simple Diophantine equations like x4 + y 4 = z 2 . Topics like Gauss sums. t). Euclid’s algorithm for computing GCD. Sieve of Eratosthenes. infinitude of primes (Euclid’s proof). Introduction to Partial Differential Equations. Euler’s criterion. Primitive roots. The group of units of Z/nZ. Arithmetic in Z[i]-the ring of Gaussian integers. explicit examples for quadratic fields. Gauss’s lemma. Rational points on conics. Wilson’s theorem and Euler’s theorem. Unique factorization of integers.A. Quadratic residues and non-residues. some of them may be chosen for brief discussions. Detailed study of the structure of the group of units of Z/nZ. Reference Texts 1. Brun’s sieve. Structure of Z/nZ. • Number Theory The ring structure and the order relation on Z. The Euler ϕ-function. Arithmetical functions and their convolutions. the M¨obius function µ(n) etc. The Hasse principle for conics. Rational points on cubics and the failure of the Hasse principle. Oscillation Theory and boundary value problems. Induction and well-ordering. Polynomial congruences and Hensel’s Lemma. Nonlinear equations. Picard’s method. Simmons: Differential Equations. Power series solutions and special functions. Euler’s differential equation. Coddington: An Introduction to Ordinary Differential Equations. Applications to RSA and other cryptosystems Pythagorean triplets and their geometric interpretation (rational points on circles). Linear congruences and the Chinese Remainder Theorem. the Euler function ϕ(n). The M¨obius inversion formula.• Differential Equations Review of First and second order linear differential equations with constant and variable coefficients. Sum of two and four squares. System of first order equations. Arithmetic in the ring of integers in number fields. Review of algebraic numbers and algebraic integers. Laplace transforms and convolution. 2. E. Lagrange’s four square theorem. examples like the divisor function d(n). Division algorithm. Application to non-solvability of Diophantine equations. Fermat’s “little” theorem. Calculus of variation.

Niven. Devadoss and J. de Berg et. Reference Texts 1. 4. minimum spanning tree. Approximation Algorithms: Approximation algorithms design techniques for a variety of combinatorial and graph optimization problems: greedy-method. matching. Wright. the definition of NP. May 2002. H. Vijay Vazirani. W. Brooks/Cole Pub Co. L.Group law on cubics. Prentice Hall. 4.al. Borevich. 1998. 1983. K. planarity algorithms. 3. Douglas West. Shafarevich. Combinatorial algorithms: Simplex algorithms. 7. Freeman.. E. Randomized Algorithms: Random variables and their expectations. arrangements and duality. Lectures on Discrete Geometry. S. 5. H. Wiley. 3. Optional Course in Computer Science • Special topics on Algorithm Graph algorithm: Optimal graph traversal. Spencer. Ramsey number. November 1990. H. W. Combinatorial geometry: Convexity. Graph Theory. Introduction to Graph Theory. linear programming relaxation. The Probabilistic Method. Wiley. Geometric algorithm: Convex hull. divide and conquer. Springer. 9. NP and Computational Intractability: Polynomial-time reductions. G. Michael R. O’Rourke. Matousek. shortest path. 2. Freeman Company. Approximation Algorithms for NP-Hard Problems. 2. Reinhard Diestel. Johnson. Discrete and Computational Geometry. M. John & Sons. Dorit Hochbaum (Editor). Computational Geometry: Algorithms and Applications. The Theory of Numbers.L. Ireland. Vaek Chvtal. A Classical Introduction to Modern Number Theory. I. 470pp. primal-dual methods.Szekeres theorem. 2nd edition. arrangement. An Introduction to the Theory of Numbers. Springer-Verlag. Aug 2000. I. Radon’s lemma and Helly’s theorem. Alon and J. NP-complete problems. H. 8. Computers and Intractability: A Guide to the Theory of NP-Completeness. 10. Montgomery. Princeton University Press. etc. April 2000. Number Theory. Alexander Schrijver. Zuckerman. 2000. 6. S. M. 3rd ed. Delaunay triangulations. Z. point location. Approximation Algorithms. ham sandwich cuts. network flows. Examples of randomized algorithms.. 2011. R. transcendence of e and π etc. 37 . I. 2008. 1996. Garey and David S. Examples of approximation algorithms. Reference Texts 1. Theory of Linear and Integer Programming. Hardy. M. H. Voronoi diagram. Springer-Verlag. cutting lemma. 11. Rosen. Springer-Verlag. may also be covered if time is available. 3rd edition. N. Erdos. Linear Programming.

It will also include an exposure to usual mistakes in mathematical/statistical English (for example: ‘let we consider’. and Applications. The course will have two sessions of two periods in a week. Ahuja. comprehension and verbal ability. Cambridge University Press. If a student fails this course. 7. The syllabus of this course will help the students to improve their English reading. Prabhakar Raghavan. 38 . even after the back-paper examination. This course will have three lecturehours and one tutorial session per week.) programme all students are required to take a test in English language (comprehension and ability in writing). ‘we now discuss about’. 13. Stat. and James B.12. ’the roots of the equation is’. Prentice Hall. A student will not be allowed to continue the B.) programme if he/she fails the course even after these three chances. February 1993. he/she would be allowed to repeat the course in the following year along with the new first year students. Orlin. Rajeev Motwani. Thomas L. Algorithms. (Hons. ‘stationery process’) and their corrections. Ravindra K. Network Flows: Theory. (Hons. Randomized Algorithms. Magnanti. Stat.7 • Remedial English Course Remedial English Just after the admission to the B. The students who fail this test are required to take the non-credit course in Remedial English.

- Presentation 6Uploaded bySwaroop Ranjan Baghar
- Web_Ch24_update_8-27-09Uploaded byChristian Perez
- Probability,Statistics and numerical Methods.pdfUploaded byChakri Chakravarthy
- 5Enote5 ProbabilityUploaded byJohna Mae Dolar Etang
- Chapter 06 (Part A) PowerPoint.pptUploaded bySarfaraj Ovi
- Probability and StatisticUploaded byjychong
- VGSOM Pre-Session Assignment 2010Uploaded byclementrocks
- Probability Theory and Stochastic ProcessesUploaded byToaster97
- Statistics Study GuideUploaded byldlewis
- ProbabilityUploaded bylieynna4996
- CCP303Uploaded byapi-3849444
- Approximating DistributionsUploaded bykshitijsaxena
- Blast Load-paper 411 1Uploaded bypandiangv
- c5Uploaded byrgerwwaa
- 44852464-Probability-and-Statistics.pdfUploaded by3334333
- 1994. Business School Prestige Research Versus TeachingUploaded bylengocthang
- Grubbs Trom Tang 2006Uploaded byNavneet Chaubey
- Business Mathematics and Statistics E-sample.pdfUploaded byCaroline Ndirangu
- Diagnostics TestPlanUploaded byManinder Kaur
- Assignment 3Uploaded byPramod Soni
- Guo EXAM PUploaded bySeema Soleja
- ComparativeUploaded byAd Vels
- PS_KirklandUploaded byDaniela Becerra
- Marley Colonius JMP92Uploaded byCamilo Ignacio
- Process Modeling by Statistical Methodes 905331 Lecture 1Uploaded bytala
- Ref_ Ped Competence.pdfUploaded byRodelita Villalobos
- StatUploaded byJoseph Ferreras-Guardian Eva-Escober
- BBA-ib-2-sylUploaded bySatyajeet Giri
- Spring 2009 Test 1 SolutionUploaded byAndrew Zeller
- Fao - Tilmicosin DraftUploaded byandreililioancea

- UnitsUploaded byHari Krishna
- brochureUploaded byHari Krishna
- dd.pdfdUploaded byHari Krishna
- Wac Commander.not All Codes Are Working.good LuckUploaded byHari Krishna
- UnitsUploaded byHari Krishna
- Ress OursUploaded byHari Krishna
- thalli pogathey yenai neeUploaded byHari Krishna
- thulli thulli ayya mallaiUploaded byHari Krishna
- nannnUploaded byHari Krishna
- Bst at Brochure 2012Uploaded byHari Krishna