### Главная > Документ

**Syllabus for B.Sc. (CSM)-I for the Session 2012-13**

**1st Semester**

**Title of the Paper**

CSM 111 General English (Communication Skills)

CSM 112 Algebra

CSM 113 Trigonometry and Differential Calculus

CSM 114 Computer Oriented Statistical Methods-I

CSM 115 Probability Theory-I

CSM 116 Statistics Lab-I (Computer Oriented Practicals)

CSM 117 Introduction to Information Technology

CSM 118 Computer Programming Using C

CSM 119 Software Lab I (Programming in C and its Applications in Statistics)

**2nd Semester**

**Title of the Paper**

CSM 121 General English (Communication Skills)

CSM 122 Integral Calculus & Differential Equations

CSM 123 Geometry

CSM 124 Computer oriented Statistical Methods-II

CSM 125 Probability Theory-II

CSM 126 Statistics Lab-II (Computer Oriented Practicals)

CSM 127 Object Oriented Programming Using C++

CSM 128 Management Information System

CSM 129 Software Lab II ( Programming in C++)

**Syllabus for B.Sc. (CSM)-II for the Session 2012-13**

**3rd Semester**

**Title of the Paper**

CSM 231 Advanced Calculus

CSM 232 Differential Equations

CSM 233 Applied Statistics

CSM 234 Statistical Inference I

CSM 235 Statistics Lab-III (Computer Oriented Practicals)

CSM 236 Data Structure

CSM 237 Data Base Management System

CSM 238 Software Lab III (Practicals based on DBMS using MS Access and Data Structures)

Punjabi

**4th Semester**

**Title of the Paper**

CSM 241 Real Analysis

CSM 242 Topics in Analysis

CSM 243 Industrial Statistics

CSM 244 Statistical Inference II

CSM 245 Statistics Lab-IV (Computer Oriented Practicals)

CSM 246 Operating Systems

CSM 247 Web Technology

CSM 248 Software Lab IV

Environmental Studies

**Syllabus for B.Sc. (CSM)-III for the Session 2012-13**

**5th Semester**

**Title of the Paper**

CSM 351 Communication Skills

CSM 352 Abstract Algebra

CSM 353 Discrete Mathematics

CSM 354 Computer Oriented Numerical Methods

CSM 355 Sample Surveys

CSM 356 Statistics Lab-V (Computer Oriented Practicals)

CSM 357 Computer Networks and Data Communication

CSM 358 Visual Programming

CSM 359 Software Lab-V (Practicals based on Visual Programming)

**6th Semester**

**Title of the Paper**

CSM 361 Communication Skills

CSM 362 Mechanics

CSM 363 Linear Algebra

CSM 364 Linear Programming

CSM 365 Design and Analysis of Experiments

CSM 366 Statistics Lab-VI (Computer Oriented Practicals)

CSM 367 Oracle

CSM 368 Software Engineering

CSM 369 Software Lab-VI (Practicals based on Oracle)

**SYLLABUS**

** B.Sc. (Computer Science, Statistics, Mathematics) Part – I **

Outlines of Tests Syllabi and Courses of Reading.

Note:-Every theory paper will be of three hours duration.

**For Examination of Session 2012-13.**

** 1st Semester **

**________________________________________________________________________**

Code Title of paper/subject Hrs./ __Max Maks__ Week Conti. Univ. Total

Asmt. Exam.

CSM 111 General English 2 20 30 50

(Communication Skills)

CSM 112 Algebra 4 30 45 75

CSM 113 Trigonometry and 4 30 45 75

Differential Calculus

CSM 114 Computer Oriented 3 20 30 50

Statistical Methods-I

CSM 115 Probability Theory-I 3 20 30 50

CSM 116 Statistics Lab-I 4 20 30 50

(Computer Oriented Practicals)

CSM 117 Introduction to 3 20 30 50 Information Technology

CSM 118 Computer Programming 3 20 30 50

Using C

CSM 119 Software Lab I 4 20 30 50

(Programming in C and its

Applications in Statistics) ________________________________________________________________________

Total 200 300 500

_______________________________________________________________________

Note: The minimum pass marks in each paper is 33% in continuous assessment and University

examination separately subject to a minimum of 40% in aggregate.

** BREAK-UP OF CONTINUOUS ASSESSMENT OF 20 MARKS **

**THEORY PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Seminars/Assignments/Quizes/ 25% Marks

Class participation

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

** PRACTICAL PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Viva and Lab records 25% Marks

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

**CSM 111- : ****GENERAL ENGLISH (COMMUNICATION SKILLS)**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

Contents of the course :

I One literary Text 15 marks

II Translation 05 marks

II Grammar and Vocabulary 10 marks

1. Flights of Fancy : Edited by Bakhshish Singh, Punjabi University , Patiala .

Poems to be studied :

Sonnet 116 W. Shakespeare

On His Blindness John Milton

The Pebble and the Clod William Blake

The World is Too Much With Us William Wordsworth

Lucy Gray William Wordsworth

My Native Land Sir Walter Scott.

Love S.T. Coleridge

The Scholar Robert Southey

The River of Life Thomas Camp bell

The Journey Onward Thomas Moore

II Translation : From Pbi/Hindi into English : No book prescribed.

III Grammar and Vocabulary:

(a) Grammar : Living English Structures by W. Stannard Allen (units 1-20)

Vocabulary : Students ' Companion by Wilfred D. Best -one word substitutes

1.(a) words denoting numbers : (b) words denoting places ; (c) words denoting

professions or trades .

2. Antonyms

Testing : Guide lines for the paper setter :

Q.I (a) One essay type question with internal alternative on the main idea or

summary (150words) of a poem studied from the prescribed text book

is to be attempted .

6 marks

Three short-answer type questions of comprehension out of the given five (30 words each) from the poems studied from the prescribed text book are to be attempted . 3 marks

Q (II) Explanation with reference to the context of any two out of the given three

extracts from the poems prescribed for study are to be attempted .

6 marks

Q. III Translation from Punjabi/ Hindi into English of a short passage of five short

sentences.

OR

( For students who do not know Punjabi and Hindi )

A five line passage of poetry with three questions of comprehension.

5 marks

Q.IV Do as directed : Twelve sentences out of the given fifteen from the book Living

English Structures are to be attempted .

6 marks

Q.V(a) Four one- word substitutes from the given six phrases exclusively from Students'

Companion) are to be attempted .

2 marks

(b) Antonyms of four out of the given six words (exclusively from the Students'

Companion) are to be attempted. 2 marks

## CSM-112 ALGEBRA

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Each of sections A and B will have four questions from the respective sections of the syllabus and section C will consist of one compulsory question having eight parts of short-answer type covering the entire syllabus uniformly. All the questions will carry equal marks.

**Instructions for the candidates**

Candidates are required to attempt five questions in all, selecting two questions from each section A and B and the compulsory question of section C. All questions will carry equal marks.

Use of scientific non-programmable calculator is allowed

### SECTION-A

Relations between the roots and coefficients of general polynomial equation in one variable .Transformation of equations. Descarte's rule of signs. Solution of cubic equations (Cardon method). Biquadratic equations.

Mappings, Equivalence relations and partitions .Congruence modulo n.

Symmetric, Skew symmetric, Hermitian and Skew Hermitian matrices . Elementary operations on matrices. lnverse of a matrix .

### SECTION-B

Linear independence of row and column vectors. Row rank ,column rank and rank of a matrix . Equivalence of column and row ranks. Eigen values, eigen vectors and the characteristic equation of a matrix. Cayley Hamilton theorem and its use in finding inverse of a matrix. Applications of matrices to a system of linear ( both homogeneous and non-homogeneous ) equations. Theorems on consistency of a system of linear equations .

**TEXT BOOKS**

P.B. Bhattacharya, S.K. Jain and S.R. Nagpaul, First Course in Linear Algebra,Wiley Eastern,New Delhi ,1983.

S.K. Jain, A. Gunawardena and P.B. Bhatacharya, Basic Linear Algebra with MATLAB, Key College Publishing (Sprinder-Verlag), 2001.

Chandrika Prased, Text Book on Algebra and Theory of Equations, Pothishala private Ltd., Allabhabad.

**RECOMMENDED READINGS**

K.B. Datta, Matrix and Linear Algebra, Prentice Hall of India Pvt.Ltd., New Delhi, 2000.

**CSM-113 : TRIGONOMETRY AND DIFFERENTIAL CALCULUS**

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Each of sections A and B will have four questions from the respective sections of the syllabus and section C will consist of one compulsory question having eight parts of short-answer type covering the entire syllabus uniformly. All the questions will carry equal marks.

**Instructions for the candidates**

Candidates are required to attempt five questions in all, selecting two questions from each section A and B and the compulsory question of section C. All questions will carry equal marks.

Use of scientific non-programmable calculator is allowed

### SECTION-A

**Trigonometry: **De Moivre's theorem and its applications . Direct and inverse circular and hyperbolic functions. Logarithm of a complex quantiy. Expansion of trigonometrical functions. Gregory's series. Summation of series.

**SECTION-B**

**Differential Calculus: ** definition of the limit of a function . Basic properties of limits . Continuous functions and classification of discontinuities .Differentiability . Successive differentiation . Leibnitz theorem . Asymptotes . Curvature. Tests for concavity and convexity. Points of inflexion . Multiple points. Tracing of curves ( Cartesian and parametric coordinates only ).

### TEXT BOOKS

S. L . Loney plane Trigonometry Part II, Macmillan and Company, London.

R.S. Verma and K.S. Shukla,Text Book on Trigonometry, Pothishala Pvt. Ltd., Allahabad.

P .K . Jain and S. K. Kaushik, An introduction to Real Analysis, S. Chand & Co. New Delhi, 2000.

Gorakh Prased Differential Calculus, Pothishala Private Ltd. Allahabad.

**RECOMMENDED READINGS**

1. Gabriel Klambauer, Mathematical Analysis , Marcel Dekkar,Inc. New York, 1975.

2. Murray R . Spiegel, Theory and problems of Advanced Calculus, Schaum's outline series, Schaum Publishing Co. New York

**CSM-114 : COMPUTER ORIENTED STATISTICAL METHODS **- I

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

The question paper will consist of three sections A, B and C. Each of sections A and B will have four questions from the respective sections of the syllabus and section C will consist of one compulsory question having eight parts of short-answer type covering the entire syllabus uniformly. All the questions will carry equal marks.

**Instructions for the candidates**

Candidates are required to attempt five questions in all, selecting two questions from each section A and B and the compulsory question of section C. All questions will carry equal marks.

Use of scientific non-programmable calculator is allowed

###### SECTION- A

Collection of data : Primary data – designing a questionnaire and a schedule. Secondary data - its major sources including some government publications. Concept of a Statistical population and samples from a population ;quantitative and qualitative data , discrete and continuous data ,nominal, ordinal , ratio & interval scales .

Presentation of data: Diagrammatical representation of data , frequency distribution , graphical representation , Histogram , Frequency polygon , Frequency curves and ogives .

**SECTION-B**

Analysis of quantitative data : univariate data concepts of central tendency , dispersion , skewness and kurtosis and their measures including those based on quartiles and moments .Sheppard's correction for moments (without derivation).

#### TEXT BOOKS

1. Goon, A.M., Gupta Fundamental of Statistics. Vol. 1. 1991, world

M.K., Dasgupta, B. Press. Calcutta.

###### RECOMMENDED READINGS

1. Bhat B.R, Srivenkatramana T and Rao Madhava K.S. (1997): Statistics : A

Beginner's Text, Vol, I , New Age International (P) Ltd.

2. Croxton F.E, Cowden D. J and Kelin S (1973) : Applied General statistics, Prentice Hall of India .

3. Spiegel, M.R. (1967): Theory & Problems of Statistics, Schaum's Publishing Series.

4. W.W. Daniel : Bio Statistics : A foundation for Analysis in the Health Sciences 7th Ed. (1999)

5. Wiley Series in Probability and Statistics. Applied Probability and statistics section.

** CSM-115 : PROBABILITY THEORY – I**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION- A

Important concepts in probability :Random experiment, trial, sample point and sample space, definition of an event, mutually exclusive, exhaustive, independent and equally likely events. Definition of the probability-classical and relative frequency approach to probability, their demerits and axiomatic approach to probability. Properties of probability based on axiomatic approach, conditional probability, Bayes theorem and its applications.

** Section- B**

Random Variable** : **Definition of discrete random variables, probability mass function ,continuous random variable, probability density function illustrations of random variables and its properties, expectation of a random variable and its properties-moments, measures of location and dispersion, moment generating function and probability generating function. Two dimensional random variables –joint, marginal and conditional distributions (concepts & simple applications)** .**

## TEXT BOOKS

P.L. Meyer ( 1970 ) : Introductory Probability and Statistical ApplicationsAddison-Wesley.

Goon, A.M., Gupta, M.K., Dasgupta, B.(1999) : Fundamental of Statistics

*,*Vol. I, World Press ,Calcutta .Mood A.M., Graybill F.A and Boes D.C. (1974) : Introduction to the Theory of Statistics, McGrawh Hill .

**REFERENCE READINGS**

Bhat B.R, Srivenkatramana T and Rao Madhava K.S. (1997) : Statistics : A Beginner's Text, Vol. II, New Age International (P) Ltd.

David S (1996) : Elementary Probability, Oxford Press. John E. Freund's Mathematical Statistics 6th Ed. Pub. Pearson Education

**CSM-116: STATISTICS LAB-I (COMPUTER ORIENTED PRACTICALS)**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The setting and evaluation will be done by a board of examiners consisting of Head, External examiner and the teacher(s) involved with the teaching of this paper.

The practical paper will consist of four exercises and the candidates will be required to attempt any three exercises.

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Exercises : 18

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-114(Computer Oriented Statistical Methods-I) and CSM-115(Probability Theory-I).

**CSM - 117 : INTRODUCTION TO INFORMATION TECHNOLOGY**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

SECTION-A

Information Technology : Introduction, hardware and software, the information processing cycle. Information systems, software and data, IT Applications; Types of computers, Anatomy of a computer, Binary numbers, Binary arithmetic, digital revolution, computer as a digital device, Moore’s Law, Bits and bytes, CPU, Memory : RAM and ROM, Registers, System buses, i/o Buses, communication with peripherals. Input and Output devices : Keyboards-virtual and ergonomic, OCR, handwriting recognition, bar code and speech recognition, scanners resolution, printers-Laser, dot matrix and inkjet.

Secondary Storage : Storage devices and media, sequential and random storage, tracks and sectors, speed, storage capacity, Removable media. Storage Media : floppy and hard disks. RAID, Optical discs, Increasing storage capacity, backup and smart cards.

###### SECTION B

Computer languages: Machine language, assembly language, higher level language, 4GL. Introduction to Compiler, Interpreter, Assembler, System Software Application Software. Number System: Non-positional and positional number systems, base-conversion, fractional numbers, various operations on numbers. Computer code: BCD, EBCDIC, ASCII.

WWW and Internet: Introduction, home page, connecting to web, browsing, information search, multimedia. Computer Network and communication: Network types, network topologies, network communication devices, physical communication media. Introduction of E-Commerce: Meaning, its advantages and Limitations, Type of E- Commerce Applications.

**TEXT BOOK :**

1. Curtin D.P., Foley K., Sen K., Morin C “Information Technology” : The breaking wave, TMH.

2. V. Rajaraman ";Fundamentals of computer";, PHI, N. Delhi,1996.

3. Chetan Srivastva,” Fundamentals of information Technology, Kalayani Publishers, 2003.

**REFERENCE READINGS:**

1. Williams B. K., Sawyer S.C., Hutchinson S. E., Using Information Technology, 3rd Edition,

TMH.

###### CSM - 118 : COMPUTER PROGRAMMING USING “C”

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

** Section-A**

Problem Solving with Computer : Algorithms, Pseudocodes and Flowcharts. Data types, constants, variables, arithmetic and logical expressions, data input and output, assignment statements, conditional statements, iteration.

Arrays, string processing, User-defined data types.

** SECTION-B**

Functions recursion, Parameter Passing by reference & by value. Structures, Multiple structures, Arrays of structures, Unions, Files: Reading , Writing text and binary files, Pointers, character pointers, pointers to arrays, Array of pointers, pointers to structures.

Debugging, testing and documentation ; structured programming concepts, top down & Bottom-Up design approaches.

(The programming language C is to be taught along with the course in detail)

** TEXT bookS**

1. E. Balagurusamy, ";Programming in C";, Tata McGraw Hill.

2. Kanetkar, ";Let Us C";, BPB Publications.

** reference READINGS**

1. Richie and Kerningham, "; C Programming";.

2. Rajaraman, V: Fundamentals of Computers (PHI, 1992)

3. D. Dromey: How to solve it by Computer (Prentice-Hall 1985)

** CSM-119 : SOFTWARE LAB-I **

**( PROGRAMMING IN ";C"; AND ITS APPLICATIONS IN STATISTICS)**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The setting and evaluation will be done by a board of examiners consisting of Head, External examiner and the teacher(s) involved with the teaching of this paper.

The practical paper will consist of four exercises and the candidates will be required to attempt any three exercises.

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Development of programmes : 18

& their execution

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-114(Computer Oriented Statistical Methods-I) and CSM-118(Computer Programming using ";C";).

**Syllabus**

**2nd Semester **

**For Examination of Session 2012-13.**

**________________________________________________________________________**

Code Title of paper/subject Hrs./ __Max Marks__ Week Cont. Univ. Total

Asmt. Exam.

CSM 121 General English 2 20 30 50

(Communication Skills)

CSM 122 Integral Calculus &

Differential Equations 4 30 45 75

CSM 123 Geometry 4 30 45 75

CSM 124 Computer oriented 3 20 30 50

Statistical Methods-II

CSM 125 Probability Theory-II 3 20 30 50

CSM 126 Statistics Lab-II 4 20 30 50

(Computer Oriented

Practicals)

CSM 127 Object Oriented 3 20 30 50

Programming Using C++

CSM 128 Management Information 3 20 30 50

System

CSM 129 Software Lab II 4 20 30 50

( Programming in C++)

________________________________________________________________________

Total 200 300 500

________________________________________________________________________

Note: The minimum pass marks in each paper is 33% in continuous assessment and University examination separately subject to a minimum of 40% in aggregate.

**BREAK-UP OF CONTINUOUS ASSESSMENT OF 20 MARKS **

**THEORY PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Seminars/Assignments/Quizes/ 25% Marks

Class participation

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

** PRACTICAL PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Viva and Lab records 25% Marks

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

**CSM 121- : GENERAL ENGLISH (COMMUNICATION SKILLS)**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

Contents of the course :

I One literary Text 15 marks

II Composition : 05marks

II Grammar and Vocabulary 10 marks

Poems to be studied :

1 . Love's Philosophy Percy Bysshe Shelley

2. Bright Star John Keats

3. Dream Peddler Thomas Lovell Beddoes

3. How Do I Love Thee Elizabeth Barret Browning

4. To One In Paradise Edgar Allan Poe

5. Home Thought from Abroad Robert Browning

6. Invictus W.E. Henley

7. Leave This Chanting Rabindra Nath Tagore

8. Stopping By Woods Robert Frost

10.The Highway Man Alfred Noyes

II Composition : Para graph (Descriptive) No book prescribed.

III Grammar and Vocabulary:

(a) Grammar : Living English Structures by W. Stannard Allen (units 21-30)

Vocabulary : Students ' Companion by Wilfred D. Best : one word

substitutes :

(i) Names by which persons with certain characteristics are known .

(ii) Words pertaining to government. (iii) marriage (iv) medical profession.

(v) death (vi) opposites (vii) scientific instruments .

Synonyms

Testing : Guide lines for the paper setter :

Q.I (a) One essay type question with internal alternative on the main idea or

summary (150words) of a poem studied from the prescribed text book

is to be attempted . 6 marks

(b) Three short answer type questions of comprehension out of the given five

(30 words each) from the poems studied from the prescribed text are to be

attempted 3 marks

Q.II Explanation with reference to the context of any two of the given three extracts from the poems prescribed for study are to be attempted. 6 marks

Q. III A paragraph (Descriptive) one out of the given three topics is to be

attempted (150words)

5 marks

Q.IV Do as directed : Twelve sentences out of given fifteen from Living

English Structures are to be attempted .

6 marks

Q.V(a) Four one words substitutes from the given six phrases (exclusively from

Students' Companion) are to be attempted

2 marks

(b) Synonyms of four out of the given six words (exclusively from Students'

Companion). are to be attempted .

2 marks

**CSM 122: INTEGRAL CALCULUS AND DIFFERENTIAL EQUATIONS**

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION-A

Integration of irrational algebraic and transcendental functions . Reduction formulae. Definite integrals . Quadrature and rectification . Volumes and surfaces of solids of revolution .

Degree and order of a differential equation . Equation of first order and first degree. Equations in which the variables are separable . Homogeneous equations . Linear equations and equations reducible to the linear from . Exact differential equations .

### SECTION-B

First order higher degree equations solvable for x, y, p. Clairaut's form and singular solutions . Geometrical meaning of a differential equation .Orthogonal trajectories .Linear differential equation with constant coefficients .Homogeneous linear ordinary differential equations.

Linear differential equations of second order .Transformation of the equation by changing the dependent variable / the independent variable. Method of variation of parameters .

### TEXT BOOKS

Gorakh Prasad, Integral Calculus, Pothishala Private Ltd., Allahabad.

D.A. Murray, Introductory Course in Differential Equations, Orient Longman (India),1967.

**RECOMMENDED READINGS**

1. H.T.H. Piaggio, Elementary Treatise on Differential Equations and their Applications. C.B.S. Publisher & Distributors, Delhi , 1985.

2. Erwin Kreyszing, Advanced Engineering Mathematics, John Wiley and Sons, 1999.

## CSM 123- GEOMETRY

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION-A

Transformation of axes , shifting of origin, Rotation of axes, Reduction of the second degree equation into standard forms by transformation of co-ordinates. The invariants t , and . Identification of curves represented by second degree equation.

Pole and polar, pair of tangents from a point, chord of contact ,equation of the chord in terms of midpoint and diameter of conic .

Conjugate diameters, Conjugate hyperbola .Asymptotes of a hyperbola, rectangular hyperbola . Special properties of parabola, ellipse and hyperbola.

Polar equations of conics and equations of chords, tangents and normals only .

### SECTION-B

Sphere . Cone . Cylinder . Central conicoids. Paraboloids. Plane Sections of Concoids. Generating lines. Confocal Conicoids . Reduction of Second degree equation to standard forms.

### TEXT BOOKS

S.L. Loney, The Elements of Coordinate Geometry, Macmillan and Company, London.

Gorakh Prasad and H.C. Gupta, Text Book on Coordinate Geometry , Pothishala Pvt. Ltd., Allahabad.

P.K. Jain and Khalil Ahmad, A Text Book of Analytical Geometry of two Dimensions, Wiley Eastern Ltd.,1994.

N. Saran and R.S. Gupta, Analytical Geometry of Three Dimensions, Pothishala Pvt. Ltd., Allahabad.

**RECOMMENDED READINGS**

R.J.T. Bell, Elementary Treatise on Coordinate Geometry of Three Dimensions, Macmillan India Ltd., 1994.

**CSM-124**** : ****COMPUTER ORIENTED STATISTICAL METHODS -II **

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

## SECTION - A

Bivariate data :scatter diagram, product moment correlation coefficient, properties and coefficient of determination. Spearman's rank correlation coefficient . Concept of errors in regression, principle of least square, fitting of linear regression and related results.

**SECTION-B**

Multivariate data: Concepts of Multiple regression, multiple and partial correlation coefficients (only results no derivations) and their applications.

Analysis of categorical data: Contingency of categorical data ,independence & association of attributes . Various measures of association for two way classified data.

**TEXT BOOKS**

1. Goon, A.M., Gupta Fundamental of Statistics. Vol. 1. 1991, world

M.K., Dasgupta, B. Press. Calcutta.

**REFERENCE READINGS**

Bhat B.R, Srivenkatramana T and Rao Madhava K.S. (1997): Statistics : A

Beginner's Text, Vol, I , New Age International (P) Ltd.

Croxton F.E, Cowden D. J and Kelin S (1973) : Applied General statistics, Prentice Hall of India .

Spiegel, M.R. (1967): Theory & Problems of Statistics, Schaum's Publishing Series.

W.W. Daniel : Bio Statistics : A foundation for Analysis in the Health Sciences 7th Ed. (1999).

Wiley Series in Probability and Statistics. Applied Probability and Statistics Section.

** CSM-125: PROBABILITY THEORY– II**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION- A

Standard univariate discrete distributions and properties : Discrete uniform, Binomial, Poisson, Hyper Geometric, Geometric and Negative Binomial distributions. Continuous univariate distributions: Uniform , normal , exponential, Gamma, Beta and chi-square distributions.

### SECTION-B

the bivariate normal distribution, the marginal and conditional probability distributions associated with the bivariate normal distribution (without derivation).

Chebyshev's inequality and its applications, statements and applications of weak law of large numbers and central limit theorems (De-moivre's-Laplace and Lindeberg-Levy versions).

### TEXT BOOKS

1. P.L. Meyer ( 1970 ) : Introductory Probability and Statistical ApplicationsAddison-Wesley.

Goon, A.M., Gupta, M.K., Dasgupta, B.(1999) : Fundamental of Statistics

*,*Vol. I, World Press ,Calcutta .Mood A.M., Graybill F.A and Boes D.C. (1974) : Introduction to the Theory of Statistics, McGrawh Hill .

**REFERENCE READINGS**

1. Bhat B.R, Srivenkatramana T and Rao Madhava K.S. (1997) : Statistics : A Beginner's Text, Vol. II, New Age International (P) Ltd.

David S (1996) : Elementary Probability, Oxford Press.

John E. Freund's Mathematical Statistics 6th Ed. Pub. Pearson Education

**CSM-126:STATISTICS LAB-II (COMPUTER ORIENTED PRACTICALS)**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The setting and evaluation will be done by a board of examiners consisting of Head, External examiner and the teacher(s) involved with the teaching of this paper.

The practical paper will consist of four exercises and the candidates will be required to attempt any three exercises.

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Exercises : 18

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-124(Computer Oriented Statistical Methods-II) and CSM-125(Fitting of distributions).

**CSM - 127: OBJECT ORIENTED PROGRAMMING USING C++**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

## SECTION A

Evolution of OOP: Procedure Oriented Programming, OOP Paradigm, Advantages and disadvantages of OOP over its predecessor paradigms.

Characteristics of Object Oriented Programming: Abstraction, Encapsulation, Data hiding, Inheritance, Polymorphism, Code Extensibility and Reusability, User defined Data Types.

Introduction to C++: Identifier, Keywords, Constants, Operators: Arithmetic, relational, logical, conditional and assignment. Sizeof operator, Operator precedence and associativity.

Type conversion, Variable declaration, expressions, statements, manipulators

Input and output statements, stream I/O, Conditional and Iterative statements, breaking control statements.

Storage Classes: Automatic, Static, Extern, Register. Arrays, Arrays as Character Strings, Structures, Unions, Bit fields, Enumerations and User defined types.

Pointers: Pointer Operations, Pointer Arithmetic, Pointers and Arrays, Pointer to functions. Functions: Prototyping, Definition and Call, Scope Rules. Parameter Passing: by value, by address and by reference, Functions returning references, Const functions, recursion, function overloading, Default Arguments, Const arguments.

## SECTION B

Pre-processor : #define, #error, #include, #if, #else, #endif, #ifdef, #ifdef, #undef

Type casting : static-cast, const-cast, dynamic-cast, reinterpret-cast.

Classes and Objects: Class Declaration and Class Definition, Defining member functions, making functions inline, Nesting of member functions, Members access control. this pointer. Union as space saving classes.

Objects: Object as function arguments, array of objects, functions returning objects, Const member functions. Static data members and Static member functions.

Friend functions and Friend classes.

Constructors: properties, types of constructors (Default, parameterized and copy), Dynamic constructors, multiple constructors in classes. Destructors: Properties, Virtual destructors. Destroying objects. Rules for constructors and destructors.

Array of objects. Dynamic memory allocation using new and delete operators, Nested and container classes. Scopes: Local, Global, Namespace and Class

Inheritance: Defining derived classes, inheriting private members, single inheritance, types of derivation, function redefining, constructors in derived class.

**TEXT BOOKS**

Herbert Schildt, “The Complete Reference C++”, Tata McGraw-Hill, 2001.

Deitel and Deitel, “C++ How to Program”, Pearson Education, 2001

**REFERENCE READINGS**

Robert Lafore, “Object Oriented Programming in C++”, Galgotia Publications, 1994.

Bjarne Strautrup, “The C++ Programming Language”, Addition- Wesley Publication Co., 2001.

E. Balagurusamy, “ Object Oriented Programming with C++”, Tata McGraw-Hill, 2001

**CSM - 128: ****Management Information System**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION A**

Framework of Management Information Systems: Importance’s of MIS, Concepts of Management, information, system, Definition of MIS, information technology and MIS, nature and scope of MIS, MIS characteristics and functions.

Structure and classification of MIS: structure of MIS, MIS classification, Brief introduction of functional information system, financial information system, marketing information system, production/ Manufacturing information system, human resources information system.

Decision making and MIS**: **decision making, Simon’s model of decision making, types of decisions, purpose of decision making, level of programmability, knowledge of outcomes, methods of choosing among alternatives, decision making and MIS.

Information and system concepts: types of information: strategic information, Tactical information, Operational information. Information quality, dimensions of information, System: Kinds of Systems, System related concepts, elements of systems, Human as an information processing system.

**SECTION B**

System development stages**: **System investigation, system analysis, system design, construction and testing, implementation, maintenance.

System development approaches (a brief introduction) : waterfall model, prototyping, iterative enhancement model, spiral model.

System analysis: introduction, requirement definition, , strategies for requirement definition, structured analysis tools: data flow diagram, data dictionary, decision trees , structured English, decision trees.

System Design: objectives, conceptual design, design methods, detailed system design.

Implementation and evaluation of MIS: implementation process, Hardware and software selection, Evaluation MIS, System maintenance.

Information system Planning: Information system Planning, planning terminology, the Nolan stage model, selecting a methodology, information resources management.

Information system (IS) as an Enabler: introduction, changing concepts of IS , IS as an enabler

**TEXT BOOKS**

1. D.P. Goyal, “ Management information systems”, Macmillan India Ltd.

**REFERENCE READINGS**

1. Bentley,”System Analysis and Design”, TMH

2. Robert G. Murdick & Joel E. Ross & James R. Claggett, “Information Systems for Modern Management” PHI.

3.A. Ziya Aktas, “Structured Analysis & Design of Information System”, PHI.

4.V. Rajaraman, “Analysis & Design of Information Systems”, PHI.

5.J. Kanter, “Management/Information Systems”, PHI.

6.Gordon B. Davis & M.H. Olson, “Management Information Systems : Conceptual Foundation, Sructure & Development.

CSM-129: SOFTWARE LAB-II ( PROGRAMMING IN ";C++";)

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Development of programmes : 18

& their execution

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM -127 (Object Oriented Programming using C++).

**SYLLABUS**

**B.Sc. (Computer Science, Statistics ,Mathematics) Part – II **

Outlines of Tests Syllabi and Courses of Reading.

Note:-Every theory paper will be of three hours duration.

**For Examination of Session 2012-13.**

**3rd Semester **

**_______________________________________________________________________**

Code Title of paper/subject Hrs./Week __Max Marks__ Cont. Univ. Total

Asmt. Exam.

CSM 231 Advanced Calculus 4 30 45 75

CSM 232 Differential Equations 4 30 45 75

CSM 233 Applied Statistics 3 20 30 50

CSM 234 Statistical Inference I 3 20 30 50

CSM 235 Statistics Lab-III 4 20 30 50

(Computer Oriented

Practicals)

CSM 236 Data Structure 3 20 30 50

CSM 237 Data Base Management 3 20 30 50

System

CSM 238 Software Lab III 4 20 30 50

( Practicals based on DBMS

using MS Access and Data

Structure)

________________________________________________________________________

Total 180 270 450

________________________________________________________________________

**Note: ****1. The minimum pass marks in each paper is 33% in Continuous Assessment and University Examination separately subject to a minimum of 40% in aggregate****. **

**2. In addition to above mentioned subjects, there will be a course of Qualifying Punjabi/ Punjab History & Culture as a qualifying subject.**

**BREAK-UP OF CONTINUOUS ASSESSMENT OF 20 MARKS **

**THEORY PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Seminars/Assignments/Quizes/ 25% Marks

Class participation

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

** PRACTICAL PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment

2. Viva and Lab records 25% Marks

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

## CSM 231: ADVANCED CALCULUS

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION-A

Definition of a sequence,. Bounded sequences, Theorems on limits of sequences, Cauchy's convergence criterion, Monotonic sequences.

Continuity, Sequential continuity, Properties of continuous functions, Uniform continuity.

### Chain rule of differentiability, Mean -value theorems and their geometrical interpretations, Darboux's intermediate value theorem for derivatives.

### SECTION-B

### Taylor's theorem with various forms of remainders, Maclaurin and Taylor series expansions, Applications of derivatives, Extreme values, Indeterminate forms.

### Infinite series of non-negative terms, Comparison tests, Cauchy's root test , Integral test, Ratio tests. Raabe's, Logarithmic, De-Morgan and Bertrand's tests, Alternating series, Leibnitz's theorem, Absolute and conditional convergence.

Series of arbitary terms, Convergence, divergence and oscillation. Abel's and Dirichlet's tests. Multiplication of series.

**TEXT BOOKS**

1. S.C. Malik: Mathematical Analysis,Wiley Easteen Ltd.,New Delhi.

2. Shanti Narayan : Course of Mathematical Analysis, S. Chand & Company, New Delhi.

## 3. Gorakh Prasad : Differential Calculus, Pothishalaa Pvt. Ltd., Allahabad.

**REFERENCE READINGS**

## 1. T.M.Apostol : Mathematical Analysis Nasora Publishing House, New-Delhi,1985.

## 2. D. Soma Sundaram and B. Choudhary : A First Course in Mathematical Analysis,

## Nasora Publishing House, New-Delhi, 1997.

## 3. P. K. Jain & S. K. Kaushik: An Introduction to Real Analysis, S. Chand & Co.,New Delhi, 2000.

## 4. Murray R. Spiegal: Theory and Problems of Advanced Calculus, Schaum Publishing Co.,New York.

## CSM 232 : DIFFERENTIAL EQUATIONS

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION-A

Series solutions of differential equations. Power series method. Bessel,Legendre and Hypergeometric equations. Bessel, Legendre and Hypergeometric functions and their properties. Convergence, recurrence and generating relations. Orthogonality of functions. Sturm-Liouville problem. Orthogonality of eigen-functions. Reality of eigen values. Orthogonality of Bessel functions and Legendre polynomials.

### Partial differential equations of the first order. Lagrange's solution. Some special types of equations which can be solved easily by methods other than the general method. Charpit's general method of solution.

### SECTION-B

Partial differential equations of second and higher orders. Classification of linear partial differential equations of second order. Homogeneous and non-homogeneous equations with constant coefficients. Partial differential equations reducible to equations with constant coefficients. Monge's methods.

### Laplace Transforms – Linearity of the transformation. Existence theorem for Laplace transforms. Laplace transforms of derivatives and integrals. Shifting theorems. Differentiation and integration of transforms. Convolution theorem. Solution of integral equations and systems of differential equations using the Laplace transformation.

** TEXT BOOKS**

1. Frank Ayres : Theory & Problems of Differential Equations, Macgraw- Hill Book Co.,1972.

2. Zafar Ahsan, Introduction to Differential Equations, PHI.

**REFERENCE READINGS**

1. Erwin Kreyszig : Advanced Engg. Mathematics , John Wiley & Sons Inc., New York.99.

**2. D. A. Murray : Introductory Course on Differential Equations, Orient Longman(India) 1967.**

3. Ian N Sneddon : Elements of Partial Differential Equations, Macgraw- Hill Book Co.,1988.

4. Richard Bronson : Theory & Problems of Differential Equations, Macgraw- Hill Inc. 1973.

5. Jane Cronin : Differential Equations, Marcel Dekkar , 1994.

**CSM 233: APPLIED STATISTICS**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

## SECTION-A

**Index numbers**: definitions, interpretation and applications of index numbers. Problems involved in the construction of index numbers, Laspeyre's, Paasche's, Marshal-Edgeworth formulae for index numbers. Fisher's ideal index numbers, errors in index numbers, criterion of good index numbers, uses of index numbers.

**SECTION-B**

**Time Series**: Definition of time series,the four components of a time series,measurement of secular trend by method of moving average and fitting of Mathematical curves, measurement of seasonal fluctuations by ratio-to-moving average, ratio to trend and link relative methods, measurement of cyclical fluctuations .( excluding periodogram analysis)

## TEXT BOOKS

Goon A. M., Gupta M.K., Das gupta. B. (1986) : Fundamentals of Statistics, Vol. II, World Press, Calcutta .

### REFERENCE READINGS

Croxton F.E and Cowden D.J. (1969) : Applied General Statistics, Prentice Hall of India .

Gupta and Mukhopadhyay P. P ( ) Applied Statistics, Central Book Agency .

**CSM 234 : STATISTICAL INFERENCE - I**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

## Section-A

Point estimation, estimators and estimates, criteria for good estimator-unbiasedness, consistency, efficiency and sufficiency (only the definitions and examples), maximum likelihood method of estimation, interval estimation and interval estimate of the mean of a normal distribution.

** SECTION-B**

Testing of Hypotheses: The concept of statistical hypotheses, simple and composite hypotheses, null and alternative hypotheses, statistical test and its critical region, level of significance, two types of error, power and power function, Neyman-Pearson theory of test construction. Neyman-Pearson Lemma (only statement) and its application for constructing a test for a simple hypothesis against a simple alternative hypothesis.

**TEXT BOOKS**

Goon, A.M., Gupta, M.K. and Dasgupta, B. : Fundamentals and Statistics*, *Vol. 1, World Press Pvt. Ltd., Calcutta

** REFERENCE READINGS**

Hogg , R.V. and Craig, A.T. (1978) : Introduction to Mathematical Statistics*, *4th ed. Collier MacMillan Internations ed

**CSM-235: STATISTICS LAB-III (COMPUTER ORIENTED PRACTICALS)**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Exercises : 18

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-233(Applied Statistics) and CSM – 234 (Statistical Inference- I)

** CSM 236 : DATA STRUCTURES **

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

SECTION A

Review of basic mathematical concepts and notations.

Data structures and data structure operations, ADT Concept, algorithmic complexity and time space trade off.

Introduction to basic data structures such as arrays, linked-lists, stacks and queues, Linked and sequential representation, Basic operations such as insertion, deletion, searching.

Linked list, representation of linked list, doubly linked-list, circular linked list.

Implementation of stacks, postfix to infix conversion and evaluation of expressions using stacks, Queue, Dequeues and their applications.

## SECTION B

Tree : definitions and basic concepts, linked tree representation, representations in contiguous storage, binary trees, binary search tree : traversal searching, insertion in BST, heap and heap sort algorithm.

Graphs and their application, sequential and linked representation of graph, operations on graph, traversing a graph, Dijkstra’s algorithm for shortest distance, DFS and BFS.

Searching and sorting : linear and binary search, hash search, insertion, selection merge, radix, bubble, quick sort. Memory management: Allocation, garbage collection, fragmentation & compaction.

**TEXT BOOKS**

**Seymour Lipschutz “Theory & Practice of Data Structures”, McGraw Hill, 1988.**

**REFERENCE READINGS**

**Thomas Naps and Bhagat Singh, Introduction to Data Strucutres with Pascal., West Publishing.****Tenenbaum, Y. Lanhghsam and A. J. Augenstein, “Data Structures Using C and C++”, Prentice Hall of India, 1990.****E. Horowitz and S. Sahni, “Data Structures with Pascal”, Galgotia, 3**^{rd}Edition, 1991.**Ah. A.V. Hopcraft J.E. and Ullman, J.D. “The Design and Analysis of Computer Alorithms”, Addison Wesley.**

**CSM 237 : ****DATABASE MANAGEMENT SYSTEM**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION A**

Traditional file processing system : Characteristics, limitations, Database : Definition, composition.

Database Management system : Definition, Characteristics, advantages over traditional file processing system, Implication of Database approach, User of database, DBA and its responsibilities, Database schema, instance.

DBMS architecture, data independence, mapping between different levels.

Database languages : DDL, DML, DCL.

Database utilities, Data Models, Keys : Super, candidate, primary, unique, foreign.

Entity relationship model : concepts, mapping cardinalities, entity relationship diagram, weak entity sets, strong entity set, aggregation, generalization, converting ER diagrams to tables.

Overview of Network and Hierarchical model.

Relational Data model : concepts, constraints. Relational algebra : Basic operations, additional operations.

**SECTION B**

Database design : Functional dependency, decomposition, problems arising out of bad database design, normalization, multi-valued dependency. Database design process, database protection, database integrity, database concurrency : Problems arising out of concurrency, methods of handling concurrency. Data recovery, database security : Authentication, authorization, methods of implementing security.

**MS-ACCESS : **Introduction to MS-ACCESS, working with databases and tables, queries in Access, Applying integrity constraints, Introduction to forms, sorting and filtering, controls, Reports and Macro : creating reports, using Macros.

**TEXT BOOK:**

1. C.J. Date, ";An Introduction to Data Base Systems";, 7th Ed., Addison Wesley,

2. C. J. Date, “An Introduction to Data Base Systems” 3rd Edition, Narosa Publishers, 1997. (Reprint).

###### REFERENCE READINGS

1. Jeffrey D. Ullman, “Principles of Database Systems”, 2nd Edition., Galgotia Publications, 1984.

2. D. Kroenke., “Database Processing”, Galgotia Publications, 1987.

3. Henry F. Korth, “Database System Concepts”, McGraw Hill. Inc., 1997.

4. Naveen Prakash, “Introduction to Database Management”, TMH, 1993.

5. Elmisry Nawathy, “DBMS” Pearson India Limited.

6. Vipin Desai, ";An Introduction to DBMS";

CSM 238 : SOFTWARE LAB-III (PRACTICALS BASED ON DBMS USING MS ACCESS and DATA STRUCTURE)

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Development of programmes : 18

& their execution

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM 236 (Data Structure) and CSM 237 (Data Base Management System).

**f;b/p;**

**(****e[nkbhckfJzr gzikph)**

**e[b nze L 100 fbysh L 60**

**;wK L 3 xzN/ fJzBNoBb L 40 **

**ghohnv L 2 gqsh jcsk gk; nze L 35****%**

1 a gzikph dh gkm g[;se

Gkr gfjbk-gzikph ;kfjs

(U) eftsk

(n) ejkDh

(J) BkNe

Gkr d{ik-gzikp ;fGnkuko ns/ b'eXkok

Gkr shik-gzikph Gk;ak s/ r[ow[yh fbgh

nze tzv ns/ g/go ;?No bJh jdkfJsK

g[;se d/ fszB Gkr jB . gqzs{ gq;aB d' Gkrk ftu j't/rk . gq;aB gZso dk

gfjbk Gkr g[;se d/ gfjb/ Gkr T[s/ nXkfos j't/rk . fJ; Gkr d/ e[b 36

nze jB . gq;aB gZso dk d{ik Gkr g[;se d/ d{i/ ns/ shi/ Gkr T[s/ nXkfos

j't/rk . fJ; Gkr d/ e[b nze 24 j'Dr/ ns/ fJ; ftu g[;se d/ d{i/ ns/

shi/ Gkr d/ 12-12 nze j'Dr/ .

(1) g[;se d/ gfjb/ Gkr d/ fszB T[g-Gkr 'T', 'n' ns/ 'J' jB . fJBQK fszBK

T[g GkrK ftu' j/m fby/ nB[;ko ;[nkb g[ZS/ ikD .

(T) fJ; ftu e[b 12 gq;aB n?pi?efNe NkJhg$wbNhgb u'D tkb/ j'Dr/ .

jo T[g-Gkr ftu 4-4 gq;aB g[ZS/ ikDr/ . ;ko/ gq;aB eoB/ bkiwh

j'Dr/ . nze 3 x 4 = 12

(n) jo T[g Gkr ftu' 5-5 bx{ gq;aB g[ZS/ ikDr/ fiBQK ftu' 3-3 gq;aB eoB/

bkiawh j'Dr/ . T[Zso gzi bkJhBK s' tZX Bk j't/ . nze 9 x 2 = 18

(J) jo T[g Gkr ftu'A 1-1 gq;aB g[fSnk ikt/rk . d'jK ftu' fJe gq;aB jZb

eoBk j'r/rk . T[Zso fJe ;c/ sZe ;hws j't/ . nze = 06

ubdk gzBkaaaa aaaaaaaaaaaaaaaa

fgSb/ gzB/ s/ aaaa

(2) g[;se d/ d{i/ ns/ shi/ Gkr ftu'A gq;aB fJ; gqeko g[ZS/ ikDr/ .

(T) jo Gkr ftu' 4-4 gq;aB n?pi?efNt NkJhg$wbNhgb u'D tkb/ j'Dr/ .

;ko/ gq;aB eoB/ bkiawh j'Dr/ nze 4+4 = 08

(n) jo fJe Gkr ftu 4-4 ;zy/g gq;aB g[ZS/ ikDr/ . e[b gq;aB jZb eoB/

j”Dr/ .jo Gkr ftu’ 2 gq;aB bkiawh jB . nze 5+ 5= 10

(J) jo fJe Gkr ftu'A 1-1 gq;aB g[fSnk ikt/rk . fJe gq;aB jZb eoBk

j't/rk . T[Zso fJe ;c/ sZe ;hws j't/ . nze = 06

B”N wfye gqhfynk gk; g[;se s/ jh nXkfos j’’t/rh . fJ; dh ftXh gq?eNheb

tkbh j’t/rh .

**Punjab History & Culture**

(Special paper in lieu of Punjabi)

** Max. Marks : 100 Uni. Exam. : 80**

** Internal Assessment : 20 Pass marks : 35% Time Allowed : 3 hours**

** NOTE : **The paper setter should keep in view the topics specified in each paper and not the title of the paper. Candidates are requested to attempt one question each from the sections A, B, C and D and the entire section E.

**INSTRUCTIONS FOR THE PAPER SETTERS**

The syllabus prescribed should be strictly adhered to. The paper-setters should keep in view the topics specified in each paper and no the title of the paper.

The questions paper will consist of five sections. A, B, C, D and E. Sections A, B, C and D will have two questions from the respective sections of the syllabus and will carry 15 marks each. Section E will consist of 15 short answer type questions which will cover the entire syllabus and will carry 20 marks in all. There being internal choice in this section, each short answer type question will carry 2 marks. Candidates are required to attempt one question each from the sections A, B, C, D and the section E.

The wording of the questions should be simple and easily understandable by average students. There should be no vagueness.

There should be no question based upon quotations.

The general standard of the questions should cater to the different intellectual levels – average and below average.

Each paper is of 80 marks and of the three hours duration and 20 marks for internal assessment.

**SECTION – A**

Teachings of Guru Nanak.

Development of Sikh Institutions : (1) Langar (2) Sangat (3) Manji system

(4) Masand system (5) Harminder Sahib (6) Akal Takht (7) Miri Piri

**Section – B**

Compilation of Adi Granth, Martyrdom of Guru Arjan,

Causes of Martyrdom of Guru Tegh Bahadur, Creation of Khalsa and its impact

**Section – C**

Study of Institutions : Dal Khalsa, Gurmatta, Chhota Ghallughara and Wadda Ghallughara.

Ranjt Singh’s conquest of Lahore, Personality of Ranjit Singh

**Section – D **

Great Artists of Punjab : Amrita Shergill, Sobha Singh: Folk Music and Dances.

Famous Legends of Punjab : Heer Ranjha and Sohni Mahiwal.

**SECTION – E**

Fifteen short answer questions will be set from the entire syllabus. The candidates will attempt any 10 questions. These questions will be based upon terms, concepts, institutions within the purview of the syllabus. The answer of these questions will be of 20-25 words and will carry 2 marks each. Thus, the total marks for these questions will be 20.

**BOOKS SUGGESTED : **

Fauja Singh (ed) History and Culture of the Punjab, Vol. 11& 111

G.S. Chahara, The Advanced History of the Punjab, Vol. 1

Ganda Singh and Teja Singh: A Short History of the Sikhs

J.S. Grewal, The New Cambridge History of India : The Sikhs of the Punjab,

D.S Dhillon, Sikhism : Origin and Development

Hari Ram Gupta :History of the Sikhs Vol,-1.

**Syllabus**

**4 th Semester **

**For Examination of Session 2012-13.**

**________________________________________________________________________**

Code Title of paper/subject Hrs./ __Max Marks__ Week Cont. Univ. Total

Asmt. Exam.

________________________________________________________________________

CSM 241 Real Analysis 4 30 45 75

CSM 242 Topics in Analysis 4 30 45 75

CSM 243 Industrial Statistics 3 20 30 50

CSM 244 Statistical Inference II 3 20 30 50

CSM 245 Statistics Lab-IV 4 20 30 50

(Computer Oriented

Practicals)

CSM 246 Operating Systems 3 20 30 50

CSM 247 Web Technology 3 20 30 50

CSM 248 Software Lab IV 4 20 30 50

________________________________________________________________________

Total 180 270 450

________________________________________________________________________

**Note****: 1. The minimum pass marks in each paper is 33% in Continuous Assessment and University Examination separately subject to a minimum of 40% in aggregate****. **

**2. In addition to above mentioned subjects, there will be a course of **

**Environmental Studies as a qualifying subject. **

** BREAK-UP OF CONTINUOUS ASSESSMENT OF 20 MARKS **

**THEORY PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Seminars/Assignments/Quizes/ 25% Marks

Class participation

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

** PRACTICAL PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Viva and Lab records 25% Marks

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

## CSM-241: REAL ANALYSIS

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION-A

Riemann integral, Integrability of continuous and monotonic functions, The fundamental

theorem of integral calculus, Mean value theorems of integral calculus.

### Improper integrals and their convergence, Comparison tests, Able's and Dirichlet's tests, Frullani's integral, Integral as a function of a parameter, Continuity, derivability and integrability of an integral of a function of a parameter.

### SECTION-B

Limit and continuity of functions of two variables, Partial derivation and differentiability of

real-valued functions of two variables. Schwarz's and Young's theorems, Statements of inverse

function theorem, implicit function theorem and their applications. Euler's theorem on

homogeneous functions, Taylor's theorem , Jacobians, maxima, minima and saddle points

of functions of two variables. Lagrange's multiplier method.

Fourier series: Fourier expansion of piecewise monotonic functions.

** TEXT BOOKS**

1. S.C. Malik: Mathematical Analysis,Wiley Easteen Ltd.,New Delhi.

2. Shanti Narayan : A Course of Mathematical Analysis , S. Chand & Co.,New Delhi.

## REFERENCE READINGS

1. T. M. Apostol : Mathematical Analysis, Narosa Publishing House, New Delhi,1985.

2. D. Somasundaram & B. Choudhary : A First Course in Mathematical Analysis, Narosa Publishing House, New Delhi, 1997.

3. P. K. Jain & S. K. Kaushik : An Introduction to Real Analysis, S. Chand & Co.,New Delhi,2000.

###### CSM-242: TOPICS IN ANALYSIS

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

### SECTION-A

Beta and Gamma functions, Double and triple integrals, Change of order of integration in double integals.

**Vector Analysis: **Product of two vectors, Scalar and vector product of three vectors,Vector differention. Gradient, divergence and curl. Vector integration. Statements (without proof) of Gauss, Green and Stokes

theorems and their applications.

### SECTION-B

Sequences and series of functions, pointwise and uniform convergence, Cauchy’s criterion for uniform convergence, Weierstrass M-test, Abel’s and Dirichlet’s tests for uniform convergence ,uniform convergence and and continuity, uniform convergence and Riemann integration, uniform convergence and differentiation, Weierstrass approximation theorem. Power series, uniquincess theorem for power series.

**Complex analysis:**

Complex numbers as ordered pairs. Geometric representation of complex numbers, Stereographic

Projection.

Continuity and differentiability of complex functions. Analytic functions. Cauchy'-Riemann

Equations. Harmonic functions.

Analytic functions as conformal mapping. Examples of mapping by elementary functions. Mobius

Transformations. Fixed points. Crossratio. Inverse points.

**TEXT BOOKS**

1. S.C. Malik: Mathematical Analysis,Wiley Easteen Ltd.,New Delhi.

2. Shanti Narayan , Theory of Functions of a Complex Variable, S. Chand & Co., New Delhi

3. Murray R. Spiegel, Vector Analysis, Schaum publishing Company, New York.

4. Kasana, H.S., Complex Variables, PHI.

**REFERENCE READINGS**

1. T.M.Apostoi, Mathematical Analysis, Narosa publishing House, New Delhi,1985

2. R.R. Goldberg, Real Analysis, Oxford & IBH Publishing Co., New Delhi, 1970.

3. D. Somasundaram and B. Choudhary, A First Course in Mathematical Analysis, Narosa publishing House, New Delhi,1997.

4. Shanti Narayan, A Course of Mathematical Analysis , S. Chand & Co., New Delhi.

5. P.K. Jain and S.K.Kaushik, An introduction to Real Analysis, S. Chand & Co., New Delhi,2000.

6. R.V. Churchill & J.W.Brown, Complex Variables and Applications, 5th Edition , McGraw-Hill, New York, 1990.

**CSM - 243 : INDUSTRIAL STATISTICS**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION-A**

Statistical quality control, chance and assignable causes, process and product control, the technique of control charts for process control, three sigma probability and specification limits. Schewhart control charts for mean and S.D. and range, control charts for number defectives and fraction defective, control chart for number of defects.

Advantages of process control, sampling inspection by attribute, the concept of producer's and consumer's risks, AOQ, AOQL, ASN and OC functions and curves, single and double sampling plans.

** SECTION - B**

Inventory problem, introduction, definition, inventory costs, inventory variables. Classification of inventory problems, concept of Economic Ordering Quantity (EOQ), EOQ problems without/with shortages, Uniform/Constant demand, finite/infinite replenishment of inventory. EOQ problems with price breaks.

** TEXT BOOKS**

1. Goon, A.M., Gupta, M.K. and Dasgupta, B. : *Fundamentals of Statistics, *Vol. II, World Press, 6th Ed. (revised and enlarged), 1986

2. Kanti Swarup, P.K. Gupta and Manmohan : *Operations Research, *Sultan Chand and Sons, New Delhi, Edition - 1996

**`**

**CSM - 244 : STATISTICAL INFERENCE – II**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION-A**

Sampling distributions of Chi-square, t and F. Distribution of the sample mean and variance of independent random observations from a normal population (derivation of sample variance distribution excluded).

Exact tests and confidence intervals relating to the parameters of the Binomial and Poisson distributions. Tests for the independence of two attributes, tests about the mean and variance of a univariate normal distribution, comparison of two univariate normal distributions through their means and variances. Testing the significance of the correlation coefficient and the regression coefficients in the case of simple regression

SECTION - B

Approximate tests and confidence intervals for proportions and for poisson parameters. Fisher’s Z-transformation of the sample correlation, test regarding the population correlation coefficient based on Z-transformation and confidence limits for the coefficient based on it.

**TEXT BOOKS**

Goon, A.M., Gupta, M.K. and Dasgupta, B. : Fundamentals and Statistics*, *Vol. 1, World Press Pvt. Ltd., Calcutta

** REFERENCE BOOKS**

Hogg , R.V. and Craig, A.T. (1978) : Introduction to Mathematical Statistics*, *4th ed. Collier MacMillan Internations ed

**CSM-245: STATISTICS LAB-IV (COMPUTER ORIENTED PRACTICALS)**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Exercises : 18

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-243 (Industrial Statistics) and CSM-244 (Statistical Inference II).

**CSM - 246 : ****OPERATING SYSTEMS**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION-A**

Introduction to operating System, its need and Operating system services, Definition, Early systems, Simple batch systems, Multiprogrammed batched systems, Time sharing systems, Personal computer systems and Real time systems. Process Management: Process concept, Process scheduling,

CPU Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms : FCFS, SJF, Round Robin & Queue Algorithms. Deadlocks: Deadlock characterisation, Methods for handling deadlocks, Banker’s Algorithm.

**SECTION-B**

Memory Management: Logical versus Physical address space, Swapping, Contiguous allocation, Paging, Segmentation.

Virtual Memory: Demand paging, Performance of demand paging, Page replacement, Page replacement algorithms, Thrashing.

File management: File system Structure, Allocation methods: Contiguous allocation, Linked allocation, Indexed allocation, Free space management: Bit vector, Linked list, Grouping, Counting.

Device Management: Disk structure, Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK, Selecting disk scheduling algorithm.

**TEXT BOOKS**

Abraham Silberschatz, Peter B. Galvin, “ Operating System Concepts”, Addison-Wesley publishing. Co., 4th. Ed., 1994.

**REFERENCE READINGS**

1 Brinch Hansen, “Operating System Principles”, Prentice-Hall, 1984.

N. Haberman, “Introduction to Operating System Design”, Galgotia Publication, 1986.

Brich Hansen, “The Architecture of Concurrent Programs”, PHI, 1978.

**CSM – 247 : ****WEB TECHNOLOGY **

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION A**

Introduction to internet, www, http, webpages & URL structures, and HTML. Markup vs. traditional programming languages.

Creating HTML pages, viewing pages in different browsers.

Structures of HTML page, tags and attributes, color codes and fonts, different elements in head section of HTML document.

Text-formatting tags, applying formatting to the body section of HTML document, block level and text level tags, behavior of formatting tags in different browsers

Creating external and internal links.

Adding graphics with image tag, image element attributes, using images as links, image maps, supported image file formats

Adding multimedia to web pages, supported audio & video formats.

Tables: Presenting information in tables, table attributes, table as layout tool, nested tables

**SECTION B**

Frames: using frames, frameset, targeted links, no-frames element.

Forms: using HTML forms, input control elements and attributes, processing forms.

DHTML basics : CSS, DOM, Javascript.

Creating and applying stylesheets to HTML elements, inline embedded and linking external stylesheets, conflicting styles

DOM and object collection, using the frames and forms collection, event model ,

Introduction to client side scripting and javascript, Javascript operators , control structures, functions and arrays, examples of javascript

Using javascript's in-built objects : Math, String, Number and Date.

**TEXT BOOKS **

1. Deitel, Deitel and Nieto : Internet & WWW- How to program, 2001, Pearson Education Asia.

**REFERENCE READINGS **

1. E Stephen Mack, Janan Platt : HTML 4.0 , no experience required, 1998, BPB Publications.

2. Shiran & Shiran : Advanced Javascript programming, 1998, BPB Publications.

3.D. Bertsellas and R. Gallager, “Data Networks”, 2nd Edition, Prentice Hall, 1992.

CSM-248 : SOFTWARE LAB-IV + PROJECT

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 4

Viva-voice : 4

Development of programmes : 15

& their execution

Project : 7

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM - 247 (Web Technology) using HTML & Javascript.

** ENVIRONMENTAL STUDIES**

**Time Allowed : 3 hours Total lectures: 30**

** Total Marks : 100**

** Pass marks: 35**

** Written paper: 75 marks**

** Field work: 25 marks**

**INSTRUCTIONS**

The written paper will have two parts. Part first will be of 25 marks it will contain ten questions, the students will attempt five questions of five marks out of this part. The answer to these questions should not exceed 50 words each. Part second of the paper will be of 50 marks and will contain ten essay type questions. The candidates will attempt five questions out of this part. The answer to each question should not exceed 500 words. Each question will carry ten marks.

**Unit 1: The Multidisciplinary nature of environmental studies**

Definition, scope and importance

Need for public awareness.

**Unit 2 : Natural Resources**:

**Renewable and non-renewable resources**:

Natural resources and associated problems.

a) Forest resources: Use and over-exploitation, deforestation, case studies. Timber extraction, mining, dams and their effects on forests and tribal people.

b) Water resources: Use and over-utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and problems.

c) Mineral resources; Use and exploitation, environmental effects of extracting and using mineral resources, case studies.

d) Food resources : World food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problem, water logging, salinity, case studies.

e) Energy resources: Growing energy needs, renewable and non renewable energy sources, use of alternate energy sources, Case studies.

f) Land resources; Land as a resource, land degradation, man induced landslides, soil erosion and desertification.

Role of an individual in conservation of natural resources.

Equitable use of resources for sustainable lifestyles.

**Unit 3 : Ecosystems.**

Concepts of an ecosystem.

Structure and function of an ecosystem.

Producers, consumers and decomposers.

Energy flow in the ecosystem.

Ecological succession.

Food chains, food webs and ecological pyramids.

Introduction, types, characteristic features, structures and function of the following ecosystem:-

a) Forest ecosystem

b) Grassland ecosystem

c) Desert ecosystem

d) Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)

**Unit 4 : Biodiversity and its Conservation**

Introduction- Definition: genetic, species and ecosystem diversity.

Biogeographical classification of India.

Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values.

Biodiversity of global, National and local levels.

India as a mega-diversity nation.

Hot-spots of biodiversity.

Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts.

Endangered and endemic species of India.

Conservation of biodiversity: In-situ and Ex-situ conservation of biodiversity.

**Unit 5 : Environmental Pollution **

Definition

Causes, effects and control measures of:-

a) Air Pollution

b) Water Pollution

c) Soil Pollution

d) Marine Pollution

e) Noise pollution

f) Thermal pollution

g) Nuclear hazard

Solid waste Management: Causes, effects and control measures of urban and industrial wastes.

Role of an individual in prevention of pollution.

Pollution case studies.

Disaster management : floods, earthquake, cyclone and landslides.

**Unit 6 : Social Issues and the Environment**

From Unsustainable to Sustainable development.

Urban problems related to energy.

Water conservation, rain water harvesting, watershed management.

Resettlement and rehabilitation of people; its problems and concerns. Case studies.

Environmental ethics: Issues and possible solutions.

Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Cast Studies.

Wasteland reclamation.

Consumerism and waste products.

Environment Protection Act.

Air (Prevention and Control of Pollution) Act.

Water ( Prevention and control of Pollution) Act

Wildlife Protection Act

Forest Conservation Act

Issues involved in enforcement of environmental legislation.

Public awareness.

**Unit 7: Human Population and the Environment**

Population growth, variation among nations.

Population explosion- Family Welfare Programme.

Environment and human health.

Human Rights

Value Education.

HIV/AIDS.

Women and Child Welfare.

Role of information Technology in Environment and human health.

Case Studies.

**Unit 8 : Field Work**

Visit to a local area to document environmental assets-river/forest/grassland/hill/mountain.

Visit to a local polluted site- Urban/Rural/Industrial/Agricultural.

Study of common plants, insects, birds.

Study of simple ecosystems-pond, river, hill slopes, etc. ( Field work Equal to 5 lecture hours).

###### SYLLABUS

B.Sc. (Computer Science, Statistics and Mathematics) Part – III

Outlines of Tests Syllabi and Courses of Reading.

Note:-Every theory paper will be of three hours duration.

**For Examination of Session 2012-13.**

V th Semester

_________________________________________________________________________

Code Title of paper/subject Hrs./ __Max Marks__ Week Cont. Univ. Total

Asmt. Exam.

CSM 351 Communication Skills 2 20 30 50

CSM 352 Abstract Algebra 4 30 45 75

CSM 353 Discrete Mathematics 4 30 45 75

CSM 354 Computer Oriented 3 20 30 50

Numerical Methods

CSM 355 Sample Surveys 3 20 30 50

CSM 356 Statistics Lab-V 4 20 30 50

(Computer Oriented

Practicals)

CSM 357 Computer Networks and 3 20 30 50

Data Communication

CSM 358 Visual Programming 3 20 30 50

CSM 359 Software Lab V 4 20 30 50

( Practicals based on

Visual Programming)

________________________________________________________________________

Total 200 300 500

________________________________________________________________________

**Note: **** The minimum pass marks in each paper is 33% in Continuous Assessment and University Examination separately subject to a minimum of 40% in aggregate****. **

**BREAK-UP OF CONTINUOUS ASSESSMENT OF 20 MARKS **

**THEORY PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Seminars/Assignments/Quizes/ 25% Marks

Class participation

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

** PRACTICAL PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Viva and Lab records 25% Marks

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

**CSM-351 : COMMUNICATION SKILLS**

**No. of Lectures : 30 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

** The question paper will consist of three sections A, B and C. Each of sections A and B will have four questions from the respective sections of the syllabus and section C will consist of one compulsory question having six parts of short-answer type covering the entire syllabus uniformly. All the questions will carry equal marks.**

**Instructions for the candidates**

** Section –A**

Communication:Process of communication, Types and channels of communications.

Reading Skills: Reading purpose, strategies and methodologies, Reading activities and structure of reading techniques

** Section –B**

Writing Skills: Elements of effective writing, writing styles, use of homonyms, cloze tests, one word substitutions, abbreviations etc.

Business Corrospondence: Elements & kinds of business letters; office order, purchase order, quotations & tenders etc.

** Recommended Books **

N Sundarajan, Business Communication, Sura College of Competition, Chennai

Asha Kaul, Business Communication, Prentice Hall of India, New Delhi

Matthukutty M Monippally, Business Communication Strategies, Tata McGraw-Hill Publishing Co., New Delhi

M V Rodriques, Effective Business Communication, Concept Publishing Company, New Delhi

**CSM-352 :ABSTRACT ALGEBRA **

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION-A**

**Group Theory** : Semigroups and groups , Examples : Integers modulo n under addition and under multiplication, Linear groups and finite Direct product of groups . Homomorphisms, subgroups and cosets, Euler-Fermat theorem , Poincares theorem. Cyclic Groups. Permutation groups, Cayley's thorem . Groups of symmetries. Normal subgroups and Quotient groups Isomorphism theorems, Automorphisms, Conjugacy and conjugate classes.

**SECTION- B**

**Ring theory** : Definition and examples, the ring of integers modulo n. Elementary properties of rings. Types of rings, Integral domains division rings and fields. The ring of matrices, the ring of polynomials , ring of endomorphisms of abelian group. Subring and characteristic of ring. Ideals , the Quotient ring of a ring by an ideal, principal ideals examples. Homomorphism, the fundamental theorem and the correspondence theorem . The opposite of a ring. Unique factorization domains, principle ideal domains , Euclidean domains, polynomial rings over UFD , Gauss lemma . The ring R [x] as a UFD.

**Text Book **

1. Bhattacharya, P.B. and Jain, S.K., Nagpaul S.R.: Basic Abstract Algebra

Chapters 4,5,9,10 (Section 1and 2 only) and Chapter 11 .

**Reference Book **

1. Herstein, I.N.: Topics in Algebra

**CSM 353 : DISCRETE MATHEMATICS**

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION-A**

Sets and Propositions-Cardinality, Mathematical Induction, Princple of Inclusion and exclusion. Relations and Function- Binary relations. Equivalence relations and Partitions. Partial order relations and Lattices. Chains and Anti chains. Pigeon Hole Principle.

Graphs and Planar Graphs – Basic Terminology. Multigraphs. Weighted Graphs. Paths and Circuits. Shortest paths. Eulerian paths and circuits. Traveling Salesman Problem. Planar Graphs. Discrete numeric functions and Generating functions.

**SECTION-B**

Recurrence Relations and Recursive Algorithms- Linear Recurrence Relations with Constant Coefficients. Homogeneous Solutions. Particular Solution. Total Solution. Solution by the Methods of Generating Functions.

Boolean Algebras – Lattices and Algebraic Structures. Duality . Distributive and Complemented Lattices. Boolean Lattices and Boolean Algebras. Boolean Functions and Expressions. Propositional Calculus. Design and Implementation of Digital Networks. Switching Circuits.

**TEXT BOOKS**

C.L. Liu, Elements of Discrete mathematics ( Second Edition ) , McGraw Hill, International Edition, Computer Science Series. 1986.

Discrete Mathematics, S Series.

**RECOMMENDED READINGS**

Kenneth, H.Rosen: Discrete Mathematics and its Applications.

Mc Graw Hill Fifth Ed. 2003

** CSM - 354 : COMPUTER ORIENTED NUMERICAL METHODS**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

## Section-A

Floating point representation of numbers, Arithmetic operations with normalised floating point numbers and its consequences, Errors in numbers, Binary representation of numbers. Solution of Transcendental and polynomial equations : Bi-section method, Regula-falsi method, Newton-Raphson method, Secant method.

** Section - B**

Solution to simultaneous linear and algebraic equations : Gauss elimination method, pivoting, ill-conditioned equations, Gauss-Seidal iterative method.

Finite difference and Interpolation : Difference operators, Divided differences, (Definition and properties), relations among operators, Newton-Gregory formulae for forward and backward interpolation, Newton's interpolation formula for divided differences, Lagrange's interpolation formula, truncation error in various interpolation formulae.

** TEXT BOOKS**

1. S. Balachandra Rao and C.K. Shantha : ‘Numerical Methods with Programs

in BASIC, fortran & pascal’ University Press (india) Ltd., Edition, 1992.

2. Bala Guruswamy : ‘Computer Oriented Numerical Methods’.

3. H.C. Saxena : ‘Calculus of Finite Differences and Numerical Analysis’, S. Chand

and Sons, Delhi, E

**RECOMMENDED READINGS**

1. B.S. Grewal : Numerical Methods, Khanna Publishers, 2004

**CSM –355 : SAMPLE SURVEYS**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

###### Section-A

Concepts of population and sample, need for sampling, census and sample surveys, basic concepts in sampling, Simple random sampling ( with and without replacement) : estimation of population mean, population variance and population proportion, Variance of estimators of population mean, population proportion and their estimators.

###### Section-b

Stratified random sampling: proportional, Neyman and optimum allocations, estimate of population mean , variance of the estimate and estimate of its variance, ratio and regression methods of estimation under simple random sampling without replacement, large sample expressions of their variances, comparison with mean per unit estimate.

### TEXT BOOKS

1. Singh, D. and Chaudhary , F.S. : Theory and Analysis of Sample Surveys Design,

Wiley East. Ist ed., 1986

CSM-356: STATISTICS LAB-V (COMPUTER ORIENTED PRACTICALS)

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Exercises : 18

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-354(Computer Oriented Numerical Methods) and CSM-355(Sample Surveys).

**CSM - 357: ****COMPUTER NETWORKS AND ****DATA COMMUNICATION**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

*SECTION - A *

Computer Networks: Uses of Computer Network, Network Hardware, Network Software, Goals and Applications of Computer networks, Structure of Computer Network: Point-to-point structure, Broadcasting structure, Types of Networks, Topologies.

Reference Models: OSI Reference Model, TCP/IP reference Model, Comparison of OSI and TCP Reference Model.

Data Communication: Transmission media, Wireless communication, and the Telephone system, Introduction to cellular radio and communication satellite, Data Rate of Channel, Electromagnetic spectrum.

**SECTION - B**

Switching : Circuit switching, packet switching, comparison.

ALOHA Protocols : Introduction to Internetworking – Concepts, Repeaters, Routers, Bridges, and Gateways.

Internet Protocol: IP protocol, IP Addresses, Subnets, Internet Control Protocol, Introduction to interior and exterior gateway routing protocol., internet multicasting and mobile IP.

Internet Applications: Domain Name System, Electronic mail, The World Wide Web, Introduction to Multimedia - Audio, Video, Data compression, File Transfer and Remote File Access – Introduction, data transfer and distributed communication, generalised file transfer, interactive and batch transfer, FTP, FTP model, FTP interface, client-server interaction in FTP.

**TEXT BOOKS**

Andrew S. Tanenbaum, “Computer Networks”, Third Edition, PHI Publications, 1997.

Stallings William, “Data & Computer Communication”, 6th Edition, PHI Publications.

**REFERENCE READINGS**

D.E. Corner, “Computer Networks and Internets’, Second Edition, Addison-Wesley Publication, 2000.

D. Bertsellas and R. Gallager, “Data Networks”, 2nd Edition, Prentice Hall, 1992.

**CSM 358 : VISUAL PROGRAMMING**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Candidates are required to attempt five questions in all, selecting two questions from each section A and B and the compulsory question of section C. All questions will carry equal marks. Use of scientific non-programmable calculator is allowed

## Section-A

Introduction to Visual Basic: The Visual Basic Program Development Process; The Visual Basic Environment; Opening a Visual Basic Project; Saving a Visual Basic Project; Running a Visual Basic Project.

Visual Basic Fundamentals: Numeric Constants; String Constants; Variables; Data Types and Data Declarations; Operators and Expressions; Hierarchy of Operations; String Expressions; Library functions, Branching and Looping Statements, Relational Operators and Logical Expressions; Logical Operators; Branching with if-then block; Branching with if- then- else blocks; Selection: Select- case; Looping with for–next; Looping with do-loop; Looping with while-end.

Visual Basic Control Fundamentals: Visual Basic Control Tools; Control tool Categories; Working with controls; Naming Forms and Controls; Assigning Property Values to Forms and Controls; Executing Commands ( Event Procedures and Command Buttons); Display Output Data ( Labels and Text Boxes); Entering Input Data ( Text Boxes); Selecting Multiple Features( Check Boxes); Selecting Exclusive Alternatives ( Option Button and Frames); Assigning Properties Collectively ( The With Block); Generating Error Messages ( The MsgBox Function); Creating Times Events; Scrollbars;

Menus and Dialog Boxes: Building Drop-down Menus; accessing a Menu from the Keyboard; Menu Enhancements; Submenus; Pop-up Menus; Dialog Boxes; Input Boxes;

Executing and Debugging a New Project: Syntax Errors; Logical Errors; Selecting Break Points; Defining Watch Values; Stepping Through a Program; User-Induced Errors; Error Handlers.

**SECTION-B**

Procedures : Modules and Procedures; Sub Procedures ; Event Procedures ; Function Procedures ; Scope; Optional Arguments.

Arrays: Array Characteristics; Array declarations; Processing Array elements; Passing Arrays to Procedures; Dynamic Array-Related Functions; Control Arrays;

Using Class Modules** :** Object Oriented Principles; Creating Class Modules; Using Class Modules Adding Properties and Events and Methods.

Using COM Components : Introduction to ActiveX Components and Component Object Model; Benefits of COM; Clients and Servers; Types of ActiveX Components available in Visual Basic; Creating user defined ActiveX Components; Managing Components; The Visual Component Manager; Registering and UnRegistering Components.

ActiveX Controls: Creating an ActiveX Control; Benefits of ActiveX Control; Adding Properties; Methods and Events to the Control; Managing and Distribution of the Control; Built-in ActiveX Controls.

Introduction to data controls like ADO, RDO, ADODC.

**TEXT BOOKS**

SAMS Teach yourself Visual Basic 6 in 21 days: Tec media Publication by Gerg Perry.

Visual Basic Complete Reference.

**CSM-359 : SOFTWARE LAB V**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Development of programmes : 18

& their execution

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-358(Visual Programming).

###### SYLLABUS

**VIth Semester **

**For Examination of Session 2012-13.**

**_______________________________________________________________________**

Code Title of paper/subject Hrs./ __Max Marks__ Week Cont. Univ. Total

Asmt. Exam.

CSM 361 Communication Skills 2 20 Theory 20 30 50

Practical 10

CSM 362 Mechanics 4 30 45 75

CSM 363 Linear Algebra 4 30 45 75

CSM 364 Linear Programming 3 20 30 50

CSM 365 Design and Analysis 3 20 30 50

Of Experiments

CSM 366 Statistics Lab-VI 4 20 30 50

(Computer Oriented

Practicals)

CSM 367 Oracle 3 20 30 50

CSM 368 Software Engineering 3 20 30 50

CSM 369 Software Lab VI 4 20 30 50

( Practicals based on

Oracle)

_____________________________________________________________________________

Total 200 300 500

_____________________________________________________________________________

**Note: The minimum pass marks in each paper is 33% in Continuous Assessment and University Examination separately subject to a minimum of 40% in aggregate. **

**BREAK-UP OF CONTINUOUS ASSESSMENT OF 20 MARKS **

**THEORY PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Seminars/Assignments/Quizzes/ 25% Marks

Class participation

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

** PRACTICAL PAPERS**

1. Two tests will be held and their average 50% Marks

will be considered for assessment.

2. Viva and Lab records 25% Marks

3. Attendance 25% Marks

Marks will be given according to

below criteria:

75% attendance & above

but less than 80% 60% Marks of allotted marks to attendance

80% attendance & above

but less than 85% 80% Marks of allotted marks to attendance

85% attendance& above 100% Marks of allotted marks to attendance

**CSM-361 : COMMUNICATION SKILLS (Theory) **

**No. of Lectures : 30 Uni. Examination - 20 **

**to be delivered Max. Marks : Int. Assessment - 20 50**

** Practical - 10 **

**Time Allowed : 2.5 hrs. Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

** The question paper will consist of two sections A and B. Each of sections A and B will have four questions from the respective sections of the syllabus. All the questions will carry equal marks.**

**Instructions for the candidates**

Candidates are required to attempt four questions in all, selecting two questions from each section A and B.

** Section –A**

Listening Skills: Process of listening, barriers to listening, note taking & note making and feedback skills. Recognizing and articulating speech sounds, mock dialogue/conversation. Participating in a group discussion. Holding a mock meeting.

** Section –B**

SpeakingSkills: Speech mechanism, articulation of sounds, phonetic transcription, components of effective talk, oral presentation, group discussion, conducting meetings etc. Types and use of audio visual aids in presentation. Preparation for participating in a mock interview for a job etc. Developing skills for conducting a meeting; attending telephonic calls.

** Recommended Books **

N Sundarajan, Business Communication, Sura College of Competition, Chennai

Asha Kaul, Business Communication, Prentice Hall of India, New Delhi

Matthukutty M Monippally, Business Communication Strategies, Tata McGraw-Hill Publishing Co., New Delhi

M V Rodriques, Effective Business Communication, Concept Publishing Company, New Delhi

**CSM-361(A) : COMMUNICATION SKILLS (Practical)**

**Time Allowed : 1 hr. Max. marks: 10**

Practical Examination will be conducted by the Examiner from the following topics:

**Topics:**

Recognizing and articulating speech sounds, mock dialogue/conversation.

Making an oral presentation, class seminars, paper reading.

Participating in a group discussion.

Holding a mock meeting.

Preparation for participating in a mock interview for a job etc.

Developing skills for conducting a meeting; attending telephonic calls.

** CSM-362 : MECHANICS**

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

** SECTION-A**

Conditions of equilibrium of Coplanar forces in three dimensions, Work, energy and power, Forces in three dimensions. Poinsot's central axis theorem. Null lines and planes. Stable and unstable equilibrium.

** SECTION-B**

Velocities and accelerations along radial and transverse directions and along tangential and normal directions.

Simple harmonic motion. Elastic strings. Curvilinear motion.

Elliptic orbits, Central orbits. Kepler's laws of motion.

Motion of a particle in three dimensions. Velocities and Accelerations in cylinderical and spherical coordinates.

**TEXT BOOK**

S.L. Loney, Statics, Mcmillan and Company, London

Surge and Griffith, Mechanics.

F. Chorlton, Tectbook of Dynamics.

** CSM-363 : LINEAR ALGEBRA**

**No. of Lectures : 55 Max. Marks : **_{}** 75**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION-A**

Spaces : Vector spaces, Examples, Linear Dependence, Linear Combinations, Bases, Dimension, Isomorphism, Calculus of subspaces, Dimension of a subspace, dual Bases, Reflexivity , Annihilators, Direct Sum, Dimension of a direct sum, Dual of a direct sum, Quotient spaces, Bilinear Forms.

**SECTION-B**

Transformations : Linear Transformations, Products and Polynomials of Transformations , Inverses , Matrices of Transformations, Invariance, Reducibility, Projections and their combinations, Projections and Invariance , Adjoints , Adjoints of projections , Change of Bases, Similarity, Range and Null space , Rand and Nullity, Eigenvalues, Multiplicity, Triangular form .

**TEXT BOOK**

Lipschutz S.: Theory and Problems of Linear Algebra, Outline Series.

2. Halmos, P.R. : Finite Dimensional Vector Spaces

Sections 1-23, 32-50 and 54 to 56 only .

**RECOMMENDED READING **

Kenneth Hoffman and Ray Kunze, : Linear Algebra

** CSM-364: LINEAR PROGRAMMING**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

** Section-A**

Linear programming problems (LPPs); Examples, Mathematical formulation, Graphical solution, Solution by Simplex method, artificial variables, Big-M method and two phase simplex method.

Duality in linear programming; Concept, Mathematical formulation, fundamental properties of duality, duality and simplex method and dual simplex method.

**Section -B**

Sensitivity Analysis : Discrete changes in the cost vector, requirement vector and Co-efficient matrix. Transportation problem ; initial basic feasible solution and Optimal solutions using MODI method (for balanced cases only), Assignment problem; solution of balanced and unbalanced assignment problems, maximization case in assignment problem.

** TEXT BOOKS**

1. Kanti Swarup, P.K. Gupta and Manmohan : ‘Operations Research’, Sultan Chand

and Sons, New Delhi, Ed. 1996.

**RECOMMENDED READING**

1. Kasana, H.S. and Kumar K.D. : Introductory Operations Research, SIE 2003

##### CSM – 365: DESIGN AND ANALYSIS OF EXPERIMENTS

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

## Section-A

Linear models, the fixed effect models, the distribution of minimum error sum of squares, and the conditional error sum of squares, tests of general linear-hypotheses.

Analysis of one way classified data under the fixed effects model. Analysis of the two way classified data with one observation per cell and multiple but equal observations in cells under the fixed effect model.Terminology in experimental designs, basic principles of design-randomization, replication and local control,

## Section - B

Completely randomized design, randomized block design and Latin square design and their advantages and disadvantages

Concept of factorial experiments, the concept of main effects and interactions in 2^{2} and 2^{3} factorial experiments and the sum of squares due to them. Yate's method of computing the sum of squares due to the main effects and interactions in 2^{2} and 2^{3} factorial designs.

**TEXT BOOKS**

1. Goon, A.M., Gupta, M.K. and Dasgupta, B. : *Fundamentals of Statistics, *Vol. II, World Press, 6th ed. (revised and enlarged), 1986).

**RECOMMENDED READING**

1. Gupta, S.C. and Kapoor, V.K**.: **Fundamentals of Applied Statistics, Sultan Chand and Sons, 2003

**CSM-366: STATISTICS LAB-VI (COMPUTER ORIENTED PRACTICALS)**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Exercises : 18

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM-364 (Linear programming) and CSM-365 (Design and analysis of experiments)

**CSM-367: ORACLE**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION - A **

**Interactive SQL : **SQL commands; Data Definition Language Commands; Data Manipulation Language Commands; The Data types a cell can hold; insertion of data into the table; Viewing of data into the tables; Deletion operations; Updating of contents of the table; Modifying the structure of the table; Renaming the table; Destroying tables; Data Constraints; Types of data constraints; Column Level Constraints; Table Level Constraints; Null value Concepts; The UNIQUE Constraint; The PRIMARY constraints; The FOREIGN key constraint; The CHECK Constraint; Viewing the User Constraints

**Viewing The Data:** Computations on Table Data; Arithmetic Operators; Logical Operators; Comparison Operators; Range Searching; Pattern Searching; ORACLE FUNCTIONS; Number Functions; Group Functions; Scalar Functions; Data Conversion Functions; Manipulating Dates in SQL; Character Functions;

**Sub Queries and Joins: **Joins; Equi Joins; Non Equi Joins; Self Joins; Outer Joins; Sub Queries; Correlated Queries; Using Set Operators:- Union , Intersect ; Minus;

**Views and Indexes: **Definition and Advantages Views; Creating and Alternating Views; Using Views; Indexed Views; Partitioned Views; Definition and Advantages of Indexes; Composite Index and Unique Indexes; Accessing Data with and without Indexes; Creating Indexes and Statistics.

**SECTION – B**

**Introduction to PL/SQL : **Advantage of PL/SQL; The Generic PL/SQL Block; The Declaration Section; The Begin Section; The End Section; The Character Set; Literals; PL/SQL Data types; Variables; Constants; Logical Comparison; Conditional Control in PL/SQL; Iterative Control;

Advanced **PL/SQL: **Types of Cursors; Implicit Cursor; Explicit Cursor; Explicit Cursor attributes; Cursor for Loop; Parameterized Cursor; Error Handling in PL/SQL; Internal Exceptions; User Defined Exceptions.

**Database Objects:** Sequences, Creating Sequences; Referencing Sequences; altering a Sequence; Dropping a Sequence, Stored Procedures and Functions:- Advantages of using a Procedure or Function; Procedure Versus Function; Creating stored Procedures and Functions; Parameters to Procedures and Functions; Deleting a stored Procedure or Function; Packages:- Components of a Package; Package Objects; Private and Public; Package state; Package Dependency; Triggers:- Use of Database Triggers; Database Triggers v/s Procedures; Database Triggers v/s Integrity Constraints;

RAISE_APPLICATION_ERROR PROCEDURE; Types of Triggers:- Row Triggers, Statement Triggers; Before v/s After Triggers; Deleting a Trigger.

**Object Types and Varrying Arrays: **User Defined Data Types, Creating a Type, Varrying Array, Creating and Using Varrying array, Nested Tables.

**TEXT BOOKS:**

SAMS Teach yourself SQL in 21 days: Techmedia Publication

PL/SQL The Programming Language of ORACLE, Ivan Byross(BPP Publication)

Oracle : PL/SQL Handbook, Palinsky (Pearson Publication)

**CSM - 368 : ****SOFTWARE ENGINEERING**

**No. of Lectures : 40 Max. Marks : **_{}** 50**

**to be delivered **

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

### INSTRUCTIONS FOR THE PAPER SETTER

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

**SECTION A**

Introduction to Software Engineering : Origin, Definition and goals of Software Engineering. Comparison with traditional Engineering Disciplines.

Software development process, Process Models : Waterfall, Spiral, Prototype. Error distribution, Effort distribution, Role of metrics and measurements.

Software Project Planning : Planning activities, Team structure ( Democratic, Chief-programmer, Hierarchical). Software Requirement Specification : Role, characteristics and components of SRS. Problem Analysis : Structuring Information, DFD and Data Dictionary.

**SECTION B**

Software Design : Design Objectives and principles, Design concepts – Abstraction, Information hiding, Concurrency, Modularity. Coupling-Cohesion criteria. Structured design methodology. Design specification, Metrics

Coding , Structured coding techniques : Data Encapsulation, Go to statement, Recursion, Single Entry Single Exit criteria. Structured programming.

Testing , Testing fundamentals : Error, Fault, Failure and Reliability, Levels of testing, Test case and Test criteria, Top-down and bottom-up approach, Test case execution and analysis, Test report.

**TEXT BOOK : **

P. Jalota, “An Integrated Approach to Software Engineering”, (Narosa Publishing House, 1992.)

**REFERENCES READINGS:**

1. R.E. Fairley, ";Software Engineering Concepts";, McGraw-Hill, 1985.

2. Ian Sommerville, “ Software Engineering “, Pearson Education, 2001

3. Boris Beizer, “Software Testing Techniques”, Second Edition, Van nostrand Reinhold, 1990.

4.. Roger. S. Pressman, “Software Engineering - A Practitioner’s Approach”, Fifth Edition, McGraw Hill, 2001

**CSM-368 : SOFTWARE LAB-VI**

**Total Practical Sessions: 25 Max. Marks : **_{}** 50**

**(each of two hours)**

**Time Allowed : 3 Hours Min. Pass : **_{}** 40% Aggregate Marks**

**Instruction for the Paper Setter and the Candidates**

The break-up of marks for the University Examination will be as under:

Lab. Record : 6

Viva-voice : 6

Development of programmes : 18

& their execution

**Lab Course:**

The exercises will be based on the syllabus of the papers CSM – 367 (Oracle).

### Похожие документы:

### The ccn sixth annual conference the technical university of berlin germany 23 - 24 march 2009 papers and posters content

*Документ*The Green Economy Initiative: A new approach to financial and environmental challenges - why multifunctional development is the way forward and the link to sustainable consumption 47### Self-assessment report of professional bachelor`s study programme „jurisprudence” of eihseba university college riga 2012 a pplication for accreditation of the study programme

*Документ*The objectives and tasks of the study programme “Jurisprudence” of EIHSEBA University College for obtaining professional bachelor degree in Law Science and qualification of a “Legal adviser” were drawn up in accordance with requirements### STANFORD BULLETIN 2011-12 Accreditation

*Документ*Stanford University is accredited by the Accrediting Commission for Senior Colleges and Universities of the Western Association of Schools and Colleges (WASC), 985 Atlantic Avenue, Suite 100, Alameda, CA 94501; (510) 748-9001.### Latvia university of agriculture institute of education and home economics study program home environment and visual art in education

*Документ*Requirements for obtaining the diploma – to acquire general courses, courses in pedagogy, psychology, research methodology, teaching methodology of household, home economics and visual art, and professional specialization courses### Eelk ui raamatukogu kataloogitud trükiste ja käsikirjade nimekiri (seisuga juuli 2012)

*Документ*2. . 1. Kirikuõpetajate Noorsootöö Kursus 16. ja 17. mail 1940 a. Tallinnas : ettekannete kavasid ja kokkuvõtteid. [Tallinn]: EELK Noorsootöö Keskus; [1940].### Schedule sunday

*Документ*Cosmic Distance Scale Dark Matter & Dark Energy Star Associations, Star Clusters - Galactic & Extra-galactic Stellar Evolution, Stellar Populations