MCA I Year Syllabus OU

SEMESTER-I

1. CS 601 Discrete Mathematics

2. MAT602 Probability & Statistics

3. CS 603 Computer Programming
   And Problem Solving

4. CS 604 Elements of Information
  Technology

5. CM 605 Modern Economic Analysis



PRACTICALS


1. CS 631 Programming Lab-I
  (C & C++ Programming)

2. CS 632 Programming Lab-II
  (EIT Lab)




********************************************

DISCRETE MATHEMATICS




UNIT -I

Fundamentals Of Logic:

      Basic connectives and Truth Tables
      Logical Equivalence
      Logical Implication
      Use of Quantifiers
      Definitions and the Proff of Theorems

Boolean Algebra:

      Switching Functions
      Logic Gates
      Don't Care Conditions

Set Theory:

      Sets and Subsets
      Set Operations and laws of set Theory
      Counting and Venn Diagrams.







UNIT-II


Proprties Of Integers:

      The Well-Ordering principle
      Recursive definitions
      The Division Algorithm
      Euclidean Algorithm
      Fundamental theorem of arithmetic.

Functions:

      Cartesian Product
      Functions
      Onto Functions
      Spetial Functions
      Pigeonhole Principle
      Composition and Inverse Functions
      Computational Complexity

Relations: 

      Partial Order Relations
      Lattices
      Equivalence Relations and Partitions








UNIT-III


Principle of Inclusion and Exclusion:

      Principles of Inclusion and Exclusion
      Generalization of principle,
      Defragments
      Rooks Polynomials
      Arrangements with Forbidden Positions

Generating Functions:

      Introductory examples
      Definitions and eamples
      Partition of Integers
      Exponential generating Function
      Summation operator









UNIT-IV


Recurrence Relations:

      First order Linear Recurrence Relation
      Second order Linear Homogeneous Recurrence Relations with constant coefficients
      Non homogeneous recurrence relations
      Devide and conquer algorithms

Algebraic Structures:

      Definitions
      Examples and elementary properties
      Homomorphism
      Isomorphism and Cyclic groups



UNIT-v


Graph Theory:

      Definitions and examples
      SubGraphs
      Complements and Graph Isomorphism
      Vertex Degree
      Planar grphs:
      Hamiltonian paths and Cycles
      Graph coloring

Trees:
  
      Definitions
      Properties and examples
      Rooted Trees
      Spaning Trees and
      Minimum Spaning Trees.











Suggested Reading

1. Raiph P.Grimaldi, "Discrete Mathematics and its Applications" Tata McGraw Hill, 6th Edition,2007


2. J.P Tremblay & R.Mnohar, "Discrete Mathematical Structures with Applications to computer science" Mc Graw Hill.1947


3. Joe L mott, A.kandal & T.p Baker, "Discrete Mathematics for computer scientists & Mathematicians", Prentice Hall N.J,1986


4. Kevin Ferland, "Discrete Mathematics", Houghton Mifflin Company,2009.
    

  

********************************************

MAT 602

PROBABILITY AND STATISTICS


UNIT -I


Data Validation and information abstraction:
        Methods of collecting data efficiently,
        Gathering information from data charting.








UNIT -II

Probability:
        Laws of probability,
        Probability distributions,
        Discrete, 
        equiprobable,
        Binomial,
        Poisson.








UNIT -III

Continuous distributions:
        Rectangular, 
        normal,
        gamma and beta.








UNIT –IV

Statistical Methods:
        Frequency distributions,
        mathematical expectation ,
        moments, 
        skew ness and kurtosis.








UNIT -V

       Correlation and regression, 
       Introduction to tests of significance, 
       u, t, x tests.














Suggested reading:







1) S.C. Gupta and V.K. Kapoor, "Fundamentals of mathematical Statistics", 1989.


2) William Mendenhall, Robert J. Beaver, Barbara M.. Beaver, "Introduction to
Probability and Statistics", Thomson Brooks/Cole, Eleventh Edition, 2003.


3) Richard A. Johnson, "Probability and Statistics for Engineers", Prentice Hall of India,
Seventh Edition, 2005.

********************************************

CS 603
COMPUTER PROGRAMMING AND PROBLEM SOLVING

The First Three Units (I, II & III) are for ‘C’ Programming and the last Two Units (IV and V) are for C++.








UNIT –I

Introduction to Computers:
        Computer Systems,
        Computing Environments,
        Computer Languages,
        Creating and Running programs, 
        System Development.
Introduction to Language:
        C programs, 
        identifiers,
        Types,
        Variables,
        Constants,
        Operators,
        Input/Output, 
Expressions:-
        precedence and associativity, 
        evaluating expressions, 
        type conversion, statements.
Selection:-
        making decisions (Conditional statements), 
        repetition (control statements).









UNIT-II

Functions:
        Designing Structured Programs, 
        Functions in C,
        User-defined functions, 
        Inter-function communication (Parameter passing chanism),
        Standard Functions, 
        Scope, 
        Recursion.
Arrays:
        Concepts,
        Using Arrays in C,
        Inter-function communication (Passing arrays to functions),
        Two Dimensional arrays,
        Multidimensional arrays, 
Application:-
        selection,
        bubble and insertion sort.
Pointers:
        Introduction,
        Pointers for Inter-function communication, 
        Pointers to P{pointers, 
        Compatibility,
        Arrays and Pointers(w.r.t arithmetic, passing arrays to function),
        memory allocation functions.
Strings:
        String concepts,
        C String Input/Output Functions,
        Array of Strings,
        String Manipulation functions.








UNIT –III

Enumerated, Structure and Union Types:
        The Type Definition (typedef), 
        Enumerated types, 
        Structure,
        Unions.Enumarations,
        Unions, and Pre-Prpocessor Directives.

Text Input/Output Files in C:
        Files,
        Streams,
        Standard Library Input/Output functions, 
        Formatting Input/Output functions, and Character Input/Output functions.

Binary Input/Output:
        Text versus Binary streams,
        Standard Library functions in files. Converting File Type.








UNIT-IV

Introduction to C++:
        Introduction and Basic elements of C++,
Functions in C++: 
        User-defined functions,
        Types of functions, 
        Parameter passing mechanisms, 
        Overloading, 
        Inline functions,
        Function Templates.








UNIT –V

Classes:
        Introductions to classes,
        Inheritance, 
        Operator Overloading,
        Dynamic Polymorphism using Virtual functions,
        Abstract Classes.
        Templates and Exceptional Handling.
  







Suggested Reading:







1) Behrouz A. Forouzan, Richard F Grilberg,”Computer Science- A Structured Approach using C”,3rd Edition ,Cengage Learning 2007.(For Units I,II,III)


2)D.S.Malik,”C++ Programming Language”, Cengage Learning 2009.(For Units IV, V)







References:







1) Harry.H. Cheng,”C/C++ for Engineers and Scientist-An Interpretive Approach”, McGraw-Hill International Edition, 2009.

2). Owen L.Astrachan,”Programming with C++”, Tata McGraw Hill, 2007.

3)Bjarne Stroustrup,”The C++ Programming Language”, 3rd Edition, Addison-Wesley,1918.

********************************************

CS 604
ELEMENTS OF INFORMATION TECHNOLOGY









UNIT -I

Digital Age: Digital basis of computers, Data /information, Hardware input, output,
memory, communication hardware, software, application software, system software,
communications, Five kinds of computers, development in communication technology,
connectivity and interactivity.
Five Generations of Programming Languages, Programming languages used today object
oriented & visual programming.
Operating Systems: Booting managing storage, resources, files tasks, common operating
systems, Windows 95/98, DOS, and Windows -NT .








UNIT -II

Processors: The CPU and main memory, Data representation, micro computer system
unit, input & output devices, keyboard, pointing devices, source data entry devices, soft
copy output, hardcopy output, more output devices, Diskettes, hard disks, optical disks,
flash memory, magnetic tape, compression and decompression.








UNIT -III

Telecommunications: Voice, Video Voice communication, the internet, the World Wide
Web, new internet technologies. Communication channels, networks, conduits of
communication, communication networks, local networks, factors affecting
communication among devices.








UNIT- IV

Files & Databases: Data storage hierarchy, file management, flies management systems,
“Database management systems, type of database organization, and features of a DBMS.
Application Software: Common features of software, word processing, spread sheet, :
software for cyber space, Internet programming, HTML, XML, & Active X.








UNIT -V

Information Systems: Organizations, departments, tasks, management Management
information systems. Six phases of system analysis and design. Software Development:
Programming as a five step procedures.
Security Issues: Threats to computers & Communication systems. Safeguarding
computers and communications.








Suggested Reading:







I) Williams B.K. Sawyer et.al., "Using information Technology', Sixth Edition, Tata
McGraw Hill, 2006.

References:

1).Aksoy & DeNardis” Introdiction to Information technology”, Cengage Learning,2006.

2) Dennis P. Curtin, Kim Folley, et.al., "Information Technology, The breaking Wave",
Tata McGraw Hill, 1998.

3) ITL Edn Solutions Ltd. "Introduction to Information Technology", Education, 2005.

********************************************

CM 605
MODERN ECONOMIC ANALYSIS








UNIT -I

The nature and scope of managerial economics, Fundamental concepts of managerial
economics.







UNIT -II

Demand analysis, concepts of demand, demand elasticities.







UNIT -III

Production and cost analysis and principles: Production function, sIngle output
isoquantum, average cost curve -Laws of returns -Laws of supply, Price determination
under perfect competition.







UNIT -IV

National income: Concepts, measurement and determinants.
Planning: The machinery for planning in India, Salient features of India's Five,Year
plans.







UNIT-V

Indian Financial Systems, Functions and role of Reserve Bank of India. Conventional
Banks and Industrial Finance. Term"lending Financial Institutions -role and functions.







Suggested reading:







I) Dhiraj Bhatacharya & Pranab Chakraborti, "Fundamentals of Business Economics", A.
H. Wheeler & Co. (P) Ltd., 1986.

2) Barry Keating, J. Holton Wilson, "Mangeral Economics", Biztantra, Second
Edition,2003.

3) Dominick Salvatore, "Manageral Economics", Thomson, Fourth Edition, 200 I.
CS 631

********************************************

PROGRAMMING LAB –I  
(C & C++ PROGRAMMING)
Instruction 3 Periods per week
Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional 25 Marks

C-Programs: 

1. Program to calculate simple formulae like area of Circle, Rectangle etc.
2. Program to find Maximum, Minimum and Sum of given set of numbers.
3. Program to find whether a number is Prime or not.
4. Program to find Sine(x) and Cosine(x) using series expansion.
5. Program to demonstrate Call-by-Reference parameter passing mechanism.
6. Program to Implement of Linear and Binary Search mechanisms.
7. Program to Implement Selection and Bubble sort.
8. Program to Implement Multiplication using pointers..
9. Program to find the number of letters, words and sentences in a given string.
10. Program to do String manipulation without using in-built library functions.
11. Programs to generate address labels using structures.
12. Program to demonstrate Sequential File Access.
13. Program to demonstrate Random File Access.

C++-Programs:

14. Recursive functions (Great common divisor, Tower of Hanoi, Fibonacci etc).
15. Classes for Bank Account, Student Information, Library Catalogue, Employee.
16. Creation of Complex, Vector classes using operator overloading.
17. Creation of Inheritance hierarchy (bank account, person)
18. Tempalte functions for Min () and Max () for finding minimum and maximum in a List.
19. Program on Class Templates.
20. Programs demonstrating virtual, pure virtual functions using abstract base class” Shape”.
21. Program to demonstrate multiple inheritances and exception handling.
22. Program demonstrating Stream and File I/O using student and employee classes.

********************************************

CS 632
PROGRAMMING LAB -II
(EIT Lab)
Instruction 3 Periods per week
Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional 25 Marks

At the end of the course, students should be able to:

I. Identify and describe the relationships and role of the components of the "Logical'
Diagram of the computer. (e.g. processor, RAM, ROM, BIOS, input, output, storage.)

2. Relate the "logical" diagram of a computer system to the "physical" system by
Identifying physical components of a computer and describing their purpose. (e.g. the
Processor, memory chips, motherboard, disk drives, and controller cards such as AGP
Board, network cards, sound card, as well as parallel and serial ports etc) "-

3. Assemble the computer which they will use and load the OS with partitions for
Windows and Linux, configure for network connection

4. Troubleshoot his/her PC from time to time

5. Install/Uninstall SW/HW on his/her PC from time to time

6. Identify and distinguish between various types of application software. by describing
and using them. (e.g. word processor, spreadsheet, database, browser, mailers etc.)

7. MS Word: Create documents with standard formatting commands, single/multi
Column, insert pictures/objects, drawings, hyperlinks, header/footer, and tables. No
Macros.

8. MS Power Point: Create presentations with preset animations, using different layouts,
Backgrounds, slide master, insert pictures/objects, drawings, hyperlinks, header/footer,
Tables

9. MS Excel: Creating worksheets with various kinds of data, making charts, conditional
Formatting, awareness of the various functions- statistical, date/time, math/trig etc, ability
to explore (help) and use these functions if need be, demonstration through some
Common functions like sum, average, standard deviation, logical and information.

10. HTML: Should be able to create their web-page (title, text, frames, and hyperlinks to
Some sites, pictures, lists, tables, fonts and color) without using any web authoring tools.

11. Distinguish between various commercially available systems by relating the cost to
Features available on each system

********************************************

SEMESTER-II

1. CS651 Accounting & Financial
  Management

2. CS652 Principles of Object
 Oriented Programming

3. CS653 Management Information
  Systems

4. CS654 Data Structures

5. CS 655 Computer Architecture


PRACTICALS
1. CS 681 Programming Lab-III
  (OOP Lab)

2. CS 682 Programming Lab-IV
  (DS Lab)





********************************************

CM 651
ACCOUNTING AND FINANCIAL MANAGEMENT

Instruction 4 Periods per week
Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks







UNIT -I

An overview of Accounting cycle -Basic concepts and conventions -Books of Account -
Terminal statement.







UNIT- II







Financial statement analysis and interpretation -Ratio analysis.







UNIT -III







Working capital -Sources and uses -Funds flow and cash flow analysis -Management of
Inventory.







UNIT- IV







Capital Budgeting -Techniques for evaluation -Cost of capital -Computation of specific
costs, and weighted average cost of capital







UNIT -V







Analysis of costs and their behavior -Cost volume -Profit analysis Variable costing and
Absorption costing.
Budgets- Flexible Budgeting -Long and Short term forecasting.














Suggested Reading:













I) James. C. Van Horne, "Fundamentals of Financial Management", Pearson edition,
Eleventh edition, 200 I.







2) Khan MY, lain PK, "Financial Management", Tata McGraw Hill, Second Edition,
1993.







3) Maheswari SN, "Management Accounting and Financial Control", Sultan Chand &Co.







4) Gupta G, Radhaswamy M, "Advanced Accountancy", Sultan Chand,& Sons.

********************************************

CS 652
PRINCIPLES OF OBJECT ORIENTED PROGRAMMING
Instruction 4 Periods per week
Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks













UNIT -I













Object Oriented System Development: Understanding Object Oriented Development,
Understanding Object Oriented Concepts, Benefits of Object Oriented Development.
Java Programming Fundamentals: Introduction, Overview. of Java, Data types, Variables and Arrays, Operators, Control Statements, Classes, Methods, Inheritance, Packages and Interfaces..













UNIT -II













Exceptional Handling, Multithreaded Programming, 110 basics, Reading console input
and output, Reading and Writing Files, Print Writer Class, String Handling.













UNIT -III













Exploring java.lang, Collections Overview, Collections Interfaces, Collection Classes,
Iterators, Random Access Interface, Maps, Comparators, Arrays, Legacy classes and
Interfaces, String Tokenizer Bit Set, Date, Calendar observable, timer.














UNIT IV













Java I/0 classes and Interfaces, Files, Stream and Byte Classes, Character Streams,
Serialization.













UNIT -V













GUI and Event Driven Programming: Applet Class, Event Handling, Delegation event
model, event classes, event listener Interfaces.
Customizing Frame Windows, GUI Programming Basics, Text Related GUI
Components, Layout Managers, Effective use of Nested panels, Other GUI components,
:. Menus and Handling Mouse Events.













Suggested reading:













I) Patrick Naughton " JA V A 2, The Complete Reference " Tata McGraw Hill 2005.


2).Richard A.Johnson,”Java Programming and Object-Oriented Application Development” Cengage Learning, India edition 2009.
References:

3 John Dean and Raymond “Introduction Programming with JAVA A problem solving approach”, McGraw Hill 2008.

4). Joe Wigglesworth and Paula McMillan, ”Java Programming: Advanced Topics” Cengage Learning .3rd Edition 2009.

********************************************

CS-653
MANAGEMENT INFORMATION SYSTEMS







UNIT-I







An Introduction to concepts of System and Organizations. Strategic uses of Information Technology, Business Process in Engineering and Information Technology.







UNIT-II







Applications of Operational Information Systems to Business, Tactical and Strategic Information System to Business.







UNIT-III







Information System Planning, approach to System Building Alternative Application Development.







UNIT-IV







Managing Knowledge Management in the Organization, Enhancing Management Decision-Making,DSS,GDSS, and ESS.







UNIT-V







Management of Information Systems. Information System security and control, Ethical issue, managing firm infrastructure and Enterprise system.







Suggested Reading:







1.
Robert Schultheis,Mary Summer,” Management Information Systems- The Manager’s view”,Tata McGraw Hill, fourth edition,2006.


2.
Kenneth C.Loudon, Jane P laudon,” Management Information Systems “, Prentice Hall, 2008.

Reference:

3.
Ralph Stair, George Reynolds” Principles of Information Systems”,Cengae Learning 2008.
4.
James A ,O’ Brien,” Management Information Systems “,Tata McGraw Hill, Sixth edition,2004.

********************************************

CS 654
DA T A STRUCTURES
Instruction 4 Periods per week
Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional 20 Marks







UNIT –I







Linear Lists: Array based representation. Linked Lists: Properties, Operations, Ordered Linked Lists, Doubly Linked Lists, Circular Linked Lists.







UNIT –II







Matrices: Special and Sparse matrices.
Arrays, matrices, special and sparse matrices.
Stacks: Operations and applications, array and linked representation of
stacks.
Queues: Operations. Array and linked representation of queues and their
Applications.







UNIT- III







Trees: Definitions and properties,
Binary trees: Binary trees traversal.(recursive and non-recursive).
Binary Search trees: Operations and Analysis.
AVL tress: operations on A VL trees.B-Trees, Operations on B-Trees.







UNIT –IV







Searching Algorithms: Sequential Search and Binary Search. Complexity analysis of searching algorithms.
Hashing: Collision resolution, open addressing, Quadratic probing, Chaining. Hashing Analysis.
Sorting Algorithms: Selection Sort, Quick Sort, Merge Sort, Heap Sort, Shell Sort. Complexity analysis of sorting algorithms.







UNIT -V







Graphs: Definitions, notations and representation. Operations on Graphs, Graph Traversals.
Applications of Graphs: Shortest Path and Minimal Spanning Tree algorithms.







Suggested Reading:







I) S Sahani, "Data Structures, Algorithms and Applications in C++" Second Edition
, University Press, 2005.
References:

2) D S Malik “Data Structures using C++", Thomson Learning, 2003.


3) Cormen Leiserson & Rivest, "Introduction to Algorithms", Prentice Hall India,
1996.

4).Mark Allen Weiss,” Data Structures and Algorithm Analysis in C++”, Third Edition, Pearson Education, 2007.
-

********************************************

CS 655
COMPUTER ARCHITECTURE













Instruction 4 Periods per week
Duration of University Examination 3 Hours
University Examination 80 Marks
Sessional. 20 Marks














UNIT -I:













Digital Logic Circuits: Digital Computers, Logic Gates, Boolean Algebra, Map
Simplification, Combinational Circuits, Flip Flops, Sequential Circuits.
Digital Components: Integrated Circuits, Decoder, Multiplexers, 'Registers, Shift
Registers, Binary counter, Memory unit.
Data Representation: Data types, Complements, Fixed and Floating Point Representation,Other binary codes and error Detection codes.







UNIT -II







Register Transfer and Micro operations:. Register Transfer language, Register transfer,
Bus and Memory Transfer, Arithmetic Micro operations, Logic Micro operations, Shift
Micro operations and Arithmetic logic shift unit.
Basic Computer Organization and Design: Instruction codes, Computer Registers,
Computer Instructions, Timing and Control, Instruction Cycles, Memory Reference
Instructions, Input, Output and Interrupts, Design of Accumulator logic.













UNIT -III













Programming the Basic Computer: Introduction, Machine Language, Assembly
Language, The Assembler, Programming Arithmetic and Logic Operations, Subroutines,
and input -output ,Programming.
Micro programmed Control: Control Memory, Address Sequencing, Micro program
Example, Design of Control Unit.













UNIT -IV







Central Processing Unit: Introduction, General Register Organization, Stack
Organization, Instruction Formats, Addressing Modes, Data Transfer and Manipulation,
Program Control, RISC.
Parallel Processing: Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline.
Computer Arithmetic: Addition and Subtraction, Multiplication algorithms, Division
Algorithms, Floating point arithmetic operations, decimal arithmetic unit, and decimal
arithmetic operations.














UNIT -V







Input -Output organization: Peripheral Devices, I/O output interface, Asynchronous datatransfer, Modes of transfer, Priority Interrupt, DMA, Input output Processor, Serial
Communication.
Memory Organization: Memory Hierarchy, Main Memory, Cache Memory.















Suggested Reading:







I) M. Morris Mano, "Computer System Architecture", Pearson Asia / Prentice Hall, Third
edition, 1993.
2) Sivarama P Dandamudi "Fundamentals of Computer Organization and Design" ,
Springer/ Dream tech Publishers, 2003.
3) William Stallings, "Computer Organization & Architecture", Pearson Education, Sixth
: Edition, 2003,

********************************************

CS 681
PROGRAMMING LAB –III
(OOP LAB)
Instruction 6 Periods per week
Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional. 25 Marks







1. A program to illustrate the concept of class with constructors, methods and
Overloading.

2. A program to illustrate the concept. of inheritance and dynamic polymorphism

3. A program to illustrate the usage of abstract class.

4. A program to illustrate multithreading.

5. A program to illustrate thread synchronization.

6. A program to illustrate Exception handling.

7. A program to illustrate User-defined Exceptions.

8.A program to illustrate User-defined Packages.

9. A program using StringTokenizer .

10. A program using Linkedlist class

11. A program using TreeSet class

12. A program using Hash Set and Iterator classes.

13. A program using Map classes.

14. A program using Enumeration and Comparator interfaces.

15. A program to illustrate the usage of File and FielnameFilter

16. A program to illustrate the usage of Byte and Character I/O streams.

17. A program to illustrate the usage of Serialization

18. Program using Date class.

19. An application involving GUI with different controls, menus and event handling.

20. A program to implement an applet.

********************************************



CS 682
PROGRAMMING LAB –IV
(DATA STRUCTURES LAB)

Instruction 6 Periods per week
Duration of University Examination 3 Hours
University Examination 50 Marks
Sessional. 25 Marks

1. Implementation of ADT Stacks. (Arrays and Linked representations)
2. Infix to postfix conversion (unparenthesized).
3. Infix to postfix conversion (parenthesized).
4. Evolution of postfix expression.
5. Implementing Parenthesis Matching Application using Stack.
6. Implementation of ADT Queues.(Linear, Circular and DeQueue)
7. Application of Queues (Super-market, Ticket reservation etc)
8. Implementation of ADT Linked Lists (Singly, doubly and Circular)
9. Implementation of Linear, binary search
10. Implementation of Hashing.
11. Implementation of Collision resolution techniques.
12. Implementation of Insertion Sort.
13. Implementation of Selection Sort.
14. Implementation of Shell sort.
15. Implementation of Quick sort.
16. Implementation of Merge sort.
17. Implementation of basic operations on Binary trees.
18. Implementation of traversals on binary trees.
19. Implementation of Binary Search trees.
20. Implementation of Heap sort.
21.. Implementation of operations of A VL Trees.
22. Implementation of Red-Black Trees.
23. Implementation of Graph Search Methods.
24. Program to find a Minimal Spanning Tree.