MCA COURSE STRUCTURE - · PDF fileMCA COURSE STRUCTURE:: ... Algorithm / pseudo code,...

Click here to load reader

  • date post

    28-Mar-2018
  • Category

    Documents

  • view

    237
  • download

    4

Embed Size (px)

Transcript of MCA COURSE STRUCTURE - · PDF fileMCA COURSE STRUCTURE:: ... Algorithm / pseudo code,...

  • MCA COURSE STRUCTURE:: AY 2012-13

    The Course Structure for MCA -1st and 2nd semesters under autonomy system during the Academic year 2012-13 is detailed below: MCA- 1st Semester:

    MCA- 2nd Semester:

    S. No Code Subject T/P Credits

    1 HSP0 1401 Accounting & Financial Management 4 4

    2 ITP1 1401 Computer Organization 4 4

    3 ITP1 1402 Computer Programming & Data Structures 4 4

    4 ITP1 1403 Data Base Management Systems 4 4

    5 MATHP0 1401 Probability & Statistical Applications 4 4

    6

    ITP1 1204 Computer Programming & Data Structures Laboratory

    3 2

    7 ITP1 1205 Data Base Management Systems Laboratory 3 2

    Total Credits 24

    S. No Code Subject T/P Credits

    1 ITP1 1406 Advanced Data Structures 4 4

    2 MATHP0 1402 Optimization Techniques 4 4

    3 ITP1 1407 Operating Systems 4 4

    4 ITP1 1408 OOPs Through Java 4 4

    5 ITP1 1409 Software Engineering 4 4

    6

    ITP1 1210 Advanced Data Structures Laboratory 3 2

    7 ITP1 1211 OOPs Through Java Laboratory 3 2

    8 Term Paper - 2

    Total Credits 26

  • MCA- 1st Semester

    SYLLABUS

    Course Title: ACCOUNTING AND FINANCIAL MANAGEMENT Course Code: HSP0 1401 UNIT-I ACCOUNTING: (10 HOURS) Generally Accepted Accounting Principles (GAAP) & Accounting standards, Characteristics and limitations of single entry system, double entry system of accounting, introduction of basic books of accounts, users of accounting information. UNIT-II PREPARATION OF TRIAL BALANCE (8 HOURS) Final accounts - company final accounts. Role of Accountant in modern Organization. UNIT-III FINANCIAL MANAGEMENT (9 HOURS) Financial Management meaning, scope, role and objectives, time value of money over vitalization under capitalization - profit maximization - wealth maximization - EPS maximization. UNIT-IV RATIO ANALYSIS (7 HOURS) Ratio Analysis - advantages - limitations - Fund flow analysis - meaning, importance, preparation and interpretation of Funds flow and cash flow statements. UNIT-V COSTING (6 HOURS) Costing - nature and importance and basic principles. Elements of cost, Absorption costing vs. marginal costing - Financial accounting vs. cost accounting vs. management accounting. UNIT-VI MARGINAL COSTING AND BREAK-EVEN ANALYSIS (6 HOURS) Marginal costing and Break-even Analysis: nature, scope and importance - practical applications of marginal costing, limitations and importance of cost - volume, profit analysis, Short run decisions. UNIT-VII STANDARD COSTING AND BUDGETING (8 HOURS) Standard costing and budgeting: nature, scope and computation and analysis materials variance, labor variance and sales variance -cash budget, sales budget - flexible Budgets, master budgets. UNIT-VIII INTRODUCTION TO COMPUTERIZED ACCOUNTING SYSTEM (6 HOURS) Introduction to computerized accounting system: coding logic and codes, master files, transaction files, introduction documents used for data collection, processing of different files and Outputs obtained.

  • TEXT BOOKS: 1. Accounting for Management, T. Vijay Kumar, TMH. 2. A text book of accounting for management, SKM vikas,S.N. Maheswari and S.K. Maheswari, Vikas REFERENCES: 1. Financial Accounting, A. Mukherjee and M. Haneef, TMH 2. Basic Financial Accounting for Management, Ambaresh Gupta, Pearson 3. Accounts and Finance for Non Accounts, Chatterjee. D.K, Himalaya 4. Financial Analysis and Accounting, P. PremchandBabu and M.Madan Mohan, Himalaya. 5. Essential of Financial Accounting, Ashish. K and Ballacharya, PHI. 6. Guide to Financial Management, John Tannent, Viva. 7. Financial Management, M.Y.Khan, P K Jain, TMH

  • MCA- 1st Semester SYLLABUS

    Course Title: COMPUTER PROGRAMMING AND DATA STRUCTURES Course Code: ITP1 1402

    UNIT I PRILIMINARIES (12 HOURS) Algorithm / pseudo code, flowchart, program development steps, structure of C program, A Simple C program, identifiers, basic data types and sizes, Constants, variables, arithmetic, relational and logical operators, increment and decrement operators, conditional operator, bit-wise operators, assignment operators, expressions, type conversions, conditional expressions, precedence and order of evaluation. Input-output statements, statements and blocks, if and switch statements, loops- while, do-while and for statements, go to and labels, break, continue statements. UNIT II DESIGNING STRUCTURED PROGRAMS (10 HOURS) Arrays- concepts, declaration, definition, accessing elements, storing elements, arrays and functions, two dimensional and multi-dimensional arrays, applications of arrays. String manipulations. Designing structured programs, Functions, basics, parameter passing, storage classes- extern, auto, register, static, scope rules, block structure, user defined functions, standard library functions, recursive functions, header files, Preprocessor Directive. UNIT III POINTERS (6 HOURS) Pointers- concepts, initialization of pointer variables, pointers and function arguments, address arithmetic, Character pointers and functions, pointers to pointers, pointers and multidimensional arrays, dynamic memory managements functions, command line arguments. UNIT IV STRUCTURES & FILES (6 HOURS) Derived types- structures- declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to structures, self referential structures, unions, typedef, bitfields. Input and output concept of a file, text files and binary files, streams, standard I/o, Formatted I/O, file I/O operations, error handling. UNIT V LINEAR DATA STRUCTURES (6 HOURS) Introduction to data structures, Representing stacks and queues using arrays, infix to post fix conversion, postfix expression evaluation. Circular Queues. UNIT VI SEARCHING (7 HOURS) Searching Linear and binary search methods, sorting Bubble sort, selection sort, Insertion sort, Quick sort, merge sort. UNIT VII LINKED LISTS (7 HOURS) Singly linked lists, doubly linked lists, circular list, representing stacks and queues using linked lists.

  • UNIT VIII TREES & GRAPHS (7 HOURS) Trees- Binary tress, terminology, representation, traversals, graphs- terminology, representation, graph Traversals (DFS&BFS) TEXT BOOKS: 1. The C Programming Language, B.W. Kernighan, Dennis M.Ritchie,PHI/Pearson Education. 2. Data Structures Using C A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson education. REFERENCES: 1. Computer science, A structured programming approach using C, B.A. Forouzan and R.F. Gilberg, Third edition,Thomson. 2.Let us C YashvantKanetkar BPB Publications. 3. C Programming with problem solving, J.A. Jones & K. Harrow,dreamtech Press. 4. Programming in C Stephen G. Kochan, III Edition, PearsonEductaion. 5. Data Structures and Program Design in C, R.Kruse, C.L. Tondo, BP Leung, Shashi M, SecondEdition, Pearson Education.

  • MCA- 1st Semester SYLLABUS

    Course Title: COMPUTER ORGANIZATION Course Code: ITP1 1401

    UNIT-I NUMBER SYSTEMS-AND COMPUTER ARITHMETIC (8 HOURS)

    NUMBER SYSTEMS-AND COMPUTER ARITHMETIC: Numbering Systems, Binary coded decimal numbers, Number Base Conversions, Signed and unsigned Numbers , Addition and subtraction, multiplication, division, Floating point representation. Logical operations, Gray code, BCD codes, Error detecting codes, Error correcting codes, Boolean algebra, Simplification of Boolean expressions, Canonical forms for Boolean Functions, Binary Operators and Logic gates. UNIT-II GATE LEVEL MINIMIZATION & COMBINATIONAL LOGIC (12 HOURS) Gate Level Minimization: The map method, Four variable Karnaugh Map, Five variable map, Quine-McCluskey Procedure, Product of sums simplification, Dont care conditions, NAND & NOR implementation, Other two level implementations, exclusive-or function. Combinational Logic: Combinational Circuits, analysis procedure, Design procedure, Binary adder, subs tractor, Decimal adder, Binary multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, De Multiplexers. UNIT-III SYNCHRONOUS SEQUENTIAL LOGIC (7 HOURS) Synchronous Sequential Logic: Sequential Circuits, Latches, Flip-Flops, Analysis of clocked sequential Circuits, State Reduction & assignment, Design procedure. Registers, Shift registers, Counters. UNIT-IV PLOS & ASYNCHRONOUS SEQUENTIAL LOGIC (8 HOURS) Introduction, Random-access memory, Error Detection & Correction, programmable Logic array, Programmable array Logic Asynchronous Sequential Logic: Introduction, analysis procedure, Circuits with latches, design procedure, Reduction of state & flow tables, race free state assignment. UNIT-V CENTRAL PROCESSING UNIT (4 HOURS) Central Processing Unit : Learning Goals, Introduction, Operation Code Encoding and Decoding, Instruction Set and Instruction Formats, Instruction set, Instruction Format, Addressing Modes, Base Addressing, Segment Addressing, PC Relative Addressing, Indirect addressing, How to Encode Various Addressing Modes, Register Sets. UNIT-VI INPUT -OUTPUT ORGANIZATION (8 HOURS) INPUT -OUTPUT ORGANIZATION-peripheral devices, input-output interface-I/0Bus and interface modules, I/O versus Memory bus, isolated versus memory mapped I/O, Modes of transfer, priority interrupts-Daisy chaining, parallel priority, interrupt cycle, DMA- DMA control, DMA transfer, Input output processor-CPU-IOP communication. UNIT-VII (4 HOURS) MEMORY ORGANIZATION-memory hierarchy, Main memory-RAM, ROM chips, Memory address map, memory contention to CPU; Associative Memory-Hardware logic, match, read and write logic; Cache Memory-Associative mapping, Direct mapping, set associative mapping, hit and miss ratio.