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

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

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

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

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.

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.

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

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

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.

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

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

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

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

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

Use of scientific non-programmable calculator is allowed

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

Use of scientific non-programmable calculator is allowed

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.

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.

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

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

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

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

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

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,

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