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**

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

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.

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).

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**

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

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.

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**

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**

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 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 -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

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

**to be delivered **

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

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

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.

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.

**REFERENCE READINGS**

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

**to be delivered **

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

**Instructions for the candidates**

Use of scientific non-programmable calculator is allowed

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 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.

** 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 candidates**

Use of scientific non-programmable calculator is allowed

**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)

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

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 candidates**

Use of scientific non-programmable calculator is allowed

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 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-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 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.

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 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).

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

### 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