Sri Guru Granth Sahib World University Fatehgarh Sahib · 2020. 5. 28. · 3 1 _ 4 40 60 MCA103...

DEPARTMENT OF COMPUTER

SCIENCE

SYLLABUS

FOR

MCA

(Master of Computer Applications)

3 Year Course/ 2 Year LEET

(Batch 2019)

Sri Guru Granth Sahib World University

Fatehgarh Sahib

Batch 2019 Page | 2

DEPARTMENT OF COMPUTER SCIENCE

Scheme Followed for the External and Internal Paper

The external paper will carry 60 marks and will be of3 hours duration. The question paper will be

divided into three sections (A, B and C). Section A will be Compulsory which consists of short answer

type questions of20 marks. Section B will consist of 4 questions of 10 marks each. Student will attempt

2 questions from Section B. Section C will consist of 4 questions of 10 marks each. Candidate will be

required to attempt two questions.

The Internal paper will carry 40 marks and it will be distributed as follows:

Sr. No. Description Weightage of

Marks (%)

1 Mid Semester Tests 10+10

2. Assignments/ Quiz/ Seminar/ Presentation 15

3

Attendance

75-80%

81-85%

86-90%

91-95%

>95%

05

1

2

3

4

5

Batch 2019 Page | 3



Master of Computer Applications - 3 Year Programme

First Semester MCA (Master of Computer Application)

Course

Code Title

Schedule OfTeaching

(Hrs/Week) Credits Marks

Lecture Tutorial Practical Internal External

MCA101 Information Technology

3 1 _ 4 40 60

MCA102 Programming

in C 3 1 _ 4 40 60

MCA103

Computer

Organization

and

Architecture

3 1 _ 4 40 60

MCA104

Introduction to

Management Functions

3 1 _ 4 40 60

MCA105 Mathematical

Foundations 3 1 _ 4 40 60

MCA101L Information Technology

Lab _ _ 4 2 20 30

MCA102L Programming

in C Lab _ _ 4 2 20 30

Total 15 5 8 24 240 360

Batch 2019 Page | 4




Second Semester MCA (Master of Computer Application)

Course

Code Title

Schedule OfTeaching

(Hrs/Week) Credits

Marks

Lecture Tutoria

l Practical Internal External

MCA201

Object Oriented

Programming Using C++

3 1 0 4 50

MCA202 Web Designing 3 1 _ 4 40 60

MCA203

Object Oriented

Analysis and Design

3 1 _ 4 40 60

MCA204 Accounting and

Financial Management

3 1 _ 4 40 60

MCA205 Probability and Combinatonics

3 1 _ 4 40 60

MCA201L

Object Oriented

Programming Using C++ Lab

_ _ 4 2 20 30

MCA202L Web Designing

Lab _ _ 4 2 20 30

Total 15 5 8 24 250 300

Batch 2019 Page | 5




Third Semester MCA (Master of Computer Application)

Course Code Title

Schedule Of Teaching

(Hrs/Week) Credits

Marks


MCA301 Data Structures 3 1 _ 4 40 60

MCA302 Java Programming 3 1 _ 4 40 60

MCA303 Operating System 3 1 _ 4 40 60

MCA304

Computer Based

Optimization

Techniques

3 1 _ 4 40 60

MCA305

Data

Communication

and Networks

3 1 _ 4 40 60

MCA301L Data Structures Lab

_ _ 4 2 20 30

MCA302L Java Programming

Lab _ _ 4 2 20 30

Total 15 5 8 24 240 360

Batch 2019 Page | 6




Fourth Semester MCA (Master of Computer Application)

Course Code Title

Schedule Of Teaching

(Hrs/Week) Credits Marks


MCA401 Database

Management System 3 1 _ 4 40

60

MCA402 Visual Programming

3 1 _

4 40 60

MCA403 Theory of

Computation 3

1 _ 4

40 60

MCA404 Elective-I 3

1 _ 4

40 60

MCA405 Elective-II 3

1 _ 4

40 60

MCA401L

Database

Management System

Lab

_ _ 4 2 20 30

MCA402L Visual

ProgrammingLab _ _ 4 2 20 30

Total 15 5 8 24 240 360

Elective-I:

I. Compiler Design II. Distributed Database Management

III. Design and Analysis of Algorithms

IV. Machine Learning

Elective- II:

I. Oral and Written Technical Communication

II. MIS Framework and Implementation

III. Corporate Planning

Batch 2019 Page | 7




Fifth Semester MCA (Master of Computer Application)

Course

Code

Title

Schedule ofTeaching

(Hrs/Week)

Credits

Marks

Lecture

Tutorial Practical Internal External

MCA501 Computer

Graphics 3 1 _ 4 40 60

MCA502 Python

3 1 _ 4 40 60

MCA503 Institutional

Training 2 _ _ 2 40 --

MCA504 Elective-I 3

1 _ 4

40 60

MCA505 Elective-II 3

1 _ 4

40 60

MCA501L Computer

GraphicsLab _ _ 4

2 20 30

MCA502L Python

Lab _ _ 4

2 20 30

MCA506P Industrial

Training 4 100 100

Total 14 4 8 26 350 400

Elective-I: I. Artificial Intelligence

II. System Simulation

III. Multimedia and Its Applications IV. Cloud Computing

Elective-II:

I. Organizational Behavior

II. Management of Software Projects III. Investment Technology

Batch 2019 Page | 8




Sixth Semester MCA (Master of Computer Application)

Course

Code

Title

Schedule OfTeaching

(Hrs/Week)

Credits

Marks

Lecture Tutorial Practical Internal External MCA 601

Project Work _ _ _ 10 160 240

Total _ _ _ 10 160 240

Batch 2019 Page | 9


FIRST SEMESTER

Batch 2019 Page | 10


Course Code: MCA 101 Title: Information Technology [SGGSWU- DCS] L/T/P: 3/1/2

Lectures to Be Delivered: 32

PART-I Overview of Computer System: block structure of computer, characteristics of computer,

generations of computers, classification of computer (based on operating principles, applications,

size and capability), applications of computers. Elements of a Computer Processing System: input-output devices: keyboard, mouse, trackball,

light pen, touch screens, scanner, digital camera, monitor (crt technology), printers, ocr, omr, micr.

types of memory: primary, secondary (magnetic tape, floppy disk, hard disk, cd, dvd, flash

memory).

Computer Languages: machine language, assembly language, high level languages, fourth

generation languages, characteristics of a good programming language, introduction to compiler,

interpreter, assembler.

Operating System: functions of operating system, types of operating system- batch processing,

multi-programming, time-sharing, real time, distributed, multi-processor, multitasking. functions

and features of operating system.

PART-II

Internet: evolution, net structure, services (email, telnet, ftp, www), applications of internet. search

engines, types of internet connections, addressing schemes (ip address and domain name

addressing).

Html Basic Concepts:static and dynamic html, structure of html documents, html elements,

linking in html, anchor attributes, image maps, meta information, image preliminaries, layouts,

backgrounds, colors and text, fonts, tables, frames and layers,audio and video support with html.

Database Integration with Html:css, positioning with style sheets. forms control, form element.

relationship between html, sgml, and xml, xml basics, xml for data files, embedding xml into html

documents, converting xml to html and html to xml. displaying xml using css and xsl, the future of

xml.



Syllabus for Practical: Implementation of all studied concepts Course Code: MCA-101L

of Information Technology

Textbooks: 1. V. Rajaraman, “Fundamentals of Computers” (2nd edition), Prentice Hall of India, New Delhi, 1996. 2. Internet & World Wide Web How to Program, Pearson education, 3rd edition, by: H.M. Deitel, P.J. 2.A Powell, HTML-The Complete Reference, Tata McGraw Hill. References:

1 Petrick Norton, “Fundamentals of Computers”. 2 E Balagurusamy, “Fundamentals of Computers”, Tata Mc.Graw Hill. 3 David Cyganski, John A. Orr, “ Information Technology Inside and Outside” Pearson

Education 2002



Course Code- MCA 102 TITLE: Programming in C [SGGSWU-DCS] L/T/P: 3/1/2

Lectures to be delivered: 32

PART-I

Planning the Computer Program: Concept of problem solving, Problem definition, Program

design, Debugging, Types of errors in programming, Documentation.

Techniques of Problem Solving: Algorithms, Flowcharting, tracing flowcharts, decision table,

Structured programming concepts, Programming methodologies viz. top-down and bottom-up

programming.

Searching, Sorting, and Merging: Linear & Binary Searching, Bubble, Selection, and Insertion

Sorting, Merging.

Overview of C: History of C, Importance of C, Structure of a C Program. Elements of C: C

character set, identifiers and keywords, Data types, Constants and Variables. Operators: Arithmetic,

relational, logical, bitwise, unary, assignment and conditional operators and their hierarchy &

associativity.

PART-II

Input-Output Functions: getchar( ),putchar( ), scanf( ), printf( ), gets( ), puts( ). Pre Processor

Directives. Control statements: Sequencing, Selection: if and switch statement; Repetition: for,

while, and do-while loop; break, continue, goto. Functions: Definition, prototype, passing parameters, recursion. Storage classes in C: auto, extern, register and static storage class, their scope, storage, and lifetime. Arrays: Definition, types, initialization, processing an array, passing arrays to functions, Strings. Pointers: Declaration, operations on pointers, pointers and arrays, dynamic memory allocation, pointers and functions. Structure & Union: Definition, processing, Structure and pointers, passing structures to functions.Data files: Opening and closing a file, I/O operations on files, Error handling during I/O operation, Random access to files.

Syllabus for Practical: Course Code: MCA-102L Implementation of C concepts – Data types declaration, conditional statements, loop statements, function usage, Array implementation, pointers, structures and union implementation.

Textbooks: 1. Sinha, P.K. & Sinha, Priti, Computer Fundamentals, BPB 2. Dromey, R.G., How to Solve it By Computer, PHI

References:

1. Brain W. Kernigham and Dennis M. Richie: The C Programming Language, 2nd Ed., PHI. 2. E.Balagurusamy: Programming in ANSI C, 4th Edition TMH 3. H.H. Tanz & T. B. D Orazio: “C Programming for Engineers & Computer Science”

McGraw Hill International editions.



Course Code: MCA 103 Title: Computer Organization and Architecture [SGGSWU- DCS] L/T/P: 3/1/0


PART-I Number System: Decimal, binary, octal and hexadecimal number systems and their inter-conversion.

Binary Arithmetic: addition, subtraction, multiplication and division. Representation of Information:

Integer and floating point representation, signed and unsigned numbers. Character Codes: BCD,

ASCII, EBCDIC, Excess 3 and Gray code. Basic Building Blocks: Boolean algebra, K-maps

Combinational Circuits: Half adder, Full adder and parallel adder. Decoder: 2x4 decoder, 3x8

decoder and Encoders. Flip Flops: D, SR, JK, JK-Master Slave and T. Counters: Ripple, Asynchronous

and synchronous. Input- Output Devices and their characteristics. Computer Organization: Structure

of computer, Instruction codes, Instruction Formats, InstructionCycle, Addressing modes.

PART-II Control PART: Design of control PART, data path & control path design, Microprogramming Vs

hardwired control (overview only), Features of RISC and CISC. Input/output Processing, bus

interface, data transfer techniques (Programmed initiated and interrupt initiated), I/O interrupts,

channels.

Memory Organization: Memory hierarchy, Main Memory: (RAM and ROM chips), Memory Address

Map, memory connection to CPU. Auxiliary Memory: hardware organization, match logic, read operation,

write operation. Cache memory: associative mapping, direct mapping, writing into cache, cache

initialization. Virtual Memory: address space and memory space, address mapping using pages, associative

memory page table, page replacement, and Memory management hardware: segmented page mapping,

memory protection. Textbooks:

1. Puneet Wadhwa, “ Computer Organisation And Architecture”, Kalyani Publications.

2. 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. 3. Nicholas Carter, “ Schaum’s Outlines Computer Architecture”, Tata McGraw Hill, 2002.



Course Code: MCA 104 Title: Introduction to Management Functions [SGGSWU-DCS] L/T/P: 3/1/0 Lectures to be delivered: 32

PART I

Evolution of Management thoughts, Management: its nature and purpose, Approaches of Management,

Functions of Management: Planning: MBO & MBE, Organization: Principles & Structures, Staffing,

Directing, Co-ordination and Control: Types, Process & Techniques, Principles of Management and

Scientific Management.

Human Resource Management: Meaning, Personnel vs. HRM, Functions of HRM; Job Analysis: Job

Description, Job Specification; Recruitment: Sources, Techniques of Recruitment; Selection: Procedure,

Placement, Induction; Performance Appraisal: Meaning, need and Purpose, Methods; Employee Training:

Meaning, Importance, objectives, need assessment, stages of training; Grievance Handling Procedure.

PART II

Financial Management: Meaning, Objectives, Scope of financial Management & types of decisions:

Financing, Investing, Dividend & Liquidity, Process of Financial Management, Role of Financial

Manager in an Organization, Agency Problems, Objectives of Firm: Shareholder maximization vs. Wealth

maximization, Risk-return trade-off, Brief Introduction to Indian Financial System.

Marketing: Evolution of Marketing, Core concepts of Marketing, Marketing Mix & 4 P’s-Product:

Meaning, Product Life Cycle, New Product Development; Price: Pricing Strategies; Place: Channels,

Physical Distribution; Promotion: components, Strategies, Personal Selling, Advertising.

Suggested Readings:

1. Koontz, H and Wechrich, H., Management, New York, Tata McGraw Hill, 13th Edition

2. Luthans, F, Organizational Behaviour, New York, McGraw Hill, 7th Edition

3. Robbins, S P & Mary Coulter, Management, Pearson, 11th Edition

4. Aswathappa, K., Human Resource Management, Tata McGraw-Hill, New Delhi, 6th Ed.

5. Rao, VSP, Human Resource Management, Excel Books, 2nd Edition

6. Flippo, E., Fundamentals of Human Resource Management, McGraw Hill, 3rd Ed.

7. Armstrong, G & Kotler Philip, Marketing: An Introduction, Pearson, New Delhi, 7th Edition

Suggested Course Pedagogy: Case Study, Practical Assignments, Role Plays, Small Projects,

Class Room inputs



Course Code: MCA-105 Title: Mathematical Foundation [SGGSWU-DCS] L/T/P: 3/1/0


PART I

Set Theory: - Introduction of Sets and Elements, Subsets, Venn diagrams, Operation on sets, Union,

Insertion & Complements, De-Morgan’s Law, Finite Sets, Power sets, Product sets.

Relation and Function: Binary Relation, Composition of relations, Equivalence Relation. Function,

types of Functions, function composition and Inverse Functions.

Recursion: Recursion relation, Solving recession relation with constant coefficient. Generating

Function. Mathematical Induction, Inclusion & Exclusion principal, Mathematical Logics.

PART II

Graph: Definitions, Incidence and Degree, Connectedness, Walk, Path, Reachability, Circuit,

Shortest Path Algorithm, between two Vertices, Eulerian graph, Hamiltonian graph, Directed graph,

Fulres’sAlgorithms, Matrix representation of Graph.

Trees: Properties of Trees, Rooted and Binary Tree, Directed Tree, Spanning Tree, Cut Vertices.

Group: Group, Semi Group, Cyclic Groups. Quotient group, Homomorphism – Isomorphism,

Permutation group, Generators of Subgroup, Normal Subgroups.

Textbooks:

1. Tremblay, J.P., el. Al “Discrete Mathematical Structures with Applications to Computer

Science” McGraw Hill.

2. Sahni, S., “Concepts in Discrete Mathematics”. Camelot Publisher. U.S.A.

3. Liu, C. L. ,Mohapatra., D. P. “Elements of Discrete Mathematics”McGraw Hill.Joshi R.C., ‘Discrete Structure’.



SECOND SEMESTER



Course Code: MCA -201 Title: Object Oriented Programming using C++ [SGGSWU-DCS] L/T/P: 3/1/2


PART-I

Introduction to C++: Object-Oriented features of C++, Comparison of C with C++, Class

and Objects, Inline functions, Static data members and member functions, Read-Only objects,

Pointers, Dynamic memory allocation and de-allocation, constructors and destructors,

Dynamic objects, array of pointers to object, local and global class, nested and empty class,

preprocessor directives, namespace.

Console I/O: Hierarchy of console stream classes, unformatted and formatted I/O operations,

Manipulators

Operator Overloading: Overloadable operators, overloading unary and binary arithmetic

and relational operators, overloading subscript, array, insertion, extraction, new and delete

operators.

Friend Function and Type Conversion: Friend function, Function overloading,

overloading operators through friend function. Basic type conversion, conversion between

Objects and Basic Types, conversion between objects of different classes

PART-II

Inheritance: Derivation Rules, Different forms of inheritance, Roles of constructors and

destructors in inheritance.

Virtual Functions: Virtual functions and their needs, Pure virtual function, virtual

destructor, virtual derivation, abstract class.

Generic Programming & Exception Handling: Template functions, Template class,

Exception handling features of C++. File Handling: Hierarchy of File Stream classes, Opening and Closing files, File modes,

testing for errors, File pointers and their manipulations, ASCII & Binary files, Sequential and

Random access files.

Syllabus for Practical: Course Code: MCA 201L Implementation of all studied concepts of Oops using C++

Textbooks:

1. E. Balagurusamy, Object Oriented Programming with C++, Tata McGraw-Hill.

2. Deitel and Deitel, C++ How to Program, Pearson Education.

References:

1. Robert Lafore, Object Oriented Programming in C++, Galgotia Publications.

2.Bjarna Stroustrup, The C++ Programming Language, Third Edition, Addison-Wesley Publishing Company. 3.Salaria, R. S, Object Oriented Programming Using C++, Fourth Edition, Khanna Book Publishing



Course Code: MCA 202 Title: Web Designing [SGGSWU-DCS] L/T/P: 3/1/2


PART-I

HTML: Introduction to HTML, HTML and the World Wide Web, Basic structure elements

of HTML, creating HTML pages, viewing pages in different browsers.

HTML Tags: Character Level and Paragraph Level Tags, Colours and Fonts, Image Tag, Tag

for Headings, Lists (Ordered, Unordered and Definition).

Scripting languages: HTML: Introduction to HTML, HTML and the World Wide Web,

HTML elements, basic structure elements of HTML, the body elements, creating HTML

pages, viewing pages in different browsers, rule for nesting.

HTML Tags: Colours and Fonts, Formatting the Body Section, Creating lists, Creating

External links, and Creating Internal links.

PART-II

Frames: Introduction to Frames (The <FRAMESET> tag, The <FRAME> tag, Targeting

Named Frames.

DHTML: Introduction, CSS (Font Attributes, Color and Background Attributes, Text

Attributes, Border Attributes, Margin Attributes, List Attributes), Use of Class, Span Tag.

Forms: The Form Object, The Form Elements: Text Element, Password Element, Button

Element, Submit (Button) Element, Reset (Button) Element, Checkbox Element, Radio

Element, Text Area Element, Select and Option Element, Multi Choice Select Lists Element.

Introduction to JavaScript: Advantages, Data Types, Variables, Arrays, Operators and

Expressions. Programming Constructs: Conditional Checking and Loops.

Syllabus for Practical: Course Code: BCA 202L

Implementation of all studied concepts of Web Designing.

Textbooks:

1. Ivan Bayross, HTML, DHTML ,JAVASCRIPT , Perl CGI, Bpb Publications.

2. Jon Duckett, “HTML and CSS: Design and Build Websites”, Wiley

References:

1. Kasser, Barbara, 1998 , Using the Internet, PHI, 4th ed., New Delhi.

2. Jon Duckett, “JavaScript and JQuery: Interactive Front-End Web Development”, Wiley



Course Code: MCA 203 Title: Object-Oriented Analysis and Design

[SGGSWU- DCS] L/T/P: 3/0/1


PART I Introduction to Object: Object Orientation, Development, Modeling, Object Modeling technique.

Object modeling: Objects and classes, Links and Association, Generalization and inheritance,

Grouping constructs, Aggregation, Abstract Classes, Generalization as extension and restriction,

Multiple inheritance, Meta data, Candidate keys, Constraints.

Dynamic modeling: Events and states, Nesting, Concurrency, Advanced Dynamic Modeling concepts.

Functional modeling: Functional Models, Data flow diagrams, Specifying operations, Constraints,

Relation of Functional model to Object and Dynamic Models.

Design Methodology, Analysis: Object modeling, dynamic modeling, Functional modeling, adding

operations, Iterating Analysis. System design: Subsystems Concurrency, Allocation to processor and

tasks, Management of data stores, Handling Global Resources, Handling boundary Conditions, Setting

Trade-off priorities.

Object Design: Overview, Combining the three models, Designing Algorithms, Design Optimization,

Implementation of Control, Adjustment of Inheritance, Design of Associations, Object Representation,

Physical Packaging, Documenting design decisions

PART II

UML: Basics, Emergence of UML, Types of Diagrams.

Use Case: Actors, Use Case Diagram, and Relationship between Use Cases.

Classes: Class Diagram, Classes, Objects, Attributes, Operations, Methods, Interfaces, Constraints,

Generalization, Specialization, Association, and Aggregation.

Behavioural Diagrams: Activity Diagram, Collaboration Diagram, Sequence Diagram, State chart

Diagram. Implementation Diagrams: Component Diagram, Deployment Diagram

Programming Style: Object Oriented Style, Reusability, Extensibility, and Robustness.



Text Books:

1. Bansal, R.K. and Harrison, J. B. Spoken English For India: A Manual of Speech and Phonetics, Hyderabad: Orient Longman.

2. Best, Wilfred D. The Student’s Companion, New Delhi: Rupa & Co.

3. Bhattacharya, Indrajit. An Approach to Communication Skills. Dhanpat Rai & Co. pvt. Ltd., New Delhi. 2012.

Reference Books 1. Pushp Lata and Kumar Sanjay. Communication Skills. Oxford University, press. 2011 2. Sharma, R.S. Technical Writing. Delhi: Radha Publications.

3. Singh, Achhru, University English Grammar and Vocabulary Study, Chandigarh:

Unistar Publishers.



Course Code: MCA-204 Title: Accounting and Financial Management [SGGSWU-DCS] L/T/P: 3/1/0


PART-I

Basic Accounting- Nature, scope and objectives of accounting; Accounting as an information

system, users of accounting information, Accounting: Principles, concepts and conventions,

Double entry system of accounting, Accounting Equation, Traditional and Modern rules of

Accounting, Branches of Accounting; their interrelationships and difference.

Journal, Ledger & Trial Balance, Preparation of Final Accounts: Trading, Profit and loss

accounts and Balance sheet (with simple adjustment entries), Introduction to manufacturing

account.

PART-II

Financial Management: Meaning, Role & Scope, Ratio Analysis: Meaning, advantages, limitations,

types of ratios and their usefulness, Fund Flow Statement: Meaning of the terms–fund flow and fund

preparation and interpretation of the fund flow statement, Cash Flow Statement.

Working capital Management, Inventory Management, Cost Accounting: Introduction, Types

of Costs, Break Even Analysis, ABC Costing, Kaizen Costing, Life Cycle Costing, Target Costing,

Budgetary Control: Meaning, Classification, Types of Budgets, Zero Based Budgeting

(fundamentals only).

Text Books: 1. Kellock, John: Elements of Accounting, Heinemann, 1978. 2. Levy and Sarnet: Principle of Financial Management, Prentice-Hall International. 3. Horngren and Sundem: Introduction to Financial Accounting, Prentice Hall International.

Reference Books: 1. Murthy, U.S., 1978: Management Finance, 2nd Edition, Vakils Fefers & Simons Ltd. 2. Pandey, I.M., 1979: Financial Management, Vikas Publications. 3. Shah Parish P.: Financial Management, Wiley India Pvt. Ltd.



course Code: MCA-205 Title-Probability and Combinatorics

[SGGSWU-DCS] L/T/P: 3/1/0 Lectures to be delivered: 32

PART-I

Sets and propositions: Cardinality, Mathematical induction, Principle of inclusion and exclusion.

Probability: Sample space. Events. Axioms. Conditional probability. Bayes rule.

Random variables: Discrete and continuous. Distribution and density functions. Marginal and conditional

distributions. Stochastic independence. Expectation: Expectation of a function. Conditional expectation

and variance. Moment generating function. Cumulant generating functions. Characteristic functions.

Distributions: Discrete and continuous distributions.

PART-II

Discrete distributions: uniform, binomial, Poisson, geometric, negative binomial.

continuous distributions: uniform, normal, exponential.

Recurrence relations: Linear and with two indices. Principles of inclusion and exclusion. Formula

derangement. Restrictions on relative positions.

Graphs and Planar Graphs: Basic Terminology. Multigraphs. Weighted Graphs. Paths and Circuits

Shortest paths. Eulerian Paths and Circuits. Travelling Salesman Problem. Planar Graphs. Trees.

Definition and Examples of Finite State Machines-Equivalent Machines and Finite State Machines as

Language Recognizers.

Textbooks: 1. Gupta, S.C., and V.K. Kapoor. Fundamentals of Mathematical Statistics. New Delhi: S. Chand& Sons,

2002. Print.

2. Mood, A.M., F.A. Graybill, and D.C., Boes. Introduction to the theory of Statistics. Delhi: McGraw

Hill, 1974. Print

References : 1. K. Rohtagi and A. K. M. E. Saleh, An Introduction to Probability Theory and Mathematical Statistics,

3 rd Edition, Wiley, 2015.

2. S. M. Ross, Introduction to Probability Models, 11th Edition, Academic Press, 2014.



THIRD SEMESTER



Course Code: MCA 301 Title: Data Structures [SGGSWU-DCS] L/T/P: 4/1/2

Lectures to Be Delivered:32

LEARNING OBJECTIVES:

To impart the basic concepts of data structures and algorithms.

To understand concepts about searching and sorting techniques.

To Understand basic concepts about stacks, queues, lists.

To understanding about writing algorithms and step by step approach in solving problems

with the help of fundamental data structures.

COURSE OUTCOMES:

Ability to analyze algorithms and algorithm correctness.

Ability to summarize searching and sorting techniques

Ability to describe stack, queue and linked list operation.

Ability to understand and implement searching and sorting techniques.

PART- I Introduction to Data Structures: Concepts and Definition of Data Types, Data Objects,

Data Structures (Linear and Non-Linear).

Array: Linear Arrays and Algorithms to implement various operations including Traversing,

Insertion, Deletion, Reversing, Searching. Representation of one dimensional and

multidimensional array in memory, Matrix Operations.

Linked List: Introduction, Sequential Representation Versus Linked Representation,

Algorithms to implement various operations using Linked Lists: Creation, Insertion, Deletion,

Traversal, Applications of Linked Lists.

Stacks: Introduction, Sequential and Linked Representations, Operations: Inserting an

Element, deleting an Element, Implementing Operations Using Linked Lists, Applications of

Stack: Conversion from Infix to Post Fix Form, Evaluation of Post Fix Expression, Balanced

Parenthesis, Recursion and Quick Sort.

Queues: Sequential and Linked Representation, Operations: Insertion and Deletion,

Implementing Operations Using Linked List, Circular Queues.



PART – II Trees: Introduction to terminology of trees, binary tree, full binary tree, complete binary tree,

sequential and linked representation of binary trees in memory, tree traversal: in order, pre-order

and post order. application of binary trees: binary search trees, algorithms to implement tree

operations

Heap: Creation of Heap, And Heap Sort.

Graphs: Graph Theory Terminology, sequential representation of graphs; adjacency matrix path

matrix, operations on graphs.

Searching and Sorting: Insertion Sort, Selection Sort, Merge Sort, Bubble Sort, Linear and

Binary Searching Techniques. Algorithms to implement above methods and Complexity of the

Algorithms.

Syllabus for Practical: Course Code: MCA 301L Implementation of Studied Concepts.

Textbooks: 1. Seymour Lipschultz, “Data Structures", Mcgraw-Hill. 2. A.Tanenbaum, Y. Lanhgsam And A.J. Augenstein, "Data Structures Using C", Prentice Hall Of India, 1990

References: 1.Robert Sedgewick, “Algorithms In C”, Pearson Education. 2. Tanenbaum, A. M. Andaugenstein, M.J. ,”Data Structures Using C”, Prentice Hall International,1985.

3. Lipschutz, Seymour, “Theory & Problems of Data Structures”, Schaum Series,1986.



Course Code: MCA 302 Title: Java Programming

[SGGSWU-DCS] L/T/P: 3/1/2


PART-I

Java: Features of Java, Data types, operators, control structures, arrays, Class, objects &

methods, constructors, garbage collection, access specifiers, static variables and methods,

Command Line Arguments.

Inheritance: single and multilevel inheritance, method overriding, Dynamic Method

Dispatch, abstract class, use of super and final.

Packages: Defining, Access Protection, Importing Packages. Interfaces.

String handling – String operations, character extraction, string comparison,

searching and modifying strings, Wrapper classes.

Exception Handling: Exception types, try-catch-finally structure, multiple catch clauses,

nested try statements, built-in exceptions, creating your own exceptions.

PART-II

Multithreading: Java thread model, creating multiple threads, thread priorities,

synchronization, inter-thread communication, suspending, resuming and stopping threads.

Applets: Local & Remote Applets, Applet Architecture, Passing Parameters to Applets.

Event Handling: introduction, Terminology, types of events.

AWT: Brief about AWT Controls, adding AWT components, Layout Manager, Adding menu

to a window, popup menus, Dialog boxes, Color control, introduction to font control. Swing: Features, Components,Container Class, Swing Vs Awt, Swing Components, adding

Components, Using Dialogs, Progress Bars, Layout Manager.

Syllabus for Practical: Course Code: MCA 302L

Implementation of studied concepts.

Textbooks:

1. Ivan Bayross: Web Enabled Commercial Application Development using Java 2.0,BPB 2. Programming with Java - E. Balaguruswami, Second Edition, Tata McGraw Hill-1998.

Reference books:

1. Advanced Java Programming by Uttam K. Roy,Oxford University Press

2. Anshuman Sharma: Programming in Java, LP.

3. Schildt , Herbert : The Complete Reference Java 2,TMH.



Course Code: MCA 303 Title: Operating System [SGGSWU-DCS] L/T/P: 3/1/2


PART- I

Introduction to Operating System: Types of OS: batch processing, multiprogramming,

multitasking, time sharing, parallel and distributed, structure of operating system, functions of

OS.

Process management: process concept, process scheduling, operations on processes, and inter

process communication. Process scheduling: Basic concepts, CPU I/O Burst cycle, CPU

scheduler, preemptive and non-preemptive scheduling, dispatcher, scheduling criteria,

scheduling algorithms: FCFS scheduling, shortest job first scheduling, priority scheduling, round

robin scheduling, multilevel-queue scheduling and multilevel feedback queue scheduling.

Process Synchronization: critical section problem, Peterson’s solution, synchronization

hardware, semaphores, bounded buffer problem, readers writers problem, dining philosophers’

problem, monitors.

Deadlocks: deadlock characterization, methods for handling deadlocks, deadlock prevention,

deadlock avoidance, deadlock detection, recovery from deadlock.

PART II

Memory management: Swapping, contiguous memory allocation: memory allocation (first fit,

best fit, and worst fit), fragmentation; paging and segmentation.

Virtual Memory Management: demand paging, Page replacement algorithms: FIFO, Optimal

Page replacement, LRU page replacement, LRU approximation, counting based page

replacement, Allocation of frames: minimum number of frames, Allocation algorithms, global

versus local allocation; thrashing, working set model, page fault frequency.

Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK scheduling algorithms.

Textbooks: 1 .Silberschatz and Galvin, Operating System Concepts, Sixth Edition, Addison Wesley

publishing,Co., 1999.

2 . Sumitabha Das, Your Unix - The Ultimate Guide, Tata McGraw-Hill.

References:

1) Peterson, James, L. and Silberschatz, A.:Operating System Concepts, Wiley Publ. Comp,1985

2) Deitel, H.M.: An Introduction to Operating System, Addison-Wesley Publ. Comp,1984



Course Code: MCA 304 Title-Computer Based Optimization Techniques

[SGGSWU-DCSA] L/T/P: 3/1/0


PART-I

Introduction: The Historical development, Nature, Meaning and Management Application of

Operations research. Modelling, Its Principal and Approximation of O.R Models, Main

characteristic and phases, General Methods of solving models, Scientific Methods, Scope, Role

on Decision Making and Development of Operation Research in India. Linear Programming: Formulation, Graphical solution, standard and matrix form of linear

programming problems, Simplex method and its flow chart, Two-phase Simplex method,

Degeneracy. Duality: Definition of Dual Problem, General Rules for converting any Primal into its Dual,

PART-II Assignment Models: Formulation of problem, Hungarian Method for Assignment Problems,

Unbalanced Assignment Problems. Queuing Models: Introduction, Applications, Characteristic, Waiting and Ideal time costs,

Transient and Steady states, Kendall's Notations, Deterministic Models. (No Mathematical

derivations included).

PERT and CPM: Basic steps in PERT/CPM, Techniques, Network Diagram Representation,

Forward and Backward Pass-computation, Representation in Tabular form, Determination of

Critical path, Critical activity, Difference between CPM and PERT, Floats and Slack Times.

Textbooks: 1 .Tara, H.A., 1982 : Operations Research, 3rd Edn., McMillan Publishing Company 2. Sharma, S.D., Operations Research, Kedar Nath and Ram Nath, Meerut.

References :

1. Hiller, F.S. & Liberman, G.J., 1974: Introduction to Operations Research, 2nd Edn., Holden

DayInc. London. 2. Tara, H.A., 1982 : Operations Research, 3rd Edn., McMillan Publishing Company. 3. Srinath, L.S. : Linear Programming, East-West, New Delhi.



Course Code: MCA 305 Title: Data Communications and Networks [SGGSWU-DCSA] L/T/P: 3/1/0


PART- I Introduction: Data Transmission concepts, transmission impairments, switching, modulation,

multiplexing. Network Topologies: LAN, MAN, WAN, Wireless networks. Network Software: Layer,

Protocols, interfaces and services. Reference Models: OSI, TCP/IP and their comparison.

Physical Layer: Transmission Media: Magnetic, twisted pair, coaxial cable, fiber optics,

wireless transmission (radio, microwave, infrared, light wave).

Introduction to ATM, ISDN, Cellular radio and communication satellites.

Data Link Layer: Framing, Error control, sliding window protocols (one bit, Go back n,

selective repeat). Examples of DLL Protocols–HDLC, PPP. Medium Access Sub layer: Channel Allocation, MAC protocols – ALOHA, CSMA protocols,

Collision free protocols, Wireless LAN protocols, IEEE 802.3, 802.11 standards and their

Comparison. Bridges - Transparent, source routing, remote.

PART-II Network Layer: Design issues, routing algorithms (shortest path, flooding, flow based,

distance vector, hierarchical, broadcast, multicast, for mobile hosts).

Congestion control algorithms: Leaky bucket, Token bucket, Choke Packet, Load shedding,

Internetworking. IP Protocol: ARP, RARP.

Transport Layer: Addressing, establishing and releasing connection, flow control, buffering,

Internet Transport Protocol (TCP and UDP).

Application Layer: Domain name system, E-mail, File transfer protocol, HTTP, HTTPS, World

Wide Web.

Textbooks : 1. Tanenbaum A. S. “Computer Networks”, 4th Edition, PHI publications,2009.. 2. Data Communications & Networking by Forouzan, Tata McGraw Hills, 2009

References:

1. Comer Douglas E, “Computer Networks and Internet”,2nd Edition, PH, 2000 2. Stallings, William 2008 : Data and Computer Communications (8th Edition), PHI.

3. Prakash C. Gupta,” Data Communication and Networks”, PHI learning LTD



FOURTH SEMESTER



Course Code: MCA-401 Title: Database Management System [SGGSWU-DCS] L/T/P: 3/1/2


PART-I Introduction: Data base vs file oriented approach, General Architecture of a Data Base

Management Systems, Data Independence (logical and physical), Data Base Models (hierarchical,

network and relational model), and Components of a DBMS, advantages and disadvantages of

DBMS. Entities, Attributes, E-R Diagrams.

Normalization concepts: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF.

Relational Database management system: components, structure, data integrity, relational data

manipulation. Codd’s rule, DBMS vs RDBMS. Database languages: DDL, DML, DCL.

SQL: Oracle data types, querying database tables: creating, modifying, dropping databases,

Inserting, updating, deleting data from databases. SELECT statement. Conditional retrieval of rows,

working with Null values, primary, unique and foreign key concepts, matching a pattern from the

table, granting and revoking privileges and roles, joins.

PART-II

Introduction to PL/SQL: The PL/SQL Block structure, PL/SQL data types, variables and

constants, Assignment and expressions. Writing PL/SQL code, Database triggers types of triggers,

dropping triggers.

Transaction Management: Transaction Concept, Properties, Transaction States, Concurrent

Execution, Serializability, Conflict Serializability, View Serializability.

Concurrency control: locking techniques (types and operations), inconsistency problem

solution, problem of starvation, two phase locking protocol, handling of deadlocks, deadlock

detection and recovery.

Recovery System: Failure Classification: Transaction Failure, System Crash, And Disk Failure. Log

based Recovery, Deferred Database Modification, Immediate Database Modification, Checkpoints.

Syllabus for Practical: Course Code: MCA 401 L

Implementation of studied concepts. Textbooks:

1. Database System Concepts by A. Silberschatz, H.F. Korth and S. Sudarshan, 3rd edition, 1997, McGraw-Hill, International Edition.

2. Ivan Bayross: SQL, PL/SQL- The Program Language of ORACLE, BPB Publication. 3. Elmasri & Navathe: Fundamentals of Database systems, 5th edition, Pearson Education.

References: 1. Desai, B.C.: An Introduction to Database Systems, Galgotia Publ. Private Ltd,2008 2. Date, C.J.: Data Base Systems, Vols. I & II, Narosa Publication,2008. . 3. Abbey, Abramson & Corey: Oracle 8i-A Beginner’s Guide, Tata McGraw Hill.

4. Bhatia Prateek: Simplified Approach to DBMS, Kalyani Publishers, 8th Edition.



Course Code: MCA 502 Title: Visual Programming [SGGSWU-DCS] L/T/P: 3/1/2


Learning Objectives

To understand the concept of the visual programming and operations on them

Analyse program requirements

Design, develop programs with GUI interfaces

Learning Outcomes

To develop the skill necessary to create software solution using Visual Programming

To learn how to design software solution to some types of problems

To learn how to implement, test, and debug Visual Programming applications

To learn to confirm to a set of standards established for the course

PART- I

Introduction to .Net: Introduction to .Net Framework, the common language runtime, Origins of .Net

Technology, Features of .Net, Architecture of .Net framework.

Getting Started with Visual Basic: - Integrated Development Environment (IDE), Elements of user

interface, designing user interface, programming an application, Simple Project Creation, VB as event

driven programming.

Visual Basic as Language: - Variables, Constants, Arrays, Collections, Procedures, Arguments,

Functions, Control Flow statements, Loop statements, Nested control structures.

Concepts of C#: Introducing C#, Introduction to classes, Creating a console application in C#,

difference between C++ and C#, difference between Java and C#.

PART – II

Writing and deploying windows forms applications: -Appearance of forms, designing menu,

Multiple Document Interface: - Basic of MDI, accessing child forms, Accessing Data with ADO .NET:

Introduction, Features of ADO.NET.

Drawing with VB: - Graphic controls, Co - ordinate systems, Graphic methods: Lines, Circle,

Rectangle.

ActiveX Controls: - Text box control, List box control, Combo box control, Scroll bar control.

Common dialog Control: - Color, Font, File Open, File Save.

Writing and Deploying ASP.NET applications: Introduction to ASP.NET, Features of ASP.NET,

Web Forms.



Textbooks: 1 . Balagurusamy, E., 2004: Programming in C#, Tata McGraw-Hill (Unit I, II). 2. Visual Basic.Net, Kalyani Publishers; ISBN: 978-81-272-6965-4

References: 1.Jones, Bradley L.: Sams Teach Yourself C# in 21 Days. 2. Thamarai, S. Selvi, R.Murugesan, 2003: A Textbook on C#, Pearson Education

3.Applied Microsoft.NET Framework Programming, Jeffrey Richter



Course Code: MCA 403 Title: Theory of Computation


PART-I

Finite Automata & Regular Languages: Finite state systems, Deterministic, non-deterministic finite

automata, equivalence of deterministic and non-deterministic finite automata, Finite -moves, 2 way

finite automata with output, equivalence of Mealy and Moore machines.

Properties of Regular Sets: Finite automata and regular expressions, The pumping lemma for regular

sets, closure properties of regular sets, decision algorithms of regular sets, Minimization of finite

Automata, regular sets and regular grammars.

Context free grammars: Introduction to context free grammars, derivation trees, top-down & bottom

up parsing methods, ambiguous context free grammars, Chomsky normal forms.

PART-II

Properties of Context Free Languages: The pumping Lemma for context free languages,

closureproperties of context free languages, decision algorithms for context free languages.

Pushdown Automata: Deterministic and Non-deterministic pushdown automata, Equivalence of

contextfree languages and sets accepted by pushdown automata

Turning Machines: Introduction to turing Machines, Deterministic, non-deterministic, two way

infinitetape, multi tape, Chomsky hierarchy of languages, Insolvability of the halting problems.

Text Books:

1. Theory of Computer science by K.L.P Mishra,, PHI Publicatins.

2. Theory of Computer science by EV Krishnamurthy, East-west press

3. Switching circuits & FSM by ZVI Kohavi, TMH publications.

References:

1. Introduction to automata theory Languages & computation by Hopcraft,Ullman, Narosa

Publications.

2.Daniel I.A. Cohen, "Introduction to Computer Theory", Wiley, Second edition.



ELECTIVE-I

Course Code: MCA 404 (I) Title: Complier Design [Sggswu-DCS] L/T/P: 3/1/0


PART- I

Introduction to Compiler: Compilers, Analysis of the source program. Analysis - Synthesis model of

compilation, the structure of a compiler, Phases of compilation, compilers and translators, Interpretation.

Lexical Analysis: Regular grammar and regular expression for common programming language features,

Interface with input, Parser and symbol table, Token, Lexeme and patterns, Problems in lexical analysis, Error

reporting, Implementation, Transition diagrams.

Syntax Analysis: Role of the parser. Writing grammars - Context-free grammar, Top down parsing -

Backtracking, LL(1), Recursive descent parsing, Predictive parsing, Bottom-up parsing - Shift reduce parsing,

Operator precedent parsing, LR parsers, SLR parser, Canonical LR parser, LALR parser.

Symbol Table: Symbol table format, Block structure languages, Hashing, Tree structure representation of

scope information. Block structures and non-block structure storage allocation - Static, Runtime stack and heap

storage allocation, Storage allocation for arrays, Strings and records.

PART- II

Semantic Analysis: Abstract syntax tree, Polish notation and three address codes, Attributed grammars, Syntax

directed translation. Type checking - Type system, Type expressions, Structural and name equivalence of types,

Type conversion, Type checker.

Intermediate Code Generation: Intermediate languages, Declarations, Assignment Statements, Boolean

expressions, Case statements, Back patching, Procedure calls.

Code Generation: Issues in the design of code generator, Basic blocks and Flow graphs, DAG representation

of Basic blocks, Peephole optimization.

Code Optimization: Peephole optimization, Register allocation and assignment, Introduction to global

dataflow analysis.

Text Books:

1. A. Aho, R. Sethi and J. D Ullman, “Compilers: Principles, Techniques and Tools”, Pearson Education Asia,

2003.

2. A. Aho, “Principles of Compiler Design”, Narosa Publishers, 2002.

3. S. S. Muchnick, “Advanced Compiler Design and Implementation", Morgan Kaufmann Publishers, 1997.

4. A.W. Appel, “Modern Compiler Implementation in C: Basic Design”, Cambridge Press, 2004.



Course Code: MCA 404 (II) Title: Distributed Database Management [Sggswu-DCS] L/T/P: 3/1/0


PART- I

Distributed Database: Basic concepts of distributed databases, advantages and disadvantages of distributed

DBMS, Homogeneous and Heterogeneous DDBMS, MDBS, functions and architecture of DDBMS,

Distributed Relational Database design.

Data Allocation: centralized, fragmented, replicated. Advantages and disadvantages of data replication, Data

Fragmentation: fragmentation and its types, transparencies in DDBMS, distributed system and communication

network, Date’s twelve rules for a DDBMS.

Object Oriented Databases: Features, advantages and disadvantages of OODBMS and ORDBMS.

Comparison of Object Oriented and Object Relational databases.

Query Processing: Overview of Query Processing: Phases of Query processing, Dynamic versus Static

Optimization.

PART- II

Temporal Databases: Application, concepts, data types, valid time and transaction time.

Distributed Transactions: System Structure, System Failure Modes.

Distributed Database Availability: Majority based approach, read one write all available approach, site

reintegration, comparison with remote backup, Co-coordinator selection, trading off consistency with

availability.

Cloud Based Databases: Data storage system on the cloud, data representation, partitioning and retrieving

data, transaction and replication, traditional databases on the cloud, challenges with cloud based databases.

Textbooks:

1. Database System Concepts; Korth & Sudarshan; Tata McGraw Hill.

2. Distributed Databases - Principles and Systems; Stefano Ceri; Guiseppe Pelagatti; Tata McGraw

Hill; 1985. Fundamental of Database Systems; Elmasri & Navathe; Pearson Education; Asia.

3. Principles of Distributed Database Systems; M. Tamer Özsu; and Patrick Valduriez Prentice Hall.

Reference Books:

1. Data Base Management System; Leon & Leon; Vikas Publications.

2. Introduction to Database Systems; Bipin C Desai; Galgotia.

3. Bhatia Prateek: Simplified Approach to DBMS, Kalyani Publishers, 8th Edition.



Course Code: MCA 404 (III) Title: DESIGN & ANALYSIS OF ALGORITHMS


Lectures to be delivered: 32 LEARNING OBJECTIVES:

1. Identify the problem given and design the algorithm using various algorithm design

techniques.

2. Analyze the performance of various algorithms.

3. Discuss various algorithm design techniques for developing algorithms.

4. Analyze the asymptotic performance of algorithms.

5. Discuss various advanced topics on algorithms.

6. Define the basic concepts of algorithms and analyze the performance of algorithms.

COURSE OUTCOMES:

1. Implement various algorithms in a high level language.

2. Compare the performance of different algorithms for same problem.

3. Discuss various searching, sorting and graph traversal algorithms.

4. Analyze worst-case running times of algorithms using asymptotic analysis.

5. Describe the divide-and-conquer paradigm and explain when an algorithmic design situation

calls for it. Synthesize divide-and-conquer algorithms. Derive and solve recurrences

describing the performance of divide-and-conquer algorithms.

6. Describe the dynamic-programming paradigm and explain when an algorithmic design

situation calls for it. Recite algorithms that employ this paradigm. Synthesize dynamic-

programming algorithms, and analyze them.

7. Describe the greedy paradigm and explain when an algorithmic design situation calls for it.

Recite algorithms that employ this paradigm. Synthesize greedy algorithms, and analyze

them.

8. Understand NP completeness and identify different NP complete problems.

PART- I Introduction to Algorithm Analysis: Introduction to algorithm, Algorithms specifications,

Recursive algorithms, space and time complexity, Asymptotic Notation (O, Ω, and Θ) practical

complexities, Best, average and worst case performance of algorithms.

Divide and Conquer: General method, Binary Search, Merge sort, Quick sort, Selection sort, and

analysis of these problems.

Greedy Method: General Method, Knapsack problem, Job sequencing with deadlines,

Minimum cost spanning Trees (Prim’s algorithm, Kruskal’s minimal spanning tree), Single Source

Shortcut paths and analysis of these problems.

Dynamic Programming: General method, Optimal Binary Search Trees, 0/1 Knapsack, the

travelling salesperson problem.



PART-II

Back Tracking: General method, 8 queen's problem, Graph coloring, Hamiltonian cycles, Analysis

of these problems.

Branch-And-Bound: Method, 0/1 Knapsack and Travelling Salesperson problems, Efficiency

Considerations.

NP-hard problems: Basic concepts, NP Hard and NP complete Problems, NP-hard graph Problem

(Travelling Salesman Problem) and NP Hard Scheduling Problems.

NP-completeness: Polynomial time, Polynomial-time verification, NP-completeness & reducibility,

NP-complete problem.

Textbooks:

1 . Ellis Horowitz , Sartaj Sahni ,Sanguthevar Rajasekaran : Fundamentals of Computer Algorithms,second edition, Galgotia Publications, 2nd Edition,2008 2.Coreman, Leiserson & Rivest: Introduction to Algorithm, PHI Publication

3. Design And Analysis Of Algorithms, V.V. Muniswamy

References:

1. Aho, A.V., Hopcroft, J.E.,Ullman,J.D.,2003: The Design and Analysis of Computer Algorithms,Addison-Wesley, First Edition. 2. Algorithm Analysis & design by Harwitz and Sahni, Galgotia Publications.



Course Code: MCA 404 (IV) Title: Machine Learning [Sggswu-DCS] L/T/P: 3/1/0


PART-I

Overview and Introduction to Bayes Decision Theory: Machine intelligence and applications,

pattern recognition concepts classification, regression, feature selection, supervised learning class

conditional probability distributions, Examples of classifiers bayes optimal classifier and error,

learning classification approaches.

Linear machines: General and linear discriminants, decision regions, single layer neural network,

linear separability, general gradient descent, perceptron learning algorithm, mean square criterion and

widrow-Hoff learning algorithm; multi-Layer perceptrons: two-layers universal approximators,

backpropagation learning, on-line, off-line error surface, important parameters.

Learning decision trees: Inference model, general domains, symbolic decision trees, consistency,

learning trees from training examples entropy, mutual information, ID3 algorithm criterion, C4.5

algorithm continuous test nodes, confidence, pruning, learning with incomplete data

Part II

Instance-based Learning: Nearest neighbor classification, k-nearest neighbor, nearest neighbor

error probability.

Machine learning concepts and limitations: Learning theory, formal model of the learnable,

sample complexity, learning in zero-bayes and realizable case, VC-dimension, fundamental

algorithm independent concepts, hypothesis class, target class, inductive bias, occam's razor,

empirical risk, limitations of inference machines, approximation and estimation errors, Tradeoff.

Support Vector Machines: Margin of a classifier, dual perceptron algorithm, learning nonlinear

hypotheses with perceptron kernel functions, implicit non-linear feature space, theory, zero-Bayes,

realizable infinite hypothesis class, finite covering, margin-based bounds on risk, maximal margin

classifier.

Text Books:

1. E. Alpaydin, “Introduction to Machine Learning”, MIT Press, 2010.

2. T.M. Mitchell, “Machine Learning”, McGraw Hill, 1997.

Reference Books:

1. M. Mehryar, R. Afshin and T. Ameet, “Foundations of Machine Learning”, MIT Press, 2012.

2. S.S. Vinod Chandra and S. Anand H, “Artificial Intelligence and Machine Learning”, PHI

Learning, 2014.

3. C.M Bishop, “Pattern Recognition and Machine Learning”, Springer-Verlag, 2006.

4. Shawe-Taylor J. and Cristianini N., Cambridge, Introduction to Support Vector Machines,

University Press, 2000.



Elective-II

Course Code: MCA 405(I) Title: Oral & Written Communication


PART-I

Communication: Meaning, Nature, Importance and Purpose of Communication, Types of

Communication, Process of Communication, Communication Network in an Organisation, Strategy

for Effective Communication, Verbal and Non-Verbal Communication, Barriers to Communication,

Essentials of Good Communication, Communication Techniques.

Listening: The Process of Listening, Barriers to Listening, Types of Listening, Benefits of Effective

Listening.

Speech: Spoken English in India, The Organs of Speech, Description and Articulation of English

Speech Sounds, Syllables and Stress (Weak Forms, Intonation), Connected Speech, Spelling and

Pronunciation, Presentation Skills, Interviews, Public Speaking, Preparing the Speech, Organising

the Speech, Special Occasion Speeches.

PART-II

Personality Development: essay and precis writing, slide preparation and oral presentation

principles, written presentation of technical material, preparation of bibliography, basic of official

correspondence, preparation of bio-data, students should be asked to prepare and present seminars

during the practice session. Group discussions.

Reading Skills: Purpose, Process, Methodologies, and Strategy.

Effective Writing Skills: Elements of Effective Writing, Main Forms of Written Communication:

Agenda, Minutes, Notices, Writing of CV, Memo, Drafting an E-mail, Press Release.

Correspondence: Personal,

Official and Business, Report Writing.

Text Books:

1. Sethi, J & et al. A Practice Course in English Pronunciation, Prentice Hall of India, New Delhi.

2. Sen, Leena. Communication Skills, Prentice Hall of India, New Delhi.

3. Prasad, P. Communication Skills, S.K. Kataria & Sons. 4. Bansal, R.K. and J.B. Harrison. Spoken English, Orient Language.

Reference Books:

1. McCarthy, Michael. English Vocabulary in Use, Cambridge University Press.

2. Rajinder Pal and Prem Lata. English Grammar and Composition, SultanChand Publication.



Course Code: MCA 405(II) Title: MIS Framework and Implementation



PART-I

Management Information system: Definition, Characteristics, Components of MIS, role of

information system, nature and scope of MIS.

Information System concepts: Types of information, Information quality, dimensions of

information, value of information, general model of human as an information processor, Elements of

a system, and types of system. Role and importance of Management: Introduction, levels and

functions of management.

Structure and classification of MIS: Components of MIS, Framework for understanding MIS:

Robert Anthony’s hierarchy of management activity, Information requirements and levels of

management.

Decision making concept: types of decisions, methods of choosing among alternatives, Role of MIS

in decision making, Simon’s model of decision making, Structured and unstructured decisions.

PART-II

Development of MIS: Stages in the development of MIS, System development approaches:

Waterfall model, Prototyping, Iterative enhancement model and Spiral model.

Developing Information Systems: Analysis & Design of Information Systems: Implementation&

Evaluation, Pitfalls in MIS Development.

Types of information systems: Transaction processing systems, office Automation Systems.

Decision Support Systems: Definition and characteristics, MIS versus DSS, Tools and Models for

decision support.

Text Books:

1. D.P. Goyal, “Management Information Systems: Managerial Perspectives”,

Macmillan India Ltd.

2. Muneesh Kumar “Business Information Systems”.

References:

1. Robert G. Murdick, Joel E. Ross, James R. Claggett, “Information Systems for Modern

Management”, Prentice Hall of India Pvt. Ltd.

2. W.S. Jawadekar, “Management Information Systems”, Tata McGraw-Hill Publishing.



Course Code: MCA 405 [III] Title: CORPORATE PLANNING

[SGGSWU-DCS] L/T/P: 3/1/0 Lectures to Be Delivered: 32

PART-I

Concept of strategy: Defining strategy, Levels at which strategy operates, Decision Making and

Approaches to Strategic Decision making, essence of strategic thinking, replacing planning with

strategic thinking, strategic management process. Mission and Purpose, Objectives and Goals,

Strategic Business Units.

Environment Analysis and Diagnosis: Concept of Environment and its components, Environment

scanning and appraisal, organizational appraisal, Strategic advantage analysis and diagnosis.

Strategy Implementation: Inter-relationship between formulation and implementation; Issues in

strategy implementation, Resource Allocation, Budgets, Behavioural Issues – Leadership styles –

Charismatic, transformational, visionary, team, cross-cultural & ethical leadership, Corporate culture

and values power Social Responsibilities – Ethics, Building capable organization; Functional Issues –

Financial, Marketing, Operations and Personnel Plans and policies.

PART-II

Strategy and Structure: Organization structure, Structural Considerations, Structure for strategies,

Organizational design and change, Matching structure and strategy.

Strategy Formulation and Choice of Alternatives: Grand Strategies –Stability, growth,

retrenchment & combination strategies- Modernization, Diversification, Integration, Merger, Take-

over and Joint Venture strategies, Turnaround – divestment and Liquidation strategies. Strategies for

competing in globalizing markets. Process of Strategic Choice – Process of strategic choice – Gap

analysis. Industry analysis, competitor analysis - Porter’s Five Forces Model of competition

Strategy Evaluation: Importance, Overview of strategic evaluation, strategic control, techniques of

strategic evaluation and control, Operational Control. Corporate Governance – Introduction &

meaning, who are stakeholders? ownership& management, governing board, governance issues,

governance & strategic implementation.

Text Books:

1. Business Policy –Azhar Kazmi –S.Chand &Co. New Delhi

2. Strategic Management: Concepts & Cases – Upendra Kachru, Excel Books.

3. Strategic Planning: Formulation of Corporate strategy – V.S. Ramaswamy, S. Namakumari-

Macmillan Publishing House Ltd.

Reference Books:

1. Management Policy & Strategic Management – R.M.Shivastava, Himalaya Publishing House,

Mumbai.

2. Creating Excellence – Craig R. Hickman & Michael A. Silva – London Univeral Book Stall, New

Delhi.

3. Organizational Behaviour- Stephen P. Robbinson – PHI, New Delhi.



Course Code: MCA 501 Title: Computer Graphics [SGGSWU-DCS] L/T/P: 3/1/2


PART- I

Computer Graphics: Introduction, Applications areas, Components of Interactive Computer

Graphics System. Input devices: Keyboard, Touch panel, Light pens, Graphic tablets,

Joysticks, Trackball, Data glove, Digitizer, Image scanner, Mouse, Voice Systems.

Hard copy output devices: Impact and non-impact printers, such as line printer, dot matrix,

laser, ink- jet, electrostatic, flatbed and drum plotters.

Video Display Devices: Refresh cathode ray tube systems – raster scan CRT displays,

random scan CRT display, Color CRT-monitors, direct view storage tube. Flat panel displays

– emissive Vs non emissive displays, LCD displays, plasma panel displays, 3-D viewing

devices, virtual reality, Color Look-up tables. Screen co-ordinates, user co-ordinates, use of

homogeneous coordinates, Display code generation. Graphical functions. Scan Conversion

Line algorithm (DDA and Bresenham Line Algorithm), Circle (Polar, Bresenham and

midpoint circle Algorithm), Ellipse (Polar and midpoint Algorithm), Character generator,

Limitations of Scan conversion.

Pointing and positioning devices: cursor, light pen, digitizing tablet, the mouse, track

balls; Interactive graphical techniques, Positioning: Elastic or Rubber Band lines,

Linking, zooming, panning, clipping, windowing, scissoring.

PART-II

2-dimensional Graphics: 2D Cartesian and homogeneous co-ordinate system, Geometric

transformations (Translation, Scaling, Rotation, Reflection, Shearing), Composite

Transformations, 2D viewing and clipping (Cohen-Sutherland, Sutherland-Hodge man

algorithms.

3-dimensional Graphics: 3D Cartesian and Homogeneous co-ordinate system, Geometric

transformations (Translation, Scaling, Rotation, Reflection), Composite Transformations.

3-D Graphics: Wire-frame, perspective projections, Anomalies of perspective

projection, parallel projections. Hidden line and surface elimination (Black face

removal algorithm, Z-Buffer algorithm). Mouse Programming.



Syllabus for Practical: Course Code: MCA 501L Implementation of studied concepts.

Textbooks : 1.D. Hearn and M.P. Baker, “Computer Graphics”, PHI New Delhi; Second Edition, 1995.

2.R.A.Plastock & ZHIGANG Xiang “Computer Graphics”Schaum Outlines 2 nd edition References:

1.J.D. Foley, A.V. Dam, S.K. Feiner, J.F. Hughes,. R.L Phillips, ”Introduction to Computer Graphics”, Addison-Wesley Publishing company, N.Y.; Second Edition,1994. 2.R.A. Plastock and G. Kalley, “Computer Graphics”, McGraw Hill, 1986.

3.J.D. Foley, A.V. Dam, S.K. Feiner, J.F. Hughes, R.L. Philips,”;Introduction to Compute

Graphics”Addisen- Wesley Publishing Company, N.Y., 2 nd editi



Course Code: MCA 502 Title: Python Programming [SGGSWU-DCS] L/T/P: 3/1/2


PART-I

Python Programming Language: Introduction, History and Origin of Python Language, Features of

Python, Limitations, Major Applications of Python, Getting, Installing Python, and Environment

Variables, Running Python, Python Interactive Help Feature, Python differences from other languages.

Python Data Types & Input/Output: Keywords, Identifiers, Variables, Multiple Assignment,

Understanding Data Type, Data Type Conversion, Basic syntax of Writing and executing simple

program.

Operators and Expressions: Operators in Python, Expressions, Precedence, Associativity of

Operators, Non Associative Operators.

Control Structures: Decision making statements, Python loops, Python control statements.

PART-II

Python Native Data Types: Numbers, Lists, Tuples, Sets, Dictionary, Functions & Methods of

Dictionary, Strings (in detail with their methods and operations).

Python Functions: Functions, Advantages of Functions, Built-in Functions, User defined functions,

Anonymous functions, Function parameters, Formal parameters, Actual parameters, Global and Local

variables.

Python Modules: Module definition, need of modules, creating a module, importing module, Path

Searching of a Module, Module Reloading, Standard Modules, Python Packages.

Input and Output: Introduction to Output Formatting, Reading and Writing Files, Errors and

Exception Handling.

Syllabus for Practical: Course Code: MCA 502L Implementation of studied concepts.

Textbooks:

1. Programming in Python, Pooja Sharma, BPB Publications, 2017

2. Programming with python, A users Book, Michael Dawson, Cengage Learning

3. Python Essential Reference, David Beazley, Third Edition.

Reference books:

1. Core Python Programming, R. Nageswara Rao, 2nd Ediiton, Dreamtech. 2. Python, The complete Reference, Martin C. Brown, Mc Graw Hill Education. 3. Python Bible.



Course Code: MCA 503 Title: Institutional Training [SGGSWU-DCS] L/T/P: 2/0/0

Concepts of Reasoning, Aptitude, computer fundamentals and applications



ELECTIVE-I

Course Code: MCA 504-[I] Title: Artificial Intelligence [SGGSWU-DCS] L/T/P: 3/1/0


PART- I

Introduction to Artificial Intelligence: Definition, Problems of AI, AI Technique, Turing test, History

and developments in AI, Applications of AI, Architecture of AI, Characteristics of AI, , production

systems, Various types of production systems, Problem state space, Travelling Sales problem, Block

World Problem and its state representation, 8-Puzzle Problem, theorem proving.

Search Algorithms: Uninformed Search Algorithms (Breadth first search and Depth first search,

Advantages and disadvantages of DFS and BFS, Difference between DFS and BFS, DFS with iterative

deepening), Generate and test; Informed Search Algorithms (Define heuristic function, Desirable

properties of heuristic search, Simple hill climbing Problem, Steepest ascent hill climbing, Problems in

hill climbing search methods, Best first search.

Knowledge Representation: Knowledge representation and mapping, example of representation

mapping, Approaches of Knowledge Representation, issues in knowledge representation, procedural vs

Declarative knowledge, Forward and Backward Reasoning, Theorem Proving, Inferencing, Structured

Knowledge: Semantic networks, Partitioned Semantic Nets, Strong Slot and Filler Structures, Scripts.

Game Playing: Define adversarial Search, Mini-Max search procedure, reducing alternatives using

Alpha-Beta pruning method examples.

PART-II

Uncertain Knowledge and Probabilistic Reasoning: define uncertainty, knowledge representation in

uncertain domain, Probabilistic Reasoning: Define probability, Joint Probability, Conditional probability,

Probabilistic Techniques: Bayes; Theorem.

Intelligent Agents: definition, tasks performed by intelligent agents, Structure of intelligent agents, agents

and environment: relation between agent and is environment, types of environment for agents; Types of

Agents, , role of communication for an intelligent agent, Types of communicating agents, problem solving

agents, rational agent, rationality, software agent, characteristics of software agent, Agent Architecture.

Learning: definition, Components of a learner System, Types of Learning: rote learning, by taking advice

induction, analyzing differences, explaining differences, correcting mistakes, recording cases, analogical

learning, explanation-based, formal learning, neural net, learning from observation, direct instruction,

deduction; models of learning agents: basics of Supervised Learning and Unsupervised Learning.

Expert Systems: Introduction, Components, characteristics, Applications, Comparison of conventional

computer systems and expert systems, Case studies of expert systems: MYCIN, EMYCIN, and

DENDRAL. Expert Systems used in real life.



Textbooks:

1. George F. Luger, Artificial Intelligence, 5th edition, Pearson Education. 2. Dan W. Patterson Introduction to Artificial Intelligence and Expert system PHI. 3. Winston, P.H. and Horn, B.K.P.: LISP, Pearson.

References : 1. Rajasekharan, S. and Vijayalakshmi Pai, G. A.: Neural Networks, Fuzzy Logic and Genetic

Algorithms,Prentice Hall of India. 2. Russel & Norvig: Artificial Intelligence, Pearson.



Course Code: MCA 504[II] Title: System Simulation



PART-I

Introduction: Systems, modeling, general systems theory, Concept of simulation, Simulation as a

decision making tool, types of simulation. Simulation Terminologies- Application areas – Model

Classification –Types of Simulation- Steps in a Simulation study- Concepts in Discrete Event

Simulation - Simulation Examples.

Statistical Models Concepts: Discrete Distribution, Continuous Distribution, Poisson Process,

Empirical Distributions, Queueing Models, Characteristics, Notation, Queueing Systems, Markovian

Models, Properties of random numbers, Generation of Pseudo Random numbers, Techniques for

generating random numbers, testing random number generators Generating Random-Variates, Inverse

Transform technique, Acceptance, Rejection technique, Composition & Convolution Method.

PART-II

Design of Simulation Experiments: Problem formulation, data collection and reduction, time flow

mechanism, key variables, logic flow chart, starting condition, run size, experimental design

consideration, output analysis and interpretation validation, input modeling, Data collection, Assessing

sample independence, Hypothesizing distribution family with data, Parameter Estimation, Goodness-

of-fit tests, Selecting input models in absence of data, Output analysis for a Single system, Terminating

Simulations, Steady state simulations. Development of simulation models using simulation language

studied for systems like queuing systems, Production systems, Inventory systems, maintenance and

replacement systems and Investment analysis.

Simulation Tools: Model Input, High level computer system simulation, CPU –Memory Simulation,

Comparison of systems via simulation – Simulation Programming techniques - Development of

Simulation models. Simulation programming languages – simulation suitability with characteristics,

Comparison and selection of simulation languages, study of any one simulation language.



Textbooks:

1. Jerry Banks and John Carson, “ Discrete Event System Simulation”, Fourth Edition, PHI,

2005.

2. 2. Geoffrey Gordon, “System Simulation”, Second Edition, PHI, 2006.

Reference books:

1. Narsingh Deo, “System Simulation with Digital Computer, “Prentice Hall, India, 2001. 2. Jerry Banks, “Handbook of Simulation: Principles, Methodology, Advances, Applications and

Practice”, Wiley, 1998.



Course Code: MCA 504[ III] Title: Multimedia and its Applications



PART-I

Introduction: Multimedia and its types, Introduction to Hypermedia, Hyper Text, Multimedia Systems and

their Characteristics, Desirable Features, Components and Applications.

Multimedia Technology: Multimedia Systems Technology, Multimedia Hardware devices, Multimedia

software development tools, Multimedia Authoring Tools, Multimedia Standards for Document Architecture,

Multimedia Standards for Document interchange.

Basics of Compression: Classifying Compression Algorithms, Lossless Compression Algorithms, Entropy

Encoding, Run length Encoding, Pattern Substitution, Basics of Information theory, Huffman Coding.

PART-II

Audio: Basics of Digital Audio, Application of Digital Audio, Digitization of Sound, Sample Rates and

BitSize, Nyquist's Sampling Theorem, Introduction to MIDI (Musical Instrument Digital Interface),

Components of a MIDI System, MIDI Messages.

Image and Graphics Compression: Colour in Images, Types of Colour Models, Graphic/Image File

Formats: TIFF, RIFF, BMP, PNG,PDF.

Video Compression: Basics of Video, Video Signals, Analog Video, Digital Video, TV standards, H.261

Compression, Intra Frame Coding, Inter-frame (P-frame) Coding, MPEG Compression.

Text Books :

1. Ralf Steinmetz amd KlaraNahrstedt: Multimedia Computing Communications and Applications By

Pearson Educations

2. ParagHavaldar, Gerard Medioni: Multimedia Systems, Cengage Learning, 2009

3. John F Koegel, Buford, “ Multimedia System”, Pearson Education

Reference Books:

1. Prabhat K. Andleigh, Karan Thakkar: Multimedia System Design, PHI,

2. Li, Drew: Multimedia Computing, Pearson Education



Course Code: MCA 504[ IV] Title: Cloud Computing



PART-I

Introduction of Computing Paradigms: Overview of existing computing paradigms, Cluster computing,

Grid computing, Utility computing, Introduction to cloud computing, Cloud computing history and evolution,

Essential characteristics of cloud computing, Cloud benefits, The NIST model of cloud computing.

Cloud Computing Architecture: The cloud reference model architecture, Cloud based services,

Infrastructure as a service (IaaS), Platform as a service (PaaS), Software as a service (SaaS), Cloud

deployment scenarios, Public cloud, Private cloud, Hybrid cloud and Community cloud.

Virtualization: Virtualization and cloud, Characteristics of virtualization, Types of virtualization- Resource

virtualization, Server, Storage and Network virtualization, Hypervisors. Data center- Classic data center,

Virtualized data center.

PART-II

Cloud Terminology: Resource Provisioning, Multitenancy and Isolation, Service Level Agreement(SLA)

and Quality of Service(QOS) , Introduction to big data and Internet of things(IOT).

Issues and Security in cloud: Cloud computing issues and challenges like security, Cloud security,

Understanding security risks, Data security, Privacy Management, Security as a Service on cloud ,Cloud

security reference model, Encryption and key management in the cloud, Identity management.

Mobile Cloud Computing: Overview of mobile cloud computing, Advantages, Challenges, using

smartphones with the cloud, Offloading techniques - their pros and cons, Mobile cloud security.

Text Books:

1. R. K. Buyya, J. Broberg and A.M.Goscinski, “Cloud Computing: Principles and Paradigms”, 2011.

2. B. Sosinsky, “Cloud Computing Bible”, Wiley India Pvt. Ltd, 2013.

3. M. Miller, “Cloud Computing”, Que Publishing, 2008.

Reference Books:

1. A. Velte, T. Velte and R. Elsenpeter, “Cloud Computing: A practical Approach”, Tata McGrawHill,

2012.

2. J. Rittinghouse and J. F. Ransome, “Cloud Computing: Implementation, Management, and Security”,

CRC Press Taylor and Francis Group, 2010.



ELECTIVE-II

Course Code: MCA 505 [I] Title: Organizational Behaviour


PART-I

Introduction to Organizational Behaviour: Introduction to organization behaviour, Importance of

Organizational Behaviour, Key Elements of Organizational Behavior, challenges and opportunities

managers have in applying OB concepts, OB model (including motivation models) and levels of OB model.

Introduction to Personality: Definition and Meaning of Personality, Importance of Personality,

Determinants of Personality, Theories of Personality, Personality Traits Influencing OB, job

satisfaction, perception and individual decision making, learning processes rewards systems, motivation at

work: motivating performance through job design and goal setting, managing emotions and stress

(Meaning-Definition Stress and job performance relationship Approaches to stress management ,Coping with

stress).

PART-II

Interpersonal behaviour: Interpersonal Behaviour and group behaviour, foundations of group behaviour,

Understanding conflicts and its dimensions. Goal congruence and group Behaviour & dynamics.

Horizons for Organizational Behaviour: International Organizational Behaviour (IOB), the impact

of culture on IOB, Communication in IOB, motivation across culture, managerial leadership across

cultures Organizational Change & Development: Learning objectives, the changes facing

organizations, managing change and organizational development, future of organizational Behaviour.

Text Books:

1. Robbins, S. P/ Judge, T. A/ Sanghi, S., Organizational Behavior, Pearson Publication.

2. Aswathappa, K., Organisational Behaviour– Text and Problem, Himalaya Publication.

3. 1. Fred Luthans “Organizational Behavior”, McGraw Hills international Edition,

Management & Organization series.

References:

1. Colquitt, J. A., Lepine, J. A., & Wesson, M. A. 2009. Organizational behavior: Essentials for improving

performance and commitment. McGraw-Hill/Irwin.

2. Pardeshi, P. C., Organizational Behaviour & Principles & Practice Of Management, Nirali

publication



Course Code: MCA 505 [II] Title: Management of Software Projects


PART-I

Introduction to Software Project Management: The management spectrum, the people, the

product, the process and the project, W5HH Principle.

Software Project: The characteristics of software projects, Reasons for IT project failure,

Objectives of project management: time, cost and quality, Basics of Project Management,

Stakeholders, Stages of Project, Activities Covered by Software Project Management, Project and

Product Life Cycles, Project Management Knowledge areas, Project success factors, role of project

manager.

Project Management: Project Evaluation and Planning, Monitoring and Control, Project Scope

Management, Project Risk Management, Project Human Resource Management, Project

Communication Management, Project Procedure Management.

Project Estimation: Software Project Estimation, Estimation Models, COCOMO Model.

PART-II

Risk Management: Concepts of Risks and Risk Management, Aids for Risk Identification; Risk

Projection; Risk refinement, mitigation, monitoring and management, RMMM Plan.

Software Configuration Management: Software Configuration Management (SCM) – Baselines,

Software Repository, SCM Process; Identification of Objects in the Software Configuration; Version

Control; Change Control; Configuration Audit; Status Reporting; Goals of SCM.

Software Quality Assurance: Elements, tasks, goals, attributes, Formal approaches to SQA,

Statistical Software Quality Assurance, and SQA Plan, Software reliability, ISO 9000 Quality

Standards, Formal Technical Reviews.

Software Quality Standards – ISO Standards for Software Organization, Capability Maturity Model

(CMM), Comparison between ISO 9001 & SEI CMM, Other Standards.

Text Books: 1. Roger S. Pressman, Software Engineering: A Practitioner's Approach, 5th McGraw-Hill

Higher Education ©2001, ISBN:0072496681

2. Software Quality: Concepts and Plan, by Robert H Dunn Prentice Hall International

3. Bob Hughes, Mike Cotterell and Rajib Mall, Software Project Management, Third Edition,

Tata McGraw-Hill.

Reference Books:

1. Gopalaswamy Ramesh, Managing global software Projects: How to lead geographically

distributed Teams, Manage Processes and Use Quality Models, Tata McGraw-Hill.

2. Pankaj Jalote, Software Project Management in Practice, Pearson Education.



Course Code: MCA 505 [II] Title: Investment Technology


PART-I

An Overview of the Financial System: Saving and Investment, Money, Inflation and Interest,

Banking and Non-Banking Financial Intermediaries, systematic behavioral factors that influence

investment behavior.

Valuation of debt securities: Debt prices and interest rate risk. Default risk and purchasing power

risk. Market interest rates and term structure of interest rates. Valuation of warrants and convertibles.

Option pricing models.

Valuation of equity shares: Dividends and valuation: MMS arguments, fundamental analysis.

Earning multipliers. Timing of purchase and sale of equity shares. Estimating earnings and risk.

Portfolio theory. Efficient investments and diversification. Markowitz graphical portfolio analysis.

Capital market theory. Portfolio performance evaluation - sharpe. Treynor. Jenson measures.

Mutual funds - kinds and evaluation. Behaviour of share prices - technical analysis. The efficient

markets. Hypothesis - random walk and Martingale methods.

PART-II

Investment Decision Cycle: Judgment under Uncertainty, investment in cutting-edge research and

development.

Foreign Investment Analysis: Direct and Portfolio, Cost of Capital of a Foreign Investment,

International Investment Issues, Inter-sectoral linkages and role of foreign direct investment.

Investment in Human Capital: Individual’s choice of educational attainment, Costs and benefits of

human capital investments.

Corporate Investment Decisions: Introduction, Cash Flow Projection, Evaluation Techniques.

Text Books: 1. Clark N.. et. al. "Financial Management: A Capital Market Approach". Helbrook, 1976.

2. Sharpe. W.F., "Investments". Prentice Hall of India. New Delhi. 1996.

References:

1. Investments, by Zvi Bodie, Alex Kane, and Alan J. Marcus (9th ed.), McGraw-Hill.



Course Code: MCA 506p Title: Six Week Project [SGGSWU-DCS]

The Project Period Will Be 6 Weeks Duration. The Project Work Will Carry 200 Marks.

Guidelines for Submission of Project Report

The Report Should Consist of the Following:

• Cover Page Including Project Title, Name of The Student, Name of The Department and Names of the Project Guides.

• Acknowledgements. • Certificates from Company and Department Duly Signed by Project Guides. • Contents with Page Numbers. • List of Figures and Tables If Any.

• Introduction That Includes Background and Application or Importance of the

Project. • Objectives. • Software Requirement Specifications. • Design with System Flowcharts and Input/Output Design. • Hardware and Software Used. • Listing of Well Commented Programs with Result/Output or Detailed Algorithms With

Input and Output. Each Student Should Observe the Following Norms While Submitting the Synopsis/Thesis for The Project: -

1. Type Style and Spacing: Same Type Style and Font Should Be Used Throughout the Synopsis/Thesis and Should Be Justified. All Printing Should Be Single Side. As Per Following Specifications:

Font – Times New Roman Chapter Title – 16 Bold

Heading – 14 Bold (1.1, 1.2 Etc), Subheading – 12 Bold (1.1.1, 1.2.2 Etc) Body Font Size – 12 Line Spacing – 1.5 Lines Margins – Top, Bottom & Right – 1 Inch Each and Left – 1.5 Inch (Including Binding) Page Size – Standard A4 Binding- Spiral Binding



SIXTH SEMESTER



Course Code: MCA601 Title: Project Work [SGGSWU-DCS] The Project Period Will Be 14 To 17 Weeks Duration. The Project Will Involve Development of

Application or System Software In Industries, Commercial Or Scientific Environment. The Project

Work Will Carry 400 Marks.

Guidelines for Submission of Project Report

The Report Should Consist of the Following:

1. Cover Page Including Project Title, Name of The Student, Name of The Department And

2. Names of The Project Guides (Both External and Internal).

3. Acknowledgements.

4. Certificates from Company and Department Duly Signed by External Guide and Internal

5. Guide.

6. Contents with Page Numbers.

7. List of Figures and Tables If Any.

8. Introduction That Includes Background and Application or Importance of the Project.

9. Objectives.

10. System Analysis.

11. System Feasibility Study:

12. Software Requirement Specifications.

13. Design with System Flowcharts and Input/Output Design.

14. Implementation and Testing

15. Hardware and Software Used.

16. Listing of Well Commented Programs with Result/Output or Detailed Algorithms with Input

and Output.

17. Further Scope of the Project:



18. Bibliography.

19. Appendices

Each Student Should Observe the Following Norms While Submitting the Synopsis/Thesis for The

Project: -

Type Style and Spacing: Same Type Style and Font Should Be Used Throughout the

Synopsis/Thesis and Should Be Justified. All Printing Should Be Single Side. As Per

Following Specifications:

Font – Times New Roman

Chapter Title – 16 Bold

Heading – 14 Bold (1.1, 1.2 Etc), Subheading – 12 Bold (1.1.1, 1.2.2 Etc) Body

Font Size – 12

Line Spacing – 1.5 Lines

Margins – Top, Bottom & Right – 1 Inch Each and Left – 1.5 Inch (Including Binding) Page

Size – Standard A4

Binding- Hard Binding of Black Color.



Students Must Consult/Inform The Internal Guides Regarding the Progress of Their Work at Least

Once in 20 Days. It Is the Duty of the Student to Be in Touch with His/Her Internal Guide. The Student

Must Prepare 3copies of The Report Including One Copy for Self. The Remaining Two Are to Be

Submitted Before 15th May in Library and to Internal Guide.

One Softcopy of the Work Is to Be Submitted to The Concerned Head of the Department. The Student

Must Present His/Her Work in 15 Minutes Mainly Focusing On His/Her Contribution with The Help

of Slides Followed by Demonstration of the Practical Work Done. The Project Viva Will Be

Completed Before 31st May. Project Viva Will Be Conducted by an External Examiner, Internal

Examiner and The Internal Guide.

Sri Guru Granth Sahib World University Fatehgarh Sahib · 2020. 5. 28. · 3 1 _ 4 40 60 MCA103...

Documents

Transcript of Sri Guru Granth Sahib World University Fatehgarh Sahib · 2020. 5. 28. · 3 1 _ 4 40 60 MCA103...