[object XMLDocument]kk

7/22/2019 [object XMLDocument]kk

1/27

PUNJABI UNIVERSITY, PATIALA

OUTLINES OF TESTS,

SYLLABI AND COURSES OF READINGS

FOR

MCA (MASTER OF COMPUTER APPLICATIONS)

(SEMESTER SYSTEM)

1st Year ( I & II Semester)

2011-12 & 2012-13 Sessions


2/27

ANNEXURE-I

SYLLABUS

OUTLINES OF PAPERS AND TESTS

M.C.A. (MASTER OF COMPUTER APPLICATIONS)

FIRST YEAR-FIRST SEMESTER EXAMINATIONS

YEAR 2011-12 & 2012-13 Session

CODE NO. TITLE OF PAPER MAXIMUM MARKS

CONTINUOUS

ASSESSMENT

UNIVERSITY

EXAMINATION

TOTAL

MARKS

TIME TOTAL

ALLOWED

MCA-111

MathematicalFoundations

of Computer Science50 50 100 3 Hrs.

MCA-112Introduction to InformationTechnology

50 50 100 3 Hrs

MCA-113Computer ProgrammingUsing C

50 50 100 3 Hrs.

MCA-114Computer Organisation andArchitecture

50 50 100 3 Hrs.

MCA-115Principles & Practices ofManagement

50 50 100 3 Hrs.

MCA-116 Programming Lab-I

(Programming in C)60 40 100 3 Hrs.

Total 310 290 600


3/27

CONTINUOUS ASSESSMENT (THEORY PAPERS)

1. Two or three tests out of 60% of the marks allotted for ContinuousAssessment.

which minimum two wil l be

considered for assessment.

2. Seminars/Assignments/Quizzes 30% of the marks allotted for ContinuousAssessment.

3. Attendance, class participation and

behaviour 10% of the marks allotted for ContinuousAssessment.

ANNEXURE-I

SYLLABUS

OUTLINES OF PAPERS AND TESTS

M.C.A. (MASTER OF COMPUTER APPLICATIONS)

FIRST YEAR-SECOND SEMESTER EXAMINATIONS

YEAR 2011-12 & 2012-13 Session

CODENO.

TITLE OF PAPER MAXIMUM MARKS

CONTINUOUS

ASSESSMENT

UNIVERSITY

EXAMINATION

TOTAL

MARKS

TIMETOTAL

ALLOWED

MCA-121Information System Designand Implementation

50 50 100 3 Hrs.

MCA-122Object OrientedProgramming Using C++

50 50 100 3 Hrs

MCA-123

Data & File

Structures 50 50 100 3 Hrs.

MCA-124 Systems Software 50 50 100 3 Hrs.

MCA-125Computer OrientedStatistical Methods

50 50 100 3 Hrs.


4/27

MCA-126Programming Lab-II

(Data Structure and C++)60 40 100 3 Hrs.

Total 310 290 600

CONTINUOUS ASSESSMENT (THEORY PAPERS)

1. Two or three tests out of 60% of the marks allotted for ContinuousAssessment.

which minimum two wil l be

considered for assessment.

2. Seminars/Assignments/Quizzes 30% of the marks allotted for ContinuousAssessment.

3. Attendance, class participation and

behaviour 10% of the marks allotted for Continuous

Assessment.

L T P C

3 1 0 4

MCA-111: Mathematical Foundations of Computer Science

Maximum Marks: 50Maximum Time: 3 Hrs.

Minimum Pass Marks: 40%Lectures to be delivered: 45-55

A) Instructions for paper-setter

The question 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 20% marks each.Section E will have 5-10 short answer type questions which will cover the entire syllabusuniformly and will carry 20% marks in all.


5/27

B) Instructions for candidates

1. Candidates are required to attempt one question each from sections A, B, C and D of thequestion paper and the entire section E.

2. Use of non-programmable scientific calculator is allowed.

SECTION A

Logic: Propositions, Implications, Precedence of Logical Operators, translating EnglishSentences, System Specifications. Propositional Equivalences, Predicates and Quantifiers,Nested Quantifiers, Order of Quantifiers, Sets, Power Set, Set Operations, Functions, One-to-OneFunctions and Onto Functions, Inverse and Composition of Functions, Floor Function, CeilingFunction.

SECTION B

Algorithms, Searching Algorithms, Sorting, Growth of Functions, Big-O Notation, Big-Omega andBig-Theta Notation, Complexity of Algorithms, Mathematical Induction, The Basic of counting,The Pigeonhole Principle.

SECTION C

Recurrence Relations, solving recurrence relations, Divide and Conquer Algorithms andRecurrence Relations, Generating functions for sorting recurrence relations, Inclusion-Exclusion.

Relations and their properties, n-any relations and their applications, representing relations,closure of relation, equivalence relations, partial ordering.

SECTION D

Graphs: Introduction, terminology, Representing Graphs and Graph Isomorphism, Connectivity,Euler and Hamiltonian Paths, Shortest Path Problems, Planar Graphs.

Books:

1. Rosen, K.H: Discrete Mathematics and Its Applications 5th Edition, TMH Publications.


6/27

References:

1. Discrete and Combinational Mathematics, Ralph P. Grimaldi 4th Edition, PearsonEducation.

2. Elements of Discrete Mathematics, C. L. Luie, TMH Publications.3. Discrete Mathematics Fiftt Ediion, Richard Johnson Baugh Pearson Education.4. Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay &

R. P. Manohar, 9th Editiion, MGH Publications.5. Discrete Mathematical Stuctures B. Kotman, R.C. Busbay, S.Ross, PHI.

L T P C

3 1 0 4

MCA - 112: Introduction to Information Technology




The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D willhave two questions from the respective sections of the syllabus and will carry 20% marks each.Section E will have 5-10 short answer type questions which will cover the entire syllabusuniformly and will carry 20% marks in all.




SECTION A

Computer Fundamentals: Block structure of a computer, characteristics of computers, problemsolving with computers, generations of computers, classification of computers on the basis ofcapacity, purpose, generation, Introduction to Number System


7/27

SECTION B

Memory types: Magnetic core, RAM, ROM, Secondary, Cache, Bubble Memory.

Input and Output Units : functional characteristics ; Overview of storage devices : floppy disk,

hard disk, compact disk, tape ; Printers : Impact, non-impact. Graphical I/O devices: Light pen,joystick, Mouse,Touch screen; OCR, OMR, MICR

SECTION C

Computer languages: Machine language, assembly language, higher level language, 4GL.Introduction to Compiler, Interpreter, Assembler, Assembling, System Software, Application

Software.

Operating system: Batch, multi-programming, time sharing, network operating system, on-lineand real time operating system, Distributed operating system, multi-processor, Multi-tasking.

SECTION D

Computer Network and Communication: Network types, network topologies, network

communication devices, physical communication media.

Internet and its Applications: E-mail, TELNET, FTP, World Wide Web, Internet chatting; Intranet,Extranet, Gopher, Mosaic, WAIS

Introduction to E-Commerce: Meaning, its advantages & limitations, Types of E-CommerceApplications

Text

1 Petrick Norton, Fundamentals of Computers

References:

D. H. Sanders, Computers Today, McGraw Hill, 1988.

Satish Jain , " Information Technology", BPB 1999.David Cyganski, John A. Orr, Information Technology Inside and Outside PearsonEducation 2002.V. Rajaraman, Fundamentals of Computers (2nd edition), Prentice Hall of India, NewDelhi, 1996.


8/27

B. Ram, Computer Fundamentals, Wiley, 1997.Chetan Srivastva, "Fundamentals of Information Technology, Kalayani Publishers, 2003.

L T P C

3 1 0 4

MCA-113: Computer Programming Using C








SECTION A

Programming process: Problem definition, Algorithms, Flow Charts, C Character set, Identifiersand keywords, Data types, Declarations, Expressions, Statements and Symbolic Constants.

Input-Output: getchar, putchar, scanf, printf, gets, puts function

Pre processor commands: #include, #define C Program structure

Operators and their procedure: Arithmetic, Unary, Logical and relational operators.

Coding Standards: Inline documentation, indentation of code.

Naming conventions: Variables, global variables, functions, structures.

Debugging: Tracking defects, debugging by code inspection, debugging by logs, debuggingusing step-by-step execution, using break points.


9/27

SECTION B

Control statements: Branching, looping using for, while and do-while Statements, Nested controlstructures, switch, break, continue statements, Comma Operators. Functions: Definition, Call,prototypes, and passing arguments to functions. Program structure: Storage classes, automatic,external and static variables, Recursion vs Iteration.

SECTION C

Arrays: Definition, Access of Elements, initialization, passing array elements as arguments andpassing arrays as arguments; Multidimensional arrays, strings. Pointers: address anddereferencing operators, declaration, assignment, initialization, arithmetic, precedence of

address and dereferencing operators, pointer comparison, conversion. Passing pointers tofunctions. Arrays as functions arguments, pointer arrays and pointers to pointers. Dynamicmemory management .

SECTION D

Structure: Variable, initialization, accessing members, assignment, size of structure, scope of astructure, nesting, pointer to structures, scope of a structure type definition, structure as functionarguments, function values: Arrays of structures, structures containing arrays, self referentialstructures. Bitwise logical operators: AND, OR, complement precedence and Associating bitwiseshift operators, File processing: opening and closing, data files, creation, processing &unformatted data files, random file access.

Text Book:

1. Byron Gotfried: Programming with C, Second Edition, Schaums outline Series, TMHEdition.

References:

Brain W. Kernigham and Dennis M. Richie: The C Programming Language, 2nd Ed., PHI.Ashok Kamthane: Programming with ANSI and Turbo C, Pearson Education.E. Balagurusamy: Programming in ANSI C, 4th Edition TMHCampus Connect : Foundation Programming Vol:1, InfosysH. H. Tanz & T. B. D Orazio: C Programming for Engineers & Computer Science McGrawHill International editions.Infosys Campus Connect Foundation Program Volume: 1 3, Education & ResearchDepartment, Infosys Technologies Ltd, Bangalore.

L T P C

3 1 0 4


10/27

MCA-114: Computer Organisation and Architecture


Minimum Pass Marks: 40%

Lectures to be delivered: 45-55






SECTION A

Number System: Number conversions, Arithmetical operations, Concepts about bits, bytes andword.

Representation of Information: Integer and floating point representation, Complement schemes,Character codes (ASCII, EBCDIC, BCD, 8421, 2421, Excess-3, Grey, Hamming, Parity). BasicBuilding blocks : Boolean Algebra, K-maps.

SECTION B

Combinational logic design: half-adder/subtractor, full adder/subtractor, parallel adder.

Sequential circuits- concept, flip-flops (D, RS, JK, JK-Master-Slave, T),counters (Ripple,Asynchronous, Synchronous, Decade, Mod-5, Mod-3),

Computer organisation : Structure of Computer, Instruction codes, Instruction formats, Instructioncycle, Addressing modes

SECTION C


11/27

Register Transfer Language, Arithmetic, Logic and Shift micro-operations,

Control Memory: Design of control unit, Micro program Sequencer, Micro programmed andHardwired control unit(overview only), Features of RISC and CISC.

SECTION D

Memory organisation : memory hierarchy, organisation and types.

I/O organisation : I/O interface, Modes of data transfer : Programmed - initiated, Interrupt initiated,DMA, I/O controllers

Architecture of 8085, Assembly language programming of 8085 machine.

Text

Will iam Stallings, " Computer Organisation and Architecture", 6th edition, PearsonEducation , 2002.A.S.Tannenbaum, Structured Computer Organisation, Prentice- Hall of India, 1999

References:

1 M.M. Mano, Computer System Architecture, Third Edition , Prentice-Hall of India, 2002.

2 Vincent.P.Heuring, Harry.F.Jordan, Computer Systems Design and Architecture,Addison Wesley, 2000.

Nicholas Carter, Schaums Outlines Computer Architecture, Tata McGraw Hill, 2002.Infosys Campus Connect Foundation Program Volume:1 3, Education & Research

Department, Infosys Technologies Ltd , Bangalore.

L T P C

3 1 0 4

MCA-115: Principles & Practices of Management

Maximum Marks: 50

Maximum Time: 3 Hrs.



12/27






SECTION A

Definition of Management, its nature and purpose, Management: Science or art, Functions ofmanagers, Levels of management, Fayols general principles of management.

Management and society: social responsibil ity of managers.

Planning: nature and purpose of planning, Planning versus forecasting, types of plans, steps inplanning, the planning process.

Decision making: characteristics and importance, programmed and non-programmed decisions,Steps in the process of decision making.

SECTION B

Organizing: the nature and purpose of organizing, formal and informal organization.

Organizational levels and span of management, factors determining an effective span, thestructure and process of organizing.

Departmentation: need and importance of departmentation, Bases of departmentation.

Human resource management and selection: definition of staffing, the systems approach to HRM,Recruitment and selection: sources of manpower supply, Selection process, techniques andinstruments.

SECTION C


13/27

Motivation and motivators, types of motivation. Theories of motivation: Maslows hierarchy ofneeds theory, Herzbergs Hygiene theory, McClellands needs theory, the Vrooms Valence-expectancy theory, the carrot and the stick approach.

Leadership: definition and characteristics, Leadership theories: trait approaches to leadership,Behavioural approach, situational or contingency approach to leadership. Leadership styles.

Communication: meaning, characteristics and importance, Elements of communication, thecommunication process, Types of communication, barriers and breakdowns in communication,making communication effective.

SECTION D

The system and process of controlling: characteristics and importance of control, the basic

control process, requirements for an effective control system.

Budgeting as a technique of Control: purpose and types of budget, Budgetary control: objectives,essentials and advantages. Limitations of budgetary control.

Text Book :

1. L. M. Prasad, Principles & Practice of Management. Sultan Chand & Sons.

References :

1. Harold Koontz, Heinz Weihrich, Essentials of Management, Tata McGraw-HillPublishing.

2. Infosys Campus Connect Foundation Program Volume:1 3, Education & Research

Department, Infosys Technologies Ltd , Bangalore.

L T P C

0 0 6 6

MCA-116: Programming Lab-I (Programming in C)

Maximum Marks: 100*Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Practical unitsto be conducted : 45-55


14/27

This laboratory course will mainly comprise of exercises on what is learnt under the paper:

MCA-113: Computer Programming using C

The following categories of programs are to be developed:

1. Programs involving sequential control flow (Simple Interest, Area of Circles etc.)2. Programs involving conditional control flow (Greatest of 3 numbers, quadratic equation etc.)3. Program involving Iterative control flow (Sum of any n numbers, prime numbers, fib, Series,

etc.)4. Programs involving arrays, structures, unions and pointes (Linear and binary search,

sorting, bubble, etc.).5. File manipulation techniques (opening and closing of files, reading and writing text and

binary files.)

*The splitting of marks is as under

Maximum Marks for Continuous Assessment : 60Maximum Marks for University Examination: 40

L T P C

3 1 0 4

MCA-121: Information System Design and Implementation






1. Candidates are required to attempt one question each from sections A, B, C and D of the


15/27

question paper and the entire section E.


SECTION A

Introduction to Systems and Basic Systems Concepts, Types of Systems, Information Systems:Definition & Characteristics, Types of Information, Role of Information in Decision - Making,Types of an Information system: Operations Support Systems & Management Support Systems,Comparison of EDP/MIS/DSS.

SECTION B

An overview of Management Information System: Definition & Characteristics, Components ofMIS, Frame Work for Understanding MIS: Robert Anthonys Hierarchy of Management Activity,Information requirements & Levels of Management, Simons Model of decision- Making,Structured Vs Un-structured decisions, Formal Vs. Informal systems.

SECTION C

Development of MIS: System development stages; System development approaches: waterfallmodel, prototyping, iterative enhancement model, Spiral model.

Analysis & design of MIS: requirement determination, strategies for requirement determination,structured analysis tools, system design, implementation and maintenance of information system.

SECTION D

Functional MIS: A Study of Marketing, Personnel, Financial and Production MIS, Inputtransaction documents, applications and reports of functional information systems.

Text Book :

1. W. S. Jawadekar, Management Information Systems, Tata McGraw Hill, Publishing.


16/27

References:

1. A. Ziya Aktas, Structured Analysis & Design of Information System, PHI.

2. V. Rajaraman, Analysis & Design of Information Systems, PHI.

3. J. Kanter, Management /information Systems, PHI.

4. Gordon B. Davis & M.H. Olson, Management Information Systems: Conceptual Foundation,

structure & Development.

5. Robert G. Murdick & Joel E. Ross & James R. Claggett, Information Systems for ModernManagement PHI.

6. D.P. Goyal, Management Information Systems: Managerial perspectives, MacmillanIndia Ltd.

7. Infosys Campus Connect Foundation Program Volume:1 3, Education & ResearchDepartment, Infosys Technologies Ltd, Bangalore.

L T P C

3 1 0 4

MCA-122: Object Oriented Programming Using C++




The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D willhave two questions from the respective sections of the syllabus and will carry 20% marks each.Section E will have 5-10 short answer type questions which will cover the entire syllabus

uniformly and will carry 20% marks in all.



17/27



SECTION A

Evolution of OOP: Procedure Oriented Programming, OOP Paradigm, Advantages anddisadvantages 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, Operatorprecedence and associativity.

Type conversion, Variable declaration, expressions, statements, manipulators

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

SECTION B

Storage Classes: Automatic, Static, Extern, Register.

Arrays, Arrays as Character Strings, Structures, Unions, Bit fields, Enumerations and Userdefined types.

Pointers: Pointer Operations, Pointer Arithmetic, Pointers and Arrays, Multiple indirections,Pointer to functions. Functions: Prototyping, Definition and Call, Scope Rules. ParameterPassing: 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, #elif, #endif, #ifdef, #ifndef, #undef,

Type casting: static_cast, const_cast, dynamic_cast, reinterpret_cast

SECTION C

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

Ob ects: Ob ect as function ar uments, arra of ob ects, functions returnin ob ects, Const


18/27

member functions.

Static data members and Static member functions.

Friend functions and Friend classes

Constructors: properties, types of constructors (Default, parameterized and copy), Dynamicconstructors, multiple constructors in classes.

Destructors: Properties, Virtual destructors. Destroying objects. Rules for constructors anddestructors.

Array of objects. Dynamic memory allocation using new and delete operators, Nested andcontainer classes

Scopes: Local, Global, Namespace and Class

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

Types of inheritance: Single, Multiple, Multilevel and Hybrid. Types of base classes: Direct,Indirect, Virtual, Abstract. Code Reusability.

SECTION D

Polymorphism: Methods of achieving polymorphic behavior.

Operator overloading: overloading binary operator, overloading unary operators, rules for

operator overloading, operator overloading using friend function. Function overloading: earlybinding,

Polymorphism with pointers, virtual functions, late binding, pure virtual functions and abstractbase class

Difference between function overloading, redefining, and overriding.

Templates: Generic Functions and Generic Classes, Overloading of template functions.

Exception Handling catching class types, handling derived class exceptions, catching

exceptions, restricting exception, rethrowing exceptions, terminate and unexpected, uncaughtexceptions.

Files and streams: Classes for file stream operations, opening and closing of files, stream statemember functions, binary file operations, structures and file operations, classes and fileoperations, I/O with multiple objects, error handling, sequential and random access fileprocessing.

STL: Containers, Algorithms, Iterators, RTTI

Text Book:

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


19/27

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

References:

Robert Lafore, Object Oriented Programming in C++, Galgotia Publications, 1994.Bjarne Strautrup, The C++ Programming Language, Addition- Wesley Publication Co.,2001.Stanley B. Lippman, Josee Lajoie, C++ Primer, Pearson Education, 2002E. Balagurusamy, Object Oriented Programming with C++, Tata McGraw-Hil l, 2001Infosys Campus Connect Foundation Program Volume:1 3, Education & ResearchDepartment, Infosys Technologies Ltd , Bangalore.

L T P C

3 1 0 4

MCA-123: Data and File Structures








SECTION A


20/27

Basic Concepts and Notations, Data Structures and Data Structure Operations, MathematicalNotation and Functions, Algorithmic Complexity and Time Space Tradeoff.

Basic Data Structures and Operations on them: Arrays, Stacks and Queues and TheirApplications, Linked and Sequential Representation. Linked List, Representation of Linked List,Multi-Linked Structures.

SECTION B

Trees-Definitions and Basic Concepts, Linked Tree Representation, Representations inContiguous Storage, Binary Trees, Binary Tree Traversal, Searching, Insertion and Deletion inBinary Trees, Binary Search Tree, Heap and Heap Sort Algorithm, AVL Trees.

Graphs and Their Application, Sequential and Linked Representation of Graph-AdjacencyMatrix, Operations on Graph, Traversing a Graph, Dijkstras Algorithm for Shortest Distance, DFSand BFS, Minimal Spanning Tree.

SECTION C

Searching and Sorting, use of Various Data Structures for Searching and Sorting, Linear andBinary Search, Bubble Sort, Insertion Sort, Shell Sort, Selection Sort, Merge Sort, Radix Sort,Quick Sort.

Hashing: Introduction to hash table, hash function, resolving collision by chaining and openaddressing, deleting items from a hash table.

SECTION D

File Organization: Sequential File Organisation : Processing Sequential files, Operations onsequential files.

Direct File Organisation : Processing of Direct Files, Operations on sequential files.

Indexed Sequential Organisation: Processing of Indexed Sequential files,

Multi Level Indexing & B-Trees, Inverted Files.

File Sorting Techniques: Sorting in External Memory, Merging Files

Text Book:

A. Tanenbaum, Y. Lanhgsam and A.J. Augenstein, "Data Structures Using C", PrenticeHall of India, 1990Mary E. S. Loomis, "Data Management and File Structures", PHI, 1995.


21/27

References:

1. Seymour Lipschultz, Theory and Practice of Data Structures", McGraw-Hill, 1988.

2. E. Horowitz and S. Sahni, Data Structures with Pascal", Galgotia, 3rd Edition,1991.

3. Robert Sedgewick, Algorithms in C, Pearson Education.

4. M. J. Folk, B. Zoellick, G Riccardi, File Structures, Pearson Education.

5. Infosys Campus Connect Foundation Program Volume:1 3, Education & ResearchDepartment, Infosys Technologies Ltd , Bangalore.

L T P C

3 1 0 4

MCA-124: Systems Software




The question 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 20% marks each.Section E will have 5-10 short answer type questions which will cover the entire syllabusuniformly and will carry 20% marks in all.





22/27

SECTION A

Introduction to systems software: Definition, features of system programming, systemprogramming vs. application programming, type of system programmes.

Machine Architecture: Organization of simple computer, Instruction types, addressing modes.

Machine Language: Features of machine language, Machine instruction format of 8086/88 family.

Assembly Language: Features, various types of statements, data types of 8086/88

SECTION B

Assembler: general design procedure of an assembler, two-pass assembler, single pass

assembler.

Macro processor: macro instructions, features of macro facility, implementation, one pass macropre-processor, two pass macro pre-processor, macro assemblers.

SECTION C

Compilers: Overview of compilation process, lexical analysis, syntax analysis, semantic analysis,

intermediate code generation, code optimisation techniques, Error Processing.

Loaders and Linkers: Various Loading and Linking Schemes, Design of Assemble and Goloading scheme, Absolute Loader, Re-Locatable loaders, dynamic loading and linking concepts.

Introduction to device drivers, functions and structure of text editor.

SECTION D

Operating System: Introduction, various types of operating system - batch processing,Multiprogramming, Multitasking, time sharing, parallel, distributed and PC operating system.

Resource Managers View of Operating System: Components of Operating System, Users Viewof Operating System: Operating System Services, Operating System Structure Simple structure,Layered Approach, Micro kernel approach.

References:

1. John.J.Donovan, "Systems programming", McGraw-Hill, 1991

2.. Aho, A.V., Ullman Sethi R., I.D.: Com ilers: Princi les, Techni ues and Tools, Addison-


23/27

Wesley Publishing Co., 1999.

3.. D.M. Dhamdhere, "Systems Programming and Operating System", Tata McGraww Hil l , 2002.

4. Infosys Campus Connect Foundation Program Volume:1 3, Education & ResearchDepartment, Infosys Technologies Ltd , Bangalore.

L T P C

3 1 0 4

MCA-125: Computer Oriented Statistical Methods








24/27


SECTION A

INTRODUCTION TO STATISTICS: Meaning, scope, collection, classification of data, frequencydistributions,

THE MEAN, MEDIAN, MODE AND OTHER MEASURES OF CENTRAL TENDENCY: Indexor subscript notation. Summation notation. Averages and Measures of central tendency. Thearithmetic mean. Weighted arithmetic mean. Properties of the arithmetic mean. Arithmetic, meancomputed from grouped data. The median. The mode. Empirical relation between mean, medianand mode. The geometric mean. The harmonic mean. Relation between arithmetic, Geometric,and harmonic means. The root mean square (r m s) Quartiles, deciles and percentiles.

THE STANDARD DEVIATION AND OTHER MEASURES OF DISPERSION.: Dispersion orvariation. The range. The mean deviation or average deviation. The semi-inter-quartile range orquartile deviation. The 10-90 percentile range. The standard deviation. The variance. Shortmethods for computing the standard deviation. Properties of the standard deviation. Charlier'scheck. Sheppard's correction for variance. Empirical relations between measures of dispersion.Absolute and relative dispersion. Coefficient of variation. Standardized variable, standard scores.

MOMENTS, SKEWNESS AND KURTOSIS: Moments. Moments for grouped data. Relationbetween moments. Computation of moments for grouped data. Charlier's check and Sheppard's

corrections. Moments in dimensionless form Skew ness. Kurtosis. Population moments,skewness and kurtosis.

SECTION B

ELEMENTARY PROBABILITY THEORY: Classical definition of probability. Relativefrequency definition of probability. Conditional probability. Independent and dependent events.

Mutually exclusive events. Discrete probability distributions. Continuous probability distributions.Mathematical expectation. Relation between population and sample mean and variance.Combinatorial analysis. Fundamental principle. Factorial a Permutations. Combinations.Stirling's approximation to n! Relation of probabili ty to point set theory.

THE BINOMIAL, NORMAL AND POISSON DISTRIBUTIONS: The binomial distribution. Someproperties of the binomial distribution. The normal distribution. Some properties of the normaldistribution. Relation between binomial and normal distributions. The Poisson distribution. Someproperties of the Poisson distribution. Relation Between binomial and Poisson distributions. The

multinomial distribution. Fitting theoretical distributions to sample frequency distributions.

ELEMENTARY SAMPLING THEORY: Sampling theory. Random samples. Random numbers.Sampling with and without replacement. Sampling distributions. Sampling of means. Sampling


25/27


26/27

MULTIPLE AND PARTIAL CORRELATION: Multiple Correlation, Subscript Notation,Regression Equation, Regression Plane, Normal Equations for the Least Square RegressionPlane, Regression Planes and Correlation Coefficients, Standard Error of Estimate, TheCoefficient of Multiple Correlation, Change of Dependent Variable, Generalizations to More thanThree Variables, Partial Correlation, Relationships Between Multiple and Partial CorrelationCoefficients, Non-Linear Regression.

Text Book:

1. Murray R. Speigel, R. W. Boxer, "Theory and Problems of Statistics in SI units",Schaums' outline Series, McGraw-Hill Book Company.

2. S.C. Gupta, Fundamentals of Statistics

L T P C

0 0 6 6

MCA-126: Programming Lab-II (Data Structures & C++)

Maximum Marks: 100*Maximum Time: 3 Hrs.

Minimum Pass Marks: 40% Practical unitsto be conducted : 45-55

This laboratory course will mainly comprise of exercises on what is learnt under the papers:

MCA-122 (Object Oriented Programming in C++) &

MCA-123 (Data & File Structures)

The following categories of programs are to be developed in C++:

Programs for implementing stack along with applications such as infix to postfix conversion,Evaluation of postfix and infix expressions, matching braces etc.Programs for implementing Queues and Circular queues.Pro rams for im lementin linked list, sorted linked lists with a lications such as s arse


27/27

matrices using linked lists.Programs for implementing binary search trees.Programs for implementing sorting (quick sort, merge sort, radix sort, heap sort).Program for implementing hashing techniques (chaining and open addressing for collisionresolution).

*The splitting of marks is as under

Maximum Marks for Continuous Assessment : 60Maximum Marks for University Examination: 40

[object XMLDocument]kk

Documents

Transcript of [object XMLDocument]kk