MCA Concise Syllabus 18-19

NIE, Mysuru – 570 008 Department of MCA
THE NATIONAL INSTITUTE OF ENGINEERING

MYSURU – 570 008
(Autonomous Institution under VTU)
Master of Computer Applications
Scheme of
MCA
( 2018 – 2019 )
Department of MCA
Master of Computer Applications
Vision of the Institution
“NIE will be a globally acknowledged institution providing value based technological

and educational services through best-in-class people and infrastructure”
Mission of the Institution
 To impart state-of-the-art engineering education through strong theoretical foundations and

practical training to students in their choice of specialization.
 To create new knowledge through innovation and cutting-edge research in science and
engineering.
 To provide a platform for inclusiveness and collaboration by following ethical and

responsible engineering practices for long-term interaction with academia and industry.
 To encourage entrepreneurship and to develop sustainable technologies for the benefit of

global society.
Vision of the Department
“MCA will be an outstanding department contributing significantly to teaching, research

and consultancy, through well equipped laboratories and well trained staff to meet global
challenges in the field of computer engineering & applications”
Mission of the Program
 To impart quality technical education and provide skills in Computer Application through
best of practices.
 To produce graduates who can contribute professionally to the society and widely as IT
professionals or entrepreneurs.
Graduate Attributes
1. Computational Knowledge: Apply knowledge of computing fundamentals,

computing specialization, mathematics and domain knowledge appropriate for the
computing specialization to the abstraction and conceptualization of computing models
from defined problems and requirements.
2. Problem Analysis: Identify, formulate, research literature and solve complex

computing problems reaching substantiated conclusions using fundamental principles
of Mathematics, Computing Sciences and relevant domain disciplines.
3. Design / Development of solutions: Design and evaluate solutions for complex

computing problems and evaluate systems, components or processes that meet
specified needs with appropriate considerations for public health and safety, cultural
societal and environmental considerations.
4. Conduct Investigations of complex computing problems: Use research based

knowledge and research methods including design of experiments, analysis and
interpretation of data and synthesis of the information to provide valid conclusions.
5. Modern Tool Usage: Create, select, adopt and apply appropriate techniques, resources
and modern computing tools to complex computing activities with an understanding of
the limitations.
6. Professional Ethics: Understand and commit to professional ethics and cyber

regulations, responsibilities and norms of professional computing practice.
7. Life Long Learning: Recognize the need and have the ability to engage in independent
learning for continual development as a Computing Professional.
8. Project Management and Finance: Demonstrate knowledge and understanding of the

computing and management principles and apply these to once own work as a member
and leader in a team to manage projects and in multidisciplinary environments.
9. Communication Efficacy: Communicate effectively with the computing community

and society at large about complex computing activities by being able to comprehend
and write effective reports and design documentation, make effective presentations and
give and understand clear instructions.
10. Societal and environmental concern: Understand and assess societal, environmental,
health safety, legal and cultural issues within local and global contexts and
consequential responsibilities relevant to professional computing practice.
11. Individual and Team work: Function effectively as an individual and as a member or
leader in diverse teams in multi-disciplinary environments.
12. Innovation and entrepreneurship: Identify a timely opportunity and using innovation
to pursue that opportunity to create value and wealth for the betterment of the individual
and society at large.
Program Educational Objectives

The Department will produce graduates who
PEO1: Work productively as IT professional both at supportive and leadership roles.
PEO2: Advance Successfully in their chosen career path utilizing technical abilities, leadership
qualities, communication and interpersonal skills with high regard to legal and ethical
responsibilities.
PEO3: Build their profession adopting to the changes in the technology with lifelong learning.
Program Specific Outcomes
PSO1: MCA graduates will be able to understand and analyze computer systems, focused
with hardware, software and application needs.
PSO2: Develop software and hardware systems/solutions, with a knowledge of software

design life cycle process and skills with a broad range of programming tools and platforms.
Program Outcomes
Graduates will have an
PO1: Ability to apply knowledge of mathematics, computer science and domain knowledge
to solve problems in the computational world.
PO2: Ability to analyze real world/scientific problems and convert them to computable
algorithm.
PO3: Ability to evaluate, analyze and use available technological solutions to design and
implement the same.
PO4: Ability to work with complex computing problem environment, use knowledge both
technical and research to provide valid conclusions of experiments based on analysis
and interpretation of data.
PO5: Ability to use/evaluate the various software tools and networking requirements for
solutions.
PO6: Ability to adhere to the professional ethics, follow cyber rules and regulations and be
a responsible citizen.
PO7: Ability to be a lifelong learner in the field of computer science.
PO8: Ability to demonstrate the knowledge and understanding hardware, software,

networking and Finance requirements for the Society
PO9: Ability to communicate effectively with the fellow members and with other uses of
the computing community and society.
PO10: Ability to experience the industrial environment for understanding the impact of
computational solutions in a global and societal context.
PO11: Ability to function effectively as an individual and work collaboratively in a team.
PO12: Ability to become leaders, entrepreneurs, and provide solutions to complex problems
in life.
SCHEME OF TEACHING AND EXAMINATION

FIRST SEMESTER MCA
Contact
Exam
Sl. Sub. Hrs/
Subject Title Category Credits Marks Duration
No Code Week
L T P CIE SEE Total (Hrs)
Discrete
1 MCA0401 Mathematical Core 4 0 0 4 50 50 100 3
Structures
Introduction to
2 MCA04xx Unix and C Core 4 0 0 4 50 50 100 3
Programming
Web Core
3 MCA03xx 3 0 0 3 50 50 100 3
Technologies
Computer Core
4 MCA0452 4 0 0 4 50 50 100 3
Organization
Data Core
5 MCA03xx 3 0 0 3 50 50 100 3
Communications
Unix and C
6 MCA01xx Lab 0 0 3 1.5 50 - 50 -
Laboratory
Web
7 MCA0116 Technologies Lab 0 0 3 1.5 50 - 50 -
Laboratory
TOTAL 18 0 6 21 350 250 600
SECOND SEMESTER MCA
Contact Exam
Sl.
SubCode Subject Title Category Hrs/Week Credits Marks Duration
No
System Core
1 MCA0411 4 0 0 4 50 50 100 3
Programming
Data Structures Core
2 MCA0405 and Algorithms 4 0 0 4 50 50 100 3
with C
Operating Core
3 MCA0414 4 0 0 4 50 50 100 3
System
Introduction to Core
4 MCA03xx Python 2 0 2 3 50 50 100 3
Programming
Data Base Core
5 MCA03xx Management 3 0 0 3 50 50 100 3
Systems
Data Structures
6 MCA0102 LAB 0 0 3 1.5 50 - 50 -
Laboratory
DBMS
7 MCA01xx LAB 0 0 3 1.5 50 - 50 -
Laboratory
TOTAL 17 0 8 21 350 250 600

THIRD SEMESTER MCA
Contact Exam
Sl. Credits
Sub Code Subject Title Category Hrs./Week Marks Duration
No
Object
Oriented
1 MCA04xx Core 4 0 0 4 50 50 100 3
Programming
with Java
Analysis &
2 MCA0412 Design of Core 4 0 0 4 50 50 100 3
Algorithms
Computer
3 MCA0418 Core 4 0 0 4 50 50 100 3
Networks
4 MCA03xx Elective - 1 Elective 3 0 0 3 50 50 100 3
Management
5 MCA03xx Information Management 3 0 0 3 50 50 100 3
Systems
Algorithms
6 MCA0106 Lab 0 0 3 1.5 50 - 50 -
Laboratory
Java
7 MCA0117 Programming Lab 0 0 3 1.5 50 - 50 -
Laboratory
TOTAL 18 0 6 21 350 250 600
FOURTH SEMESTER MCA
Contact Exam
Sl. Credits
Sub Code Subject Title Category Hrs/ Week Marks Duration
No
Advanced Java Core
1 MCA0455 4 0 0 4 50 50 100 3
Programming
Advanced Web Core
2 MCA0456 3 0 0 3 50 50 100 3
Programming
Software Core
3 MCA03xx 3 0 0 3 50 50 100 3
Engineering
Core
4 MCA03xx Cloud Computing 3 0 0 3 50 50 100 3
5 MCA03xx Elective – 2 Elective 3 0 0 3 50 50 100 3

Minor
6 MCA0120 Minor Project 0 0 3 2 50 - 50 -
Project
7 MCA0115 Seminar – 1 Seminar 0 0 1 1 50 - 50 -
Advanced Java
Laboratory
Advanced Web
Laboratory
TOTAL 17 0 10 22 450 300 700


FIFTH SEMESTER MCA
Contact Exam
Sl. Subject
Sub Code Category Hrs./Week Credits Marks Duration
No Title
Object Core
Oriented
1 MCA0420 Modeling 4 0 0 4 50 50 100 3
and Design
Patterns
Core
2 MCA03xx .Net and C# 3 0 0 3 50 50 100 3

Industry Industry
5 MCA02xx Driven Driven 2 0 0 2 50 50 100 3
Elective Elective
Research Research
6 MCA01xx 2 0 2 50 50 100 -
Methodology Methodology
7 MCA0201 Seminar - 2 Seminar 0 0 2 2 50 - 50 -
Software
8 MCA0112 Design Lab 0 0 3 1.5 50 - 50 -
Laboratory
.Net
9 MCA0113 Lab 0 0 3 1.5 50 - 50 -
Laboratory
TOTAL 13 0 8 22 450 250 700
SIXTH SEMESTER MCA
Contact Exam
Sl. Subject
Subject Title Category Hrs./Week Credits Marks Duration
No Code
1 MCA0xx Internship Internship - - - 09 50 - 50 -
Major
2 MCA1201 Major Project - - - 16 150 75 225 3
Project
TOTAL 25 100 150 275
Pattern of the course evaluation for both CIE and SEE is to be mention in the abridged lesson
plan and the Course Instructor (CI) will discuss the same with the students during the
first/second session of the semester.
Suggested Plan of Study for Regular Students
Semester
I II III IV V VI
Sl. No.
1 MCA0401 MCA0411 MCA0453 MCA0455 MCA0420 MCA0xxx
2 MCA04xx MCA0405 MCA0412 MCA0456 MCA03xx MCA01201
3 MCA03xx MCA0414 MCA0418 MCA03xx ELEC - 3
4 MCA0452 MCA03xx ELEC - 1 MCA03xx ELEC - 4
5 MCA03xx MCA03xx MCA03xx ELEC - 2 MCA02xx
6 MCA0101 MCA0102 MCA0106 MCA0120 MCA01xx
7 MCA0116 MCA01xx MCA0117 MCA0115 MCA0201
8 MCA0118 MCA0112
9 MCA0119 MCA0113
Total Cr. 21 21 21 22 22 25
Regular Student has to earn 132 credits
Suggested Plan of Study for Lateral Entry Students
Semester
III IV V VI
Sl. No.
1 MCA0453 MCA0455 MCA0420 MCA0xxx
2 MCA0412 MCA0456 MCA03xx MCA01201
3 MCA0418 MCA3xx ELEC - 3
4 ELEC - 1 MCA03xx ELEC - 4
5 MCA03xx ELEC - 2 MCA02xx
6 MCA0106 MCA0120 MCA01xx
7 MCA0117 MCA0115 MCA0201
8 MCA0118 MCA0112
9 MCA0119 MCA0113
Total Cr. 21 22 22 25
Lateral Entry Student has to earn 90 credits
Student has to earn 125 credits to get the degree of MCA
Semester Credits
First semester 21 Credits
Second semester 21 Credits
Third semester 21 Credits
Fourth semester 22 Credits
Fifth semester 22 Credits
Sixth semester 25 Credits
Total Credits 132 Credits
Department Electives
ELECTIVE – 1
SUB. CODE SUBJECTS CREDITS
MCA03xx UNIX System Programming 3
MCA03xx Computer Graphics and Visualization 3
MCA03xx Web 2.0 and Rich Internet
3
Applications
MCA03xx Linux System Programming 3
ELECTIVE – 2
MCA03xx Software Architectures 3
MCA03xx Multimedia Systems 3
MCA03xx Information and Network Security 3
MCA03xx Mobile Programming 3
ELECTIVE – 3
MCA03xx Data Mining 3
MCA03xx Digital Image Processing 3
MCA03xx Introduction to Artificial Intelligence 3
MCA03xx Big Data Analytics 3
ELECTIVE – 4
MCA03xx Internet of Things 3
MCA03xx Introduction to Machine Learning 3
MCA03xx Principles of User Interface Design 3
MCA03xx Introduction to Data Science 3
Industry Driven Electives
INDUSTRY DRIVEN ELECTIVE

MCA02xx Subject offered by Industry expert 2
I MCA
Discrete Mathematical Structures (4:0:0)

Sub Code : MCA0401 CIE : 50%
Hrs/Week : 04 SEE : 50%
SEE Hrs : 03 Max. Marks : 100
Course Outcome: On successful competition of the course the students will be able to
1. Solve problems using operation on sets, Inclusion - Exclusion principles and problems
on basic probability.
2. Construct the matrix, digraphs of relations and explain some results on different types
of relations and solve problems associated with equivalence relations.
3. Identify different types of functions, compute composition and inverse of a function
and solve problems using pigeon-hole principle.
4. Solve problems associated with discrete & continuous probability distributions.
5. Estimate the truth value of the propositions, demonstrate various normal forms and
estimate the truth value of the proposition using fuzzy logic.
6. Define and explain the basic concepts of graph theory and its applications to solve
Konigsberg bridge problem and produce minimal spanning.
Set Theory, Relations, Functions, Probability, Formal Logic, Graph theory.

Reference Books
1. Discrete Mathematics and its Applications, Kenneth H. Rosen, 7th Edition, Tata
McGraw Hill Publications, 2003.
2. Discrete Mathematics with Graph Theory, Edgar G Goodaire, and Michael M
Paramenter, 3rd Edition, Pearson Education, 2002.
3. Discrete Mathematics, Semyour Lipschutz, Marc Lipson, 3nd Edition, Tata McGraw-
Hill, 2006.
4. Discrete Mathematical Structures: Bernad Kolman, Robert C Busby, 6th Edition,
Pearson Education, 2000.
5. Graph Theory with Applications to Engineering and Computer Science – Narsingh
Deo, Prentice – Hall of India Pvt Ltd New Delhi, 1999
Introduction to Unix and C Programming (4:0:0)
Sub code : MCA04xx CIE : 50 %

Hrs /week : 04 SEE : 50 %
SEE Hrs : 3 Hrs Max. Marks : 100
Course Outcomes: On successful competition of the course the students will be able to
1. Summarize the role of an Operating System.
2. Analysis of various tools and commands used in UNIX
3. Learn the architecture of UNIX with other variants of Linux.
4. Learn the syntax and semantics of the C language.
5. Understand and handle the major data types of the C Language.
6. Code and test simple real world problems using the C language.
The Unix Getting started, Navigating the File System, The Shell, The C Language, Control
Statements, Arrays
Textbooks
1. UNIX Concepts and Applications, Sumitabha Das, 4th Edition, Tata McGraw Hill, 1
July, 2017(reprint), Tata McGraw Hill publication.
2. Programming in ANSI C, Balagurusamy, 7th Edition, Tata McGraw Hill, 1 July 2017
Reference Books
1. Linux command line and shell scripting bible, 3rd edition, Richard Blum and Christine
Bresnahan, 2015 edition, Wiley Publishers.
2. C How to Program, 7th ed, Dietel & Dietel Publishers.
Web Technologies (3:0:0)

Sub Code : MCA03xx CIE : 50%
SEE Hours : 3 Hrs Max Marks : 100
1. Remember and recall the basis of Internet.

2. Understand the format in which the communication happen in www .
3. Experiment with the power of XHTML, CSS and JavaScript and also develop
applications using the same.
4. Analyze and examine how dynamic web applications can be designed and developed
using Java script and HTML.
5. Explain the principle involved in dynamic web pages using Document object model
elements.
Fundamentals of Web, XHTML, CSS, Javascript, avascript and HTML Documents, Dynamic
Documents with Javascript, Dynamic documents
Text Books
1. Robert W. Sebesta: Programming the World Wide Web, 7th Edition, Pearson
Education, 2012.
Reference Books
1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to HTML
program, 3rd Edition, Pearson Education / PHI, 2004.
2. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley
India, 2006
3. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.
Computer Organization (4:0:0)

SEE Hours :3 Hrs Max. Marks: 100
1. Understand the basics of computer structure and machine instructions

2. Understand the different ways of communicating with I/O Devices and Interfaces
3. Describe different kinds of memory and their hierarchy
4. Analyse the working of arithmetic operations
5. Understand the basic processing unit and its organization
6. Apply the pipelining concept
Basic Structure of Computers and Machine Instructions, Input / Output Organization, The
Memory System, Arithmetic, Basic Processing Unit, Pipelining
Text Books
1. Computer Organization, Carl Hamacher, Z Varnesic and S Zaky, 5th Edition, McGraw
Hill, 2002.
Reference Books
1. Computer Organization and Architecture: Designing for performance, William
Stallings, 9th Edition, Pearson Education Asia, 2014.
2. Computer Organization: Andrew S Thanenbaum, 6th Edition, PHI
Data Communication (3:0:0)

SEE Hours : 3 Hrs Max. Marks: 100
Course Outcome: On successful completion of the course the students will be able to
1. Describe the basic concepts of data communication, networks, internet, OSI and
TCP/IP models
2. Understand the digital conversion techniques, different transmission modes and
transmission media.
3. Analyze the different functionalities of data link layer and examine error detection
and correction codes used
4. Categorize the different data link layer protocols and media access control protocols
5. Discuss the IEEE standards for wired and wireless LANs
Introduction, Network Models, Introduction to Physical Layer, Digital Transmission,
Bandwidth utilization, Transmission Media, Introduction to Data Link Layer, Error Detection
and Correction, Data Link Control, Wired LANs, Wireless LANs
Text Book
1. Data Communications and Networking by Behrouz Forouzan, Fifth Edition, McGraw
Hill Education (India) Pvt. Ltd., 2013.
Reference Books
1. Communication Networks by Alberto Leon-Garcia and Indra Widjaja, Second Edition,
Tata McGraw Hill Publications.
Unix and C Laboratory (0:0:3)

Course Outcomes: On successful competition of the course the students will be able to
1. Learn the usage of UNIX, design and implement simple shell scripts.
2. Understand the need of UNIX in today’s scenario.
3. Learn the usage of C programming language, design and implement simple C
programs.
4. Apply various concepts of the C programming language like its data types, usage of
arrays to develop solutions to real world problems.
Basic command usage for simple commands like ls, cp, mv, rm, cat, cal, date, who, printf, stty,
tty, uname, passwd, echo, clear, bc, script and others. Basic command usage for commands
like cd, mkdir, rmdir, pwd, wc, split, comm, diff, cmp etc. Usage of Vi editor through its
different modes. Basic shell scripts using these above commands.
Usage of C language to develop various types of c programs like:

1. finding biggest/smallest of 3 numbers.
2. finding the roots of a quadratic equation.
3. usage of c keywords like const, volatile, static and others.
4. Using the various kinds of if statements.
5. Usage of while and other looping constructs.
6. Programs using arrays like: sum of array elements, sum of diagonal array elements amongst
others.
Web Technologies Laboratory (0:0:3)

Course Outcomes: The student on successful completion of this course will be able to
1. Learn the usage of HTML, design and implement simple applications.
2. Understand the need of JavaScript and CSS in web applications.
3. Develop a structured and well-documented computer program.
4. Apply the Web Technology techniques to solve practical Web problems.
5. Understand the need of Java script in web applications.
6. Design and implement dynamic web applications using HTML, JavaScript
programming environment
Programs on XHTML and HTML tags.Programs on usage of CSS with XHTML and HTML.
Programs on usage of JavaScript with XHTML for client side validation. Programs on usage
of Javascript for demonstrating dynamic documents concept.
II MCA
System Programming (4:0:0)

Course Outcomes: On successful completion of the course, the students will be able to
1. Define the features of system software through SIC and SIC/XE machine architecture.
2. Apply the basics of assembler characteristics for SIC architecture.
3. Compare and contrast the machine independent and machine dependent details of
assemblers.
4. Describe the working of loaders and linkers
5. Explain the various features of macroprocessors.
6. Analyze the problems of validating grammar and tokens recognition using Lex and
YACC tools towards the design of complier.
Machine Architecture , Assemblers-1 , Assemblers-2, Loaders and Linkers, Macro Processor,

Lex and Yacc
Text Books
1. Leland.L.Beck: System Software, 3rd Edition, Addison-Wesley, 1997.
2. John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1999.
Reference Book
1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition, Tata
McGraw - Hill, 1999.
Data Structures and Algorithms with C (4:0:0)

Course Outcomes: On successful completion of the course, students will be able to
1. Identification of specific data structure for a given problem.

2. Implement and apply the stack as a data structure.
3. Design and implement the queue as a data structure.
4. Employ and understand the use of linked lists.
5. Understand and develop tree and graphs as a data structure.
6. Demonstrate different sorting and searching techniques.
Introduction to Data Structures, The Stack, Recursion, Queues, Linked Lists, Graphs and Trees,
Sorting and Searching
Text Book
1. Data Structures using C and C++ by Yedidyah Langsam and Moshe J. Augenstein and
Aaron M Tenanbaum, 2nd Edition, Pearson Education Asia, 2002.
Reference Books
1. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2nd Edition, Pearson
Education Asia, 1997.
2. Data Structures - A Pseudocode Approach with C, Richard F Giberg and Behrouz A
Forouzan, 3rd Reprint, Thomson Course Technology, 2005.
Operating Systems (4:0:0)

1. Describe the objectives and functions of modern operating systems.
2. Compare the different types of the process scheduling, and scheduling algorithms and
threaded model.
3. Understand process synchronization and deadlocks
4. Distinguish different types of memory management schemes.
5. Analyze the memory management schemes and disk space management.
6. Compare the different types of protection of the files in OS, Linux operating system
concepts.
Introduction to Operating Systems, Process Management, Process Synchronization, Memory

Management, File System, Implementation of File System, Secondary Storage Structures,
Protection
Text Book
1. Abraham Silberschatz, Peter Baer Galvin , Greg Gagne: Operating System Principles,
9th edition, Wiley-India, 2013
Introduction to Python Programming (2:0:2)

Course Outcomes: On successful completion of the course the students will be able to
1. Learn the syntax and semantics of the Python language.

2. Handle strings, files and other data types of Python.
3. Understand lists and dictionaries of Python.
4. Implement OOPs concepts in Python.
5. Understand network, database concepts using Python.
Textbooks
1. Python for Everybody: Exploring data using Python 3, 1st Edition, CreateSpace
Independent Publishing Platform, 2016.
2. Allen B. Downey, "Think Python: How to Think Like a Computer Scientist”, 2
ndEdition, Green Tea Press, 2015.
Reference Books
1. Mark Lutz, “Programming Python”, 4th edition, O'Reilly publications, 2010
2. Zed A Shaw, “Learn Python the hard way”, Hard Way Series, 2013
Data Base Management Systems (3:0:0)

Course Outcome: On successful completion of the course, the students will be able to
1. Understand when to use normal file system and when to use DBMS.
2. Identify entities, attributes, keys, relationship types and draw the E-R diagram.
3. Solve the relational algebraic expressions for the given queries
4. Construct the SQL statements to perform various operations for the given queries.
5. Apply Normalization techniques for the given relation.
Introduction, Entity-Relationship Model, Relational Model and Relational Algebra, SQL,

Database Design
Text Book
1. Elmasri and Navathe: Fundamentals of Database Systems, 7th Edition, Addison-
Wesley, 2016
Reference Books
1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 5th Edition, Mc-
GrawHill, 2006.
2. C.J. Date, A. Kannan, S. Swamynatham: A Introduction to Database Systems, 8th
Edition, Pearson education, 2006
Data Structures Laboratory (0:0:3)

Course Outcomes: On successful completion of the course, students will be able to

1. Analyze and illustrate the properties of various data structures
2. Compare and contrast the strengths and weaknesses of different data structures
3. Propose a set of data structures and algorithms as an abstract data type
4. Design and employ appropriate data structures for solving computing problems
Programs on Pointers, Structures, Union, Stack and its applications, Queues, Dynamic Lists
and its operations, Trees, Sorting: Quick sort, Insertion sort, Heap Sort, Merge Sort, BST Sort,
Searching: Linear search, Binary search, Binary Search Tree search
DBMS Laboratory (0:0:3)

Sub Code : MCA0xxx CIE : 50%
Course Outcomes: The student on successful completion of this course should be able to
1. For a Specified Database create the tables by properly specifying the primary keys and
the foreign keys.
2. Enter at least five tuples for each relation, perform update, alter operations and Create
suitable front end for querying and displaying the results
3. To solve Query for a given Database.
4. Normalize a database
Data Definition Language commands, Data Manipulation Language commands-Basic queries,

Data Manipulation Language commands-Nested Queries and Join queries, Design data model
and schemas in RDBMS, Privileges and Views
III MCA
Object Oriented Programming with JAVA (4:0:0)

1. Appraise Java Programming Fundamentals.

2. Explore and employ OOP concepts of Java for a given problem.
3. Choose and develop an appropriate Packages and Interfaces for a given problem.
4. Identify and employ multi-threaded programming and Handling exceptions.
5. Explore and apply Enumerations, Autoboxing and Generics
6. Design graphical user interfaces using applets/swings
The Java Language and An Overview of Java, Introducing Classes, Inheritance, Packages and
Interfaces, Exception Handling and Multithreaded Programming, Enumerations, Autoboxing
and Generics, Applets and Swings
Text Book
1. Java The Complete Reference: Comprehensive Coverage of the Java Language by
Herbert Schildt, McGrawHill Education (India) 9th Edition 2014.
Reference Book
1. Java Fundamentals, A comprehensive Introduction by Herbert Schildt, Dale Skrien.
Tata McGraw Hill Edition 2013.
2. Introduction to Java Programming, Comprehensive Edition, by Y.Daniel Liang,
Analysis and Design of Algorithms (4:0:0)

Course outcomes: On successful completion of the course, the students will be able to
1. Analyze Recursive and Non-recursive algorithms in terms of time and space

complexities.
2. Understand and apply algorithm design techniques like Brute force and Divide-and-
conquer to solve variety of problems.
3. Distinguish algorithm design strategies like Decrease-and-conquer and Transform-and-
Conquer for effective problem solving.
4. Negotiate space and time tradeoffs and also implement dynamic programming to solve
variety of problems.
5. Solve problems using greedy strategy.
6. Examine the limitations of algorithm power and choose suitable solutions like
Backtracking and Branch-and-bound.
Introduction, Brute Force and Divide-and-Conquer, Decrease-and-Conquer and Transform-

and-Conquer, Space, Time Tradeoffs and Dynamic Programming, Greedy Techniques and
Limitations of Algorithm Power, Coping with the Limitations of Algorithm Power
Text Books
1. Anany Levitin: Introduction to the Design and Analysis of Algorithms, Pearson
Education, 2003.
Reference Books
1. Coremen T.H., Leiserson C.E., and Rivest R.L.: Introduction to Algorithms, PHI, 1998.
2. Horowitz E., Sahani S., Rajasekharan S.: Computer Algorithms, Galgotia Publications,
2001
Computer Networks (4:0:0)

1. Discuss the network layer services and learn the concepts of IP address, Classes, IPv4
Datagram.
2. Learn the auxiliary protocols in IPv4 and working of different Unicast Routing
algorithms and protocols.
3. Discuss the concepts and working of IPv6 and various Multicast routing protocols.
4. Identify the services of the Transport layer and analyze the performances of UDP and
TCP protocols.
5. Explain the congestion control in TCP and the working of SCTP.
6. Distinguish between various application layer protocols and analyze the need for
information on DNS.
Network Layer-I, Network Layer Protocols-II, Network Layer Protocols-III, Transport Layer-
I, Transport Layer-II, Application Layer
Text Book
1. Data Communications and Networking, BehrouzA. Forouzan, Tata McGraw-Hill, 5th
Edition, 2013.
Reference Books
1. Computer Networks, Andrew S. Tanenbaum, Pearson Education, 4th Edition, 2002.
2. Data and Computer Communication, William Stallings, Pearson Education, 8th
Edition, 2007.
Management Information Systems (3:0:0)

Course Outcome: On successful completion of the course the students will be able to
1. Recall and understand the different types of systems.

2. Identify and analyze requirements for information systems
3. Understand and apply design principles in Information Systems
4. Choose, compare, evaluate and conclude technology alternatives and to solve problems
in an MIS context.
5. Able to understand the concepts of MIS to adapt to equivalent Client server architectural
systems.
Systems Engineering, Strategic Management of Business, Developing Business/IT

Strategies/IT Solutions, Decision Making and DSS, Client Server Architecture and E-business
Technology
Text Book
1. Management Information Systems - Waman S Jawadekar,5th Edition, Tata McGraw Hill,
2013.
2. Management Information Systems, James A O’Brien and George M Marakas, 9th Edition,
Tata McGraw Hill, 2009..
Reference Books
1. Principles of Information Systems, Ralph M Stair and George W Reynolds, 12 th
Edition, Thomson, 2015.
2. Information Systems - The Foundation of E-Business, Steven Alter, 4th Edition, Pearson
Education Asia, 2002.
3. Management Information System, MahadeoJaiswal and Monika Mital, 3rd Edition,
Oxford University Press, 2006.
4. Management Information Systems – Effy Oz, 6th Edition, Thomson Course
Technology, 2013.
Algorithms Laboratory (0:0:3)

SEE Hours : 3 Hrs Max. Marks : 50
Course outcomes: On successful completion of the course, the students will be able to
1. Implement Different Sorting and Searching algorithms, perform posterior analysis, and
compare them with theoretical complexities.
2. Design and implement algorithms to solve various problems using Brute-Force method
3. Develop algorithms using divide and conquer, Transform and conquer techniques and
implement them.
4. Implement solutions for problems using Dynamic Programming methods.
5. Solve various problems using Greedy Technique and backtracking
Bubble sort, Selection Sort, Merge Sort, Quick Sort, Linear Search, Binary Search, DFS, BFS,
Topological sorting, Heap Sort, binomial coefficients problem, Horspool String Matching,
shortest path problems with Warshall’s and Floyd’s Algorithms, Knapsack Problem, Prim’s
Algorithm, Kruskal’s Algorithm and Dijkstra’s Algorithm, n-Queens’s problem
Java Programming Laboratory (0:0:3)

1. Gain exposure to state-of-the-art JAVA development tools.

2. Explore and design solutions in JAVA for a given problem.
3. Propose accurately documented implementations
4. Adapt critical thinking skills and creativity to solve problems.
JAVA programs on classes, constructor overloading, method overloading, inner class

anonymous inner classes, various access protections, Inheritance, method overriding, built-in
and user-defined Exception handling programs, creation of interfaces, enumerations, generics,
applets and swings.
IV MCA
Advanced Java Programming (4:0:0)

Course Outcomes: The student on completion of this course will able to
1. Understand the concepts of JDBC.

2. Illustrate the basics of web applications using Servlet .
3. Discuss the concept of web applications using JSP technology.
4. Construct and develop how to write complex code using proper design- structure.
5. Implement the successor of JSP called the struts technology.
6. Adapt, build web applications with the navigational language designed to work with struts.
JDBC, Servlets, JSP, Introduction to Struts, Actions and Results, OGNL
Text Books
1. Marty Hall, Larry Brown. Core Servlets and Java Server Pages. Volume 1: Core
Technologies. Second Edition.
2. Budi Kurniawan, A Tutorial Struts 2 Design and Programming Second Ed., BPB
Publications.
Reference Books
1. Kathy Sierra, Cert Bates -Head first servlets and JSP, 2ndedition. O'Reilly Publications.
2. Donald Brown, Chad Michael and others – Struts 2 in Action. Manning Publications.
Advanced Web Programming (3:0:0)

Course Outcomes: The student on completion of this course will able to
1. Identify the usage of Perl.

2. Illustrate the applications of CGI.
3. Select appropriate Perl or PHP for solving a problem.
4. Build web applications with PHP and discuss the application of Ruby.
5. Explain More Ruby concepts and Discuss concepts about introduction web 2.0-Saas, Web
services.
Programming in Perl, CGI Scripting, Building Web Applications with Perl, Building Web
applications with PHP, Ruby, Introduction web 2.0
Text Books
1. Chris Bates: Web Programming Building Internet Applications, 3rd Edn, Wiley
India, 2006
2. Robert W. Sebesta: Programming the World Wide Web, 7th Edition, Pearson
Education, 2013.
3. Francis Shanahan: Mashups, Wiley India 2007.
Reference Books
1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to program,
4th Edition, Pearson Education / PHI, 2009.
2. Xue Bai et al: The Web Warrior Guide to Web Programming, Thomson, 2003.
3. Joel Murach’s PHP and MySQL. Mauch’s Publications, 2nd Edition,2014
Software Engineering (3:0:0)

1. Identify and Design System and Software Processes, adopt appropriate software
process models and appreciate professional ethics.
2. Understand Agile Software Development and requirements engineering processes.
3. Design software systems using various system models and Architectural design models.
4. Use object oriented design models for development of software and adopt appropriate
Software testing plan.
5. Appreciate proven methods of project and people management including estimation of
project cost.
Introduction to Software Engineering, Agile Software Development, Requirements

Engineering, System Modeling, Architectural Design, Design and Implementation, Software
Testing, Project management, Project planning
Text Book
1. Ian Sommerville: Software Engineering, 10th Edition, Person Education Ltd.,
Reference Books
1. Ian Sommerville: Software Engineering, 8th Edition, Person Education Ltd., 2007.
2. Roger.S.Pressman: Software Engineering-A Practitioners approach,
7thEdition,McGraw-Hill, 2007.
3. Waman S Jawadekar: Software Engineering Principles and Practice, Tata McGraw
Hill, 2004
Cloud Computing (3:0:0)

1. Identify and acquire the knowledge of types of clouds, service – level and Compliance
– level agreements, and software licensing.
2. Discuss applications of cloud in science and engineering, biology research, and social
computing.
3. Explain the concept of virtualization.
4. Compare different scheduling techniques in cloud.
5. Analyze the security risks posed by shared images and the management OS.
Introduction, Cloud Infrastructure, Cloud Computing: Applications and Paradigms, Cloud

Resoruce Virtualization, Cloud Resource Management and Scheduling, Cloud Security
Text Book
1. Cloud Computing: Theory and Practice, Dan C. Marinescu, Morgan Kaufmann, 2013
Reference Books
1. Cloud Computing Bible by Barrie Sosinsky, Wiley India.
2. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India.
Minor Project (0:0:3)

SubjectCode : MCA0120 CIE : 50%
Max. Marks : 50
Course Outcomes: On successful completion of the course, the students will be able to:
1. Identify of real world problems
2. Understand different design methodologies.
3. Select appropriate tools for solving a problem
4. Decide on advanced programming techniques/languages
5. Apply the art of verification and validation.
6. Write technical reports
A team of TWO students must develop the mini project. However, during the final presentation,
each student must demonstrate the project individually.
• The team may implement a mini project of their choice.
• The team must submit a Brief Project Report (25 to 30 Pages) that must include the following:
1. Introduction
2. Requirements
3. Software Development Process Model Adopted, Analysis and Design Models.
4. Implementation
5. Testing
The Report must be evaluated for 10 marks, Demonstration for 30 marks and Viva for 10 mark
Seminar – I (0:0:2)
Max Marks : 50
Course Outcomes:On successful completion of the course, the students will be able to
1. Understand current trends in specific area of interest

2. Perform literature survey related to the specific topics of interest
3. Appreciate the results of technical work
5. Summarize and present the technical contents
A Seminar should be given by an individual student based on topics chosen from the emerging
areas and technologies of Computer science & Computer Applications. References from
journals such as IEEE, ACM etc., shall be used. A report on this seminar with 15-20 pages
shall also be prepared
Advanced Java Programming Laboratory (0:0:3)
Subject Code : MCA0118 CIE : 50%
Hrs/Week: 03 SEE : 50%
1. Distinguish OO programming from declarative and procedural ones and to
design programs using the object-oriented paradigm
2. Analyze and design a computer program to solve real world problems based on
object oriented principles and ability to implement these designs
3. Acquire the knowledge of basic JAVA library and tools at a depth that is
required to solve real-world programming problems
4. Produce accurately documented implementations
5. Gain exposure to state-of-the-art development tools
6. Use critical thinking skills and creativity to solve problems.
IDE: ECLIPSE /Netbeans, Apache tomcat server for servlets and JSP programs, ODBC-JDBC
Connectivity Bridge software. (Note: Initial programs to work with notepad editor and compile
and execute in jdk environment command prompt) Advanced JAVA programs on JSP, servlets,
Struts, programs on cookies, session creation, and web application using database connectivity.
Advanced Web Programming Laboratory (0:0:3)

Hrs/Week : 03 SEE :50%
Course Outcomes: The student on successful completion of this course should be able to
1. Learn the usage of Perl with example programs.
2. Apply CGI Applications to solve practical web problems.

3. Build web applications using Perl with relational databases.
4. Design and implement web applications using PHP and relational databases
5. Develop web applications using Ruby
Advanced Programs on HTML tags, CSS, CGI Applications, PHP, Mysql with PHP, and
simple Ruby programs
V MCA
Object Oriented Modeling and Design Patterns (4:0:0)

1. Recall the concept of object-orientation methodologies and use them for designing classes
and objects.
2. Create use case documents that capture requirements for a software design.
3. Create class diagrams that model both the domain model and design model of a software
system.
4. Design the interface between the classes and objects.
5. Create interaction diagrams that model the dynamic aspects of a software system.
6. Explain communication and design patterns.
Introduction, Modeling Concepts, Class Modeling, Advanced Class Modeling, State Modeling,
Process Overview, System Conception, Domain Analysis, Application analysis, System
Design, Class Design, Implementation Modeling, Legacy Systems Design Patterns, Idioms
Text Books
1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML, 2nd
Edition, Pearson Education / PHI, 2009.
2. Frank Buschmann, RegineMeunier, Hans Rohnert, Peter Sommerlad, Michael Stal:
Pattern-Oriented Software Architecture, A System of Patterns, Volume 1, John Wiley and
Sons, 2013.
.Net and C# (3:0:0)

1. Identify a solution in .NET environment after proper analysis of previous state of affairs
and designing simple applications in C#.
2. Discuss C# language fundamentals
3. Demonstrate the Object Oriented Programming concepts in C#
4. Experiment the applications with different exceptions scenarios
5. Devise applications using interface and delegates
The philosophy of .NET, C# Language Fundamentals, Object- Oriented Programming with

C# , Exceptions and Object Lifetime, Interfaces
Text Books
1. Andrew Troelsen: Pro C# with .NET 3.0, Special Edition, Dream tech Press, India, 2007.
2. E. Balagurusamy: Programming in C#, 5th Reprint, Tata McGraw Hill, 2004.
Reference Books
1. Tom Archer: Inside C#, WP Publishers, 2001.
2. Herbert Schildt: The Complete Reference C#, Tata McGraw Hill, 2004.
Research Methodology (2:0:0)
Subject Code : MCA02xx CIE : 50%

1. Understand the need for research and its related approaches and methodology.
2. Analyze the various designs of research.
3. Exemplify the need for presentation and report writing skills.
Research Methodology: An Introduction, Research Design, Interpretation and Report Writing
Text Books
1. Research Methodology – Methods and Techniques, 3rd edition, C R Kothari and Gaurav
Garg, New Age International Publishers, 2015 reprint.
Reference Books
1. An Introduction to Research Methodology, 2002 Edition, Garg, Agarwal and et al.,
RBSA Publishers
2. Writing a report – how to prepare, write and present effective reports, 9th edition,
Constable and Robinson Publications, 2011 reprint.
Seminar - 2 (0:0:2)
Max Marks : 50
1. Understand current trends in specific area of interest

2. Perform literature survey related to the specific topics of interest
3. Appreciate the results of technical work
5. Summarize and present the technical contents
A Seminar should be given by an individual student based on topics chosen from the emerging
areas and technologies of Computer science & Computer Applications. References from
journals such as IEEE, ACM etc., shall be used. A report on this seminar with 15-20 pages
shall also be prepared.
Software Design Laboratory (0:0:3)

1. Describe the concept of object-orientation methodologies
2. Create use case documents that capture requirements for a software system.
3. Create class diagrams that model both the domain model and design model of a
software system.
4. Design the interface between the classes and objects.
5. Create interaction diagrams that model the dynamic aspects of a software system.
6. Design communication and design patterns.
The student has to draw the necessary UML diagrams using any suitable UML Drawing
Tool and implement in Java OR C++ OR C# program to demonstrate the working of object
oriented methodologies and some design patterns listed below:
Basic introductory programs, Data hiding, inheritance, polymorphism, operator overloading,

function overloading, exception handling and File I/O, Publisher-Subscriber, Forward-
Receiver, Client-Dispatcher, commannd
.Net Laboratory (0:0:3)

Hrs/Week : 03 SEE :50%
1. Display proficiency in C# by building stand-alone applications in the .NET framework
using C# that is completely event driven.
2. Create simple web applications and window application features of C#
3. Create distributed data-driven applications using the .NET Framework C#
4. Create web-based distributed applications using C#
5. Debug an application using breakpoints and Try/Catch/Finally blocks
6. Debug an application using delegates and demonstration of inheritance support
IDE: Microsoft Visual Studio8 Initially work with simple programs in runtime
environment .NET framework i.e., SDK command prompt. Simple programs in C#, Programs
on Array processing in C#, interfaces, use of Virtual and override key words, collections,
abstract classes and methods, exception handling etc.
VI MCA
Internship
Sub Code : MCAxxx
Credits:09 Max. Marks: 50
1. Exposure to industry environment.
2. Understands tools and technology for implementing real world problems
3. Select appropriate tools for solving problems.
4. Develop communication, interpersonality and critical skills.
Individual student must carry out Internship training at industry. Student shall submit a
detailed report on internship work (15 to 20 Pages) in a format as specified by the department.
Internal guide and industry personnel will evaluate the student performance for 50 Marks. By
taking demonstration and presentation of the work carried during internship.
Major Project
Sub Code : MCA1201
Credits: 16 Max. Marks: 275
1. Analyze real world problems

2. Implement the different design methodologies
3. Select appropriate tools for solving problems
4. Implementing advanced programming techniques/languages
5. Perceive the art of verification and validation
Individual student, one project per student, must carry out major project. Student must submit
a Detailed Project Report (60 to 80 Pages) in a format as specified by the department. Internal
guides will evaluate the performance (Continuous Internal Evaluation) for 50 Marks. The
Report will be evaluated for 125 marks by both internal and external evaluators. Internal and
external examiners for 75 marks will evaluate final viva-voce, which includes demonstration
and presentation of project work jointly.
ELECTIVES
UNIX System Programming (3:0:0)

Hrs/Week: 03 SEE : 50%
Course Outcomes: On Successful completion of the course, the students will be able to:
1. Summarize the basic features of unix OS.

2. Illustrate the system calls for handling files, I/O and directories.
3. Analyzing the processes in unix environment.
4. Illustrate the importance of process control and its relationship.
5. Describe signals and daemon concepts in unix environment.
UNIX System Overview, UNIX Standardization and Implementations, File I/O, Files
and Directories, UNIX Processes, Process Control, Process Relationships, Signals
Text Book
1. Advanced Programming in the UNIX Environment, W Richard Stevens, Stephen A Rago,
2nd Edition, Addison-Wesley, 2005.
Reference Books
1. Unix System Programming Using C++, Terrence Chan.
2. Advanced Unix Programming, Marc J Rochkind, 2nd Edition.
3. The Design of the UNIX Operating System, Maurice J Bach.
Computer Graphics and Visualization (3:0:0)

1. Recall the different applications of computer graphics

2. Explain the potential and benefits of using openGL in field of computer graphics
3. Show the working of various animated interactive programs by using suitable input and
output devices.
4. Explain the different aspects of modeling and transforming using homogeneous
coordinates.
5. Design and implement various three dimensional Line clipping algorithms
Introduction, The OpenGL, Input and Interaction, Geometric Objects and Transformations,
Shading Light and matter
Text Books
1. Edward Angel: Interactive Computer Graphics A Top-Down Approach with OpenGL,
2nd Edition, Addison-Wesley, 2000
Reference Books
1. F.S. Hill,Jr.: Computer Graphics Using OpenGL, 2nd Edition, Pearson education / PHI,
2001.
2. James D Foley, Andries Van Dam, Steven K Feiner, John F Hughes: Computer
Graphics, Addison Wesley, 1997.
Web 2.0 and Rich Internet Applications (3:0:0)

1. Understanding the basics of web services & Design and implement Rich Internet
Applications using AJAX
2. 2.Understand the usage of basics of XML and HTTP
3. Able to work with FLEX
4. Design and implement User Interface techniques
5. Understand the concepts of web 2.0 technology.
Introduction-Web Services, XMLHTTP Object, Building Rich Internet Applications with Flex,
Working with UI components, Building Advanced Web 2.0 applications
Text Books
1. Nicholas C Zakas et al: Professional AJAX, Wrox publications, 2006.
2. ChaficKazoun: Programming Flex 2, O’Reilly publications, 2007.
3. Francis Shanahan: Mashups, Wrox, 2007.
Reference Books
1. Thomas A. Powel: Ajax The Complete reference, McGraw Hill, 2008.
2. Gottfried Vossen, Stephan Hagemann: Unleashing Web 2.0 From Concepts to Creativity,
Elsevier, 2007.
3. Colin Moock: Essential Actionscript 3.0, O’Reilly Publications, 2007.Steven Holzner :
Ajax Bible Wiley India , 2007.
4. Eric Van derVlist et al: Professional Web 2.0 Programming, Wiley India, 2007.
5. Justin Gehtland et al: A Web 2.0 primer Pragmatic Ajax, SPD Publications, 2006
LINUX System Programming (3:0:0)

Pre-requisite:NA
1. Identify the role of various LINUX programming standards and file types.
2. Demonstrate the usage of various system calls to perform file operations.
3. Discuss LINUX OS concepts such as: kernel support for files.

4. Illustrate process controlling procedures, relationship between processes, process
groups.
5. Describe system limits and understand the uname command.
6. Understand the various file systems.
History and Standards, Fundamental Concepts, System Programming Concepts, File I/O, File
I/O: Further Details, Processes, System Limits And Options, File Systems
Text Books
1. Michael Kerrisk: The LINUX Programming Interface, 1st Edition, No Starch Press,
2010.
Reference Books
1. Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson Education,
2005.
2. W.Richard Stevens, Stephen A. Rago: Advanced Programming in the UNIX
Environment, 2nd Edition, Pearson Education / Prentice-Hall of India, 2005.
Software Architecture (3:0:0)

1. Understand the architecture business cycle.

2. Differentiate architectural styles and patterns
3. Understand the quality attributes in the architecture.
4. Illustrate the different design patterns.
5. Understanding the design and documentation of the architecture.
Introduction The Architecture Business Cycle, architectural Styles and Case Studies, Quality
Functionality and architecture, Architectural Patterns Introduction, Designing and
Documenting Software Architecture
Text Books
Len Bass, Paul Clements, Rick Kazman: Software Architecture in Practice, 2nd Edition,
1. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal:
Pattern-Oriented Software Architecture, A System of Patterns, Volume l. John Wiley and
Sons, 2006.
2. Mary Shaw and David Garlan: Software Architecture Perspectives on an Emerging
Discipline, Prentice-Hall of India / Pearson Education, 2007.
Reference Books
1. E. Gamma, R. Helm, R- Johnson, L Vlissides: Design Patterns Elements of Reusable
Object Oriented Software, Addison-Wesley, 1995.
Web Reference
Web site for Patterns: http://Www.hillside-netJpatterns/
Multimedia (3:0:0)
1. Understand various elements of multimedia and its applications.

2. Analyze the different data compression techniques for both audio and video.
3. Explain the need for different type of storage media and its applications.
4. Illustrate design and implementation of different data file formats.
5. Apprise different applications of multimedia.
Introduction, Graphics and Images, Data Compression, Optical Storage, Multimedia

Application
Text Books
1. Ralf Steinmetz, Klara Narstedt: Multimedia Fundamentals: Vol I-Media Coding and
Content Processing, 2nd Edition, Pearson Education / PHI, 2003.
2. Prabhat K. Andleigh, KiranThakrar: Multimedia Systems Design, PHI, 2003
Reference Books
1. KR Rao, Zoran S- Bojkovic and Dragorad A. Milovanovic: Multimedia
Communication Systems: Techniques, Standards, and Networks. Pearson Education,
2002.
2. Nalin K Sharad: Multimedia information Networking, PHI, 2002.
Information and Network Security (3:0:0)

Course Outcomes:On successful completion of the course, the students will be able to
1. Recognize different services and mechanisms for Network Security applications and
also plans to provide security for the information by designing models
2. Identify the basic security technologies
3. Apply cryptographic techniques using various tools
4. Analyze the email security formats and design of IP security technology
5. Explain the different web security technologies
Introduction to Network Security, Authentication Applications, Security Technologies,

Cryptography, Electronic Mail Security, Web Security
Text Books
1. Michael E. Whitman and Herbert J. Mattord: Principles of Information Security, 2nd
Edition, Thomson, 2005.
2. William Stallings: Network Security Essentials: Applications and Standards, Pearson
Education, 2000.
Reference Book
1. Behrouz A. Forouzan: Cryptography and Network Security, Special Indian Edition,
Tata McGraw-Hill, 2007.
Mobile Programming (3:0:0)

1. Understand the basic versions, the evolution of Android as a Mobile OS, create
simple apps and apply different styles.
2. Explain the User Interface of Android.
3. Manipulate the UI with different common elements.
4. Understand and analyze the need for cross platform mobile application development
Getting Started With Android Programming, Activities, Fragments and Intents, Getting To
Know The Android User Interface, Designing Your User Interface With Views, Displaying
Pictures And Menus With Views Hybrid Mobile Apps, Setting The Development
Environment, Apache Cordova Basics
Text Books
1. Beginning Android 4 Application Development by Wei Ming Lee, Wrox, Wiley India
Edition.
2. Mobile App Development with Ionic 2 by Chris Griffith, O’Reilly Publications, 2017
Ed.
Reference Books
1. Mark Murphy, The Busy Coder's Guide to Android Development, version 4.2.
2. Android Programming: The Big Nerd Ranch Guide (Big Nerd Ranch Guides)
3. Joshua Morony, Building apps with Ionic 2,3, ebook edition.
Data Mining (3:0:0)

1. Understand the necessity of data mining.

2. Identify different tasks of data mining.
3. Identify the different methods in association analysis

4. Apply algorithms for association analysis in identifying associations
5. Understand the importance of cluster analysis.
Introduction, Data – 1, Data – 2 Data Preprocessing, Association Analysis – 1, Association

Analysis – 2, Cluster Analysis Overview
Text Books
1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining,
Reference Books
1. K.P.Soman, Shyam Diwakar, V.Ajay: Insight into Data Mining – Theory and Practice,
PHI
2. Jiawei Han and MichelineKamber: Data Mining – Concepts and Techniques, 2nd
Edition, Morgan Kaufmann, 2006.
Digital Image Processing (3:0:0)

SEE Hours : 3 Hrs MaxMarks : 100
1. Understand digital image processing fundamentals.

2. Appreciate image formation model.
3. Apply the concepts of image enhancement with various filters
4. Describe image restoration techniques
5. Appraise image compression techniques
Introduction, Digital Image Fundamentals, Image Enhancement in the Spatial Domain, Image
Restoration, Image Compression
Text Book
1. Rafel C Gonzalez and Richard Digital Image Processing, Second Edition, Prentice Hall.
Introduction to Artificial Intelligence (3:0:0)
SubCode : MCA03xx CIE : 50%

1. Explain the fundamentals of Artificial Intelligence

2. Explain the search techniques and knowledge representation
3. Describe the Rules for knowledge representation.
4. Define the reasoning and planning
5. Explore the concept of Machine Learning and Common Sense
Introduction, Problems, Problem Spaces & Search, Problems, Problem Spaces & Search,
Search Techniques and Knowledge Representation, Representing knowledge using Rules,
Statistical Reasoning and Planning, Learning and Common Sense
Text Book
1. Elaine Rich, Kelvin Knight, Shiva Shankar B Nair: Artificial Intelligence, 3 rd Edition,
Tata McGraw Hill, 2009.
Reference Books
1. Stuart Russel, Peter Norvig: Artificial Intelligence: A Modern Approach, 2nd Edition,
2. Nils J. Nilsson: Principles of Artificial Intelligence, Elsevier, 1980.
Big Data Analytics (3:0:0)
Sub code : MCA03xx CIE : 50 %

Hrs /week : 03 SEE : 50 %
SEE Hrs : 3 Hrs Max. Marks : 100
Course Outcomes: On successful completion of the course the students will be able to
1. Define and relate several key technologies used in manipulating, storing, and analyzing
big data.
2. Outline a clear understanding of R &Hadoop.
3. Experiment with Integrating R &Hadoop for solving big data problems.
4. Analyze and get a clear understanding of Hadoop Streaming and its importance
5. Measure Big Data and analyze Big Data.
Understanding Big Data, Big data storage concepts, Introduction to NoSQL, Understanding
the storage architecture, Big Data Analysis Techniques
Textbooks
1. Big Data Fundamentals: Concepts, Drivers, Techniques by Thomas Erl, Prentice Hall
publication, July 2016 reprint ed.
2. Professional NoSQL by Shashank Tiwari, Wiley publications, 2011 edition.
Reference Books
1. Big data analytics with R and Hadoop by Vignesh Prajapathi, Packt Publishers,
November 2013.
2. NoSQL for mere mortals by Dan Sullivan, Addison Wesley Publications, 2015 edition
Internet of Things (3:0:0)

1. Assess the genesis and impact of IoT applications, architectures in real world.
2. Illustrate diverse methods of deploying smart objects and connect them to network.
3. Compare different Application protocols for IoT.
4. Infer the role of Data Analytics and Security in IoT.
5. Identify sensor technologies for sensing real world entities and understand the role of
IoT in various domains of Industry.
What is IoT, Smart Objects, IP as the IoT Network Layer, Data and Analytics for IoT, IoT
Physical Devices and Endpoints
Text Books
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton, Jerome
Henry,"IoT Fundamentals: Networking Technologies, Protocols, and Use Cases for the
Internet of Things”, 1stEdition, Pearson Education (Cisco Press Indian Reprint).
2. Srinivasa K G, “Internet of Things”, CENGAGE Leaning India, 2017
Reference Books
1. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”,
1stEdition, VPT, 2014.
2. Raj Kamal, “Internet of Things: Architecture and Design Principles”, 1st Edition,
McGraw Hill Education, 2017.
Introduction to Machine Learning (3:0:0)
Sub Code: MCA03xx CIE: 50%

Hrs/Week: 03 SEE: 50 %
SEE Hours: 3Hrs Max. Marks: 100
Prerequisite: NA
1. Explain is the basics of machine learning and its classifications.

2. Illustrate the working of algorithms on classifications.
3. Develop the working of Support Vector Machines Decision tree learning.
4. Develop good training sets for data processing.
5. Experiment with Compressing Data via Dimensionality Reduction techniques.
Giving Computers the Ability to Learn from Data Building intelligent machines to transform
data into knowledge, Training Machine Learning Algorithms for Classification, A Tour of
Machine Learning Classifiers Using Scikit-learn, Building Good Training Sets – Data
Preprocessing, Compressing Data via Dimensionality Reduction
Text Books
1. Sebastian Raschka, “Python Machine Learning”, Unlock deeper insights into machine
learning with this vital guide to cutting-edge predictive analytics, Packt Publishing Ltd.,
2015
2. AurelienGeron, Hands-On Machine Learning with Scikit-Learn and Tensor Flow:
Concepts, Tools, and Techniques to Build Intelligent Systems, O’Reilly Publications,
2017
Reference Books
1. EthemAlpaydm, Introduction to Machine Learning (Adaptive Computation and
machine learning) The MIT Press Cambridge, Massachusetts London, ISBN: 0-262-
01211-1, 2004
2. Simon Rogers, Mark Girolami, A first course in machinelearning, Chapman, &
Hall/CRC machine learning& patternrecognition, 2011
3. John D. Kelleher, Brian Mac Namee, Aoife D’Arcy, FUNDAMENTALS OF
MACHINE LEARNING FOR PREDICTIVE DATA ANALYTICS Algorithms,
Worked Examples, and Case Studies, The MIT Press,Cambridge, Massachusetts,
London, England
E-Books
1. alex.smola.org/drafts/thebook.pdf
2. https://www.mathworks.com/content/dam/mathworks/tag-
team/Objects/i/88174_92991v00_machine_learning_section1_ebook.pdf
Principles of User Interface Design (3:0:0)

Course Outcome
On successful completion of the course, the students will be able to
1. Explain the Concept of Usability; design Principles, Guidelines of Human Computer

Interface
2. Describe the Interaction design pattern and their applicability.
3. Illustrate a set of Requirements in terms of its user – interface implications.
4. Describe the usage scenario for a given set of user requirements and available
technologies.
5. Explain User Documentation.
Usability of Interactive System, Guidelines, Principles, and Theories, Evaluating Interface

Designs, Menu Selection, Form Fill-in and Dialog Boxes, Interaction Devices, User
Documentation and Online help
Text Book
1. Ben Shneiderman: Designing the User Interface, 5th edition, Pearson Educaions.,2010
Reference Books
1. Alan J Dix et. al.: Human-Computer Interaction, II Edition, Prentice - Hall, India,1998
2. Eberts: User Interface Design, Prentice-Hall, 1994.
3. Wilber O Galitz: The Essential Guideto User Interface Design – An Introduction to
GUI Design, Principles and Techniques, Wiley-Dreamtech India Pvt. Ltd, 1998
Introduction to Data Science (3:0:0)

Prerequisite: NA
1. Demonstrate proficiency with statistical analysis of data.

2. Develop the ability to assess data based models.
3. Understand the basics of data management.
4. Experience in deriving theoretical properties of methods involved in Data Science.
5. Involves in understanding an intuition of the whole process line of extracting
knowledge from data.
How to sound like a data scientist, Types of data, The five steps of data science, Impossible or
Improbable – a general introduction to probability, Basic statistics, Getting data with Python,
Working with data.
Text Books
1. Principles of Data Science by Sinan Ozdemir, 1st Ed, Packt Publications, December
2016.
2. Data Science from Scratch by Joel Grus, 1st Ed, O’Reilly Publications, April 2015
Reference Books
1. The Data Science Handbook by Field Cady, 1st Ed, Wiley Publications, April 2017
2. Python Data Science Handbook by Jake Vander Plas, 1st Ed, O’Reilly Publications,
2016
3. Data Science for Business by Foster Provost, 1st Ed, O’Reilly Publications, 2013
4. Introducing Data Science by Davy Cielen et al, 1st Ed, Manning Publications, 2016

MCA Concise Syllabus 18-19

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCA Concise Syllabus 18-19

Uploaded by

Copyright:

Available Formats

NIE, Mysuru – 570 008 Department of MCA

THE NATIONAL INSTITUTE OF ENGINEERING

Master of Computer Applications

Master of Computer Applications

Vision of the Institution

“NIE will be a globally acknowledged institution providing value based technological

Mission of the Institution

 To impart state-of-the-art engineering education through strong theoretical foundations and

 To provide a platform for inclusiveness and collaboration by following ethical and

 To encourage entrepreneurship and to develop sustainable technologies for the benefit of

Vision of the Department

“MCA will be an outstanding department contributing significantly to teaching, research

Mission of the Program

1. Computational Knowledge: Apply knowledge of computing fundamentals,

2. Problem Analysis: Identify, formulate, research literature and solve complex

3. Design / Development of solutions: Design and evaluate solutions for complex

4. Conduct Investigations of complex computing problems: Use research based

6. Professional Ethics: Understand and commit to professional ethics and cyber

8. Project Management and Finance: Demonstrate knowledge and understanding of the

9. Communication Efficacy: Communicate effectively with the computing community

Program Educational Objectives

PEO1: Work productively as IT professional both at supportive and leadership roles.

Program Specific Outcomes

PSO2: Develop software and hardware systems/solutions, with a knowledge of software

PO7: Ability to be a lifelong learner in the field of computer science.

PO8: Ability to demonstrate the knowledge and understanding hardware, software,

PO11: Ability to function effectively as an individual and work collaboratively in a team.

SCHEME OF TEACHING AND EXAMINATION

SECOND SEMESTER MCA

SCHEME OF TEACHING AND EXAMINATION

4 MCA03xx Elective - 1 Elective 3 0 0 3 50 50 100 3

FOURTH SEMESTER MCA

5 MCA03xx Elective – 2 Elective 3 0 0 3 50 50 100 3

TOTAL 17 0 10 22 450 300 700

SCHEME OF TEACHING AND EXAMINATION

3 MCA03xx Elective – 3 Elective 3 0 0 3 50 50 100 3

4 MCA03xx Elective – 4 Elective 3 0 0 3 50 50 100 3

SIXTH SEMESTER MCA

Suggested Plan of Study for Regular Students

Suggested Plan of Study for Lateral Entry Students

Student has to earn 125 credits to get the degree of MCA

Industry Driven Electives

INDUSTRY DRIVEN ELECTIVE

Discrete Mathematical Structures (4:0:0)

Set Theory, Relations, Functions, Probability, Formal Logic, Graph theory.

Introduction to Unix and C Programming (4:0:0)

Sub code : MCA04xx CIE : 50 %

Web Technologies (3:0:0)

1. Remember and recall the basis of Internet.

Computer Organization (4:0:0)

1. Understand the basics of computer structure and machine instructions

Data Communication (3:0:0)

Unix and C Laboratory (0:0:3)

Usage of C language to develop various types of c programs like:

Web Technologies Laboratory (0:0:3)

System Programming (4:0:0)

Sub Code : MCA0411 CIE : 50%

Machine Architecture , Assemblers-1 , Assemblers-2, Loaders and Linkers, Macro Processor,

Data Structures and Algorithms with C (4:0:0)

Course Outcomes: On successful completion of the course, students will be able to

1. Identification of specific data structure for a given problem.

Operating Systems (4:0:0)

Sub Code : MCA0414 CIE : 50%

Introduction to Operating Systems, Process Management, Process Synchronization, Memory