integral university, lucknow department of computer application … · 5. maheshwari and maheshwari...

Integral University, Lucknow

Department of Computer Application STUDY & EVALUATION SCHEME

Choice Based Credit System

Master of Computer Application (MCA)

w.e.f. Session 2016-17

Year I, Semester II

S. No.

Course

Category

Subject

Code Name of the Subject

Periods

Evaluation Scheme

Subject

Total Sessional (CA)

End

Sem.

Exam

L T P C CT TA Total ESE

1. Foundation BM434

Accounting and

Financial

Management

3 1 0 4 25 15 40 60 100

2. Core CA407 Data and File

Structure Using C 3 1 0 4 25 15 40 60 100

3. Core CA408 Unix and Shell

Programming 3 1 0 4 25 15 40 60 100

4. Elective - I 3 1 0 4 25 15 40 60 100

5. Elective - II 3 1 0 4 25 15 40 60 100

6. Core CA413 Computer

Architecture and

Microprocessor

3 1 0 4 25 15 40 60 100

7. Core CA414 Data Structure Lab 0 0 3 1 30 30 60 40 100

8. Core CA415 Unix / Linux Lab 0 0 3 1 30 30 60 40 100

9. Core CA416 Microprocessor Lab 0 0 2 1 30 30 60 40 100

Total 18 6 8 27 900

Elective – I

CA409 Introduction to Operation Research

CA410 Simulation and Modelling

Elective – II

CA411 Information System Analysis and Design

CA412 E-Commerce

L - Lecture T – Tutorial P – Practical C – Credit CT – Class Test TA – Teacher Assessment

Sessional Total (CA) = Class Test + Teacher Assessment

Subject Total = Sessional Total (CA) + End Semester Examination (ESE)

BM434 ACCOUNTING AND FINANCIAL MANAGEMENT


PREREQUISITE: NONE COREQUISITE: NONE

UNIT-I

Accounting: Principles, Concepts and Conventions of Accounting, Double Entry System of

Accounting. Basic Books of Accounts, Journals, Ledgers and Trial Balance, Trading Account,

Profit and Loss Account and Balance Sheet, Final Accounts with and without Adjustments. [8]

UNIT-II

Financial Management: Meaning, Scope, Role and Objectives of Financial Management, Time

Value of Money, Fundamentals of Capital Budgeting, Financing Decision, Dividend Decision

and Working Capital Management. [8]

UNIT-III

Financial Analysis and Planning: Ratio Analysis: Meaning, Advantage, Limitation, Types and

Uses.

Funds Flow Statements: Preparations and Interpretations, Working Capital Cycle.

Budgets and Budgetary Controls: Importance, Preparations and Use of Master Budget and other

Functional Budgets. [8]

UNIT-IV

Costing: Nature, Importance and Basic Principles.

Marginal Costing: Scope and Importance, Break Even Analysis-Uses and Limitations,

Applications of Marginal Costing.

Standard Costing: Basic Concepts, Scope and Importance, Variance Analysis -Uses and

Importance. [8]

UNIT-V

Introduction to Computerized Accounting: Accounting System, Application of CAS, Use of

Tally, M.S. Excel and Other Software. Introduction to Integrated Software System Oracle-

Financials, ERP. [8]

REFERENCES:

1. Shukla, Grewal and Gupta, "Advanced Accounts-parts I, II", S Chand.

2. Jambalvo, (2000), "Managerial Accounting", John Wiley & Sons USA.

3. Khan & Jain, (2001), “Management Accounting”, Tata McGraw Hill 3rd

edition

4. Pandey, I.M., (1977) "Management Accounting", Tata McGraw Hill.

5. Maheshwari and Maheshwari , "Financial Accounting", Vikas Publishing House Pvt Ltd.

6. Atkinson Banker Kaplan Young, (2000), “Advance Management Accounting" Prentice Hall

of India, New Delhi.

L T P

3 1 0

CA407 DATA AND FILE STRUCTURE USING C


PREREQUISITE: NONE COREQUISITE: CA414

UNIT-I

Introduction: Basic Terminology, Elementary Data Organization, Data Structure Operations,

Algorithm Complexity and Time-Space Trade-Off

Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays,

Address Calculation, Application of Arrays, Character String in C, Character String Operation,

Array as Parameters, Sparse Matrices and Vector.

Linked List: Introduction to Singly Linked List, Representation and Implementation of Singly

Linked Lists, Types of Linked List, Circular and Doubly List, Operations of Linked List:

Insertion, Deletion, Searching and Traversing of Linked List, Application of Linked List:

Polynomial Representation and Addition, Generalized Linked List. [8]

UNIT-II

Queues: Array and Linked Representation and Implementation of Queues, Operations on Queue:

Create, Add, Delete, Full and Empty, Circular Queue, De-Queue and Priority Queue.

Stacks: Array Representation and Implementation of Stack, Operations on Stacks: PUSH and

POP, Linked Representation of Stack, Operations associated with Stacks, Application of Stack,

Conversion of Infix to Prefix and Postfix Expressions, Evaluation of Postfix Expression using

Stack.

Recursion: Definition and Processes, Example of Recursion, Tower of Hanoi Problem,

Principles of Recursion, Removal of Recursion. [8]

UNIT-III

Trees: Basic Terminology, Binary Tree, Binary Tree Representation, Complete Binary Tree,

Extended Binary Tree, Array and Linked Representation of Binary Trees, Traversing Binary

Trees, Threaded Binary Trees, Application of Trees: Algebraic Expression, Huffman Algorithm.

Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of

Search Algorithm, Path Length.

Height Balancing Trees: AVL Tree, B-Trees. [8]

UNIT-IV

Sorting: Insertion Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Sorting on Different

Keys, Practical Consideration for Internal Sorting.

Searching and Hashing: Sequential Search, Binary Search, Comparison and Analysis, Hash

Table, Hash Function, Collision Resolution Strategies, Hash Table Implementation. [8]

UNIT-V

Graphs: Terminology and Representations, Graphs & Multi-Graphs, Directed Graphs,

Sequential Representations of Graphs, Traversal, Connected Component and Spanning Trees,

Minimum Cost Spanning Trees (Single Source Shortest Path).

L T P

3 1 0

File Structures: Physical Storage Media, File Organization, Organization of Records into

Blocks, Sequential Files, Indexing and Hashing, Primary Indices, Secondary Indices, B+ Tree

Index Files, B Tree Index Files, Indexing and Hashing Comparisons. [8]

REFERENCES:

1. Horowitz and Sahani, "Fundamentals of data Structures", Galgotia Publication.

2. R. Kruse et aI, "Data Structures and Program Design in C" Pearson Education.

3. A.M. Tenenbaum et aI, "Data Structures using C & C++", PHI.

4. Lipschutz, "Data Structure", TMH.

5. K Loudon, "Mastering Algorithms with C", Shroff Publishers and Distributors.

6. Bruno R Preiss, "Data Structure and Algorithms with Object Oriented Design Pattern in C++,

John Wiley & Sons, Inc.

7. Adam Drozdek, "Data Structures and Algorithms in C++", Thomson Asia.

8. Pal G. Sorenson, "An Introduction to Data Structures with Application", TMH.

CA408 UNIX AND SHELL PROGRAMMING



UNIT-I

Introduction: Introduction to Unix, Unix System Organization (The Kernel and the Shell), Files

and Directories, Library Functions and System Calls, Editors (vi and ed). [8]

UNIT-II

Unix Shell Programming: Types of Shells, Shell Meta characters, Shell Variables, Shell scripts,

Shell Commands, Unix Environment, Integer Arithmetic and String Manipulation, Special

Command Line Characters, Decision Making and Loop Control, Controlling Terminal Input,

Trapping Signals, Arrays. [8]

UNIT-III

Portability with C: Command Line Argument, Background Processes, Process synchronization,

Sharing of Data, User-ID, Group-ID, Pipes, Fifos, Message Queues, Semaphores, Shared

Variables, Introduction to Socket Programming. [8]

UNIT-IV

Unix System Administration: File System, Mounting and Unmounting File System, System

Booting, Shutting Down, Handling User Account, Backup, Recovery, Security, Creating Files,

Storage of Files, Disk Related Commands. [8]

UNIT-V

Different Tools and Debugger: System Development Tools: Lint, Make, SCCS (Source Code

Control system), Language Development Tools: YACC, LEX, M4, Text Formatting Tools: nroff,

troff, tbl, eqn, pic, Debugger tools: Dbx, Adb, Sdb, Strip and Ctrace. [8]

REFERENCES:

1. Parata, "Advanced Unix Programming guide", BPB.

2. Yashwant Kanitkar, "Unix Shell Programming", BPB.

3. Meeta Handhi, Tilak Shetty, Rajiv Shah "The 'C' Odyssey Unix-the open boundless C", BPB.

4. Sumita;bh Das, "Unix Concepts and applications". TMH.

5. Mike Joy, Stephen Jarvis, Michael Luck, 'Introducing Unix and Linux", Palgrave Macmillan.

6. Rachel Morgan, Hanery McGilton, "Introducing Unix System V", TMH.

L T P

3 1 0

CA409 INTRODUCTION TO OPERATION RESEARCH



UNIT-I

Basics of Operation Research: Definition, Characteristics, Phases, Scope and limitations of

Operation Research.

Linear Programming: Formulation, Graphical method, Simplex method, Degeneracy, Big-M

method, Two phase method, Quality, Sensitivity analysis. [8]

UNIT –II

Transportation Model:

North-West Corner rule, Least-cost method, Vogel’s approximation method, Degeneracy in

transportation problem, Stepping stone method, Modified distribution method, Unbalanced

supply and demand, Profit maximization problem, Prohibited Transportation Routes,

Transshipment problems. [8]

UNIT-III

Assignment Model: Hungarian Method for Solution, Non Square Matrix, Restriction on

Assignments, Maximization Problem, Travelling Salesman Problem.

Network Techniques: Shortest Path Model, Minimum Spanning Tree Problem, Max-Flow

problem and Min Cost Problem. [8]

UNIT-IV

Sequencing Problem: Johnson’s Algorithm for n Jobs and Two machines, n Jobs and Three

Machines, Two jobs and m Machines Problems.

Theory of Games : Concept of game, Two- person zero –sum game , Pure and Mixed Strategy

games, Saddle point, Odds Method. [8]

UNIT-V

Queuing Theory: Characteristics of M/M/1 Queue Model, Application of Poisson and

Exponential Distribution, Arrival rate and Service Rate, Applications of Queue Model for better

service to the customers.

Project Management: Phases of Project Management, Guidelines for Network Construction,

CPM and PERT. [8]

REFERENCES:

1. Wayne L. Winston, “Operations Research” Thomson Learning,2003.

2. Hamdy H. Taha, “Operations Research-An Introduction” Pearson Education, 2003.

3. R. Panneer Seevam, “Operations Research” PHI Learning, 2008.

4. J.K.Sharma , “ Operations Research” , Pearson.

L T P

3 1 0

CA410 SIMULATION AND MODELLING



UNIT-I

System Definition and Components, Stochastic Activities, Continuous and Discrete Systems,

System Modeling, Types of Models, Static and Dynamic Physical Models, Static and Dynamic

Mathematical Models, Full Corporate Model, Types of System Study. [8]

UNIT-II

System Simulation, Nature And Techniques of Simulation, Comparison of Simulation and

Analytical Methods, Types of System Simulation, Real Time Simulation, Hybrid Simulation,

Simulation of Pure-Pursuit Problem, Single-Server Queuing System and an Inventory Problem,

Monte-Carlo Simulation, Distributed Lag Models, Cobweb Model, Simulation of Single Server

Queuing system and Monte Carlo Simulation [9]

UNIT-III

Simulation of Continuous Systems, Analog Vs. Digital Simulation, Simulation of Water

Reservoir System, Simulation of a Servo System, Simulation of an Autopilot, Discrete System

Simulation, Fixed Time-Step Vs. Even to Even Model, Generation of Random Numbers, Test for

Randomness, Monte-Carlo Computation Vs. Stochastic Simulation. Demonstration of generation

of Random Number through MATLAB [8]

UNIT-IV

System Dynamics, Exponential Growth Models, Exponential Decay Models, Modified

Exponential Growth Models, Logistic Curves, Generalization of Growth Models, System

Dynamic Diagrams.

Introduction to SIMSCRIPT: Program, System Concepts, Origination and Statements, Defining

the Telephone System Model. [8]

UNIT-V

Simulation of PERT Networks, Critical Path Computation, Uncertainties in Activity Duration,

Resource Allocation and Consideration, Simulation Languages and Software, Continuous and

Discrete Simulation Languages, Expression Based Languages, Object Oriented Simulation,

General Purpose Vs. Application Oriented Simulation Packages, CSMP-III, MODSIM-III. [7]

REFERENCES:

1. Geoffrey Gordon, “System Simulation”, PHI.

2. Jerry Banks, John S. C Barry L. Nelson David M. Nicol, “Discrete Event System

Simulation”, Pearson Education.

3. V P Singh, “System Modeling and simulation”, New Age International.

4. Averill M. Law, W. David Kelton, “System Modeling and Simulation and Analysis”, TMH.

L T P

3 1 0

CA411 INFORMATION SYSTEM ANALYSIS AND DESIGN



UNIT-I

Introduction to Information System, Types of Information Systems, Effectiveness and Efficiency

Criteria in Information System, Application of Database and Interface Design Principles,

Centralization and Decentralization of the Information System Facilities, Solving Organizational

Decision-Making Problems, Use of Decision-Support Problem-Solving Tools. [8]

UNIT-II

Business Information Systems, Telecommunication, Database Management, Internet &

Electronic Commerce, Information System for Business Operations, Managerial Decision

Support and Strategic Advantage. [8]

UNIT-III

Information Technology used for Information System, Security & Ethical Challenges, Enterprise

Resource Planning, Supply Chain Management, Customer Relationship Management. [8]

UNIT-IV

A Modern Approach to System Analysis and Design, Systems Development Life Cycle,

Improving is Development Productivity, Identifying and Selecting System Development

Projects, Corporate Information Systems Planning, Analytical, Technical, Management &

Interpersonal Skills for Information generation and System Analysts, Components of CASE tools

and its usage. [8]

UNIT-V

Process Modeling, Conceptual Data Modeling and E-R Model, Introduction to DFD, Business

Rules. Logic Modeling, Structured English, Decision Tables, Decision Trees, Organizational

Issues in System Implementation, Testing, Implementation and Maintaining Information

Systems, Joint Application Development, Rapid Application Development. [8]

REFERENCES:

1. Simon Bennett, “Object-Oriented systems Analysis and Design Using UML”, 4th Edition,

Steve McRobb and Ray Farmer, Mc Graw Hill, 2010.

2. O. Brian, “Management Information System” TMH.

3. Jeffrey A. Hoffer; Joey F. George; Joseph S. Valacich, “Modern Systems Analysis and

Design”, Sixth Edition, Prentice Hall, 2011.

4. Kenneth E. Kendall & Julie E. Kendall, “Systems Analysis and Design”, Eight Edition,

Pearson, 2011.

5. Whitten, Bittney, "System Analysis & Design Methods", Galgotia Pub.

6. Kendall, "Introduction to system Analysis & Design", McGraw Hill.

7. Elis Awad, "System Analysis & Design", Galgotia Pub.

8. Gordon B. Davis & Margrethe H. Oison, “Management Information System” TMH.

L T P

3 1 0

CA412 E-COMMERCE



UNIT-I

Introduction: Definition of Electronic Commerce, E-Commerce: Technology and Prospects,

Incentives for Engaging in Electronic Commerce, Needs of E-Commerce, Advantages and

Disadvantages, Framework, Impact of E-commerce on Business, E-Commerce Models, E-

Commerce Process Models: Introduction, Business Models, E-business Models based on the

Relationship of Transaction Parties, E-Commerce Sales Life Cycle (ESLC) Model, Roadmap of

E-Commerce in India. [8]

UNIT-II

Network Infrastructure for E- Commerce: Internet and Intranet based E-commerce- Issues,

Problems and Prospects, Network Infrastructure, Network Access Equipments, Broadband

Telecommunication (ATM, ISDN, and FRAME RELAY).

Mobile Commerce: Introduction, Wireless Application Protocol, WAP Technology, Mobile

Information Device. [8]

UNIT-III

Web Security: Security Issues on Web, Importance of Firewall, Components of Firewall,

Transaction Security, Emerging Client Server, Security Threats, Network Security, Factors to

consider in Firewall design, Limitation of Firewalls. [8]

UNIT-IV

Encryption: Encryption Techniques, Symmetric Encryption: Keys and Data Encryption

Standard, Triple Encryption, Secret Key Encryption, Asymmetric Encryption: Public and Private

Pair Key Encryption, Digital Signatures, Virtual Private Network. [8]

UNIT-V

Electronic Payments: Overview, The SET Protocol, Payment Gateway, Certificate, Digital

Tokens, Smart Card, Credit Card, Magnetic Strip Card, E-Checks, Credit/Debit Card based EPS,

Online Banking, EDI Application in Business, E- Commerce Law, Forms of Agreement, Govt.

Policies and Agenda. [8]

REFERENCES:

1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addison- Wesley.

2. Pete Lohsin , John Vacca “Electronic Commerce”, New Age International.

3. Goel, Ritendra “E-commerce”, New Age International.

4. Laudon, “E-Commerce: Business, Technology, Society”, Pearson Education.

5. Bajaj and Nag, “E-Commerce the cutting edge of Business”, TMH.

6. Turban, “Electronic Commerce 2004: A Managerial Perspective”, Pearson Education.

L T P

3 1 0

CA413 COMPUTER ARCHITECTURE AND MICROPROCESSOR



UNIT-I

8-Bit Microprocessor: Intel 8085 Microprocessor, Pin Diagram and Internal Architecture of

8085 Microprocessor, Registers, ALU, Control & Status, Interrupt and Machine Cycle,

Instruction Sets, Addressing Modes.

Instruction Formats: Instruction Classification, Data Transfer, Arithmetic Operations, Logical

Operations, Branching Operations, Machine Control and Assembler Directives. [8]

UNIT-II

16-Bit Microprocessor: Architecture of 8086 Microprocessor, Register Organization, Bus

Interface Unit, Execution Unit, Memory Addressing and Memory Segmentation, Operating

Modes, Instruction Sets, Instruction Format, Types of Instructions.

Interrupts: Hardware and Software Interrupts. [7]

UNIT-III

Programming: Assembly Language Programming Based on Intel 8085/8086, Instructions, Data

Transfer, Arithmetic, Logic, Branch Operations, Looping, Counting, Indexing, Programming

Techniques, Counters and Time Delays, Stacks and Subroutines, Conditional Call and Return

Instructions. [9]

UNIT-IV

Parallel Computing: Introduction, Parallelism in Uniprocessor Systems, Parallel Computer

Structures, Architectural Classification Schemes, Parallel Processing Applications.

Pipelining Processing: An Overlapped Parallelism, Instruction and Arithmetic Pipelines. [8]

UNIT-V

Principles of Designing Pipelined Processors: Internal Forwarding and Register Tagging,

Hazard Detection and Resolution, Job Sequencing and Collision Prevention, Characteristics of

Vector Processing, Multiple Vector Task Dispatching, SIMD Array Processors, Masking and

Data Routing.

SIMD Interconnection Network: Cube Interconnection Network, Shuffle-Exchange and

Omega Network. [8]

REFERENCES:

1. Gaonkar, Ramesh S, “Microprocessor Architecture, Programming and Applications with

8085”, Penram International Publishing.

2. Ray A K, Bhurchandi K M, “Advanced Microprocessors and Peripherals”, TMH.

3. Hall D V,”Microprocessor Interfacing’, TMH.

4. Liu and Gibson G A, “Microcomputer System: The 8086/8088 family”, PHI.

5. Aditya P Mathur, “Introduction to Microprocessor”, TMH.

6. M Rafiqzzaman, “Microprocessors, Theory and Applications”.

7. Hwang & Briggs, “Computer Architecture & Parallel Processing”, McGraw Hill.

L T P

3 1 0

CA414 DATA STRUCTURE LAB



Write Program in C for following.

Sorting programs: Bubble sort, Merge sort, Insertion sort, Selection sort and Quick sort.

Searching programs: Linear Search, Binary Search.

Array implementation of Stack, Queue, Circular Queue, and Linked List.

Implementation of Stack, Queue, Circular Queue, Linked List using Dynamic Memory

Allocation.

Implementation of Binary tree.

Program for Tree Traversals (Preorder, Inorder, Postorder).

Program for Graph Traversal (BFS, DFS).

Program for Minimum Cost Spanning Tree, Shortest Path.

L T P

0 0 3

CA415 UNIX / LINUX LAB



UNIX COMMANDS

1. Miscellaneous Command.

2. File & Directory Related Commands.

3. Communication & Disk Related Commands.

4. Basic Filters

SHELL PROGRAMMING

1. Shell script to accept two numbers and perform all arithmetic operations on it.

2. Menu Based Shell Script.

3. Shell Script to calculate the Gross salary as under following constraints:-

In a company an employee is paid as under

(i) If his basic pay less than 1500 then HRA is 10%, DA is 90% of basic pay.

(ii) If his basic pay equal or above 1500 then HRA is 500 and DA is 98% of basic

pay.

If the employee salary is input through keyboard, find its gross salary. 4. Shell Script through case statement.

5. Shell Script to Illustrate While ,Until and For Loop

6. Shell Script to find the

(i) Sum of digit

(ii) Reverse of a digit

7. Shell Script to perform String operations.

8. Shell Script to find the largest among numbers using positional parameters. 9. Write a shell script which will greet you “Good Morning”, ”Good Afternoon”, “Good

Evening” and “Good Night” according to current time.

10. Shell script to delete all files whose size is zero bytes from current directory.

SYSTEM PROGRAMMING

1. Use the fork() to create the Process.

2. Use the fork() to create the Child Process.

3. Implementation of exec System Call.

4. Implementation of Pipe.

5. Implementation of Semaphore and message queue.

6. Implement of Socket Programming

L T P

0 0 3

CA416 MICROPROCESSOR LAB



Study of 8085 and 8086/8088.

Assembly Language programs for 8086/8088:

(i) Address and data transfer

(ii) Addition, subtraction

(iii) Block transfer

(iv) Find greatest numbers

(v) Find r's and (r-l)'s complements of signed and unsigned number.

(vi) Multiplication of two decimal/binary/hexadecimal/octal numbers.

(vii) Division of two decimal/binary/hexadecimal/octal numbers.

(viii) Conversion of Lower case to upper case character.

Test the performance of Booth's Algorithm for:

(i) Signed numbers.

(ii) Unsigned numbers.

L T P

0 0 2

integral university, lucknow department of computer application … · 5. maheshwari and maheshwari...

Documents