Semester: I

Course Code: CAC01 Course Title: Fundamentals of Computers

Course Credits: 03 Hours/Week: 03
Total Contact Hours: 42 Formative Assessment Marks: 40
Exam Marks: 60 Exam Duration: 2 hrs
Course Outcomes (COs):

• Introduction to computers, classification of computers, anatomy of computer, constituents and architecture,

microcontrollers
• Operating systems, functions of operating systems, classification of operating systems, kernel, shell, basics of
Unix, shell programming, booting
• Databases, why databases are used, users, SQL, data types in SQL, introduction of queries - select, alter,
update, delete, truncate, using where, and or in not in
• Internet basics, features, applications, services, internet service providers, domain name system, browsing,
email, searching
• Web Programming basics, introduction of HTML and CSS programming
• Introduction of computers, classification of computers, anatomy of computer, constituents and architecture,
microcontrollers.
Course Content

Content Hours
Unit - 1
Fundamentals of Computers: Introduction to Computers - Computer Definition, Characteristics of Computers,
Evolution and History of Computers, Types of Computers, Basic Organisation of a Digital Computer; Number Systems
– different types, conversion from one number system to another; Computer Codes – BCD, Gray Code, ASCII and
Unicode; Boolean Algebra – Boolean Operators with Truth Tables; Types of Software – System Software and Utility
Software; Computer Languages - Machine Level, Assembly Level & High Level Languages, Translator Programs –
Assembler, Interpreter and Compiler; Planning a Computer Program - Algorithm, Flowchart and Pseudo code with
Examples. 10

Unit-2
Introduction to computers: Characteristics of computers, Classification of Digital Computer Systems: Microcomputers,
Minicomputers, Mainframes, Super computers. Anatomy of Computer: Introduction, Functions & Components of a
Computer, Central Processing Unit, Microprocessor, Storage units, Input and output Devices. How CPU and memory
works. Program execution with illustrative examples. Introduction to microcontrollers. 10
Unit-3
Operating System Fundamentals: Operating Systems: Introduction, Functions of an operating System, Classification of
Operating Systems, System programs, Application programs, Utilities, The Unix Operating System, Basic Unix
commands, Microkernel Based Operating System, Booting. 10
Unit-4
Introduction to Database Management Systems:Database, DBMS, Why Database -File system vs DBMS, Database
applications, Database users, Introduction to SQL, Data types, Classification of SQL-DDL with constraints, DML,
DCL, TCL 6
Unit-5
Internet Basics: Introduction, Features of Internet, Internet application, Services of Internet, Logical and physical
addresses, Internet Service Providers, Domain Name System.
Web Basics: Introduction to web, web browsers, http/https, URL, HTML5, CSS 6

1. Pradeep K. Sinha and Priti Sinha: Computer Fundamentals (Sixth Edition), BPB
Publication, 2004
2. David Riley and Kenny Hunt, Computational thinking for modern solver,
Chapman & Hall/CRC, 1st edition, 2014
Reference:
1. J. Glenn Brook shear,” Computer Science: An Overview”, Addision-Wesley, Tenth
 Edition, 2008.
2. R.G. Dromey, “How to solve it by Computer”, PHI, 2008

Course Content

Content Hours
Unit - 1
Introduction to C Programming: Overview of C; History and Features of C;
Structure of a C Program with Examples; Creating and Executing a C Program;
Compilation process in C.

C Programming Basic Concepts: C Character Set; C tokens - keywords,

identifiers, constants, and variables; Data types; Declaration & initialization of 10
variables; Symbolic constants.

Input and output with C: Formatted I/O functions - printf and scanf, control stings
and escape sequences, output specifications with printf functions; Unformatted I/O
functions to read and display single character and a string - getchar, putchar, gets
and puts functions.

Unit - 2

C Operators & Expressions: Arithmetic operators; Relational operators; Logical

operators; Assignment operators; Increment & Decrement operators; Bitwise
operators; Conditional operator; Special operators; Operator Precedence and
Associatively; Evaluation of arithmetic expressions; Type conversion. 12

Control Structures: Decision making Statements - Simple if, if_else, nested if_else,
else_if ladder, Switch Case, goto, break & continue statements; Looping

9
 Statements - Entry controlled and exit controlled statements, while, do-while, for
loops, Nested loops.

Unit - 3

Derived data types in C: Arrays: One Dimensional arrays - Declaration,

Initialization and Memory representation; Two Dimensional arrays - Declaration,
Initialization and Memory representation.
8
Strings: Declaring & Initializing string variables; String handling functions - strlen,
strcmp, strcpy and strcat; Character handling functions - toascii, toupper, tolower,
isalpha, isnumeric etc.

Unit - 4
Pointers in C: Understanding pointers - Declaring and initializing pointers,
accessing address and value of variables using pointers; Pointers and Arrays; 4
Pointer Arithmetic; Advantages and disadvantages of using pointers;
Unit - 5

User Defined Functions: Need for user defined functions; Format of C user
defined functions; Components of user defined functions - return type, name,
parameter list, function body, return statement and function call; Categories of user
defined functions - With and without parameters and return type.
8
User defined data types: Structures - Structure Definition, Advantages of
Structure, declaring structure variables, accessing structure members, Structure
members initialization, comparing structure variables, Array of Structures; Unions -
Union definition; difference between Structures and Unions.
Files: File-modes, file functions and file operations. Text and Binary files.

Model Course Content for BCA, Semesters III and IV

Semester: III

Course Title: Database Management System Course code: CAC07

Total Contact Hours: 42 Course Credits: 03+02
Formative Assessment Marks: 40 Duration of SEE/Exam: 03 Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:

 Explain the various database concepts and the need for database systems.
 Identify and define database objects, enforce integrity constraints on a database using
DBMS.
 Demonstrate a Data model and Schemas in RDBMS.
 Identify entities and relationships and draw ER diagram for a given real-world
problem.
 Convert an ER diagram to a database schema and deduce it to the desired normal
form.
 Formulate queries in Relational Algebra, Structured Query Language (SQL) for
database manipulation.
 Explain the transaction processing and concurrency control techniques.

CAC07: Database Management System (DBMS)

Unit Description Hours

Database Architecture: Introduction to Database system applications.
Characteristics and Purpose of database approach. People associated with
Database system. Data models. Database schema. Database architecture.
1 08
Data independence. Database languages, interfaces, and classification of
DBMS.

E-R Model: Entity-Relationship modeling: E – R Model Concepts: Entity,

Entity types, Entity sets, Attributes, Types of attributes, key attribute, and
domain of an attribute. Relationships between the entities. Relationship
2 08
types, roles and structural constraints, degree and cardinality ratio of a
relationship. Weak entity types, E -R diagram.

Relational Data Model: Relational model concepts. Characteristics of

3 relations. Relational model constraints: Domain constrains, key constraints, 10
primary & foreign key constraints, integrity constraints and null values.
 Relational Algebra: Basic Relational Algebra operations. Set theoretical
operations on relations. JOIN operations Aggregate Functions and Grouping.
Nested Sub Queries-Views. Introduction to PL/SQL & programming of
above operations in PL/SQL

Data Normalization: Anomalies in relational database design.

Decomposition. Functional dependencies. Normalization. First normal form,
4 07
Second normal form, Third normal form. Boyce-Codd normal form.

Query Processing Transaction Management: Introduction Transaction

Processing. Single user & multiuser systems. Transactions: read & write
operations. Need of concurrency control: The lost update problem, Dirty
5 read problem. Types of failures. Transaction states. Desirable properties 09
(ACID properties) of Transactions. Concurrency Control Techniques: Locks
and Time stamp Ordering. Deadlock & Starvation.

References:
1. Fundamentals of Database Systems, Ramez Elamassri, Shankant B. Navathe, 7th Edition,
Pearson, 2015
2. An Introduction to Database Systems, Bipin Desai, Galgotia Publications, 2010.
3. Introduction to Database System, C J Date, Pearson, 1999.
4. Database Systems Concepts, Abraham Silberschatz, Henry Korth, S.Sudarshan, 6th
Edition, McGraw Hill, 2010.
5. Database Management Systems, Raghu Rama Krishnan and Johannes Gehrke, 3rd Edition,
McGraw Hill, 2002
 Course Title: C# and Dot Net Framework Course code: CAC08
Total Contact Hours: 42 Course Credits: 03+02
Formative Assessment Marks: 40 Duration of SEE/Exam: 03 Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:
 Describe Object Oriented Programming concepts like Inheritance and Polymorphism
in C# programming language.
 Interpret and Develop Interfaces for real-time applications.
 Build custom collections and generics in C#.

CAC08: C# and Dot Net Framework

Unit Description Hours

Introduction to .Net Technologies: Introduction to Web Technologies.
HTML Basics, Scripts. Sample Programs. Advantages and Disadvantages of
1 Client-side and Server-side Scripts. Overview of Client-side Technologies 08
and Server-side Technologies.

Introduction to C#:Overview of C#, Literals, Variables, Data Types,

Operators, Expressions, Control Structures-Methods, Arrays, Strings,
Structures, Enumerations.
2 08
OOPS with C#: Classes, Objects, Inheritance, Polymorphism, Interfaces,
Operator Overloading Delegates, Events, Errors and Exceptions.

Introduction to VB.NET: Introduction VB.NET -IDE – Creating a shortcut

to start VB.NET. Maneuverings the Toolbar Auto-hide, Docking and
Undocking, Placing and Resizing the Windows, Forms, Properties Window
and Solution Explorer. Writing and Event Procedure. Execution Basic
3 08
Keywords. Data Types. VB.NET statements. Conditional statements: If Else,
Select Case, Switch and Choose Loops: Do, For Next, For Each Next, While
loop. Arrays.

Application Development on .NET:C#.NET: Building Windows

Applications, VB.NET: Windows Forms. Working with Controls, Timer,
Picture-box, Group-box, Combo-box, Horizontal and Vertical Scrollbar,
4 10
Numeric-up-down, Track-bar, and Progress-bar. Subroutines and Functions in
VB.NET. Database applications

ADO .NET Connectivity: Introduction to ADO.NET, ADO vs ADO.NET.

Architecture: Data reader, Data adopter, Accessing Data with ADO.NET.
5 Programming Web Applications with Web Forms. ASP .NET applications 08
with ADO.NET
References:
1. "Programming in C#", E. Balagurusamy, 4th
Edition, Tata McGraw-Hill, 2017.
2. “Visual Basic.NET”, Shirish Chavan, 3rd
Edition, Pearson Education, 2009.

Course Title: Computer Communication and Course code: CAC09

Networks
Total Contact Hours: 42 Course Credits: 03
Formative Assessment Marks: 40 Duration of SEE/Exam: 03 Hours
Summative Assessment Marks: 60

Course Outcomes (COs):

At the end of the course, students will be able to:
 Explain the transmission technique of digital data between two or more computersand a
computer network that allows computers to exchange data.
 Apply the basics of data communication and various types of computer networks inreal world
applications.
 Compare the different layers of protocols.
 Compare the key networking protocols and their hierarchical relationship in theconceptual
model like TCP/IP and OSI.

CAC09: Computer Communication and Networks

Unit Description Hours

Introduction: Computer Networks and its applications, Network structure,
1 network architecture, Topologies, LAN, WAN, MAN, The OSI reference 08
model, The TCP/IP reference model.
The Physical Layer: Transmission Media – Twisted pair, coaxial cable,
optical fiber, radio transmission, microwaves and infrared transmission,
2 07
Switching – message switching, Multiplexing.

The Data Link Layer: Data Link Layer design issues, Error detection –
Single parity checking, Checksum, polynomial codes – CRC, Error
3 correction- Hamming code, Elementary data link protocols, sliding window 08
protocols

The Network Layer: Network layer design issues, Routing algorithms –

Flooding, Distance vector routing, Hierarchical routing, Link state routing,
4 Congestion, control algorithms – Leaky bucket, token bucket algorithm, 09
admission control, Hop by Hop choke packets.
 The Transport Layer and Application Layer: Elements of Transport
5 service, Elements of Transport, protocols, Internet transport protocols (TCP & 10
UDP), DNS, Electronic Mailing, and World Wide Web.
References:
1. Computer Networks, Andrew S. Tanenbaum, 5th Edition, Pearson Education, 2010.
2. Data Communication & Networking, Behrouza A Forouzan, 3rd Edition, Tata McGraw

Program
BCA Semester V
Name
Course Title Design and Analysis of Algorithm (Theory)

Course Code: DSC13 No. of Credits 04

Contact hours 52 Hours Duration of SEA/Exam 2 hours
Formative Assessment Summative Assessment
40 60
Marks Marks

Course Outcomes (COs): After the successful completion of the course, the student will be able to:
CO1. Understand the fundamental concepts of algorithms and their complexity, including time and
space complexity, worst-case and average-case analysis, and Big-O notation. BL (L1, L2)
CO2. Design algorithms for solving various types of problems, such as Sorting, Searching, Graph
traversal, Decrease-and-Conquer, Divide-and-Conquer and Greedy Techniques. BL (L1, L2, L3)
CO3. Analyze and compare the time and space complexity of algorithms with other algorithmic
techniques. BL (L1, L2,L3,L4)
CO4. Evaluate the performance of Sorting, Searching, Graph traversal, Decrease-and-Conquer,
Divide-and-Conquer and Greedy Techniques using empirical testing and benchmarking, and identify
their limitations and potential improvements. BL (L1, L2, L3, L4)
CO5. Apply various algorithm design to real-world problems and evaluate their effectiveness and
efficiency in solving them. BL (L1, L2, L3)
Note: Blooms Level(BL): L1=Remember, L2=Understand, L3=Apply, L4=Analyze, L5= Evaluate,
L6= Create
Contents 52 Hrs
Introduction: What is an Algorithm? Fundamentals of Algorithmic problem solving, 10
Fundamentals of the Analysis of Algorithm Efficiency, Analysis Framework, Measuring
the input size, Units for measuring Running time, Orders of Growth, Worst-case, Best-
case and Average-case efficiencies.
Asymptotic Notations and Basic Efficiency classes, Informal Introduction, O-notation, 10
Ω-notation, θ-notation, mathematical analysis of non-recursive algorithms, mathematical
analysis of recursive algorithms.
Brute Force & Exhaustive Search: Introduction to Brute Force approach, Selection Sort 11
and Bubble Sort, Sequential search, Exhaustive Search- Travelling Salesman Problem and
Knapsack Problem, Depth First Search, Breadth First Search
Decrease-and-Conquer: Introduction, Insertion Sort, Topological Sorting 11
Divide-and-Conquer: Introduction, Merge Sort, Quick Sort, Binary Search, Binary Tree
traversals and related properties.
Greedy Technique: Introduction, Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s 10
Algorithm, Lower-Bound Arguments, Decision Trees, P Problems, NP Problems, NP-
Complete Problems, Challenges of Numerical Algorithms.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with
Program Outcomes
(POs 1-15)

Course Outcomes (COs) / Program Program Outcomes (POs)

Outcomes (POs) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Discuss the fundamentals of the
algorithms.
Describe the analysis of algorithm
efficiency using different notations.

Discuss various problems using Brute

force technique.

Describe various problems using Divide

and-Conquer Technique.

Describe various problems using

Decrease-and-Conquer.

Discuss Greedy Techniques.

Devise an algorithm using appropriate

design strategies for problem solving.

Estimate the computational complexity of

different algorithms.

Demonstrate the hardness of simple NP-

complete problems.

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-

Observe- Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/
Activity/ Flipped Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/
Mini Projects/ Hobby Projects/ Forum Theatre/ Dance/ Problem Based Learning/ Game
Based Learning/ Group Discussion/ Collaborative Learning/ Experiential Learning / Self
Directed Learning etc.

Formative Assessment for Theory

Assessment Occasion/ type Marks

Internal Assessment Test 1 10%
Internal Assessment Test 2 10%
Quiz/ Assignment/ Small Project 10%
Seminar 10%
Total 40 Marks
 Program
BCA Semester V
Name

Course Title Statistical Computing & R Programming (Theory)

Course Code: DSC14 No. of Credits 04

Contact hours 52 Hours Duration of SEA/Exam 2 hours

Formative Assessment
40 Summative Assessment Marks 60
Marks

Course Outcomes (COs): After the successful completion of the course, the student will be able to:
CO1. Explore fundamentals of statistical analysis in R environment.
CO2. Describe key terminologies, concepts and techniques employed in Statistical Analysis.
CO3. Define Calculate, Implement Probability and Probability Distributions to solve a wide variety of
problems.
CO4. Conduct and interpret a variety of Hypothesis Tests to aid Decision Making.
CO5. Understand, Analyse, and Interpret Correlation Probability and Regression to analyse the
underlying relationships between different variables.
Contents 52 Hrs
Introduction of the language, numeric, arithmetic, assignment, and vectors, Matrices and 10
Arrays, Non-numeric Values, Lists and Data Frames, Special Values, Classes, and
Coercion, Basic Plotting.
Reading and writing files, Programming, Calling Functions, Conditions and Loops: stand- 10
alone statement with illustrations in exercise 10.1,stacking statements, coding loops,
Writing Functions, Exceptions, Timings, and Visibility.
Statistics And Probability, basic data visualisation, probability, common probability 11
distributions: common probability mass functions, bernoulli, binomial, poisson distributions,
common probability density functions, uniform, normal, student’s t-
distribution.
Statistical testing and modelling, sampling distributions, hypothesis testing, components of 10
hypothesis test, testing means, testing proportions, testing categorical variables, errors and
power, Analysis of variance.
Simple linear regression, multiple linear regression, linear model selection and diagnostics. 11
Advanced graphics: plot customization, plotting regions and margins, point and click
coordinate interaction, customizing traditional R plots, specialized text and label notation.
Defining colors and plotting in higher dimensions, representing and using color, 3D scatter
plots.

Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program

Outcomes
(POs 1-15)

Course Outcomes (COs) / Program Program Outcomes (POs)

Outcomes (POs) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby Projects/
Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group Discussion/
Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Formative Assessment for Theory

Assessment Occasion/ type Marks

Internal Assessment Test 1 10%
Internal Assessment Test 2 10%
Quiz/ Assignment/ Small Project 10%
Seminar 10%
Total 40 Marks

Formative Assessment as per guidelines.

References
1 Tilman M. Davies, “The book of R: A first course in programming and ststistics”, San
Francisco, 2016.
2 Vishwas R. Pawgi, “Statistical computing using R software”, Nirali prakashan publisher, e1
edition, 2022.
3 https://www.youtube.com/watch?v=KlsYCECWEWE
https://www.geeksforgeeks.org/r-tutorial/
https://www.tutorialspoint.com/r/index.htm
Program
B.C.A Semester V
Name
Course Title Software Engineering (Theory)
Course Code: DSC15 No. of Credits 04
Contact hours 52 Hours Duration of SEA/Exam 2 hours
Formative Assessment
40 Summative Assessment Marks 60
Marks

Course Outcomes (COs): After the successful completion of the course, the student will be able to:
How to apply the software engineering lifecycle by demonstrating competence in
CO1
communication, planning, analysis, design, construction, and deployment.
CO2 An ability to work in one or more significant application domains.
Work as an individual and as part of a multidisciplinary team to develop anddeliver quality
CO3
software.
Demonstrate an understanding of and apply current theories, models, and techniques that
CO4
provide a basis for the software lifecycle.
CO5 Demonstrate an ability to use the techniques and tools necessary for engineeringpractice.

Contents 52 Hrs
OVERVIEW: Introduction; Software engineering ethics; Software process models;
Process activities; Coping with change; Agile software development:Agile methods; Plan- 10
driven and agile development.
REQUIREMENTS ENGINEERING: Functional and non-functional requirements;
Software requirements document; Requirement’s specification; Requirements engineering 10
processes; Requirement’s elicitationand analysis; Requirement’s validation; Requirements
management.
SYSTEM MODELING: Context models; Interaction models- Use case modeling, Sequence
diagrams; Structural models- Class diagrams, Generalization,Aggregation; Behavioral models- 10
Data-driven modeling, Event-driven modeling; Model-driven engineering.
ARCHITECTURAL DESIGN: Architectural design decisions; Architectural views;
Architectural patterns- Layered architecture, Repository architecture, Client–server architecture
Pipe and filter architecture. 12
DESIGN AND IMPLEMENTATION: Object-oriented design using the UML- System
context and interactions, Architectural design, Object class identification, Design models,
Interface specification; Design patterns; Implementation issues.
SOFTWARE TESTING: Development testing- Unit testing, Choosing unit test cases,
Component testing, System testing. Test-driven development; Release testing; User 10
testing- Alpha, Beta, Acceptance testing.
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program
Outcomes
(POs 1-15)

Program Outcomes (POs)

Course Outcomes (COs) / Program
Outcomes (POs) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby Projects/
Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group Discussion/
Collaborative Learning/ Experiential Learning / Self Directed Learning etc.

Formative Assessment for Theory

Assessment Occasion/ type Marks
Internal Assessment Test 1 10%
Internal Assessment Test 2 10%
Quiz/ Assignment/ Small Project 10%
Seminar 10%
Total 40 Marks
Formative Assessment as per guidelines.

Text Books:
1 Ian Somerville, “Software Engineering” 8th Edition, Pearson Education, 2009.
References Books:
1 Waman S Jawadekar, “Software Engineering Principles and Practice”, Tata McGrawHill, 2004.
2 Roger S. Pressman, “A Practitioners Approach”,7th Edition, McGraw-Hill, 2007.
3 P Jalote, “An Integrated Approach to software Engineering”, Narosa Publication.
Program
B.Sc./B.C.A Semester V
Name

Course Title Cloud Computing (Theory)

Course Code: DSE-E1 No. of Credits 03

Contact hours 42 Hours Duration of SEA/Exam 2 hours
Formative Assessment
40 Summative Assessment Marks 60
Marks

Course Outcomes (COs): After the successful completion of the course, the student will be able to:
Explain the core concepts of the cloud computing paradigm such as how and why this
CO1 paradigm shift came about, the characteristics, advantages and challenges brought about
by the various models and services in cloud computing.
Apply the fundamental concepts in data centres to understand the trade-offs in power,
CO2 efficiency and cost.
Identify resource management fundamentals like resource abstraction, sharing and
CO3
sandboxing and outline their role in managing infrastructure in cloud computing.
Analyze various cloud programming models and apply them to solve problems on the
CO4
cloud.

Contents 42 Hrs
Introduction: Different Computing Paradigms- Parallel Computing, Distributed
Computing, Cluster Computing, Grid Computing, Cloud Computing etc., Comparison of
various Computing Technologies; Cloud Computing Basics- What is Cloud Computing?
8
History, Characteristic Features, Advantagesand Disadvantages, and Applications ofCloud
Computing; Trends in Cloud Computing; Leading Cloud Platform Service
Providers.
Cloud Architecture: Cloud Service Models- Infrastructure as a Service (IaaS), Platform
as a Service (PaaS) and Software as a Service (SaaS), Comparison of different Service
Models; Cloud Deployment Models- Public Cloud; Private Cloud, Hybrid Cloud,
Community Cloud; Cloud Computing Architecture- Layered Architecture of Cloud.
Virtualization- Definition, Features of Virtualization; Types of Virtualizations- Hardware 10
Virtualization, Server Virtualization, Application Virtualization, Storage Virtualization,
Operating System Virtualization; Virtualization and Cloud Computing, Pros and Cons of
Virtualization, Technology Examples- Xen: Paravirtualization, VMware: Full
Virtualization, Microsoft Hyper-V.
Cloud Application Programming and the Aneka Platform: Aneka Cloud Application
Platform- Framework Overview, Anatomy of the Aneka Container; Building Aneka Clouds
(Infrastructure Organization, Logical Organization, Private Cloud Deployment Mode,
8
Public Cloud Deployment Mode, Hybrid Cloud Deployment Mode); Cloud Programming
and Management- Aneka SDK (Application Model and Service Model);
Management Tools (Infrastructure, Platform and Application management).
Cloud Platforms in Industry: Amazon Web Services- Compute Services, Storage
Services, Communication Services, Additional Services; Google AppEngine- Architecture
and Core Concepts, Application Life-Cycle, Cost Model, Observations; Microsoft Azure- 8
Azure Core Concepts (Compute, Storage, Core Infrastructure and Other
Services), SQL Azure, Windows Azure Platform Appliance.
Cloud Applications: Scientific Applications- Healthcare (ECG Analysis in the Cloud) 8
 Biology (Protein Structure Prediction and Gene Expression Data Analysis for Cancer
Diagnosis), Geoscience (Satellite Image Processing); Business and Consumer
Applications- CRM and ERP, Productivity, Social Networking, Media Applications,
Multiplayer Online Gaming.

Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program

Outcomes
(POs 1-15)

Course Outcomes (COs) / Program Program Outcomes (POs)

Outcomes (POs) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby Projects/
Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group Discussion/
Collaborative Learning/ Experiential Learning / Self Directed Learning etc.
Formative Assessment for Theory
Assessment Occasion/ type Marks
Internal Assessment Test 1 10%
Internal Assessment Test 2 10%
Quiz/ Assignment/ Small Project 10%
Seminar 10%
Total 40 Marks
Formative Assessment as per guidelines.

Text Books:
Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi: "Mastering CloudComputing-
1
Foundations and Applications Programming”, Elsevier, 2013
2 Barrie Sosinsky: "Cloud Computing Bible", Wiley-India, 2010
3 K Chandrashekaran: “Essentials of Cloud Computing”, CRC Press, 2015
4 Derrick Rountree, Ileana Castrillo: “The Basics of Cloud Computing”, Elsevier, 2014
Program
B.Sc./B.C.A Semester VI
Name
Course Title Digital Marketing (Theory)
Course Code: Voc-2 No. of Credits 03
Contact hours 42 Hours Duration of SEA/Exam 2 hours
Formative Assessment
Marks 40 Summative Assessment Marks 60

Course Outcomes (COs): After the successful completion of the course, the student will be able to:
1. Understand the fundamental concepts and principles of digital marketing.
2. Develop practical skills to implement various digital marketing strategies and techniques.
3. Analyze and evaluate the effectiveness of digital marketing campaigns.
4. Apply critical thinking and problem-solving skills to real-world digital marketing scenarios.
5. Create comprehensive digital marketing plans and strategies.

Note: Blooms Level(BL): L1=Remember, L2=Understand, L3=Apply, L4=Analyse, L5=

Evaluate, L6= Create
42
Contents
Hrs
Introduction to Digital Marketing: Overview of digital marketing, Evolution of digital
marketing, Importance and benefits of digital marketing, Digital marketing channels and
platforms 8
Digital Marketing Strategy and Planning: Developing a digital marketing strategy,
Setting goals and objectives, Budgeting and resource allocation.
Campaign planning and execution, Monitoring and adjusting digital marketing campaigns
Social Media Marketing: Overview of social media marketing, Social media platforms and
8
their features, Creating and optimizing social media profiles, Social media content
strategy, Social media advertising and analytics
Email Marketing: Introduction to email marketing, Building an email list, Creating
effective email campaigns, Email automation and segmentation, Email marketing metrics
8
and analytics Content Marketing: Understanding content marketing, Content strategy and
planning,
Content creation and distribution, Content promotion and amplification, Content
marketing metrics and analytics.
8
Mobile Marketing: Mobile marketing overview, Mobile advertising strategies, Mobile
app marketing, Location-based marketing, Mobile marketing analytics
Analytics and Reporting: Importance of analytics in digital marketing, Setting up web
analytics tools (e.g., Google Analytics), Tracking and measuring key performance indicators 10
(KPIs), Conversion tracking and optimization, Reporting and data visualization
Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program
Outcomes (POs 1-15)
Course Outcomes (COs) / Program Program Outcomes (POs)
Outcomes (POs) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Pedagogy: Lecture/ PPT/ Videos/ Animations/ Role Plays/ Think-Pair-Share/ Predict-Observe-

Explain/ Demonstration/ Concept mapping/ Case Studies examples/ Tutorial/ Activity/ Flipped
Classroom/ Jigsaw/ Field based Learning/ Project Based Learning/ Mini Projects/ Hobby Projects/
Forum Theatre/ Dance/ Problem Based Learning/ Game Based Learning/ Group Discussion/
Collaborative Learning/ Experiential Learning / Self Directed Learning etc.

Formative Assessment for Theory

Assessment Occasion/ type Marks

Internal Assessment Test 1 10%
Internal Assessment Test 2 10%
Quiz/ Assignment/ Small Project 10%
Seminar 10%
Total 40 Marks
Formative Assessment as per guidelines.

References
"Digital Marketing Strategy: An Integrated Approach to Online Marketing" by Simon
1 Kingsnorth.
"Email Marketing Rules: How to Wear a White Hat, Shoot Straight, and Win Hearts" by Chad
2
S. White
"Content Inc.: How Entrepreneurs Use Content to Build Massive Audiences and Create
3 Radically Successful Businesses" by Joe Pulizzi
"Mobile Marketing: How Mobile Technology is Revolutionizing Marketing, Communications
4
and Advertising" by Daniel Rowles
"Web Analytics 2.0: The Art of Online Accountability and Science of Customer Centricity"
5 by Avinash Kaushik