SEMESTER : III (Curriculum Session 2024- 2025)

COURSE
S.NO. COURSE NAME L T P C
CODE
1 BCA 221 Web Designing 3 1 0 4
2 BCA 223 PC Hardware & Networking 3 1 0 4
3 BCA 211 Software Engineering 3 1 0 4
Object Oriented Programming Using C++ 3 1 0 4
4 BCA 203

5 BCA 225 Computer Organization 3 1 0 4

Object Oriented Programming Laboratory 0 0 2 1
6 BCA 251

Web Designing Laboratory 0 0 2 1

7 BCA 261
8 BLL 251` Life Skill(Technical Communication) 0 0 4 2
TOTAL NO. OF CREDITS 24

BCA FIFTH SEMESTER

COURSE
S. NO. COURSE TITLE L T P C
CODE
1 BCA 301 Introduction to Java 3 0 0 3
2 BCA 303 Web Technologies 3 0 0 3
3 BCA 305 Cloud Computing 3 0 0 3
Open Elective –I
4
CSL 101 Cyber Security 3 0 0 3
Programme Elective- I
5
BCA 307 Internet of Things 3 0 0 3
6 BCA 351 Java Lab 0 0 2 1
7 BCA 353 Web Technologies Lab 0 0 2 1
8 BCA 355 Major Project -I 0 0 4 2
9 BCA 300 Industrial Internship 0 0 2 1
10 BLL 351 Life Skill (Aptitude Building) 0 0 4 2
11 BCA 357 Technical proficiency in Computer Application-I 0 0 2 1
TOTAL NO. OF CREDITS FIFTH SEMESTER 23

MCA 1st Sem

SEMESTER-I
SR. NO. SUBJECT SUBJECTNAME
L T P Credit
CODE
1. MCA 521 OBJECT ORIENTED PROGRAMMING 3 1 0 4
2. MCA 525 ADVANCE COMPUTER ARCHITECTURE 3 1 0 4
3. MCA 527 FUNDAMENTAL OF E-COMMERCE 3 0 0 3
4. MCA 529 INTERNET OF THINGS 3 0 0 3
5. MCA 531 DATA STRUCTURE USING C 3 1 0 4
6 MCA 561 OBJECT ORIENTED PROGRAMMING LAB USING
0 0 2 1
‘C++’
7. MCA 565 DATA STRUCTURE USING C LAB 0 0 2 1
TOTAL CREDITS OF FIRST SEMESTER = 20

MCA SEMESTER-III
SR.NO. SUBJECT SUBJECTNAME L T P Credit
CODE
1. MCA 621 ANDROID 3 0 0 3
2. MCA 623 BASIC ELECTRONICS 2 0 0 2
3. MCA 625 ANALYSIS AND DESIGN OF ALGORITHMS 3 0 0 3
4. MCA 627 ADVANCE DATABASE MANAGEMENT 3 0 0 3
SYSTEM
5. Department Elective- I
MCA 629 CLOUD COMPUTING CONCEPTS 3 0 0 3
MCA 631 CYBER SECURITY 3 0 0 3
MCA 633 E-GOVERNANCE 3 0 0 3
6. MCA 661 ANDROID LAB 0 0 2 1
7. MCA 663 ANALYSIS AND DESIGN OF ALGORITHMS 0 0 2 1
LAB
8. MCA 665 ADVANCE DATABASE MANAGEMENT 0 0 2 1
SYSTEM LAB
9. MCA 650 INDUSTRIAL INTERNSHIP 0 0 2 1
10. MCA 651 LIFE SKILLS 0 0 2 1

TOTAL CREDITS OF THIRD SEMESTER = 19

 BCA SEMESTER III
COURSECODE COURSETITLE L T P C
BCA 221 WEB DESIGNING 3 1 0 4

COURSE OUTCOME
CO1. Analyzing and write the functions using scripting language.
CO2. Evaluating the website using event handling mechanism.
CO3. Applying a web page using HTML simple tags.
CO4. Applying the various use of cascading style sheet.

MODULE 1 – INTERNET BASICS [12 Sessions]

Internet basics, introduction to HTML, list, creating tables, linking documents, frames,
graphics to HTML documents, style sheet basics, adding styles to documents.
Suggested Readings: Introduction to HTML

MODULE 2 – CASECADING STYLE SHEET [12 Sessions]

Creating style sheet tools, style sheet properties, font, text, list, color and background color,
box, display properties.
Suggested Readings: CSS Tools

MODULE 3 – SCRIPTING LANGUAGES [12 Sessions]

Introduction to JavaScript, Advantages of JavaScript, JavaScript Syntax, data types, vari-

ables, arrays. Operators and Expressions, Looping constructors, functions, dialog box,
JavaScript, document object model.
Suggested Readings: Introduction to JavaScript

MODULE 4 – HTML [12 Sessions]

Introduction – objects in HTML, event handling, window object, document object, browser
object, object methods, built‐in objects, user defined objects, cookies.
Suggested Readings: Built‐in objects
MODULE 5 – DHTML [12 Sessions]

DHTML, cascading style sheets, class, external style sheets, working with JavaScript style
sheet.
Suggested Readings: DHTML

TEXT BOOKS

1. Thomas Powell(2017), HTML & CSS: The complete Reference, Fifth Edition Mc-
Graw Hill Education
2. Laura Lemay, Jennifer Kymin(2016) Mastering HTML,CSS & JavaScript, Web
Publishing ,
 COURSECODE COURSETITLE L T P C
BCA 223 PC HARDWARE& NETWORKING 3 1 0 4

COURSE OUTCOME
CO1. Understanding the concepts in basics of computer.
CO2. Describing the concepts of networking and topologies.
CO3. Analyzing the various networking devices.
CO4. Applying the process of network configuration.

MODULE 1: INTRODUCTION [12 Sessions]

Introduction about Computer‐Basics of Computer‐Organization of computer Software and hardware‐ Input/output
devices. Inside the PC: Opening the PC and identification‐ Study of different blocks‐ Assembling and disassembling.
Practical component: Assembling and disassembling.
Suggested Readings: Input/output devices

MODULE 2: BASIC NETWORKING CONCEPTS [12 Sessions]

Network Topologies: LAN, WAN, MAN, PAN, CAN.‐Networking Model the OSI model‐TCP/ IP Model Network
adapters.‐Introducing protocols.‐Cabling and troubleshooting.
Suggested Readings: Model The OSI model‐TCP/ IP Model

MODULE 3: ROUTERS AND SWITCHES [12 Sessions]

Routers‐ Switches‐ Configuration‐Modems‐Hubsetc‐Wired and Wireless technology.
Suggested Readings: Wired and Wireless technology

Network basic and configuration‐ Setting IP addresses‐ Sharing files and folders‐ Network troubleshooting. ‐PING
MODULE 4: NETWORK BASIC AND CONFIGURATION [12 Sessions]

test, ipconfig etc.

Suggested Readings: Network basic and configuration

MODULE 5: INTRODUCTION NETWORK SECURITY [12 Sessions]

Introduction to servers and network security‐ Basics of Internet and Intranet‐ Types of Internet Connections‐ Dialup,
Broadband, Leased Line, WWW, E‐mails, Search Engines, Social Networking.
Suggested Readings: servers and network security.

TEXT BOOKS
 1. White, Ron, and Timothy Downs(2014). How computers work. Que Corp‐ 9th Edition

REFERENCE BOOKS
1. Craig jacker(2017), PC Hardware: The Complete Reference, McGraw Hill Education

E BOOKS
1. https://www.e‐booksdirectory.com/listing.php?category=315

COURSECODE COURSETITLE L T P C
BCA211 SOFTWAREENGINEERING 3 1 0 4

COURSE OUTCOME
CO1. Describing the basics Software Engineering.
CO2. Analyzing the Software Design.
CO3. Evaluating the Software Requirement Analysis.
CO4. Applying about the Structured Analysis.

MODULE 1: INTRODUCTION [12 Sessions]

Introduction: Definition of software and software engineering – Software myths– Software Engineering paradigms:
Linear Sequential Model & Prototyping Model Software Project Management – Software Metrics – Software Cost Es-
timation – Software Project Planning.
Suggested Readings: Linear Sequential Model

MODULE 2: SOFTWARE REQUIREMENT ANALYSIS [12 Sessions]

Software Requirement Analysis: Software Risks – Software Configuration Management System Analysis – Modelling
the System Architecture – System Specification – Fundamentals of Requirement Analysis – Software Prototyping–
Prototyping method sand tools specification – Software Requirements Specifications.
Suggested Readings: Software Risks, Software Requirements Specifications

MODULE 3: STRUCTURED ANALYSIS [12 Sessions]

Structured Analysis: Introduction – the elements of the analysis model – data objects, attributes and relationships –
Cardinality and Modality – ERD – DFD – Classical Analysis Methods: DSSD, JSD, SADT.
Suggested Readings: DSSD, JSD, SADT

MODULE 4: SOFTWARE DESIGN [12 Sessions]

Software Design: Software Design and Software Engineering – Design and Software Quality – Evolution of Software
Design – Design Principles. Design Concepts, Abstraction, Refinement, Modularity – Effective Modular Design,
Functional Independence, Cohesion, Coupling.
Suggested Readings: Design Principles

MODULE 5: SOFTWARE TESTING METHODS [12 Sessions]

Software Testing Methods: Software Testing Fundamentals – White Box Testing– Black Box Testing – Debugging –
Software Quality: McCall’s Quality Factors.
Suggested Readings: Testing Strategies.

TEXT BOOKS
1 Richard E Fairley (2016), Principles of Software Engineering, Wiley‐ Blackwell
Publisher

REFERENCE BOOKS
1 Rajib Mall (2014), Fundamentals of Software Engineering, 4th Edition, Publisher‐
Prentice Hall India Learning Pvt Ltd.

E BOOKS
 COURSECODE COURSETITLE L T P C

BCA203 OBJECTORIENTEDPROGRAMMING USING C++ 3 1 0 4

COURSE OUTCOME
CO1. Describing the OOPS fundamentals
CO2. Analyzing the class, objects and constructor and destructor
CO3. Evaluating functions and its overloading and virtual functions
CO4. Applying the Functions of File handling

MODULE 1: INTRODUCTION [12

Sessions]

Object‐oriented paradigm, elements of object-oriented programming – Merits and demerits of OO

methodology – C++ fundamentals – data types, operators and expressions, control flow, arrays,
strings, pointers and functions.
Suggested Readings: Procedure Oriented Programming

MODULE 2: OVERVIEW PROGRAMMING IN C++ [12

Sessions]

Classes and objects – constructors and destructors, operator overloading –inheritance, virtual
functions and polymorphism
Suggested Readings: Constructors, Object oriented concepts

MODULE 3: ARRAYS AND POINTERS [12

Sessions]

Arrays – Pointers – this pointer – functions Overloading – Default arguments – Overloading

Constructors – Pointers to Functions – Ambiguity in function overloading.
Suggested Readings: Inheritance, Function Overloading

MODULE 4: POLYMORPHISM [12

Sessions]

Operator Overloading – Members Operator Function – Friend Operator Function – Overloading some
special operators like [ ], ( ) – Inheritance – Virtual base Class – Polymorphism – Virtual functions –
Pure virtual function
Suggested Readings: Polymorphism, Virtual Functions

MODULE 5: FILE HANDLIN [12 Sessions]

C++ streams – console streams –operations, manipulators ‐ File streams ‐classes file modes file
pointers and manipulations file I/O – Exception handling
Suggested Readings: File handling in C++.
TEXT BOOKS
1. Herbert Schildt(2017), "C++ Complete Reference", Fourth edition, TMH,

REFERENCE BOOKS
1. Bjarne Stroustrup, (2013 )“The C++ programming language”, Addison Wesley,
COURSECODE COURSETITLE L T P C

BCA225 COMPUTERORGANIZATION 3 1 0 4

COURSE OUTCOME
CO1. Describing the basic fundamentals of computer organization such as data transfer
logic and arithmetic operations
CO2. Describing the concept of Central Processing such as addressing modes, instruction
formats and program control statements
CO3. Analyzing cost performance and design trade-offs in designing and con-
structing a computer processor including memory. Describing internal organization of com-
puters, CPU, memory unit and Input/Outputs and the relations between its main components
CO4. Evaluating the concept of Input‐Output Organization and able to differentiatemicro-
processor and microcontrollers.

MODULE 1 – BUILDING BLOCKS OF COMPUTER SYSTEM [12 Ses-

sions]
Basic building blocks – I/O, Memory, ALU and its components, Control Unit and its functions, In-
struction –word, Instruction and Execution cycle, branch, skip, jump and shift instruction, Operation
of control registers; Controlling of arithmetic operations
Suggested Readings: Transfer logic, Micro operations and Binary codes.

MODULE 2 – ADDRESSING TECHNIQUES AND REGISTERS [12 Ses-

sions]
Addressing techniques – Direct, Indirect, Immediate, Relative, indexed addressing and paging. Regis-
ters – Indexed, General purpose, Special purpose, overflow, carry, shift, scratch, Memory Buffer reg-
ister; accumulators; stack pointers; floating point; status information and buffer registers.
Suggested Readings: Instruction execution stages, addressing modes.

MODULE 3 – MEMORY [12

Sessions]
Main memory, RAM, static and dynamic, ROM, EPROM, EEPROM, EAROM, Cache and Virtual
memory.
Suggested Readings: Memory hierarchy, Use of cache memory and virtual memory

MODULE 4 – INTERCONNECTING SYSTEM COMPONENTS [12 Ses-

sions]
Buses, interfacing buses, Bus formats – address, data and control, Interfacing keyboard, display, aux-
iliary storage devices and printers. I/O cards in personal computers.
Suggested Readings: Parallel processing, Pipelining and Peripheral devices

MODULE 5 – INTRODUCTION TO MICROPROCESSORS AND MICROCONTROLLERS

[12 Sessions]
Introduction to 8085 microprocessors, examples of few instructions to understand addressing tech-
niques. Difference between microprocessor and microcontrollers.
Suggested Readings: Addressing techniques and Types of memory.

TEXT BOOKS
 1 David A. Patterson ,( 2012)"Computer Architecture and logical Design", McGraw Hill
2 John L. Hennessy(2011), Computer Organization and Design: The Hardware/SoftwareIn-
terface(4th ed.), Morgan Kaufmann Publishers Inc.

REFERENCE BOOKS
1 J.P. Hayes(1988), “Computer Architecture & Organization”, Tata McGraw Hill

E BOOKS
https://sites.google.com/site/uopcog/ebooks

COURSECODE COURSETITLE L T P C

BCA251 OBJECT ORIENTED PROGRAMMING 0 0 2 1

LABORATORY

COURSE OUTCOME
CO1. Applying the concept of functions.
CO2. Applying the constructor within program.
CO3. Applying polymorphism using overloading.
CO4. Applying a program using run time polymorphism.

LAB / MINI PROJECT/FIELD WORK

‐ Functions with default arguments

1. Programs Using Functions

‐ Implementation of Call by Value, Call by Address and Call by Reference

‐ Classes with primitive data members

2. Simple Classes for understanding objects, member functions and Constructors

‐ Classes with arrays as data members

‐ Classes with pointers as data members – String Class
‐ Classes with constant data members
‐ Classes with static member functions

‐ Operator Overloading including Unary and Binary Operators.

3. Compile time Polymorphism

‐ Function Overloading

‐ Inheritance
4. Runtime Polymorphism

‐ Virtual functions
‐ Virtual Base Classes
‐ Templates

‐ Sequential access
5. File Handling

- Random access

TEXT BOOKS
1. Herbert Schildt(2017), "C++ Complete Reference", Fourth edition, TMH
REFERENCE BOOKS
1. BjarneStroustrup, (2013 )“The C++ programming language”, Addison Wesley
COURSECODE COURSETITLE L T P C

BCA261 WEB DESIGNING LABORATORY 0 0 2 1

COURSE OUTCOME
CO1. Applying web pages using HTML simple tags.
CO2. Applying cascading style sheet andfunctions using scripting language
CO3. Applying website using event handling
CO4. Applying a website for any real-world problem

LAB /MINI PROJECT/FIELD WORK

1. Write a HTML program to illustrate body and pre tags
2. Write a HTML program to illustrate text font tags
3. Write a HTML program to illustrate comment, header and div tags
4. Write a HTML program to illustrate text formatting tags
5. Write a HTML program to illustrate List tags
6. Write a HTML program to illustrate nested and definition tags
7. Write a HTML program to illustrate image and table tags
8. Write a HTML program to illustrate hyper link and form tags
9. Write a java script program for addition of two numbers
10. Write a script to create an array of 10 elements and display its contents.
11. Create a resume page using html tags.

TEXT BOOKS
1. Thomas Powell(2017), HTML &CSS:The complete Reference, Fifth Edition,
McGraw Hill Education
2. Laura Lemay, Jennifer Kymin (2016), “Mastering HTML,CSS & JavaScript, Web Pub-
lishing

REFERENCE BOOKS
1. Joshua Johaman, Richard Zea, Talha Khan(2016), Web Developers Reference Guide,
Packet Publishing
BCA –V
COURSE
COURSE TITLE L T P C
CODE
BCA 301 INTRODUCTION TO JAVA 3 0 0 3

COURSE OUTCOMES
CO 1 Understanding how to use data types and computation, conditional and control struc-
tures, string handling and functions.
CO 2 Describing Java Swings for designing GUI applications based on MVC architecture.
CO 3 Analyzing the importance of Classes & objects along with constructors, Arrays and
Vectors.
CO 4 Evaluating problem analysis assignments how they relate to the design of methods,
abstract classes and interfaces and packages.

COURSE CONTENT
UNIT I JAVA FUNDAMENTALS
[SESSIONS: 9]
Introduction to Java. Difference between C++ and Java. Keywords, Tokens, Data types. Use of
public, private and protected. OOPS using Java: Use of class and method in Java. Inheritance,
Abstraction, Polymorphism, Encapsulation and data privacy. Difference between method overloading
and method overriding.

UNIT II Exception Handing

[SESSIONS: 9]
Introduction to Exceptions. Difference between error and exception. Use of try, catch and throw.
Difference between throw and throws. Types of Exceptions, Exception handling in Java.

UNIT III Collection Framework

[SESSIONS: 9]
Use of Collections in Java. ArrayList, LinkedList, HashMap, TreeMap, HashSet in Java.
Multithreading in Java. Thread Synchronization. Thread Priority, Thread LifeCycle. Wrapper Classes,
I/O Streams and Annotations: Use of wrapper classes in Java- Integer, Character, Long, Boolean.
Autoboxing and Unboxing. Byte stream, Character stream, Object serialization, cloning. System
defined annotations, Custom annotations, application of annotations, Testing using JUnit.

UNIT IV JDBC
[SESSIONS: 9]
Database connectivity, Types of Drivers for connection, Connection Example. CRUD operations
using Database, Configuring various types of drivers for Java Database Connectivity, MVC Model for
project development, Sequence, Dual table , Date type management in Java.

UNIT V Servlets and JSP

[SESSIONS:9]
Servlet Lifecycle, Generic Servlet, Http Servlet, Linking Servlet to HTML, HttpServlet Request and
Response, Servlet with JDBC, Configuring project using servlet, Servlet Config and Servlet Mapping
JSP declaration, JSP directives, JSP Scriptlets, JSP include tag, JSP page tag, JSTL.

TEXT BOOKS:

1. Naughton,Schildt,“TheCompleteReferenceJAVA2”,TMH
2. Deitel & Deitel,“ The Complete Java”
3. “Professional JAVA Server Programming”,Allamaraju and Buest, SPD Publication.
4. “AdvancedProgrammingforJAVA2platforms”AustinandPawlan, Pearson.
5. Internet&JavaProgrammingbyKrishnamoorthy&S.Prabhu(NewAgePublication)

COURSE
COURSE TITLE L T P C
CODE
BCA 303 WEB TECHNOLOGIES 3 0 0 3

COURSE OUTCOMES
CO1 Applying a dynamic webpage by the use of java script and Students will be able to connect a
java program to a DBMS and perform insert.
CO2 Understanding a well formed / valid XML document.
CO3 Describing a server side java application called Servlet to catch, update and delete operations on
DBMS table.
CO4 Analysing a server side java application called JSP to catch form data sent from client, process
it and store it on database.

COURSE CONTENT
UNIT I
Web Page Designing: Introduction and Web Development Strategies, History of Web and
Internet, Protocols Governing Web, HTML-Introduction, HTML Tags, HTML-Grouping
Using Div & Span, HTML-Lists, HTML-Images, HTMLHyperlink, HTML-Table, HTML-
Iframe, HTML-Form, Introduction of CSS, CSS Syntax, External Style Sheet using < link >,
Multiple Style Sheets, Value Lengths and Percentages, CSS-Selectors, CSS-Box Model,
Floats, Clear, Introduction to Bootstrap
UNIT I I :
Spring: Spring Core Basics-Spring Dependency Injection concepts, Introduction
to Design patterns, Factory Design Pattern, Strategy Design pattern, Spring
Inversion of Control, AOP, Bean Scopes- Singleton, Prototype, Request, Session,
Application, WebSocket, Auto wiring, Annotations, Life Cycle Call backs, Bean
Configuration styles
UNIT III: Spring Boot:
Spring Boot- Spring Boot Configuration, Spring Boot Annotations, Spring Boot Actuator,
Spring Boot Build Systems, Spring Boot Code Structure, Spring Boot Runners, Logger,
BUILDING RESTFUL WEB SERVICES, Rest Controller, Request Mapping, Request Body,
Path Variable, Request Parameter, GET, POST, PUT, DELETE APIs, Build Web
Applications

UNIT IV: JAVA BEANS AND SERVLET

Introduction to Java Beans, Advantage, Properties, BDK, Java Beans API Introduction
to Servlet, Lifecycle, JSDK, Servlet API, Servlet Packages: HTTP package, working
with Http request and response, Security Issues.

UNIT V: JSP
Introduction to JSP, JSP processing, JSP Application Design, Tomcat Server, Implicit
JSP objects, Conditional Processing, Declaring variables and methods, Error Handling
and Debugging, Sharing data between JSP pages- Sharing SESSION and Application Data.
TEXT BOOKS:
1. Burdman, “Collaborative Web Development” Addison Wesley.
2. Hans Bergsten, “Java Server Pages”, SPD O’Reilly

REFERENCE BOOKS:
1. Chris Bates, “Web Programing Building Internet Applications”, 2nd Edition, WILEY,
Dreamtech
2. Joel Sklar , “Principal of web Design” Vikash and Thomas Learning

COURSE
COURSE TITLE L T P C
CODE
BCA 305 CLOUD COMPUTING 3 0 0 3

COURSE OUTCOMES

CO1 Analyzing the Cloud computing setup with its vulnerabilities and applications using different
architectures.
CO2 Understanding different workflows according to requirements and apply map reduce program-
ming model.
CO3 Applying and designing suitable Virtualization concept, Cloud Resource Management and
design scheduling algorithms.
CO4 Evaluating combinatorial auctions for cloud resources and design scheduling algorithms for
computing clouds.

COURSE CONTENT
UNIT I [10 Sessions]
Cloud Computing Fundamentals: Cloud Computing definition, Types of cloud, Cloud services: Bene-
fits and challenges of cloud computing, Evolution of Cloud Computing, usage scenarios and Applica-
tions, Major Players in Cloud Computing, and Issues in Cloud

UNIT II
[10 Sessions ]
Disadvantage of stand-alone application, web-application vs. cloud, Service Model Software as a Ser-
vice, Platform as a Service, Infrastructure as a Service, Service providers, Deployment Model- Public,
Private and Hybrid Cloud, Google App Engine, Amazon EC2

UNIT III [10 Sessions ]

Cloud Computing Management, Cloud Computing Data Storage, Collaborating via Web-Based Com-
munication Tools, Collaborating via Social Networks, Collaborating via Blogs and Wikis.

UNIT IV [10 Sessions]

Need for Virtualization, Pros and cons of Virtualization, Types of Virtualization, Process VM, Vir-
tual Machine monitor , Virtual machine properties, VM – Hypervisors, KVM , Virtual Box, Hyper-V.

UNIT V [10 Sessions ]

Cloud Security Challenges, Cloud Computing Operation, Cloud computing Application, Cloud Com-
puting Providers, Cloud Computing Challenges, Common Standards: The Open Cloud Consortium,
Standards for application Developers, End user access to cloud computing.

TEXT BOOKS:
1. Bloor R., Kanfman M., Halper F. Judith Hurwitz “Cloud Computing for Dummies” (Wiley
India Edition),2010
 2. John Rittinghouse& James Ransome, “Cloud Computing Implementation Management and
Strategy”, CRC Press, 2010.
REFERENCE BOOKS:
1. Antohy T Velte ,Cloud Computing : “A Practical Approach”, McGraw Hill,2009.
2. Michael Miller, Cloud Computing: “Web-Based Applications Online”, Que Pub., Aug 2008.

COURSE
COURSE TITLE L T P C
CODE
CSL 101 CYBER SECURITY 3 0 0 3

COURSE OUTCOMES
CO1 Describing critical thinking by analysing situations and by constructing and selecting solutions
to problems.
CO2 Understanding and appreciating the importance of the impact of effective leadership in IT or -
ganizations.
CO3 Evaluating and appreciating the legal and ethical environment impacting individuals as well as
business organizations and have an understanding of the ethical implications of IT legal de -
cisions.
CO4 Applying various types of Application such as VPN, Data Security, e-Cash and So on .

COURSE CONTENT

UNIT I INTRODUCTION
[8 Sessions ]
Introduction to Information Systems, Types of Information Systems, Development of Information
Systems, Introduction to Information Security, Need for Information Security, Threats to Information
Systems, Information Assurance, Cyber Security, and Security Risk Analysis.
UNIT II APPLICATION SECURITY
[8 Sessions ]
Application Security (Database, E-mail and Internet), Data Security Considerations-Backups,
Archival Storage and Disposal of Data, Security Technology-Firewall and VPNs, Intrusion Detection,
Access Control. Security Threats -Viruses, Worms, Trojan Horse, Bombs, Trapdoors, Spoofs, E-mail
Viruses, Macro Viruses, Malicious Software, Network and Denial of Services Attack, Security
Threats to E-Commerce- Electronic Payment System, e- Cash, Credit/Debit Cards. Digital Signature,
Public Key Cryptography
UNIT III DEVELOPING SECURE INFORMATION SYSTEMS [8
Sessions ]
Application Development Security, Information Security Governance & Risk Management, Security
Architecture & Design Security Issues in Hardware, Data Storage & Downloadable Devices, Physical
Security of IT Assets,
, Publishing and Notification Requirement of the Policies. Evolving Technology Security – Mobile,
Cloud, Outsourcing, SCM.
UNIT IV INFORMATION SECURITY STANDARDS-ISO
[8 Sessions ]
IT Act, Copyright Act, Patent LawAccess Control, CCTV and Intrusion Detection Systems, Backup
Security Measures.
UNIT V SECURITY POLICIES
[8 Sessions ]
Development of Policies, WWW Policies, Email Security Policies, Policy Review Process-Corporate
Policies-Sample Security Policies, IPR. Cyber Laws in India; IT Act 2000 Provisions, Intellectual
Property Law: Copy Right Law, Software License, Semiconductor Law and Patent Law. Case Study –
Corporate Security.

TEXT BOOKS:
1. Charles P. Pfleeger, Shari LawerancePfleeger, “Analysing Computer Security”, Pearson Edu-
cation India.
2. V.K.Pachghare, “Cryptography and information Security”, PHI Learning Private Limited,
Delhi India.
3. Sarika Gupta & Gaurav Gupta, Information Security and Cyber Laws, Khanna Publishing
House
REFERENCE BOOKS:
1. K Anshul Kaushik, Cyber Security, Khanna Publishing House.
2. Michael E.Whitman and Herbert J Mattord "Principle of Information Security" Cengage

COURSE
COURSE TITLE L T P C
CODE
BCA 307 INTERNET OF THINGS 3 0 0 3

COURSE OUTCOMES
CO1 Understanding the application areas of IOT.
CO2 Evaluating the revolution of Internet in Mobile Devices, Cloud & Sensor Networks.
CO3 Describing building blocks of Internet of Things and characteristics.
CO4 Applying privacy, security and design related challenges of IoT

COURSE CONTENT

UNIT I INTRODUCTION
[8 Sessions ]
Internet of Things Today, Time for Convergence, Towards the IoT Universe, Internet of Things
Vision, IoT Strategic Research and Innovation Directions, IoT Applications.

UNIT II INTERNET TECHNOLOGIES

[8 Sessions ]
Future Internet Technologies, Infrastructure, Networks and Communication, Processes, Data
Management, Security, Privacy & Trust, Device Level Energy Issues, IoT Related
Standardization

UNIT III IOT ARCHITECTURE

[8 Sessions ]
State of the Art–Introduction, State of the art, Architecture Reference Model- Introduction, Reference
Model and architecture, IoT reference Model.

UNIT IV IOT REFERENCE ARCHITECTURE

[8 Sessions ]
Introduction, Functional View, Information View, Deployment and Operational View, Other Relevant
architectural views.
UNIT V IOT DEFINITIONS
[8 Sessions ]
Overview, applications, potential & challenges, and architecture.
IoT examples: Case studies, e.g. sensor body-area-network and control of a smart home

TEXT BOOKS:
1. Vijay Madisetti and ArshdeepBahga,“Internet of Things (A Hands-on-Approach)”,VPT.
2. Francis daCosta,“Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything”,1st Edition, Apress Publications.

REFERENCE BOOKS:

1. CunoPfister, Getting Started with the Internet of Things, O"ReillyMedia,ISBN: 978-1-4493-

9357-1.

COURSE
COURSE TITLE L T P C
CODE
BCA 309 DATA MINING AND DATA WAREHOUSING 3 0 0 3

COURSE OUTCOMES
CO1 Understanding the functionality of the various data mining and data warehousing component.
CO2 Applying the strengths and limitations of various data mining and data warehousing models.
CO3 Analyzing techniques of various data.
CO4 Describing different methodologies used in data mining and data ware housing.

COURSE CONTENT

UNIT I INTRODUCTION
[8 Sessions ]
Data Mining – Motivation, Importance of DM Functionalities, Basic Data, Mining Tasks, DM
Applications, and Social Implications.

UNIT II DATA WAREHOUSING

[8 Sessions ]
Differences between Operational Database and Data Warehouse – Multi- dimensional Data Model
From Tables to Data Cubes. Schemas, Measures, DW Implementation – Efficient Computation of
Data Cubes.

UNIT III DATA REPROCESSING, DATA MINING PRIMITIVES, LANGUAGES

[8 Sessions ]
Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and concept of
Hierarchy Generation, Task relevant Data, Background Knowledge, Presentation and Visualization of
Discovered Patterns.

UNIT IV DATA MINING ALGORITHMS

 [8 Sessions ]
Association Rule Mining, Classification and Prediction – Decision Tree, Baysian Classification Back
Propagation, Cluster Analysis, Outlier Analysis.

UNIT V WEB, TEMPORAL AND SPATIAL DATA MINING

[8 Sessions ]
Web Content Mining, Web Structure Mining, Web Usages Mining, Spatial Mining, Generalization
and specialization, Spatial Rules, Spatial Classification and Clustering Algorithms, Temporal Mining,
Modelling Temporal Events, Times Series, Pattern Detection, Sequences.

TEXT BOOKS:
1. JiaweiI-lan&MichelineKambler, “Data Mining: Concepts and Techniques”, Harcourt India
Pvt. Ltd., First Indian Reprint.
2. Margaret H. Dunham, “Data Mining: Introduction and Advance Topics”, Pearson Education,
First Indian Reprint.

REFERENCE BOOKS:
1. Arun K. Pujari, “Data Mining Techniques”, University Press (India) Limited.
2. Efrem O, Mallach, “Decision Support and Data Warehousing Systems”, Mcgraw-Hill
International Edition.

COURSE
COURSE TITLE L T P C
CODE
BCA 351 JAVA LAB 0 0 2 1

COURSE OUTCOMES

CO1: To Understand Object-oriented programming in Java: class definition, constructors, method

overloading, inheritance.
CO2: Applying Java class implementation: instance methods, dynamic method invocation, nested
classes
CO3: Describing the Advanced Java concepts: sub classing, array of objects, string manipulation,
method overriding.
CO4: Evaluate the Java programming mastery: multilevel inheritance, package creation, exception
handling

LIST OF EXPERIMENTS:
[30 Sessions ]

1. Write a Java Program to define a class, describe its constructor, overload the Constructors and
instantiate its object.
2. Write a Java Program to define a class, define instance methods for setting and retrieving values of
instance variables and instantiate its object.
3. Write a Java Program to define a class, define instance methods and overload them and use them for
dynamic method invocation.
4. Write a Java Program to demonstrate use of sub class.
5. Write a Java Program to demonstrate use of nested class.
6. Write a Java Program to implement array of objects.
7. Write a Java program to practice using String class and its methods.
8. Write a Java Program to implement inheritance and demonstrate use of method overriding.
9. Write a Java Program to implement multilevel inheritance by applying various access controls to its
data members and methods.
 10. Write a Java program to implement the concept of importing classes from user defined package and
creating packages.
11. Write a program to implement the concept of Exception Handling by creating user defined exceptions.

REFERENCE BOOK:
1. K. Srinivas Rao; A Hands-On Java Programming- A Beginners Approach : A practical Lab
Manual.

COURSE
COURSE TITLE L T P C
CODE
BCA 353 WEB TECHNOLOGIES LAB 0 0 2 1

COURSE OUTCOMES
CO1 Describing The XML and HTML modules.
CO2 Understanding Web Service.
CO3 Evaluating Spring boot
CO4 Applying a simple shopping cart example with SESSION tracking API.

LIST OF EXPERIMENTS:
[15 Sessions ]

1. Write HTML/Java scripts to display your CV in navigator, your Institute website, Department
Website and Tutorial website for specific subject
2. Design HTML form for keeping student record and validate it using Java script.
3. Write an HTML program to design an entry form of student details and send it to store at
database server like SQL, Oracle or MS Access.
4. Write programs using Java script for Web Page to display browsers information.
5. Write a Java applet to display the Application Program screen i.e. calculator and other.
6. Writing program in XML for creation of DTD, which specifies set of rules. Create a style
sheet in CSS/ XSL & display the document in internet explorer.
7. Using ASP for server side programming, ASP for user name and password and to retrieve &
match the value. It displays success and failure messages. ASP for creating text file local
drive, ASP for keeping the student record in database.
8. Program to illustrate JDBC connectivity. Program for maintaining database by sending
queries. Design and implement a simple servlet book query with the help of JDBC & SQL.
Create MS Access Database, Create on ODBC link, Compile & execute JAVA JDVC Socket.
9. Design and implement a simple shopping cart example with SESSION tracking API.
 COURSE
COURSE TITLE L T P C
CODE
BLL 351 LIFE SKILL (APTITUDE BUILDING) 0 0 4 2

COURSE OUTCOMES

CO1 Understanding the problems related to percentage, data Interpretation etc.

CO2 Describing the basic concepts of logical reasoning.
CO3 Evaluating the problems related to Quantitative Ability& Logical Reasoning.
CO4 Applying mathematical aptitude.

COURSE CONTENT:

UNIT I
Percentages, Data Interpretation, Permutation and Combination

UNIT II
Probability, Areas, Shapes, Perimeter, Speed Time and Distance / Boats and Streams

UNIT III
Time and Work, Profit and Loss | Mixtures & Allegation, Problem on Ages

UNIT IV
Divisibility, Number Decimal & Fractions, Problems on Simple and Compound Interest, Problems on
Time and Distance.

UNIT V
Series and Progression, LCM and HCF, Numerical and Alphabet Puzzles, Seating Arrangement Para
– Jumble, Text Completion.

TEXT BOOKS:

1. Quantitative abilities by Arun Sharma.

2. Quantitative Aptitude for Competitive Examinations by R S Agrawal.

REFERENCE BOOKS:

1. Verbal and Non-Verbal reasoningby R S Agrawal.

 COURSE
COURSE TITLE L T P C
CODE
TECHNICAL PROFICIENCY IN COMPUTER
BCA 357 0 0 2 1
APPLICATION-I

COURSE OUTCOMES

CO1 Applying the skills in industries and other organizations.

CO2 Understanding function and its types
CO3 Evaluating types of data structure
CO4 Describing oops concepts

COURSE CONTENT

UNIT I
[3 Sessions ]
About C Language: Array, Multidimensional arrays. Character arrays, Array overflow, String
Variables, Reading & writing strings, string handling functions. Advantages of functions, declaring a
function, calling a function, variables, passing arguments to a function, nested functions, passing array
to functions, recursion in functions, Call by value and Call by reference. Pointers and function, Array
of pointers, Pointer and Strings, Pointer to structure, Pointers within structure.

UNIT II
[3 Sessions ]
Array and Linked Implementation of Stack in C, Recursion, Queues. Binary Trees, Extended Binary
Trees, Threaded Binary trees, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal
algorithm.

UNIT III
[3 Sessions ]
Sequential search, Binary Search, Comparison and Analysis Internal Sorting: Insertion Sort,
Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical
consideration for Internal Sorting. Search Trees: Binary Search Trees (BST), Insertion and Deletion in
BST, Complexity of Search Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees &
B+ Trees. Hashing: Hash Function, Collision Resolution Strategies. Storage Management: Garbage
Collection and Compaction.

UNIT IV
[3 Sessions ] Characterizations, Method for Handling Deadlocks, Deadlock Prevention,
Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock; Concept of File System,
Function of File System, Access Methods, Allocation Methods, Directory System and Protection.
Disk Management: Scheduling Algorithm.

UNIT V
[3 Sessions ] Objects and Classes: Basics of object and class in C++, Private and public
members, static data and function members, constructors and their types, destructors, operator
overloading, type conversion. Inheritance: Concept of Inheritance, types of inheritance: single,
multiple, multilevel, hierarchical, hybrid, protected members, overriding, virtual base class.

COURSE CODE COURSE TITLE L T P C

BCA 355 MAJOR PROJECT-1 0 0 4 2

CO1: Describe Proficiency in formulating project proposals with clear objectives, categories, and
analysis methods.
CO2: Applying Mastery in software development, including design, implementation, and testing
phases.
CO3: Ability to present project findings effectively and engage in a viva voce examination.
CO4: Understanding the importance of project evaluation criteria, including proposal, report,
presentation, and viva voce components.

COURSE CONTENT:

GUIDELINES FOR PROJECT FORMULATION

As the project work constitutes a major component in most of the professional programs and it is to be
carried out with due care and should be executed with seriousness by the candidates.

TYPE OF PROJECT
The students are expected to work out a real-life project in some industry/ research and development
laboratories/educational institutions/software companies, it is suggested that the project is to be
chosen which should have some direct relevance in day-to-day activities of the candidates in his/her
institution. It is not mandatory for a student to work on a real-life project. The student can formulate a
project problem.

PROJECT PROPOSAL
The project work should compulsorily include the software development.
The project proposal should contain complete details in the following form:
1. Title of the Project
2. Introduction and Objectives of the Project
3. Project Category (RDBMS/OOPS/Networking/Multimedia/Artificial Intelligence/Expert Systems etc.)
4. Analysis (DFDs at least up to second level, ER Diagrams/ Class Diagrams/ Database
5. Design etc. as per the project requirements). A complete structure which includes: Number of modules
and their description to provide an estimation of the student’s effort on the project. Data Structures as
per the project requirements for all the modules. Process Logic of each module. Testing process to be
used.
6. Reports generation
7. Tools / Platform, Hardware and Software Requirement specifications
8. Future scope and further enhancement of the project.

EVALUATION OF THE PROHECT

1. Proposal of the Project 20%

2. Project Report 20%
3. Presentation 30%
4. Viva Voce 30%
 COURSE CODE COURSE TITLE L T P C
BCA 300 INDUSTRIAL INTERNSHIP 0 0 0 2

COURSE OUTCOMES
CO 1. Understanding of the workplace for professional and academic success.
CO 2. Applying the practical knowledge workplace competencies necessary for professional and
academic success.
CO 3. Evaluate work habits and attitudes necessary for job success.
CO 4. Describing written communication and technical report writing skills.

COURSE CONTENT

Summer internship program allows students to gain practical experience in the workplace before
receiving their undergraduate degrees. The student identifies companies willing to hire him/her on a
full-time basis for a 4-8 week period. A basic premise for this course is that career-related work
experiences during graduation benefit students by allowing them to gain comfort and confidence in
job performance and job search skills, explore compatibility with specific careers and companies, and
become more mature professionally.
Students will gain an understanding of workplace dynamics, professional expectations, and the
influence of culture on both. Build proficiency in arrange of business or industry skills appropriate to
the field of the internship placement, including professional and inter-cultural communication through
written, verbal, and non-verbal means. Refine and clarify professional and career goals through
critical analysis of the internship experience or research project.

EVALUATION OF THE INTERNSHIP:

1. Project Report 30%
2. Quality of the Project 30%
3. Viva-Voce and Submission of the certificate 40%
MCA
FIRST SEMESTER
COURSE CODE COURSE TITLE L T P C
MCA521 OBJECTORIENTEDPROGRAMMING 3 1 0 4

COURSE OUTCOMES

CO 1: Understanding the significance and key features of object oriented program-

ming and modeling using UML
CO 2: Describing the basic structural, behavioral and architectural models using ob-
ject oriented software engineering approach.
CO 3: Analyzing the object oriented modeling techniques for analysis and design of
a system.
CO 4: Applying the basic features of data abstraction and encapsulation in C++ pro-
grams.

CONTENTS:

UNIT I [SESSIONS: 9]
Introduction: The meaning of Object Orientation, object identity, Encapsulation, information
hiding, polymorphism, generosity, importance of modelling, principles of modelling, object
oriented modelling, Introductionto UML, conceptual model of the UML, Architecture.

UNIT II [SESSIONS: 9]
Introduction Basic Structural Modeling, Classes, Relationships, common Mechanisms,
and diagrams.
Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Ob-
ject Diagrams.
Introduction Collaboration Diagrams: Terms, Concepts, depicting a message, polymor-
phism in diagrams
Sequence Diagrams: Terms, concepts, depicting asynchronous messages with/without pri-
ority, Basic Behavioral Modelling: Use cases, Use case Diagrams, Activity Diagrams,
and Architectural Modeling: Component,
Deployment and its diagrams.

UNIT III [SESSIONS: 9]

Object Oriented Analysis: Object oriented design, Object design, Designing
algorithms, design optimization, Implementation of control, Inheritance - Its types, Ob-
ject representation, Physical packaging, Documenting , Structured analysis and
structured design , Jackson Structured Development (JSD).Mapping object oriented
concepts using non-object oriented language, Passing arguments to methods,
Implementing inheritance, associations encapsulation, Object oriented Programming
style: reusability, extensibility, robustness.

UNIT IV [SESSIONS: 9]
C++ Basics: Overview, Program structure, namespace, identifiers, variables, constants, enum,
operators, typecasting, control structures C++.Functions: Simple functions Call and Return
by reference, Inline functions, Overloading of functions, default arguments, friend functions,
and virtual functions.

UNIT V [SESSIONS: 9]
Objects and Classes : Basics of object and class in C++, Private and public members,
static data and function members, constructors and their types, destructors, operator over-
loading, type conversion. Inheritance: Concept of Inheritance, types of inheritance: single,
multiple, multilevel, hierarchical, hybrid, protected members, overriding, virtual base class
Polymorphism: Pointers in C++, Pointes and Objects, this pointer, virtual and pure virtual
functions, implementing polymorphism.

TEXT BOOKS:
1. Herbert Schildt,"JavaThecompletereference",McGrawHillEducation,8thEdition.
2. CayS. Horstmann, Gary Cornell, “Core Java Volume–I Fundamentals", Prentice
Hall, 9thEdition.
3. Steven Holzner,“Java Black Book”,Dreamtech.
4. Balagurusamy E,“ProgramminginJava”,McGrawHill
5. Naughton,Schildt,“TheCompletereferencejava2”,McGrawHill
6. Khalid Mughal,“AProgrammer’sGuidetoJava SE8Oracle CertifiedAssociate (OCA)”,
Addison-Wesley.
 COURSE CODE COURSE TITLE L T P C
MCA525 ADVANCECOMPUTERARCHITECTURE 3 1 0 4

COURSE OUTCOMES
CO 1: Understanding the various modes in which IO devices communicate with CPU
and memory.
CO 2: Describing functional units of digital system and explain how arithmetic and log-
ical operations are performed by computers
CO 3: Analyzing the operations of control unit and writing sequence of instructions for
carrying out simple operation using various addressing modes.
CO 4: Evaluating various types of memory and its organization.

COURSE CONTENT:

UNIT I [SESSIONS: 9]
Basic Structure of Computers, Functional Modules - Basic operational concepts - Bus structures -
Software performance – Memory locations and addresses – Memory operations – Instruction and
instruction sequencing – Addressing modes– Assembly language – Basic I/O operations – Stacks and
queues.

UNIT II [SESSIONS: 9]
Arithmetic Module, Addition and subtraction of signed numbers – Design of fast adders –
Multiplication of positive numbers - Signed operand multiplication and fast multiplication –
Integer division – Floating point numbers and operations.

UNIT III [SESSIONS: 9]

Basic Processing Module, Fundamental concepts – Execution of a complete instruction – Multiple bus
organization – Hard wired control – Micro programmed control - Pipelining – Basic concepts – Data
hazards – Instruction hazards – Influence on Instruction sets – Data path and control consideration
– Superscalar operation.

UNIT IV [SESSIONS: 9]
Memory System, Basic concepts – Semiconductor RAMs - ROMs – Speed - size and cost – Cache
memories - Performance consideration – Virtual memory- Memory Management requirements –
Secondary storage.

UNIT V [SESSIONS: 9]
PLD, Memories and Logic Families, Accessing I/O devices – Interrupts – Direct Memory Access –
Buses – Interface circuits – Standard I/O Interfaces (PCI, SCSI, USB)

TEXT BOOKS:

1. John P. Hayes, "Computer Architecture and Organization", McGraw Hill.

2. William Stallings, "Computer Organization and Architecture-Designing for Performance",
Pearson Education.
3. M. Morris Mano, "Computer System Architecture", PHI.
4. Carl Hamacher, ZvonkoVranesic, Safwat Zaky, "Computer Organization”
5. Behrooz Parahami, “Computer Architecture”, Oxford University Press.

COURSE CODE COURSE TITLE L T P C

MCA 527 FUNDAMENTAL OF E-COMMERCE 3 0 0 3

COURSE OUTCOMES
 CO 1: Understanding the major types of E-commerce.
CO 2: Describing how procurement and supply chains relate to B2B E-commerce.
CO 3: Analyzing the impact of E-commerce on business models and strategy.
CO 4: Applying the key security threats in the E-commerce environment.

UNIT I [SESSIONS: 9]
Definition of Electronic Commerce, E-Commerce: technology and prospects, incentives for engag-
ing in electronic commerce, needs of E-Commerce, advantages and disadvantages, framework,
Impact of E-commerce on business, E- Commerce Models.

UNIT II [SESSIONS: 9]
Network Infrastructure for E- Commerce, Internet and Intranet based E- commerce- Issues, prob -
lems and prospects, Network Infrastructure, Network Access Equipment, Broadband telecommuni-
cation (ATM, ISDN, FRAME RELAY), Mobile Commerce: Introduction, Wireless Application
Protocol, WAP technology, Mobile Information device.

UNIT III [SESSIONS: 9]

Web Security, Security Issues on web, Importance of Firewall, components of Firewall, Transac -
tion security, Emerging client server, Security Threats, Network Security, Factors to consider in
Firewall design, Limitation of Firewalls.

UNIT IV [SESSIONS: 9]
Encryption, Encryption techniques, Symmetric Encryption: Keys and data encryption standard,
Triple encryption, Secret key encryption; Asymmetric encryption: public and private pair key en-
cryption, Digital Signatures, Virtual Private Network.

UNIT V [SESSIONS: 9]
Electronic Payments Overview, The SET protocol, Payment Gateway, certificate, digital Tokens,
Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based EPS, online Bank-
ing. EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies and
Agenda.

TEXT BOOKS:
1. RaviKalakota,AndrewWinston,“FrontiersofElectronicCommerce”,AddisonWesley.
2. PeteLohsin, John Vacca“Electronic Commerce”, New Age International
3. Goel, Ritendra“E-commerce”, New Age International Laudon, “E-Commerce: Business,
Technology, Society”, Pearson Education.
4. WebCommerceTechnologyHandbook,byDanielMinoli,EmmaMinoli,McGraw-Hill
5. Frontiers of Electronic Commerce by Galgotia.
6. EcommercefundamentalsandapplicationsHendryChan,RaymondLee,TharamDillon,Elliza-
bethChang,JohnWiley.

COURSE CODE COURSE TITLE L T P C

MCA 529 INTERNET OF THINGS 3 0 0 3

COURSE OUTCOMES:

CO 1 Understanding the interconnection and integration of the physical world and the cyber space.
CO 2 Describing the building blocks of Internet of Things and characteristics.
CO 3 Analyzing the interconnection and integration of the physical world and the cyber space.
CO 4 Applying IOT and realize the revolution of Internet in Mobile Devices, Cloud & Sensor
Networks

COURSE CONTENT

UNIT I [SESSIONS: 9]

Internet of Things (IoT): Vision, Definition, Conceptual Framework, Architectural view,

technology behind IoT, Sources of the IoT, M2M Communication, IoT Examples .Applying
Principles for Connected Devices: IoT/M2M systems layers and Applying standardization,
communication technologies, data enrichment and consolidation, ease of Applying and
affordability.

UNIT II [SESSIONS: 9]

Hardware for IoT: Sensors, Digital sensors, actuators, radio frequency identification (RFID)
technology, wireless sensor networks, participatory sensing technology. Embedded Platforms
for IoT: Embedded computing basics, Overview of IOT supported Hardware platforms such as
Arduino, Raspberry pi.

UNIT III [SESSIONS: 9]

Network & Communication aspects in IoT: Wireless Medium access issues, MAC protocol
survey, Survey routing protocols, Sensor deployment & Node discovery, Data aggregation &
dissemination.

UNIT IV [SESSIONS: 9]

Programming the Arduino: Arduino Platform Boards Anatomy, Arduino IDE, coding, using
emulator, using libraries, additions in Arduino, programming the Arduino for IoT.

UNIT V [SESSIONS: 9]

Challenges in IoT Applying challenges: Development Challenges, Security Challenges, Other

Challenges IoT Applications : Smart Metering, E-health, City Automation, Automotive
Applications, home automation, smart cards, Communicating data with H/W units, mobiles,
tablets, Applying of smart street lights in smart city.

TEXTBOOKS:

1. Vijay Madisetti and Arshdeep Bahga,“Internet of Things (A Hands-on-Approach.

2. Francis da Costa, “Rethinking the Internet of Things: A Scalable Approach to Connecting
 Everything” ,Apress Publications.
3. CunoPfister, Getting Started with the Internet of Things, O”Reilly Media.
4. Olivier Hersent, David Boswarthick, Omar Elloumi “The Internet of Things key applications
and protocols”, Wiley.
5. Jeeva Jose, Internet of Things, Khanna Publishing House.

REFERENCE BOOKS:
1. Michael Miller “The Internet of Things” by Pearson.
2. Raj Kamal “INTERNET OF THINGS”, McGraw-Hill.
3. ArshdeepBahga, Vijay Madisetti “Internet of Things (A Hands-On-Approach)” 1ST edition,
VPI.
 COURSE CODE COURSE TITLE L T P C
MCA 531 DATA STRUCTURE USING C 3 1 0 4

COURSE OUTCOMES

CO 1: Understanding concept of data structure, abstract, algorithms, analysis of algorithms and ba-
sic data organization schemes such as arrays and linked lists.
CO 2: Describing the applications of stacks and queues and implements various operations using
arrays and linked lists.
CO 3: Analyzing incremental and divide-and-conquer approaches of designing algorithms for
problems such as sorting and searching.
CO 4: Applying various design approaches such as Divide-and-Conquer, greedy and dynamic for
problem solving.

UNIT I [SESSIONS: 9]
Introduction: Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algo-
rithm, Time and Space Complexity, Asymptotic notations: Big-Oh,Time-Space trade-off.Abstract-
DataTypes(ADT),Arrays:Definition,SingleandMultidimensionalArrays,Representation of Arrays:
Row Major Order, and Column Major Order, Application of arrays, Sparse Matrices and their repre-
sentations. Linked lists: Array Implementation and Dynamic Implementation of Singly Linked Lists,
Doubly Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traver-
sal, Polynomial Representation and Addition, Generalized Linked List.

UNIT II [SESSIONS: 9]
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementa-
tion of Stack in C, Application of stack: Prefix and Post fix Expressions, Evaluation of post fix ex-
pression, Recursion, Tower of Hanoi Problem, Simulating Recursion, Principles of recursion, Tail re-
cursion, Removal of recursion Queues, Operations on Queue: Create, Add, Delete, Full and Empty,
Circular queues, Array and linked implementation of queues in C, Dequeue and Priority Queue.

UNIT III [SESSIONS: 9]

Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array Representation and Dy -
namic Representation, Complete Binary Tree, Algebraic Expressions, Extended Binary Trees, Array
and Linked Representation of Binary trees, Tree Traversal algorithms: In order, Pre order and Post
order, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm.

UNIT IV [SESSIONS: 9]
Graphs: Terminology, Sequential and linked Representations of Graphs: Adjacency Matrices, Adja-
cency List, Adjacency Multi list, Graph Traversal: Depth First Search and Breadth First Search, Con-
nected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and Kruskal algorithm.
Transitive Closure and Shortest Path algorithm: Warshal Algorithm and Dijikstra Algorithm, Intro-
duction to Activity Networks.

UNIT V [SESSIONS:9]
Searching: Sequential search, Binary Search, Comparison and Analysis Internal Sorting: Insertion
Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical con-
sideration for Internal Sorting. Search Trees: Binary Search Trees (BST), Insertion and Deletion in
BST, Complexity of Search Algorithm, AVL trees, Introduction to m-way Search Trees, B Trees &
B+ Trees. Hashing: Hash Function, Collision Resolution Strategies. Storage Management: Garbage
Collection and Compaction.

TEXT BOOKS:
1. ReemaThareja, Data Structures using C, Oxford Univ. Press.
 2. Sridhar S., “Design and Analysis of Algorithms”, Oxford Univ. Press.
3. Goyal K. K., Sharma Sandeep & Gupta Atul, “Data Structures and Analysis of Algorithms”,
HP Hamilton.
4. Dave P. H., H.B.Dave, “Design and Analysis of Algorithms”, 2nd Edition, Pearson Educa-
tion. Samanta D., “Classic Data Structures”, 2nd Edition Prentice Hall India.
5. R. Neapolitan and K. Naimipour, “Foundations of Algorithms”,4th edition, Jones an Bartlett
Student edition.

REFERENCE BOOKS:
1. Cormen T. H., Leiserson C. E., Rivest R. L., and Stein C., “Introduction to Algorithms”, PHI.
2. Horowitz Ellis, SahniSartaj and Rajasekharan S., “Fundamentals of Computer Algorithms”,
2nd Edition, Universities Press.
3. Lipschuts S., “Theory and Problems of Data Structures”, Schaum’s Series.
4. Lipschutz, Data Structures With C - SIE - SOS, McGraw Hill
5. Goodrich M. T. and Tomassia R., “Algorithm Design: Foundations, Analysis and Internet ex-
amples”, John Wiley and sons.
Aho, Ullman and Hopcroft, “Design and Analysis of algorithms”, Pearson Education.
 COURSE CODE COURSE TITLE L T P C
MCA 561 OBJECT ORIENTED PROGRAMMING LAB USING 0 0 2 1
‘C++’

COURSE OUTCOMES:

CO 1: Understanding the Concept of Data Abstraction and Encapsulation in C++ programs.

CO 2: Applying and Developing C++ program using the concept such as polymorphism, virtual
function, exception handling and template
CO 3: Apply fundamental algorithmic problems including type casting, inheritance, and poly-
morphism.
CO 4: Analyzing and develop a complete solution for a given problem.

LIST OF EXPERIMENTS: [SESSIONS: 30]

1. Program to add, subtract, multiply and divide two numbers using concepts of C++.
2. Program to show swapping of two numbers using C++.
3. Program to calculate volume of cube, cylinder, rectangular box using three times function
overloading in C++.
4. Program using virtual function.
5. Program using copy constructor.
6. Program to show single & multi-level inheritance.
7. Program to show multiple inheritances.
8. Program to find mean value of two numbers using friend function.
9. Program using inline function.
10. Program to demonstrate the use of Local Object, Static Object & Global Object using C ++.
11. Program in C++ to demonstrate the creation and the use of dynamic object.
12. Create two classes DM and DB which store the value of distances.
13. Derive the two class’s son and daughter and, demonstrate polymorphism in action.
14. Create a base class called shape. Use this class to store two double type values that could be
used to compute the area of figures.
 COURSE CODE COURSE TITLE L T P C
MCA 565 DATA STRUCTURE USING C LAB 0 0 4 2

COURSE OUTCOMES:
CO 1 Writing and executing programs to implement various searching and sorting algo-
rithms.
CO 2 Describing and executing programs to implement various operations on two- dimen-
sional arrays.
CO 3 Analyzing various operations of Stacks and Queues using both arrays and linked
lists data structures.
CO 4 Implementing graph algorithm to solve the problem of minimum spanning tree

LIST OF EXPERIMENTS: [SESSIONS: 60]

Write C Programs to illustrate the concept of the following:

1. To implement addition and multiplication of two 2D arrays.
2. To transpose a 2D array.
3. To implement stack using array.
4. To implement queue using array.
5. To implement circular queue using array.
6. To implement stack using linked list.
7. To implement queue using linked list.
8. To implement circular queue using linked list.
9. To implement binary tree using linked list.
10. To implement binary search tree using linked list.
11. To implement tree traversals using linked list.
12. To implement BFS using linked list.
13. To implement DFS using linked list.
14. To implement Linear Search.
15. To implement Binary Search.
16. To implement Bubble Sorting.
17. To implement Selection Sorting.
18. To implement Insertion Sorting.
19. To implement Merge Sorting.
20. To implement Heap Sorting.

THIRD SEMESTER
 COURSE CODE COURSE TITLE L T P C
MCA 621 ANDROID 3 0 0 3

COURSE OUTCOMES

CO 1 Understanding the fundamental of Java Programming for Android Application Develop-

ment.
CO 2 Describing the UI Layout and architecture of Android Operating System.
CO 3 Analyzing Ability to debug the Performance and Security of Android Applications.
CO 4 Applying android application using MVP Architecture.

COURSE CONTENT

UNIT I [SESSIONS: 9]
Installation and Setup on Android
Environment Setup – Installation & Setup of SDK tools on Windows; Installing platforms and sam-
ples; Creating an Android Virtual Device (emulator); Installing Eclipse on a Windows machine; in-
stalling the Android Development Tools; Preparing an Android device for development.
Android App Development
Overview of Android development; Understanding project creation and structure; Working with the
Android Manifest.xml file; Creating and managing activities; using explicit intents; Using implicit in-
tents; Creating and using resources; Understanding security and permissions; Debugging an app.

UNIT II [SESSIONS: 9]
User interface and Controls
Understanding units and layout; Using layout managers; Working with text controls; Building button
controls; Building list controls; Building custom list layouts; Other interesting controls.

UNIT III [SESSIONS: 9]

Graphics and Animation
Creating and using styles; Creating and using themes ; Creating icons; Creating Nine Patch drawables,
Setting up frame-by-frame animation; Showing tween animation; Working in 2D graphics.

UNIT IV [SESSIONS: 9]
Supporting Multiple Screens
Understanding screen size and density; providing alternate layouts.

UNIT V [SESSIONS: 9]
Messaging: SMS Messaging, Sending E-mail, Location-Based Services: Displaying Maps, Getting
Location Data, Monitoring a Location, Building a Location Tracker.

TEXT BOOKS:
1. MeierR.,"ProfessionaiAndroid2ApplicationDevelopment",Wiley.
2. HashimiS.,KomatineniS.andMacLeanD.,"ProAndroid2",Apress.
3. MurphyM.,"BeginningAndroid2",Apress.
4. DelessioC.andDarceyL.,"AndroidApplicationDevelopment",PearsonEducation.

COURSE CODE COURSE TITLE L T P C

MCA 623 BASIC ELECTRONICS 2 0 0 2

COURSEOUTCOMES
CO 1 Understanding the functioning of a communication system, and different modulation tech-
 nologies.
CO 2 Describing the applications of diode in rectifiers, filter circuits and wave shaping.
CO 3 Evaluating the different building blocks in digital electronics using logic gates and imple-
ment simple logic function using basic universal gates
CO 4 Applying the concept of diode in rectifiers filters circuits.

COURSE CONTENT

UNIT I [SESSIONS: 6]
Logic simplification and combinational logic design: Binary codes, code conversion, review of Bool-
ean algebra and Demorgans theorem, SOP& POS forms, Canonical forms, Karnaugh maps up to 6
variables, tabulation method.

UNIT II [SESSIONS: 6]
MSI devices like comparators, multiplexers, encoder, decoder, driver & multiplexed display, half and
full adders, subtractors, serial and parallel adders, BCD adder, barrel shifter and ALU.

UNIT III [SESSIONS: 6]

Sequential logic design: Building blocks like S-R, JK and Master-Slave JK FF, edge triggered FF,
state diagram, state reduction, design of sequential circuits, ripple and synchronous counters, shift reg-
isters, finite state machines, design of synchronous FSM, algorithmic state machines charts. Design-
ing synchronous circuits like pulse train generator, pseudo random binary sequence generator, clock
generation.

UNIT IV [SESSIONS: 6]
Logic families and semiconductor memories: TTL NAND gate, specifications, noise margin, propaga-
tion delay, fan-in, fan-out, tri state TTL, ECL, CMOS families and their interfacing, memory ele-
ments, concept of programmable logic devices like FPGA, logic implementation using programmable
devices.

UNIT V [SESSIONS:6]
Digital-to-Analog converters (DAC): Weighted resistor, R-2R ladder, resistor string etc. analog-to-
digital converters (ADC): single slope, dual slope, successive approximation, flash etc. switched
capacitor circuits: Basic concept, practical configurations, application in amplifier, integrator, ADC
etc

TEXT BOOKS:
1. R.P.Jain,“Modern Digital Electronics,”Tata McGraw Hill.
2. Anand Kumar, “Fundamental of Digital Circuits,”PHI.
3. W.H.Gothmann,“Digital Electronics-An Introduction to Theory and Practice, “PHI.
4. D.V.Hall,“Digital Circuits and Systems,”TataMcGrawHill.
5. A.K.Singh,“Foundation of Digital Electronics & Logic Design,”NewAgeInt. Pub.
6. Subrata Ghosal,“Digital Electronics,”Cengage Publication.
 COURSE CODE COURSE TITLE L T P C
MCA 625 ANALYSIS AND DESIGN OF ALGORITHMS 3 0 0 3

COURSE OUTCOMES:
CO 1 Evaluating rigorous correctness proofs for algorithms.
CO 2 Describing the major algorithms and data structures.
CO 3 Analyzing the Asymptotic performance of algorithms.
CO 4 Applying important algorithmic design paradigms and methods of analysis.

COURSE CONTENT

UNIT I [SESSIONS: 9]
Introduction: Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of functions,
Performance measurements, Sorting and order Statistics-Shell sort, Quick sort, Merge sort, Heap sort,
Comparison of sorting algorithms, Sorting in linear time.

UNIT II [SESSIONS: 9]
Advanced Data Structures: -Red-Black trees, B-trees, Binomial Heaps, Fibonacci Heaps.

UNIT III [SESSIONS: 9]

Divide and Conquer, Greedy Method: Sorting, Matrix, Multiplication, Convex hull and Searching.
Greedy methods with examples such as Optimal Reliability Allocation, Knapsack, and Minimum
Spanning trees-Prim’s and Kruskal’s algorithms, Single source shortest paths – Dijkstra’s and Bell-
man Ford algorithms.

UNIT IV [SESSIONS: 9]
Dynamic programming, back tracking and branch and bound: - Dynamic programming with ex-
amples such as Knapsack, All pair shortest paths – Warshall’s and Floyd’s algorithms, Resource allo -
cation problem. Backtracking, Branch and Bound with examples such as Travelling Salesman Prob-
lem, Graph Colouring, n-Queen Problem, Hamiltonian Cycles and Sum of subsets.

UNIT V [SESSIONS: 9]
Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP-
completeness, Approximation algorithms and Randomized algorithms.

TEXT BOOKS:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algo -
rithms”, Printice Hall of India.
2. RCT Lee, SS Tseng, RC Chang and YT Tsai, “Introduction to the Design and Analysis of
Algorithms”, McGraw Hill.
3. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
4. Berman, Paul,” Algorithms”, Cengage Learning.
5. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” ,Pearson Ed-
ucation.
6. Jon Kleinberg, Eva Tardos, “Algorithm Design” ,Pearson Education
 COURSE CODE COURSE TITLE L T P C
MCA 627 ADVANCE DATABASE MANAGEMENT SYSTEM 3 0 0 3

COURSEOUTCOMES
CO 1 Understanding the concepts of transactions, their processing so they will familiar with
broad range of database management issues including data integrity, security and recov-
ery.
CO 2 Analyzing ands olve the redundancy problem in database tables using normalization.
CO 3 Applying knowledge of database for real life applications.
CO 4 Applying query processing techniques to automate the real time problems of databases.

COURSE CONTENT

UNIT I [SESSIONS: 9]
Introduction:-The Evolution of Database Systems- Overview of a Database Management System-
Outline of Database-System Studies-The Entity-RELATIONSHIP DATA MODEL: Elements of the
E/R Model-Design Principles-The Modelling of Constraints-Weak Entity Sets

UNIT II [SESSIONS: 9]
The relational data model & algebra:-Basics of the Relational Model-From E/R Diagrams to Rela-
tional Designs Converting Subclass Structures to Relations Functional Dependencies- Rules about
Functional Dependencies-Design of Relational Database Schemas – Multi valued Dependencies. RE-
LATIONAL ALGEBRA: Relational Operations-Extended Operators of Relational Algebra- Con-
straints on Relations.

UNIT III [SESSIONS: 9]

SQL:-Simple Queries in SQL-Sub queries-Full-Relation Operations- Database Modifications-
Defining a Relation Schema-View Definitions- Constraints and Triggers: Keys and Foreign Keys-
Constraints on Attributes and Tuples Modification of Constraints-Schema-Level Constraints and
Triggers -Java Database Connectivity- Security and User Authorization in SQL.

UNIT IV [SESSIONS: 9]
Index Structure, Query Processing:-Index Structures: Indexes on Sequential Files-Secondary In-
dexes-B-Trees-Hash Tables- Bitmap Indexes.
Query Execution: Physical-Query-Plan Operators- One-Pass, two-pass & index based Algorithms,
Buffer Management, Parallel Algorithms- Estimating the Cost of Operations-Cost-Based Plan Selec -
tion -Order for Joins-Physical- Query Plan.

UNIT V [SESSIONS: 9]
Issues and Models for Resilient Operation: - Undo/Redo Logging- Protecting against Media Fail-
ures.
Concurrency Control: Serial and Serializable Schedules- Conflict Serializability-Enforcing
Serializability by Locks-Locking Systems with Several Lock Modes-Concurrency Control by
Timestamps, validation.

TEXT BOOKS:

1. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill

2. O’Neil, Databases, Elsevier Pub.
3. Leon &Leon,”Database Management Systems”, Vikas Publishing House.
4. Bipin C. Desai, “An Introduction to Database Systems”, Gagotia Publication
Departmental Elective-I
 COURSE CODE COURSE TITLE L T P C
MCA 629 CLOUDCOMPUTINGCONCEPTS 3 0 0 3

COURSE OUTCOMES
CO 1 Understanding the concepts of Cloud Computing, key technologies, strengths and limita-
tions of cloud computing.
CO 2 Understanding the use of architecture to compute and storage cloud, service and models.
CO 3 Applying the technologies in the development of cloud.
CO 4 Analyzing the core issues of cloud computing such as resource management and security.

COURSE CONTENT

UNIT I [SESSIONS: 9]
Cloud Computing Fundamentals: Cloud Computing definition, Types of cloud, Cloud services: Bene-
fits and challenges of cloud computing, Evolution of Cloud Computing, usage scenarios and Applica-
tions, Major Players in Cloud Computing, and Issues in Cloud.

UNIT II [SESSIONS: 9]
Disadvantageofstand-aloneapplication,web-applicationvs.cloud,Service Model Software as a Service,
Platform as a Service, Infrastructure as a Service, Service providers, Deployment Model- Public, Pri-
vate and Hybrid Cloud, Google App Engine, Amazon EC2.

UNIT III [SESSIONS: 9]

Cloud Computing Management, Cloud Computing Data Storage, Collaborating via Web-Based Com-
munication Tools, Collaborating via Social Networks, Collaborating via Blogs and Wikis.

UNIT IV [SESSIONS: 9]
Need for Virtualization, Pros and cons of Virtualization, Types of Virtualization, Process VM, Vir -
tual Machine monitor, Virtual machine properties, VM – Hypervisors, KVM , Virtual Box, Hyper-V.

UNIT V [SESSIONS: 9]
Cloud Security Challenges, Cloud Computing Operation, Cloud computing Application, Cloud Com-
puting Providers, Cloud Computing Challenges, Common Standards: The Open Cloud Consortium,
Standards for application
Developers, End user access to cloud computing.

TEXT BOOKS
1. AntohyTVelte,Cloud Computing:“A Practical Approach”, McGraw Hill.
2. MichaelMiller,CloudComputing:“Web-BasedApplicationsThatChangetheWayYou Work and
Collaborate Online”, Que Publishing
 COURSE CODE COURSE TITLE L T P C
MCA 631 CYBERSECURITY 3 0 0 3

COURSEOUTCOME

CO 1 Understanding and forensically investigate security incidents

CO 2 Analyzing and resolving security issues in networks and computer systems to secure an
IT infrastructure.
CO 3 Evaluating the Design, develop, test and evaluate secure software.
CO 4 Evaluating and communicating the human role in security systems with an emphasis on
ethics, social engineering vulnerabilities and training.

COURSE CONTENT

UNIT I [SESSIONS: 9]
Introduction to information systems, Types of information Systems, Introduction to Cyber Security:
Information Security, Computer Security, Network Security, and Application Security, Need for In-
formation security, Information Assurance and Security Risk Analysis.

UNIT II [SESSIONS: 9]
Application security (Database, E-mail and Internet), Data Security Considerations-Backups, Archival
Storage and Disposal of Data, Security Technology-Firewall and VPNs, Intrusion Detection, Access
Control. Security Threats -Viruses, Worms,Trojan Horse, Bombs, Trapdoors, Spoofs, E-mail viruses,
Macro viruses, Malicious Software, Network and Denial of Services Attack, Security Threats to E-
Commerce- Electronic Payment System, e- Cash, Credit/Debit Cards, Digital Signature, public Key
Cryptography.

UNIT III [SESSIONS: 9]

Developing Secure Information Systems, Application Development Security, Information Security
Governance & Risk Management, Security Architecture & Design Security Issues in Hardware, Phys-
ical Security of IT Assets, Access Control.

UNIT IV [SESSIONS: 9]
Overview of Firewalls, Types of Firewalls, Functions of Firewall, Overview of Virtual Private Net -
works (VPN’s), Types of VPN’s, Basics of VPN Protocols, Overview of Intrusion Detection Systems
(IDS), Types and Features of IDS .

UNIT V [SESSIONS: 9]
Information Security Standards-ISO, IT Act, Copyright Act, Patent Law, IPR. Cyber Laws in India;
IT Act 2000 Provisions, Intellectual Property Law: Copy Right Law, Software License, Semiconduc-
tor Law and Patent Law

TEXT BOOKS:
1. Charles P. Pfleeger, Shari LawerancePfleeger, “Analysing Computer Security”, Pearson Edu-
cation India.
2. V.K.Pachghare, “Cryptography and information security”,PHI Learning Private Limited,
Delhi India.

3. Dr. Surya Prakash Tripathi, Ritendra Goyal, Praveen Kumar Shukla, Introduction to Informa-
tion Security and Cyber Law Willey Dreamtech Press.
4. Schou, Shoemaker,“InformationAssurancefortheEnterprise”,TataMcGrawHill.
5. Chander, Harish,”Cyber Laws And It Protection” , PHI Learning Private Limited, Delhi, In-
dia
 COURSE CODE COURSE TITLE L T P C
MCA 633 E-GOVERNANCE 3 0 0 3
COURSEOUTCOMES
CO 1 Understanding concept of e-government, and the associated benefits and drawbacks
CO 2 Understanding how a relational database differs from a flat database, including the function
and construction of a joining table
CO 3 Describing the basic principles of biometric identification & verification systems.
CO 4 Analyzing suitable entities, attributes and database keys for a database design.

COURSE CONTENT

UNIT I [SESSIONS: 9]
Introduction to E-Government and E-Governance: Difference between E- Government and E-Gover-
nance; E-Government as Information System; Benefits of E-Government; E-Government Life Cycle;
Online Service Delivery and Electronic Service Delivery; Evolution, Scope and Content of E- Gover-
nance; Present Global Trends of Growth in E-Governance.

UNIT II [SESSIONS: 9]
Models of E-Governance: Introduction; Model of Digital Governance: Broadcasting / Wider Dissemi-
nation Model, Critical Flow Model, Comparative Analysis Model, Mobilization and Lobbying Model,
Interactive –Service Model / Government-to-Citizen-to-Government Model (G2C2G); Evolution in E-
Governance and Maturity Models: Five Maturity Levels; Characteristics of Maturity Levels; Good
Governance through E- Governance Models.

UNIT III [SESSIONS: 9]

E-Government Infrastructure Development: Network Infrastructure; Computing Infrastructure; Data
centers; E-Government Architecture; Interoperability Framework; Cloud Governance; E-readiness;
Data System Infrastructure; Legal Infrastructural Preparedness; Institutional Infrastructural Prepared-
ness; Human Infrastructural Preparedness; Technological Infrastructural Preparedness.

UNIT IV [SESSIONS: 9]
Security for e-Government: Challenges and Approach of E-government Security; Security Manage-
ment Model; E-Government Security Architecture; Security Standards.

UNIT V [SESSIONS: 9]
Applications of Data Warehousing and Data Mining in Government: Introduction; National Data
Warehouses: Census Data, Prices of Essential Commodities; Other Areas for Data Warehousing and
Data Mining: Agriculture, Rural Development, Health, Planning, Education, Commerce and Trade,
Other Sectors.

TEXT BOOKS:
1. Public Information Technology and e-Governance: Managing the Virtual State, G. David
Garson Jones & Bartlett Learning.
2. E-Business and E-Commerce, Chaffey, Dave, Prentice-Hall, London.
3. E- Government: The Science of the Possible Kindle Edition.
4. E-Government Implementation, Adoption and Synthesis in Developing Countries.Bwalya,
Kelvin J. and Mutula, S

COURSE CODE COURSE TITLE L T P C

MCA 661 ANDROID LAB. 0 0 2 1
COURSEOUTCOMES
CO 1 Understanding the fundamental of Java Programing for Android Application Develop-
ment.
CO 2 Evaluating the UI Layout and architecture of Android Operating System.
CO 3 Applying android application using Jetpack Library based on MVVM Architecture.
CO 4 Applying android application based on REST API using Library.

LIST OF EXPERIMENTS: [SESSIONS: 30]

1. Developing for Android: My First Android Application

2. How to setup Android Development Environment.
3. Android development Framework-Android-SDK, Eclipse
4. Emulators–What is an Emulator/Android AVD?
5. Creating & setting up custom Android emulator
6. Android Project Framework
7. My First Android Application
8. Android Activities and UI Design
9. Understanding Intent, Activity, Activity Life cycle and Manifest
10. Creating Application and new Activities
11. Expressions and Flow control, Android Manifest
12. Simple UI-Layouts and Layout properties
13. Fundamental Android UI Design
14. Introducing Layouts
15. Creating new Layouts
16. Drawable Resources
17. Resolution and density independence (px,dip, dp,sip,sp)
18. XML Introduction to GUI objects viz.
19. Push Button
20. Text/ Labels
21. Edit Text
22. Toggle Button
23. Weight Sum, Padding
24. Layout Weight, Menu, Dialog, List and Adapters.
25. What is Menu?
 COURSE CODE COURSE TITLE L T P C
MCA 663 ANALYSIS AND DESIGN OF ALGORITHMS LAB 0 0 2 1
COURSE OUTCOMES

CO 1 Applying algorithm to solve problems by iterative approach.

CO 2 Describing algorithm to solve problems by divide and conquer approach.
CO 3 Applying algorithm to solve problems by Greedy algorithm approach.
CO 4 Applying algorithm to solve problems by Dynamic programming, backtracking, branch
and bound approach.

LIST OF EXPERIMENTS [SESSIONS: 30]

1. Program for Recursive Binary & Linear Search.
2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Knapsack Problem using Greedy Solution
8. Perform Travelling Salesman Problem
9. Find Minimum Spanning Tree using Kruskal’s Algorithm
10. Implement NQueen Problem using Backtracking
11. Sort a given set of n integer elements using Quick Sort method and compute its time com -
plexity. Run the program for varied values of n> 5000 and record the time taken to sort.
Plot a graph of the time taken versus non graph sheet. The elements can be read from a file
or can be generated using the random number generator. Demonstrate using Java how the
divide and- conquer method works along with its time complexity analysis: worst case,
average case and best case.
12. Sort a given set of n integer elements using Merge Sort method and compute its time com-
plexity. Run the program for varied values of n>5000, and record the time taken to sort.
Plot a graph of the time taken versus non graph sheet. The elements can be read from a file
or can be generated using the random number generator. Demonstrate how the divide and-
conquer method works along with its time complexity analysis: worst case, average case
and best case.
13. From a given vertex in a weighted connected graph,find shortest paths to other vertices us-
ing Dijkstra's algorithm.
14. Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's
algorithm. Use Union-Find algorithms in your program.
15. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm

COURSE CODE COURSE TITLE L T P C

MCA 665 ADVANCEDATABASEMANAGEMENTSYSTEMLAB. 0 0 2 1

COURSEOUTCOMES
 CO 1 Applying Oracle 11 g products for creating tables, views, indexes, sequences and other
database objects.
CO 2 Analyzing and implementing a database schema for company database, banking database,
library information system, payroll processing system, student information system.
CO 3 Evaluating and implementing simple and complex queries using DDL, DML, DCL and
TCL
CO 4 Evaluating and executing PL/SQL blocks, procedure functions, packages and triggers,
cursors.

LIST OF EXPERIMENTS [SESSIONS: 30]

1. Installing oracle/MYSQL
2. Creating Entity-Relationship Diagram using case tools.
3. Writing SQL statements Using ORACLE/MYSQL:
a) Writing basic SQLSELECT statements.
b) Restricting and sorting data.
c) Displaying data from multiple tables.
d) Aggregating data using group function.
e)Manipulating data.
f) Creating and managing tables.
4. Normalization
5. Creating cursor
6. Creating procedure and functions
7. Creating packages and triggers
8. Design and implementation of payroll processing system
9. Design and implementation of Library Information System
10. Design and implementation of Student Information System.
11. Automatic Back up of Files and Recovery of Files.
 COURSE CODE COURSE TITLE L T P C
MCA 660 INDUSTRIAL INTERNSHIP 0 0 2 1

COURSE OUTCOMES
CO 1: Describing use of advanced tools and techniques encountered during industrial training and visit.
CO 2: Describing theoretical knowledge to participate in the projects in industries during his or her in-
dustrial training.
CO 3: Analyzing the general workplace behavior and build interpersonal and team skills
CO 4: Applying engineering practices and discipline prescribed in industry.

COURSE CONTENT

The students enrolled for the course have to undergo an Industrial Training/ Internship for a minimum of 45
Working Days duration in Software Industry and/or R&D Sector.

At the end, the students have to submit the Internship Completion Certificate.

The evaluation of the Industrial Internship includes submission of certificate and Presentation on the work
done during the Internship.