MCA 1st Yr 1st Sem Syllabus for Andhra Mahila Sabha School of Informatics Hyderabad

MCA I Year I Semester

CS 601 - Discrete Mathematics
MAT 602 - Probability & Statistics
CS 603 - Computer Programming And Problem Solving
CS 604 - Elements of Information Technology
CM 605 - Modern Economic Analysis
CS 631 Programming lab - I C & C++ Programming
CS 632 Programming Lab – II: EIT lab

CS 601 - Discrete Mathematics

UNIT-I Fundamentals of Logic: Basic Connectives and Truth Tables, Logical Equivalence, Logical Implication, Use of Quantifiers, Definitions and the Proof of Theorems.

Boolean Algebra: Switching Functions, Logic gates, Don’t Care Condition. Set Theory: Sets and Subsets, Set operations and the Laws of Set theory,Counting and Venn Diagrams. UNIT-II Properties of Integers: The well-ordering principle, Recursive definitions, The Division Algorithm, Euclidean Algorithm, Fundamental theorem of arithmetic.

Functions: Cartesian Product, Functions, Onto Functions, Special 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, Derangements, Rooks Polynomial, Arrangements with Forbidden Positions.

Generating Functions: Indroductory examples, Definitions and examples, 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, Divide –and- conquer algorithms. Algebraic Structures: Definition, Examples and properties. Groups: Definition, Examples and elementary properties, Homomorphism, Isomorphism and Cyclic groups. UNIT-V Graph Theory: Definitions and examples, Subgraphs, Complements and graph isomorphism, Vertex degree, Planar graphs: Hamiltonian paths and Cycles, Graph coloring. Trees: Definitions, Properties and examples, Rooted Trees, Spanning Trees and Minimum Spanning Trees. Suggested Reading:
1. Ralph P.Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson Education, 4^{th} Edition,2003. References:
1. Kenneth H Rosen, “Discrete Mathematics and its Applications” Tata McGraw Hill, 6^{th} Edition,2007.
2. J.P.Tremblay & R.Manohar, “Discrete Mathematical Structures with Applications to Computer Science”, Mc Graw Hill,1987.
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 & Statistics

Unit – I
Data Validation and information Abstraction: Methods of collecting data efficiency, 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 exception, Moments, Skewness 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 Statictics”, 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

Unit – I Introduction to Computers: Computers Systems, Computing Environments, Computer Languages, Creating and Running programs, System Development. Introduction to C 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 mechanism), 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 Pointers, Compatibility, Arrays and Pointers (w.r.t arithmetic, passing arrays to function), memory allocation functions.
Strings: String concepts, C Strings, 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, Enumerations, Unions, Pre-Proessor Directives. Text Input/Output Files in C: Files, Streams, Standard Library Funtions in Files, Converting File Type. 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, Parameters passing mechanisms, Overloading, Inline functions, Function Templates. Unit – V Classes: Introduction to classes, Inheritance, Operator Overloading, Dynamic Polymorphism using Virtual functions, Abstract Classes.
Templates and Exceptional Handling. Suggested Reading:

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

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

References:

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

Owen L. Astrachan, “Programming with C++”, Tata Mcgraw Hill, 2007.

Bjarne Stroustup, “The C++ Programming language”, 3^{rd} Edition, Addison- Wesely, 1998.

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, files management systems, Database management systems, type of database organization, 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 levels, Management Information systems, Six phases of system analysis and design.
Software Development: Programming as a five step procedure.
Security Issues: Threats to computers & Communication Systems, Safeguarding computers and communications. Suggested Reading:
1) Williams B.K. Sawyer et.al, “Using Information Technology”, Sixth Edition, Tata McGraw Hill, 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”, Pearson 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:
1) Dhiraj Bhattacharya & Pranab Chakraborti, “Fundamentals of Business Economics”, A.H.Wheeler & Co.(P) Ltd., 1986.
2) Barry Keating, J.Holton Wilson, “Managerial Economics”, Biztantra, Second Edition, 2003.
3) Dominick Salvatore, “Managerial Economics”, Thomson, Fourth Edition, 2001.