0% found this document useful (0 votes)
70 views348 pages

OBE BCA 2023 Batch Syllabus

The document summarizes a 3-year Bachelor of Computer Applications program with a focus on Cloud Computing and Artificial Intelligence/Machine Learning. The program aims to provide students with knowledge and skills in computer technology, programming languages, and database management. It outlines the program's education objectives, graduate attributes, qualifications, program outcomes, course structure over 6 semesters, and mapping of course outcomes to program outcomes.

Uploaded by

pinkyjaiswal7890
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views348 pages

OBE BCA 2023 Batch Syllabus

The document summarizes a 3-year Bachelor of Computer Applications program with a focus on Cloud Computing and Artificial Intelligence/Machine Learning. The program aims to provide students with knowledge and skills in computer technology, programming languages, and database management. It outlines the program's education objectives, graduate attributes, qualifications, program outcomes, course structure over 6 semesters, and mapping of course outcomes to program outcomes.

Uploaded by

pinkyjaiswal7890
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 348

Faculty of Engineering & Technology

Department of Computer Science & Engineering

Three-Year Full-Time Education Program

Bachelor of Computer Applications


(Cloud Computing/
Artificial Intelligence & Machine Learning)

With effect from Year 2023


TABLE OF CONTENTS
Sl. No. Topic/Content Page No.
1 Nature and extent of the program 1
2 Program education objective (PEOs) 2
3 Graduate attributes 3-5
4 Qualifications descriptors 6
5 Program outcomes (POs) 7-8
6 Program Specific Outcomes (PSOs) 9
7 Course structure 10-15
8 Semester-wise Course Details
● Semester I 18-56
● Semester II 57-93
● Semester III 94-132
● Semester IV 133-184
● Semester V 185-238
● Semester VI 239-282
Program Electives Pool 283-339
9 Mapping of Course Outcomes, Program Outcomes and Program 340-345
Specific Outcomes

Head of the Department Dean

Dean – Academics
1. NATURE AND EXTENT OF THE PROGRAM

The BCA course is a full time three years (six semesters) Bachelor’s Degree in Computer
Application. The basic objective of BCA Course is to provide young men and women with the
required knowledge and necessary skills to get rewarding careers into the changing world of
Information Technology. The course focuses on imparting knowledge and skills in computer
technology that includes programming languages and database management.

Eligibility Criteria:

A candidate seeking admission to the BCA Course must have passed 10+2 (any stream) securing
not less than 60% marks in aggregate (5% relaxation to ST/SC candidates) from the Central
Board of Secondary Education or any other equivalent examination recognized by the Mizoram
University preferably with Mathematics as one of compulsory or optional course, or any other
vocational course related to the computer stream having either Computer Science or Computer
Engineering as compulsory/optional course.

1
2. PROGRAM EDUCATION OBJECTIVES (PEOs)

After completing BCA, students will be able to:

PEO No. Education Objective


PEO1 Demonstrate analytical and design skills including the ability to generate
creative solutions and foster team-oriented professionalism through effective
communication in their careers.
PEO2 Graduates would expertise in successful careers based on their understanding
of formal and practical methods of application development using the
concept of computer programming languages and design principles in
national and international level.
PEO3 Exhibit the growth of the nation and society by implementing and acquiring
knowledge of upliftment of health, safety and other societal issues.
PEO4 Implement their exhibiting critical thinking and problem- solving skills in
professional practices or tackle social, technical and business challenges.

2
3. GRADUATE ATTRIBUTES

Sl. No. Attributes Description


1 Professional / Disciplinary BCA typically covers a broad range of
Knowledge
topics related to computer hardware,
software, algorithms, data structures, and
programming languages.

2 Technical / Practical skills In a BCA program, BCA students need to


have a strong foundation in computer
science concepts and programming
languages such as Java, C++, Python, etc.
In a BCA program, laboratory skills may
involve setting up and configuring
computer systems, installing software, and
troubleshooting hardware and software
issues. BCA students need to have
practical skills in software development
methodologies such as Agile, Scrum, and
Waterfall. They need to be able to write
code that is well-documented, modular,
and maintainable.
In summary, a BCA program requires a
combination technical, laboratory and
practical skills.

3
3 Communication Skill In a BCA program, Communication skills are an
essential part of education and can help students
excel in various aspects of their career. BCA
students must develop excellent communication
skills to become successful software
professionals.
4 Conduct BCA student conduct investigations of complex
problems using research-based knowledge and
research methods including design of
experiments, analysis and interpretation of data
and synthesis of information to provide valid
conclusions.
5 Modern Tool Usage Create, select and apply appropriate techniques,
resources and modern engineering and IT tools
including prediction and modeling to complex
engineering activities with an understanding of
the limitations.
6 The Engineer and Society Apply reasoning informed by contextual
knowledge to assess societal, health, safety, legal
and cultural issues and the consequent
responsibilities relevant to professional
engineering practice.
7 Environment and Sustainability Understand the impact of professional
engineering solutions in societal and
environmental contexts and demonstrate
knowledge of and need for sustainable
development.
8 Ethics Apply ethical principles and commit to
professional ethics and responsibilities and
norms of engineering practice.

4
9 Individual and Team Work Function effectively as an individual, and as a
member or leader in diverse teams and in multi-
disciplinary settings
10 Communication Communicate effectively on complex
engineering activities with the engineering
community and with society at large, such as
being able to comprehend and write effective
reports and design documentation, make
effective presentations and give and receive clear
instructions.
11 Project Management and Demonstrate knowledge and understanding of
Finance: computer applications and management
principles and apply these to one’s own work, as
a member and leader in a team, to manage
projects and in multidisciplinary environments.
12 Life-long Learning: Recognize the need for and have the preparation
and ability to Engage in independent and life-
long learning in the broadest context of
technological Change.

5
4. QUALIFICATION DESCRIPTORS:

BCA (Bachelor of Computer Applications) is an undergraduate program that prepares students


for a career in the field of computer science and technology. Some of the qualification
descriptors for BCA program are:

Technical knowledge: BCA graduates should have a strong foundation in computer science
concepts and should be familiar with programming languages, algorithms, data structures,
operating systems, databases, computer networks, and other related technologies.

Analytical skills: BCA graduates should possess strong analytical skills to analyze and solve
complex problems related to computer systems and software applications.

Creativity: BCA graduates should be able to think creatively to design and develop innovative
software applications, websites, and computer systems.

Teamwork: BCA graduates should be able to work collaboratively in a team environment to


develop and implement software applications and computer systems.

Communication skills: BCA graduates should possess excellent communication skills to


articulate technical concepts and ideas to a diverse audience.

Project management skills: BCA graduates should have project management skills to plan,
organize, and execute software development projects successfully.

Ethical and professional conduct: BCA graduates should adhere to ethical and professional
conduct n their work and be aware of the impact of technology on society and the environment.

6
5. PROGRAM OUTCOME
PO No. Attribute Competency
PO1 Professional Professional Knowledge: Refers to the expertise and
knowledge understanding of a particular field or profession, including its
principles, concepts, theories, and practices. It is the foundation
upon which individuals build their professional skills and
develop their careers.
PO2 Technical skills Technical Skills: Refers to the abilities and expertise needed to
perform specific tasks within a clinical or technical setting. This
includes skills such as diagnostic assessment, treatment
planning, technical procedures, and the use of specialized
equipment.
PO3 Team work Team work: Refers to the ability to work collaboratively with
others towards a common goal. This involves effective
communication, coordination, and cooperation among team
members, as well as a willingness to share responsibilities and
support others in achieving their objectives.
PO4 Ethical value & Ethical Value & Professionalism: Refers to the principles,
professionalism values, and behaviors that are expected of professionals in their
work. This includes a commitment to ethical behavior, honesty,
integrity, respect for others, and a dedication to upholding the
highest standards of professionalism in one’s field.
PO5 Communication Communication: This includes the use of verbal and nonverbal
communication skills, active listening, and the ability to adapt
communication style to different audiences and situations.

7
PO6 Evidence based Evidence-Based Practice/Learning: Refers to the use of the best
practice/learning available evidence to guide decision-making and practice in a
particular field or profession.

PO7 Life-long learning Lifelong Learning: Refers to the ongoing process of acquiring
new knowledge, skills, and competencies throughout one
career. This involves a commitment to continuous learning and
professional development, as well as a willingness to adapt to
changes in one’s field or profession.

PO8 Entrepreneurship, Entrepreneurship: Refers to the ability to identify and pursue


leadership and opportunities to create new ventures or initiatives within a
mentorship particular field or profession. This involves a willingness to
take risks, innovate, and adapt to changing market conditions.
Leadership: Refers to the ability to inspire, motivate, and guide
others towards a common goal. This involves setting a clear
vision, establishing a culture of collaboration and
accountability, and providing direction and support to team
members.
Mentorship: Refers to the process of providing guidance,
support, and advice to individuals who are seeking to develop
their skills and advance their careers. This involves sharing
knowledge and experience, providing feedback and
encouragement, and serving as a role model and advocate for
others.

8
6. PROGRAM SPECIFIC OUTCOME

PSO No. Competency


PSO1 Graduates of the program will be able to design, implement, and maintain complex
software systems using a range of programming languages and tools.
PSO2 Graduates of the program will be able to analyze and solve complex problems in
computer science and engineering using a range of algorithms and data structures.

PSO3 Graduates of the program will be able to communicate effectively with technical
and non-technical audiences, and work collaboratively in teams to solve complex
problems.

9
7. COURSE STRUCTURE

SEMESTER – I

Course Course Title Credit Marks Distribution


Code Distribution
(Hours/Week)
L T P C IAE ESE Total
Mathematics-I 3 0 0 3 40 60 100
Fundamentals 2 0 0 2 40 60 100
of Computers
and IT
Fundamentals 0 0 4 2 20 30 50
of Computers
and IT Lab
Networks and 3 0 0 3 40 60 100
Systems
Networks and 0 0 2 1 20 30 50
Systems Lab
Minor Electives 2 0 0 2 40 60 100
Courses-I
Minor Electives 0 0 4 2 20 30 50
Courses-I Lab
MGE-I 4 0 0 4 40 60 100
AECC-I 2 0 0 2 20 30 50
VAC-I 2 0 0 2 20 30 50
Total 18 0 10 23 300 450 750
Note – L: Lecture Hour/week, T: Tutorial Hour/week, P: Practical Hour/week, C: Credits,
IAE: Internal Assessment Examination, ESE: End Semester Examination

10
SEMESTER – II

Course Course Title Credit Distribution Marks Distribution


Code (Hours/Week)
L T P C IAE ESE Total
Statistics for 3 0 0 3 40 60 100
Computing
Introduction to 2 0 0 2 40 60 100
Programming
Methodology using C
Introduction to 0 0 4 2 20 30 50
Programming
Methodology using C
Lab
Empirical Software 3 0 0 3 40 60 100
Engineering
Empirical Software 0 0 2 1 20 30 50
Engineering Lab
Minor Electives 2 0 0 2 40 60 100
Courses-II
Minor Electives 0 0 4 2 20 30 50
Courses-II Lab
MGE-II 4 0 0 4 40 60 100
AECC-II 2 0 0 2 20 30 50
VAC-II 2 0 0 2 20 30 50
Total 18 0 10 23 300 450 750
Note – L: Lecture Hour/week, T: Tutorial Hour/week, P: Practical Hour/week, C: Credits,
IAE: Internal Assessment Examination, ESE: End Semester Examination

11
SEMESTER – III

Course Course Title Credit Distribution Marks Distribution


Code (Hours/Week)
L T P C IAE ESE Total
Object oriented 2 0 0 2 40 60 100
Development using C++
Object oriented 0 0 4 2 20 30 50
Development using C++
Lab
PE-I 2 0 0 2 40 60 100
PE-I Lab 0 0 4 2 20 30 50
Personality Development 2* 0 0 - - - -
& Career Building
(MCNC)
Minor Electives Courses- 3 0 0 3 40 60 100
III
Summer Internship-I - - - 1 20 30 50
MGE-III 4 0 0 4 40 60 100
AECC-III 2 0 0 2 20 30 50
VAC-III 2 0 0 2 20 30 50
SEC-I 0 0 4 2 20 30 50

Total 15 0 12 22 280 420 700


Note – L: Lecture Hour/week, T: Tutorial Hour/week, P: Practical Hour/week, C: Credits,
IAE: Internal Assessment Examination, ESE: End Semester Examination.
MCNC: Mandatory Course Non-Credit

12
SEMESTER – IV

Course Course Title Credit Distribution Marks Distribution


Code (Hours/Week)
L T P C IAE ESE Total
Database Management 2 0 0 2 40 60 100
Systems
Database Management 0 0 4 2 20 30 50
Systems Lab
PE-II 3 0 0 3 40 60 100
PE-II Lab 0 0 2 1 20 30 50
Quantitative Aptitude & 2* 0 0 - - - -
Logical Reasoning
(MCNC)
Problem Solving using 2 0 0 2 40 60 100
Python
Problem Solving using 0 0 4 2 20 30 50
Python Lab
Minor Electives Courses- 3 0 0 3 40 60 100
IV
Minor Electives Courses- 0 0 2 1 20 30 50
IV Lab
AECC-IV 2 0 0 2 20 30 50
SEC-II 0 0 4 2 20 30 50
Total 12 0 16 20 280 420 700
Note – L: Lecture Hour/week, T: Tutorial Hour/week, P: Practical Hour/week, C: Credits,
IAE: Internal Assessment Examination, ESE: End Semester Examination

13
SEMESTER – V

Course Course Title Credit Distribution Marks Distribution


Code (Hours/Week)
L T P C IAE ESE Total
Data Warehousing and 3 0 0 3 40 60 100
Data Mining
Data Warehousing and 0 0 2 1 20 30 50
Data Mining Lab
PE-III 3 0 0 3 40 60 100
PE-III Lab 0 0 2 1 20 30 50
Java Programming 2 0 0 2 40 60 100
Java Programming Lab 0 0 4 2 20 30 50
Innovations & 3 0 0 3 40 60 100
Entrepreneurship
Minor Electives Courses- 3 0 0 3 40 60 100
V
Minor Electives Courses- 0 0 2 1 20 30 50
V Lab
Summer Internship - II - - - 2 20 30 50
SEC-III 0 0 4 2 20 30 50
Total 14 0 14 23 320 480 800
Note – L: Lecture Hour/week, T: Tutorial Hour/week, P: Practical Hour/week, C: Credits,
IAE: Internal Assessment Examination, ESE: End Semester Examination

14
SEMESTER – VI

Course Course Title Credit Distribution Marks Distribution


Code (Hours/Week)
L T P C IAE ESE Total
Web Development using 2 0 0 2 40 60 100
PHP
Web Development using 0 0 4 2 20 30 50
PHP Lab
PE-IV 2 0 0 2 40 60 100
PE-IV Lab 0 0 4 2 20 30 50
Essentials of Cyber 3 0 0 3 40 60 100
Security
Minor Electives Courses- 3 0 0 3 40 60 100
VI
Minor Electives Courses- 0 0 2 1 20 30 50
VI Lab
Capstone Project 0 0 2 1 20 30 50
SEC-IV 0 0 4 2 20 30 50
Total 10 0 16 18 260 390 650
Note – L: Lecture Hour/week, T: Tutorial Hour/week, P: Practical Hour/week, C: Credits,
IAE: Internal Assessment Examination, ESE: End Semester Examination

15
Multidisciplinary Generic Electives (MGE)
Multidisciplinary Generic Electives is credited and choice-based. The students make a choice
from a pool of MGE offered by the Faculty under the University. (Reference: University
Umbrella Multidisciplinary Generic Electives)

Value Added Courses (VAC)


Value Added Courses are credited and choice-based. The students make a choice from the pool of
VAC offered by the Faculty under the University. (Reference: University Umbrella Value Added
Courses)

Ability Enhancement Compulsory Course (AECC)


Ability Enhancement Compulsory Courses are credited and choice-based. The students make a
choice from the pool of AECC offered by the Faculty under the University. (Reference: University
Umbrella Ability Enhancement Compulsory Course)

Skill Enhancement Courses (SEC)


Ability Enhancement Compulsory Courses are credited and choice-based. The students make a
choice from the pool of AEC offered by the Faculty under the University.

SEC Courses

SEC-I Web development using HTML and CSS


SEC-II Embedded System development
SEC-III MATLAB
SEC-IV Drone Remote Sensing

Minor Electives pool

Cloud Computing (CC) Artificial Intelligence & Machine


Learning (AIML)
MEC-I Virtualization Concepts Foundation of Data Science
MEC-II Fundamentals of Cloud Computing Data Mining and Predictive
Modeling
MEC-III Cloud Computing Securitization Natural Language Processing
MEC-IV Cloud Computing Architecture and R Programming for Data Analytics
Deployment models & Visualization
MEC-V Introduction to Windows Azure Data Visualization and Story
Telling
MEC-VI Applications of Cloud Systems Big Data Analytics & applications

16
Program Electives pool

PE-I Algorithms Design and Complexity Digital Electronics Game


Theory Programming with
HTML5
PE-II Advances in Operating Systems IoT Networks and Industrial and
Protocols Medical IoT

PE-III Computer Graphics & Vision Automata Theory Reinforcement


and Computability Learning
PE-IV Enterprise Mobile Application Compiler Design Image and Video
Development Processing

OVERALL CREDIT DISTRIBUTION TABLE

SEMESTER HOURS PER Total Marks Distribution


WEEK Credit
L T P TC IAE ESE Total
SEMESTER – I 18 0 10 23 300 450 750
SEMESTER – II 18 0 10 23 300 450 750
SEMESTER – III 15 0 12 22 280 420 700
SEMESTER – IV 12 0 16 20 280 420 700
SEMESTER – V 14 0 14 23 320 480 800
SEMESTER – VI 10 0 16 18 260 390 650
Total 87 0 78 129 1740 2610 4350
Note – L: Lecture Hour, T: Tutorial Hour, P: Practical Hour, TC: Total Credits, IAE: Internal
Assessment Examination, ESE: End Semester Examination.

17
8. SEMESTER-WISE COURSE DETAILS

SEMESTER - I
Course Code Course Title

Mathematics-I

Fundamentals of Computers and IT

Fundamentals of Computers and IT Lab

Networks and Systems

Networks and Systems Lab

Minor Electives Courses-I

Virtualization Concepts (CC)

Foundation of Data Science (AIML)

Minor Electives Courses-I Lab

Virtualization Concepts Lab (CC)

Foundation of Data Science Lab (AIML)

MGEC-I

AECC-I

VAC-I

18
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Mathematics-I

Academic Year I
Semester I
Number of Credits 3
Course Prerequisite Basic Mathematics
Course Synopsis In this course, Students will learn about basic concepts of
Engineering Mathematics such as Determinants, Matrices,
Sequence and series, Differentiation and integration.
Course Outcomes:
At the end of the course students will be able to:
CO1 Familiarity with Matrices and Determinants.
CO2 To determine general term of series in AP and GP, Calculate sum of n terms of
series.
CO3 To gain insight of differentiation and its applications.
CO4 To gain insight of integration and its applications.

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program


Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO PSO3
2
CO1 3 2 - 2 - - 2 - 2 3 -

CO2 3 3 3 - - - - - 1 2 -

CO3 3 1 - 3 - - 2 - 3 1 -

CO4 3 2 2 3 - - - - 2 2 -

Average 3 2 1.2 2 - - 1 - 2 2 -

19
Course Content
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 Determinants and Matrices:

Determinants:

Definition, Minors, Co-factors, Properties of Determinants (C1: knowledge)

Applications of determinants in finding area of triangle (C3: Application)

Matrices: Definition, Types of Matrices (C1: Knowledge)

Apply Addition, Subtraction, Scalar Multiplication and Multiplication of Matrices,

Adjoint, Inverse (C3: Application)

Implement Solution of system of linear equation by Cramer’s Rule (C3:


Application)
2 Sequence and Series:

Introduction to Sequences, Series, Arithmetic Progression (A.P), Geometric


Progression (G.P) (C1: knowledge)

Evaluate Relationship Between A. M. and G.M. (C5: Evaluation)

Apply Sum to N terms of Special Series (C3: Application)

Describe Principle of Mathematical Induction (C2: Comprehension)

20
3 Differentiation:

Evaluate Derivative of a function, Derivatives of sum, differences, product, and


quotient of functions (C5: Evaluation)

Evaluate Derivative of polynomial, trigonometric, exponential, logarithmic, inverse


trigonometric and implicit functions (C5: Evaluation)

Implement Logarithmic Differentiation, Derivatives of functions in parametric


forms, Differentiation by substitution (C3: Application)
4 Integration:

Evaluate Indefinite integrals (C5: Evaluation)

Implement Methods of integration: by substitution, by parts, by partial fractions

(C3: Application)

Apply Integration of algebraic and transcendental functions (C3: Application)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 38
Practical -
Seminar/Journal Club 1
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 5
Case/Project Based Learning (CBL) -
Revision 1
Others If any: -
Total Number of Contact Hours 45

21
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √ √ √
Assignment / Presentation √ √ √ √
Unit test √ √ √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References List of reference books


:

1. Babu Ram, Engineering Mathematics, Pearson Education


2. Engineering Mathematics; Author, B. V. Ramana
Publisher, Tata McGraw-Hill
3. Advanced Engineering Mathematics by RK Jain
4. Shanti Narayan, Differential calculus, Sultan Chand &
Company.

22
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Fundamentals of Computers and Information Technology
Academic Year I
Semester I
Number of Credits 2
Course Prerequisite Basics of Computers
Course Synopsis In this course, Students will learn about fundamental concepts
of computers, Number system, basics of Information
Technology
Course Outcomes:
At the end of the course students will be able to:
CO1 Understanding the concept of input and output devices of Computers
CO2 Learn the functional units and classify types of computers, how they process
information and how individual computers interact with other computing systems
and devices
CO3 Understand an operating system and its working, and solve common problems
related to operating systems
CO4 Know fundamental concepts of computers, Number system, basics of Information
Technology
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes :
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO
3
CO1 3 2 - 2 - - 2 - 2 3 -

CO2 3 3 3 - - - - - 1 2 -

CO3 3 1 - 3 - - 2 - 3 1 -

CO4 3 2 2 3 - - - - 2 2 -

23
Average 3 2 1.2 2 - - 1 - 2 2 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies
1 Introduction to Computers:

Describe Evolution of computers: Computer Generation from First Generation to


Fifth Generation. (C1: Knowledge)

Classifications of Computers: Micro, Mini, Mainframe and supercomputers,


Distributed Computer System, Parallel Computers. (C2: Comprehension)

Explain Computer Hardware: Major Components of a digital computer, Block


Diagram of a computer. (C2: Comprehension)

Discuss Input devices, Output Devices. Computer Memory: Memory Cell (C2:
Comprehension)

Analysis of Memory Organization, Primary Memory: RAM & ROM, Secondary


memory, Flash Drives, Solid State Drives. (C4: Analysis)
2 Introduction to System Software and Operating System:

Describe Computer Software: Machine language, Assembly language, high-level


languages, fourth generation language, assemblers, compilers, interpreters, linkers,
loaders. (C2: Comprehension)

Analyze Operating System concepts: different types of operating systems, functions


of operating system (C4: Analysis)

Implement the concept of multiprogramming, multitasking, multithreading,


multiprocessing, time-sharing, real time, single-user & multi-user operating system.
(C3: Application)

24
3 Number Systems:

Introduction to number systems, Decimal number system-Definition, digits,


radix/base, Binary number system – Bit Byte (C1: knowledge)

Apply Conversions: Binary to Decimal and Decimal to Binary. Octal number system
Conversion from Octal to Decimal to Octal, Octal to Binary and binary to Octal.
Hexadecimal number system –Conversion: Decimal to Hex, Hex to decimal, Hex to
Binary, Binary to Hex, Octal to Hex, Hex to Octal (C3: Application)

Implement binary addition, subtraction, multiplication and division (only Integer


part). (C3: Application)

Evaluate 1’s and 2’s complement: 2’s complement subtraction. (C5: Evaluation)
4 Electronic Payment System:

Describe Secure Electronic Transaction, Types of Payment System: Digital Cash,


Electronic Cheque, Smart Card, Credit/Debit Card (C2: Comprehension)

Introduction to Bluetooth, Cloud Computing, Big Data, Data Mining, Mobile


Computing and Embedded Systems and Internet of Things (IoT) (C1: knowledge)

25
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

26
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √
Feedback Process Student’s Feedback
References: List of reference books
1.P. K. Sinha & Priti Sinha, “Computer Fundamentals”, BPB
Publications.

2. Anita Goel “Computer Fundamentals”, Pearson.

3. Introduction to Computers by Peter Norton, Tata McGraw Hill

27
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Fundamentals of Computers and Information Technology
Lab
Academic Year I
Semester I
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about fundamental concepts
of Computers, basics of HTML Programming.
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand basic concepts and organization of computer system
CO2 Understand Functions of Excel
CO3 Learn about basic HTML Commands
CO4 Learn to design web sites
Mapping of Course Outcomes (COs) to Program Outcomes (Pos) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PS
O3
CO1 2 3 - 2 - 2 - 2 2 - 3

CO2 2 3 3 - - - - - 1 - 2

CO3 3 3 - - - 2 - 2 3 - 1

CO4 1 3 2 3 - - - - 2 - 2

Average 2 3 1.2 2.5 - 1 - 1 2 - 2

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week

28
- 4 4
Unit Content & Competencies
1 Dismantling the system unit, recognize all major components inside a PC, describe
function of each component and define the relationship of internal components (C1:
Knowledge)
2 Operating system-Definition & functions, basics of Windows. Basic components of
windows, icons, types of icons, taskbar, activating windows, using desktop, title bar,
running applications, exploring computer, managing files and folders, copying and
moving files and folders (C3: Application)
3 Control panel – display properties, adding and removing software and hardware,
setting date and time, screensaver and appearance. Using windows accessories. (C3:
Application)
4 Documentation Using MS-Word – Introduction to Office Automation, Creating &
Editing Document, Formatting Document, Auto-text, Autocorrect, Spelling and
Grammar Tool, Document Dictionary, Page Formatting (C4: Analysis)
5 Advance Features of MS-WordMail Merge, Tables, File Management, Printing,
Styles, linking and embedding object, Template (C2: Comprehension)
6 MS-Excel – Introduction to MS-Excel, Creating & Editing Worksheet, Formatting
and Essential Operations, Formulas and Functions, Charts, Advance features of MS-
Excel-Pivot table & Pivot Chart (C5: Evaluation)
7 Presentation using MS-PowerPoint: Presentations, Creating, Manipulating &
Enhancing Slides, Organizational Charts, Excel Charts, Word Art, Layering art
Objects, Animations and Sounds, Inserting Animated Pictures or Accessing through
Object, Inserting Recorded Sound Effect or In-Built Sound Effect (C6: Synthesis)
8 Create an office writer document and using tables distinguish between different types
of memories (C6: Synthesis)
9 Draft a letter asking for quotations of different peripheral devices for your computer
lab and mail the letter using mail merge in open office writer (C6: Synthesis)
10 Create a template and draw a basic block diagram of computer & using graphs
compare the performance of different laptop/notebook PC (C6: Synthesis)

29
11 Evaluate basic HTML Tags
(C5: Evaluation)
12 Create a table to show your class timetable. Use tables to provide layout to your
HTML page describing your university infrastructure (C6: Synthesis)
13 Use frames in HTML such that page is divided into 3 frames 20% on left to show
contents of pages, 60% in center to show body of page, remaining on right to show
remarks (C3: Application)
14 Create HTML pages showing timetable of trains departing from Delhi railway
station
(C6: Synthesis)
15 Create web pages for your college using HTML (C6: Synthesis)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

30
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination
Feedback Process Student’s Feedback
References: List of reference books

1.Introduction to Computers by Peter Norton, Tata McGraw


Hill
2.Learn HTML for Beginners: The illustrated guide to Coding
by Jo Foster.

31
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Networks and Systems

Academic Year I
Semester I
Number of Credits 3
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about basics of Computer
networks, OSI Model, Layers of OSI model, functionalities of
layers of OSI model.
Course Outcomes:
At the end of the course students will be able to:
CO1 To develop an understanding of modern network architectures from a design
and performance perspective
CO2 To introduce the student to the major concepts involved in wide-area networks
(WANs), local area networks (LANs) and Wireless LANs (WLANs)
CO3 Explain the functions of the different layers of the OSI Protocol.
CO4 Explain functionalities of layers of OSI model
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO7 PO8 PSO1 PSO PSO
1 3 4 2 3
CO1 3 2 - 2 - - - 2 2 3 -

CO2 3 3 3 - - - - - 1 2 -

CO3 3 1 - 3 - - - 2 3 1 -

CO4 3 2 2 3 - - - - 2 2 -

Average 3 2 1.2 2 - - - 1 2 2 -

32
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 - 3
Unit Content & Competencies
1 Basics of Computer Network:

Introduction to Computer Network: Definition, Goals, Structure; Broadcast and


Point-To Point Networks; Network Topology and their various Types (C1:
Knowledge)

Discuss Types of Networks: LAN, MAN, WAN; Server Based LANs & Peer-to-
Peer LANs (C2: Comprehension)

Analyze Communication Types: Synchronous, Asynchronous (C4: Analysis)

Implement modes of Communication: Simplex, Half Duplex, Full Duplex; Protocols


and Standards (C3: Application)
2 Network Models:

Explain Design Issues of the Layer, Protocol Hierarchy, ISO-OSI Reference Model:
Functions of each Layer, Various Terminology used in Computer Network (C2:
Comprehension)

Analyze Connection-Oriented & Connectionless Services (C4: Analysis)

Explain Internet (TCP/IP) Reference Model (C3: Application)

Comparison of ISO-OSI and TCP/IP Model (C4: Analysis)


3 Network Connectivity Devices:

Categories of Connectivity Devices, Passive and Active Hubs, Repeaters, Bridges,


Switches (2-Layer Switch, 3-Layer, Switch (Router), Gateways, Network Security
Devices (Firewalls, Proxy Servers) (C4: Analysis)

Discuss and analyze Network Layer - Point - to Point Networks, routing, Congestion
control Internetworking -TCP / IP, IP packet, IP address, IPv6 (C3: Application, C4:
Analysis)

33
4 Transport Layer:
Introduction to TCP/UDP protocols. (C1: Knowledge)

Session, Presentation and Application Layers:


Analyze Session Layer design issues, Presentation Layer design issues (C4:
Analysis)

Evaluate Data compression techniques, Cryptography. Application Layer –


Distributed application (client/server, peer to peer, cloud etc.) (C5: Evaluation)

Distinguish World Wide Web (WWW), Domain Name System (DNS), E-mail, File
Transfer Protocol (FTP), HTTP as an application layer protocol (C4: Analysis)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 39
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 45

34
Assessment Methods

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books

1. Tanenbaum, Andrew, Computer Networks, PHI

2. Forouzan Behrouz A., Tata McGraw Hill

3. Norton Peter, Complete Guide to Networking

35
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Networks and Systems Lab

Academic Year I
Semester I
Number of Credits 1
Course Prerequisite NIL
Course Synopsis In this course, students will learn about basic networking
commands, socket programming, Simulation tools
Course Outcomes:
At the end of the course students will be able to:
CO1 To learn and use network commands
CO2 To learn socket programming
CO3 To implement and analyze various network protocols.
CO4 To learn and use simulation tools
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO PO PO5 PO6 PO7 PO8 PSO PSO2 PSO3
3 4 1
CO1 2 2 - 2 2 - - 2 2 - 3

CO2 2 3 3 - 2 - - - 1 - 2

CO3 3 1 - - 2 - - 2 3 - 1

CO4 1 2 2 3 2 - - - 2 - 2

Average 2 2 1.2 2.5 2 - - 1 2 - 2

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
- 2 2

36
Unit Content & Competencies
1 Learn to use commands like tcpdump, netstat, ipconfig, nslookup and traceroute.
Capture ping and traceroute PDUs using a network protocol analyzer and examine
(C1: Knowledge)
2 Write a program for a HLDC frame to perform the following. i) Bit stuffing ii)
Character stuffing. (C2: Comprehension)

3 Implement Dijkstra’s algorithm to compute the shortest routing path. (C3:


Application)

4 Write a program for error detecting code using CRC-CCITT (16- bits). (C2:
Comprehension)
5 Implementation of Stop and Wait Protocol and Sliding Window Protocol (C3:
Application)
6 Write a program to find the shortest path between vertices using bellman-ford
algorithm. (C2: Comprehension)
7 Implement a program for simple RSA algorithm to encrypt and decrypt the data. (C3:
Application)
8 Design a program for congestion control using leaky bucket algorithm. (C6: Synthesis)
9 Develop a program for distance vector algorithm to find suitable path for transmission.
(C6: Synthesis)
10 Develop a program to find the shortest path between vertices using bellman-ford
algorithm (C6: Synthesis)

37
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

38
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Logbook/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books

1. Tanenbaum, Andrew, Computer Networks, PHI

2. Forouzan Behrouz A., Tata McGraw Hill

3. Norton Peter, Complete Guide to Networking

39
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Virtualization Concepts

Academic Year I
Semester I
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about Virtualization
concepts, understand and apply Network Virtualization
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand the Virtualization fundamentals.
CO2 Describe binary translation
CO3 Understand and apply Network Virtualization
CO4 Understand desktop Virtualization: Terminal Services, Hosted Desktop
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO PSO2 PSO
1 3
CO1 3 2 - 2 - - 2 - 2 3 -

CO2 3 3 3 - - - - - 1 2 -

CO3 3 1 - 3 - - 2 - 3 1 -

CO4 3 2 2 3 - - - - 2 2 -

Average 3 2 1.2 2 - - 1 - 2 2 -

Course Content:

40
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content Competencies
1 Introduction To Virtualization:

Explain System Architectures, Virtual Machine Basics, Process Virtual Machines,


System Virtual Machines, Taxonomy of Virtual Machines (C1: Knowledge)

Emulation: Basic Interpretation (C3: Application)

Threaded Interpretation – Pre-Coded and Direct Interpretation (C5: Evaluation)


2 Apply Binary Translation:
Full and Paravirtualization (C3: Application)
Analyze Types of Hypervisors, Types of Virtualizations. (C4: Analysis)
3 Network Virtualization:

Design of Scalable Enterprise Networks (C6)

Virtualizing the Campus – WAN Design, WAN Architecture, WAN virtualization


(C4: Analysis)

Examine Virtual Enterprise Transport virtualization, VLANs and Scalability


Theory, Network Device Virtualization (C4: Analysis)

Compare Routing Protocols – VRF, Aware Routing, Multi-Topology Routing.


(C4: Analysis)

41
4 Applying Virtualization

Comparison of Virtualization Technologies: Guest OS, Host OS, Hypervisor,


Emulation (C4: Analysis)

Describe Kernel Level – Shared Kernel, Enterprise Solutions: VMware Server,


ESXi, Citrix Xen Server, Microsoft Virtual PC, Microsoft Hyper-V (C2:
Comprehension)

Building Virtual Box – Server Virtualization: Configuring Server with Server


Virtualization, Adjusting and Tuning Virtual Servers (C6: Synthesis)

Analyze Network and Storage Virtualization: VPN, VLAN, SAN and VSAN,
NAS. (C4: Analysis)

Mapping of Assessment with COs

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

42
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

43
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4

Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Chris Wolf, Erick M. Halter, “Virtualization: From the Desktop
to the Enterprise”, A Press, 2005.
2. James E. Smith, Ravi Nair, “Virtual Machines: Versatile
Platforms for Systems and Processes”, Elsevier/Morgan
Kaufmann, 2005.
3. David Marshall, Wade A. Reynolds, “Advanced Server
Virtualization: VMware and Microsoft Platform in the Virtual
Data Center”, Auerbach Publications, 2006.
4. William von Hagen, “Professional Xen Virtualization”, Wrox
Publications, January, 2008.

44
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Virtualization Concepts Lab

Academic Year I
Semester I
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about key technologies
and capabilities required for setting up IT virtualization and
cloud computing infrastructure and Visualization of data.
Course Outcomes:
At the end of the course students will be able to:
CO1 Define key technologies and capabilities required for setting up IT
virtualization and cloud computing infrastructure.
CO2 Enumerate the ultimate goal of assessing, measuring and planning for the
deployment of cloud-based IT resources.
CO3 Observe the applications of tools used in Cloud environment.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO PSO PSO
1 2 3
CO1 3 2 2 3 - 1 - - 1 - 2

CO2 3 2 2 3 - 2 - - - - -

CO3 3 2 1 - - 1 - - 2 - 1

Average 3 2 1.6 2 - 1.3 - - 1 - 1

Course Content:

45
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content Competencies
1 Container technology
•Installation
•Working with containers
•Configuring containers (C1: Knowledge)

2 Understanding virtualization

•Virtualization and Cloud Computing

•Virtualizing servers

•Virtualizing desktops (C2: Comprehension)


3 Understanding hypervisors
•Exploring the hypervisors
•Understanding type 1 hypervisor
•Understanding type 2 hypervisor (C2: Comprehension)
4 Understanding virtual machines
•Examining CPUs in a virtual machine
•Examining memory in a virtual machine (C2: Comprehension)
5 Examining network resources in a virtual machine (C4: Analysis)
6 Examining storage in a virtual machine
(C4: Analysis)
7 Understanding how a virtual machine works
(C2: Comprehension)
8 Creating a virtual machine
•VM configuration (C6: Synthesis)
9 Virtualizing applications (C4: Analysis)
10 Installing a guest OS
•Installing windows on a virtual machine
•Loading windows into a virtual machine (C6: Synthesis)

46
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

47
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3


Quiz √
VIVA √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References List of reference books

1. Virtualization Essentials by Mathew Portnoy, Wiley


2. Cloud Computing: Principals and Paradigms by James Broberg,
Wiley

48
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Foundation of Data Science
Academic Year I
Semester I
Number of Credits 2
Course Prerequisite Nil
Course Synopsis In this course, Students will learn about data science concepts,
relationship between data and Visualization of data.
Course Outcomes:
At the end of the course students will be able to:
CO1 To understand the data science fundamentals and process.
CO2 To learn to describe the data for the data science process
CO3 To learn to describe the relationship between data.
CO4 To present and interpret data using visualization libraries
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO PSO2 PSO3
1
CO1 2 3 1 1 - 1 - - 2 1 -

CO2 2 3 2 - - 2 - - - 3 -

CO3 2 3 3 - - 3 - - 3 - -

CO4 2 3 - 3 - - - - 2 2 -

Average 2 3 1.5 1 - 1.5 - - 1.7 1.5 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

49
2 2
Unit Content & Competencies
1 Introduction

Introduction to Data Science – Evolution of Data Science (C1: Knowledge)

Classify Data Science Roles – Stages in a Data Science Project (C2: Comprehension)

Applications of Data Science in various fields, Data Security Issues. (C3: Application)
2 Data Collection and Data Pre-Processing
Describe Data Collection Strategies – Data Pre-Processing, Data Cleaning, Data
Integration and Transformation, Data Reduction, Data Discretization. (C2:
Comprehension)

Exploratory Data Analytics: Descriptive Statistics – Mean, Standard Deviation, Skewness


and Kurtosis, Box Plots – Pivot Table, Heat Map (C3: Application)

Design Correlation Statistics – ANOVA. (C6: Synthesis)


3 Model Development Simple and Multiple Regression

Model Evaluation using Visualization (C5: Evaluation)

Construct Residual Plot, Distribution Plot, Polynomial Regression and Pipelines (C6:
Synthesis)

Measures for In-sample Evaluation (C5: Evaluation)

Prediction and Decision Making (C5: Evaluation)

4 Model Evaluation Generalization Error

Out-of-Sample Evaluation Metrics – Cross (C5: Evaluation)

Validation, Overfitting, Underfitting and Model Selection (C5: Evaluation)

Prediction by using Ridge Regression (C5: Evaluation)

Testing Multiple Parameters by using Grid Search (C4: Analysis)

50
Mapping of Assessment with COs

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Quiz Mid Semester Examination 2
Seminars University Examination
Problem Based Learning (PBL) Multiple Choice Questions (MCQ)
Short Answer Questions (SAQ)
Long Answer Question (LAQ)

51
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books

1. Jojo Moolayil, “Smarter Decisions: The Intersection of IoT and Data


Science”, PACKT, 2016.

2. Cathy O’Neil and Rachel Schutt, “Doing Data Science”, O'Reilly,


2015.

3. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data
Analytics”, EMC 2013

4. Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big


Data Analytics”, IGI Global.

52
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Foundation of Data Science Lab

Academic Year I
Semester I
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about data science concepts,
relationship between data and Visualization of data
Course Outcomes :
At the end of the course students will be able to:
CO1 Apply appropriate tools for Data Collection and Manipulation
CO2 Implement Data Visualization Methods for getting insights of Data.
CO3 Analyze Data by implementing Concepts of Data Preparation
CO4 Perform three-dimensional plotting and visualization
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO PSO3
2
CO1 2 2 2 1 - - - 1 1 1 1

CO2 2 1 2 3 - - - 1 2 - -

CO3 3 3 1 2 - - - 1 3 3 -

CO4 3 2 1 2 - - - 1 - - 1

Average 2.5 2 1.5 2 - - - 1 1.5 1 0.5

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

53
4 4
Unit Content Competencies
1 Write a program to create a list, manipulate and slice it. (C1: Knowledge)
2 Write a program for Accessing/Importing and Exporting Data (C2: Comprehension)
3 Apply basic statistical methods on Sample Datasets (C3: Application)
4 Consider the sample data Mean velocity: 0.2474, 0.1235, 0.1737, 0.1824 Standard
deviation of velocity: 0.3314, 0.2278, 0.2836, 0.2645 (C2: Comprehension)
5 Univariate analysis: Frequency, Mean, Median, Mode, Variance, Standard Deviation
(C4: Analysis)
6 Bivariate analysis: Linear and logistic regression modeling (C4: Analysis)
7 Multiple Regression analysis (C4: Analysis)
8 Apply and explore various plotting functions on UCI data sets.
(C3: Application)
9 Three-dimensional plotting (C6: Synthesis)
10 Reading different types of data sets (.txt, .csv) from web and disk and writing in file
in specific disk location (C3: Application)
11 Analyze the data distributions using box and scatter plot (C4: Analysis)
12 Analyze the correlation matrix (C4: Analysis)
13 Analyze the outliers using plot (C4: Analysis)
14 Plot the histogram, bar chart and pie chart on sample data (C6: Synthesis)

54
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

55
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books

1.Jojo Moolayil, “Smarter Decisions: The Intersection of IoT and


Data Science”, PACKT, 2016.

2.Cathy O’Neil and Rachel Schutt, “Doing Data Science”, O'Reilly,


2015.

3.David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big
data Analytics”, EMC 2013

4.Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for


Big Data Analytics”, IGI Global.

56
SEMESTER - II
Course Code Course Title

Statistics for Computing

Introduction to Programming Methodology


using C
Introduction to Programming Methodology
using C Lab
Empirical Software Engineering

Empirical Software Engineering Lab

Minor Electives Courses-II

Fundamentals of Cloud Computing (CC)

Data Mining and Predictive Modeling


(AIML)
Minor Electives Courses-II Lab

Fundamentals of Cloud Computing Lab (CC)

Data Mining and Predictive Modeling Lab


(AIML)
MGEC-II

AECC-II

VAC-II

57
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Statistics for Computing
Academic Year I
Semester II
Number of Credits 3
Course Prerequisite Mathematics
Course Synopsis In this course, students will study about Samples, population,
Central Tendency, Permutation and Combination
Course Outcomes:
At the end of the course students will be able to:
CO1 Summarize data in a useful and informative manner, estimate and population,
characteristic based on a sample
CO2 Analyze data using measures of dispersion
CO3 Apply the concepts of permutations and combinations
CO4 Determine if the data adequately represents the population
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 - 3 1 3 - - 1 - 1 1

CO2 2 - 2 3 2 - - 3 - 3 2

CO3 3 - 1 1 1 - - 1 - 2 1

CO4 3 - 3 3 3 - - 3 - 1 2

Average 2.7 - 2.2 2 2.2 - - 2 - 1.7 1.5

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 3

58
Unit Content & Competencies
1 Population, Sample and Data Condensation

Definition of statistics, Scope of statistics, Concept of population and simple with


Illustration (C1: Knowledge)

Describe Raw data, Attributes and variables (C2: Comprehension)

Compare Frequency distribution, Cumulative frequency distribution (C4: Analysis)


2 Measures of Central Tendency

Concept of central Tendency (C2: Understand)

Analyze requirements of good measures of central tendency (C4: Analysis)

Classify Arithmetic mean, Median, Mode, Harmonic Mean, Geometric mean for grouped
and ungrouped data (C2: Understand)

Measures of Dispersion

Explain concept of dispersion (C2: Comprehension)

Absolute measure of dispersion (C5: Evaluation)

Relative measure of dispersion, Range variance (C5: Evaluation)

Interpret Standard deviation, Coefficient of variation (C3: Application)


3 Permutations and Combinations

Permutations of 'n' dissimilar objects taken 'r' at a time (with or without repetitions),
n
Pr = n! /(n-r)!(without proof) (C6: Synthesis)

Combinations of 'r' objects taken from 'n' objects, nCr = n!/(r! (n-r)!) (C6: Synthesis)

Simple examples of permutations and combinations, Applications (C3: Application)

59
4 Sample Space, Events and Probability:

Experiments and random experiments (C5: Evaluation)

Ideas of deterministic and non-deterministic experiments (C2: Comprehension)

Definition of sample space, Discrete sample space, Events, Types of events, Union and
intersections of two or more events, mutually exclusive events, Complementary event,
Exhaustive event, Simple examples (C1: Knowledge)

Classical definition of probability (C2: Comprehension)

Apply Addition theorem of probability without Proof (up to three events are expected)
(C3: Application)

Definition of conditional probability (C1: Knowledge)

Definition of independence of two events (C1: Knowledge, C2: Comprehension)

Simple numerical problems (C3: Application)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 38
Practical -
Seminar/Journal Club 1
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial 5
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) -
Revision 1
Others If any: -
Total Number of Contact Hours 45

60
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Quiz Mid Semester Examination 2
Seminars University Examination
Problem Based Learning (PBL) Multiple Choice Questions (MCQ)
Short Answer Questions (SAQ)
Long Answer Question (LAQ)

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: 1. Levin, R.I. and Rubin D.S., Statistics for Management, Pearson Education.
2. Gupta, S.P. and Gupta, M.P., Business Statistics, Sultan Chand and Sons.
3. Sharma, J.K., Business Statistics, Vikas Publication House Pvt. Ltd.

61
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Introduction to Programming Methodology using C
Academic Year I
Semester II
Number of Credits 2
Course Prerequisite Fundamentals of Computers and IT
Course Synopsis In this course, students will study about Programming concepts
using C
Course Outcomes:
At the end of the course students will be able to:
CO1 Demonstrate problem solving skills by developing and implementing
algorithms to solve problems
CO2 Implement programs using functional program pedagogy

CO3 Demonstrate an understanding of array, structures and pointers

CO4 Implement programs using functional program pedagogy

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 3 3 2 3 - - - 2 3 -

CO2 3 3 3 2 - - - - 2 2 -

CO3 - 3 3 2 - - - - 1 - -

CO4 3 3 3 2 3 - - - 3 1 -

Average 2 3 3 2 1.5 - - - 2 1.5 -

Course Content:

62
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction:

Algorithms, flow charts, decision tables, pseudo code, characteristics of a good programming
language (C1: Knowledge, C2: Comprehension)

Planning the Computer Program: Concept of problem solving, Problem definition (C2:
Comprehension)

Program design (C6: Synthesis)

Discuss Debugging, Types of errors in programming, Documentation. (C2: Comprehension)

Explain Structured programming concepts (C2: Comprehension)

Analyze Programming methodologies viz. top-down and bottom-up programming (C4:


Analysis)

Evaluate Advantages and disadvantages of Structured programming (C5: Evaluation)


2 From algorithms to programs:

Explain source code, variables (with data types) variables and memory locations (C1:
Knowledge)

Distinguish Syntax and Logical Errors in compilation (C4: Analysis)

Explain object and executable code, Arithmetic expressions and precedence (C2:
Comprehension)

Analyze Conditional Branching and Loops (C4: Analysis)

Writing and evaluation of conditionals and consequent branching, Iteration and loops (C6:
Synthesis)

Construct Arrays: Arrays (1-D, 2-D), Character arrays and Strings (C6: Synthesis)

63
3 Basic Algorithms:
Design Searching algorithms, Basic Sorting Algorithms (Bubble, Insertion and Selection)
(C5: Evaluation)

Finding roots of equations, notion of order of complexity through example programs (no
formal definition required) (C5: Evaluation)

Describe Functions (including using built in libraries), Parameter passing in functions, call
by value, passing arrays to functions: idea of call by reference (C2: Comprehension)

Implement Recursion, as a different way of solving problems. Example programs, such as


Finding Factorial, Fibonacci series, Quick sort, Merge sort. (C3: Application)
4 Structure: Structures, Defining structures and Array of Structures (C1: Knowledge)

Pointers: Understanding Pointers, Accessing the Address of a Variable, Declaration and


Initialization of Pointer Variables, Accessing a Variable through its Pointer (C2:
Comprehension, C3: Application)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

64
Assessment Methods:
Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Multiple Choice Questions (MCQ)
Problem Based Learning (PBL) Short Answer Questions (SAQ)
Long Answer Question (LAQ)

Mapping of Assessment with COs


Nature of Assessment CO1 CO2 CO3 CO4
Quiz √ √
VIVA
Assignment / Presentation √ √ √ √
Unit test √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: 1.Byron Gottfried, Schaum’s Outline of Programming with C, Tata


McGraw-Hill
2. E. Bala Guruswamy, Programming in ANSI C, Tata McGraw-Hill

65
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Introduction to Programming Methodology using C Lab
Academic Year I
Semester II
Number of Credits 2
Course Prerequisite Fundamentals of Computers and IT
Course Synopsis In this course, Students will study about basic concepts of C
Programming.
Course Outcomes:
At the end of the course students will be able to:
CO1 Demonstrate problem solving skills by developing and implementing
algorithms to solve problems.
CO2 Implement programs using functional program pedagogy.
CO3 Demonstrate an understanding of array, structures and pointers.
CO4 Implement programs using functional program pedagogy.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO PO7 PO8 PSO1 PSO PSO3
6 2
CO1 3 2 3 2 - - 1 - 2 - 2

CO2 3 2 - - 1 - 1 - - - -

CO3 3 2 - - - - 1 - - - -

CO4 3 2 2 3 2 - 1 - 1 - 1

Average 3 2 1.2 1.2 0.7 - 1 - 0.7 - 0.7

Course Content:

66
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content & Competencies
1 Understand I/O statements, operators, expressions (C1: Knowledge)
2 Develop Decision-making constructs: if-else, go to, switch-case, break-continue
(C6: Synthesis)
3 Design Loops: for, while, do-while (C6: Synthesis)
4 Implement Arrays: 1D and 2D, multi-dimensional arrays (C3: Application)
5 Implement Strings: operations (C3: Application)
6 Implement Functions: call, return, passing parameters by (value, reference), passing
arrays to function (C3: Application)
7 Apply Recursion Concept using Factorial (C3: Application)
8 Show the concept of Pointers: Pointers to functions, Arrays, Strings, Pointers to
Pointers, Array of Pointers (C2: Comprehension)

9 Demonstrate Structures: Nested Structures, Pointers to Structures, Arrays of


Structures and Unions (C3: Application)
10 Implement Files: reading and writing, File pointers, file operations, random access,
processor directives (C3: Application)
11 Write a C program to find roots of a Quadratic equation (C1: Knowledge)
12 Write a C program to generate the Fibonacci sequence of first N numbers (C1:
Knowledge)
13 Write a C program to check whether the given string is palindrome or not without
using Library functions (C1: Knowledge)
14 Write a C program to generate Prime numbers in a given range using a user defined
function (C1: Knowledge)
15 Write a C program to maintain a record of n student details using an array of
structures with four fields - Roll number, Name, Marks and Grade. Calculate the
Grade according to the given conditions.
(C1: Knowledge)

67
16 Design a C program to input two matrices and perform matrix multiplication on them
(C6: Synthesis)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Quiz
Problem Based Learning (PBL)

68
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: 1. Byron Gottfried, Schaum’s Outline of Programming with C,


McGraw-Hill

2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill

69
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Empirical Software Engineering
Academic Year I
Semester II
Number of Credits 3
Course Prerequisite NIL
Course Synopsis In this course, students will learn about the process and
stages of Software Engineering, software process/product
metrics, risk management, quality management and UML
diagrams.
Course Outcomes:
At the end of the course students will be able to:
CO1 Outline the phases and activities involved in the conventional software life
cycle models
CO2 Design documents for various phases of software life cycle.
CO3 The aim of the course is to provide an understanding of the working knowledge
of the techniques for estimation, design, testing and quality management of large
software development projects
CO4 Topics include process models, software requirements, software design,
software testing, software process/product metrics, risk management, quality
management and UML diagrams
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO PO7 PO8 PSO PSO2 PSO3
6 1
CO1 3 3 2 1 - - 3 - 2 2 -

CO2 2 3 3 2 - - 3 - 1 - -

70
CO3 2 - - 2 - - 3 - - - -

CO4 2 2 3 3 - - 3 - 2 1 -

Average 2.2 2 2 2 - - 3 - 1.2 0.7 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 3
Unit Content & Competencies
1 Software:

Describe Characteristics, Components, Applications, And Software Process (C2:


Comprehension)

Implement Models: Waterfall, Spiral, Prototyping (C3: Application)

Explain concepts of Project Management (C2: Comprehension)

Analyze Role of Metrics & Measurements (C4: Analysis)


2 Project Planning:

Explain objectives of Project Planning (C2: Comprehension)

Discuss about Decomposition techniques: S/W Sizing, Problem-based estimation,


Process based estimation (C2: Comprehension)

Implement Cost Estimation Models: COCOMO Model, The S/W Equation (C3:
Application)

System Analysis: Principles of Structured Analysis, Requirement analysis (C4:


Analysis)

Construct DFD, Entity Relationship diagram, Data dictionary (C6: Synthesis)


3 Design:

Describe Objectives, Principles, Concepts of Software design (C2:


Comprehension)

Implement Design methodologies: Data design, Architectural design, procedural


design (C3: Application)

Discuss Object-oriented concepts (C2: Comprehension)

71
4 Testing fundamentals:

Define Objectives, principles, Testability (C2: Comprehension)

Compare Test cases: White box & Black box testing (C4: Analysis)

Evaluate Testing strategies: verification & validation, unit test, integration testing,
validation testing, system testing (C5: Evaluation)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 38
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 5
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:
Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

72
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA
Assignment / Presentation √ √ √ √
Unit test √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: 1. Software Engineering - A Practitioner’s Approach, Roger S.


Pressman, MGH Publications, New Delhi.
2. Fundamentals of Software Engineering, Rajib Mall, PHI, New
Delhi.

73
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Empirical Software Engineering Lab
Academic Year I
Semester II
Number of Credits 1
Course Prerequisite NIL
Course Synopsis In this course, students will learn about the process and
stages of Software Engineering
Course Outcomes:
At the end of the course students will be able to:
CO1 Design System and Software requirements of project for client specifications
CO2 Create Data Flow Diagram to describe flow of information of the software
project
CO3 Develop UML diagrams in an interactive manner through the Web.
CO4 Generate high-level design document of the system from the software
requirements
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO PSO2 PS
1 O3
CO1 3 2 2 3 1 - 1 - 1 2 1

CO2 2 2 - 3 - - - - 2 - 1

CO3 2 2 3 3 - - - - - - 1

CO4 1 2 2 3 3 - 3 - - 1 1

Average 2 2 1.7 3 1 - 1 - 0.7 0.7 1

Course Content:

74
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Draft a project plan for any Project (C2: Comprehension)
2 Development of SRS document (C6: Synthesis)
3 Draw different levels of DFD (C1: Knowledge)
4 Draw an ER diagram (C1: Knowledge)
5 Draw a use case diagram (C1: Knowledge)
6 Draw a sequence diagram and collaboration diagrams (C1: Knowledge)
7 Draw a class diagram (C1: Knowledge)
8 Develop a Gantt chart and network diagram (C6: Synthesis)
9 Draw a structured chart (C1: Knowledge)
10 Development of design Document (C6: Synthesis)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 25
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 5
Revision -
Others If any: -
Total Number of Contact Hours 30

75
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Clinical assessment
Clinical/Practical Logbook/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: 1. Software Engineering - A Practitioner‟s Approach, Roger S.


Pressman, MGH Publications, New Delhi.
2. Fundamentals of Software Engineering, Rajib Mall, PHI, New
Delhi.

76
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Fundamentals of Cloud Computing
Academic Year I
Semester II
Number of Credits 2
Course Prerequisite Networks and Systems
Course Synopsis In this course, students will learn about Cloud computing
fundamentals, core issues of Design and Development of
application on Cloud computing
Course Outcomes:
At the end of the course students will be able to:
CO1 Explain the core issues of Design and Development of application
on Cloud computing such as security, privacy, and
interoperability
CO2 Choose the appropriate technologies, algorithms, and approaches for the
related issues
CO3 Provide basics of cloud files systems
CO4 Understand basic issues concerning cloud security
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO PO6 PO7 PO8 PS PS PSO3
5 O1 O2
CO1 2 2 3 2 - - - - 2 - 1

CO2 1 2 3 3 - - - - - 1 1

CO3 3 2 3 - - - - - 3 - 1

CO4 2 2 3 - - - - - - 1 1

77
Average 2 2 3 1.2 - - - - 1.2 0.5 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

Unit Content & Competencies

1 Cloud computing fundamentals

Explain the role of networks in Cloud computing (C2: Comprehension)

Describe Essential characteristics of Cloud computing (C2: Comprehension)

Analyze Cloud deployment model, Cloud service models, Multi-tenancy, Cloud


cube model (C4: Analysis)

Explain Cloud economics and benefits (C1: Knowledge)

Describe Cloud types and service scalability over the cloud (C2: Comprehension)

Discuss challenges in cloud NIST guidelines (C2: Comprehension)

Explain Cloud economics and benefits (C1: Knowledge)

Analyze Cloud computing platforms - IaaS: Amazon EC2, PaaS: Google App
Engine, Microsoft Azure, SaaS. Open-Source platforms: OpenStack (C4:
Analysis)

78
2 Virtualization:

Explain Basic Concepts of Virtualization (C1: Knowledge)

Describe types of Virtualizations: Server virtualization, Storage virtualization


(C2: Comprehension)

Discuss about Storage services (C1: Knowledge)

Compare Network virtualization, Service virtualization, Virtualization


management, Virtualization technologies and architectures (C4: Analysis)

Discuss about Internals of virtual machine (C2: Comprehension)

Explain Measurement and profiling of virtualized applications (C2:


Comprehension)

Analyze Hypervisors: KVM, Xen, Hyper V, VMware hypervisors and their


features (C4: Analysis)
3 Relational databases

Analyze Cloud file systems: GFS and HDFS (C4: Analysis)

Analyze Bigtable, HBase and Dynamo (C4: Analysis)

Discuss about MapReduce and extensions: Parallel computing, the map-Reduce


model (C2: Comprehension)

Determine Parallel efficiency of MapReduce (C5: Evaluation)

Determine Relational operations using Map-Reduce (C5: Evaluation)

Apply Enterprise batch processing using MapReduce (C3: Application)

79
4 Cloud security fundamentals

Discuss Vulnerability assessment tool for cloud (C2: Comprehension)

Discuss Privacy and Security in cloud (C2: Comprehension)

Cloud computing security architecture: General Issues, Trusted Cloud computing,


Secure Execution Environments and Communications (C3: Application)

Micro - architectures; Identity Management and Access control, Autonomic


security, Security challenges: Virtualization security management - virtual
threats, VM Security Recommendations (C5: Evaluation)

Evaluate VM - Specific Security techniques, Secure Execution Environments and


Communications in cloud (C5: Evaluation)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

80
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References List of reference books


1.Enterprise Cloud Computing, Gautam Shroff, Cambridge
Publication
2.Cloud computing – Automated virtualized data center, Venkata
Josyula, CISCO Press
3.Cloud and virtual data storage networking, Greg Schulr CRC Press
Handbook of Cloud Computing, Borko Furht, Springer

81
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Fundamentals of Cloud Computing Lab

Academic Year I
Semester II
Number of Credits 2
Course Prerequisite Networks and Systems
Course Synopsis In this course, students will learn about Cloud computing
fundamentals, Installing and set up private cloud, Design and
Implement applications on cloud.
Course Outcomes:
At the end of the course students will be able to:
CO1 Install and set up private cloud
CO2 Setup Hadoop environment
CO3 Design and Implement applications on cloud
CO4 Understand various services offered by Amazon Web Services.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO PO PO PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3
2 3 4
CO1 3 2 1 2 - - - 1 - 3 -

CO2 3 2 - 2 - - - - 2 - -

CO3 3 2 - 2 - - - - - 2 -

CO4 3 2 3 2 - - - 3 2 - -

Average 3 2 1 2 - - - 1 1 1.2 -

Course Content:

82
L (Hours/Week) T P (Hours/Week) Total Hour/Week
(Hours/Week)
4 4
Unit Content & Competencies
1 Study the installation procedure of open stack or open nebula to set up a private cloud (C1:
Knowledge)
2 Infer procedure to run the virtual machine of different configurations. Check how many
virtual machines can be utilized at particular time (C4: Analysis)
3 Install a C compiler in the virtual machine and execute a sample program (C6: Synthesis)
4 Write a wordcount program to demonstrate the use of Map and Reduce tasks (C1:
Knowledge)
5 Development of applications on Google app engine (C6: Synthesis)
6 Setting up of private Cloud setup through OpenStack (C6: Synthesis)
7 Setting up of private Cloud setup through OpenStack (C6: Synthesis)
8 Installation of XEN/VMware/ KVM hypervisor and Manage resource of different OS
instances (C6: Synthesis)
9 Case study of Amazon ec2.
10 Use GAE launcher to launch the web applications (C3: Application)
11 Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not present
in CloudSim (C6: Synthesis)
12 Infer procedure to transfer the files from one virtual machine to another virtual machine (C4:
Analysis)
13 Infer procedure to launch virtual machine using trystack (Online Openstack Demo Version)
(C4: Analysis)

83
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

84
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Enterprise Cloud Computing, Gautam Shroff, Cambridge
Publication
2.Cloud computing – Automated virtualize data center, Venkata
Josyula, CISCO Press
3. Cloud and virtual data storage networking, Greg Schulr CRC Press
4. Cloud Computing: A Practical Approach by: Toby Velte, Anthony
Velte, Robert Elsenpeter

85
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data mining and Predictive Modelling

Academic Year I
Semester II
Number of Credits 2
Course Prerequisite Foundations of Data Science
Course Synopsis In this course, students will learn about fundamental
concepts of data mining and modern predictive modeling.
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand and apply the fundamental concepts of data mining and modern
predictive modeling
CO2 Know how to preprocess and clean up data extracted from large databases – known
as data wrangling by predictive modelers
CO3 Explore large datasets to find hidden but important relations among
variables this is sometimes called unsupervised learning.
CO4 Know how to preprocess and clean up data extracted from large databases –
known as data wrangling by predictive modelers.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO PS
2 O3
CO1 2 1 1 - - - 3 - 2 3 1

CO2 2 2 - - - - 3 - - - -

CO3 2 - 3 - - - 3 - - - -

CO4 2 2 3 3 - - 3 - 2 1 1

86
Average 2 1.2 1.7 1.2 - - 3 - 1 1 0.5

Course Content:
L (Hours/Week) T P (Hours/Week) Total
(Hours/Week) Hour/Week
2 2

Unit Content & Competencies

1 Introduction to JMP Pro. (C1: Knowledge)

Introduction to Data Mining and Predictive Analytics; concepts, terminology,


methods, etc. (C2: Comprehension)

Exploring, Preprocessing (Query Builder) data, and Visualizing Data (C4: Analysis)

Discuss Unsupervised Learning including PCA, Clustering, Variables Clustering,

MDS, and Market Basket Analysis (C3: Application)

Build Statistical Model Part 1; Review MLR, Bias Variance Tradeoff, explain vs
Predict, Validation Strategies, Effect Sparsity (C6: Synthesis)

2 Building of Statistical Model Part 2, 3 Stepwise Selection (C6: Synthesis)

All Possible Models, Model Averaging, Prediction Averaging, Variable


Importance

Statistical Model Building Parts 4, 5 and PLS. Penalized Regression including

LASSO, Elastic Net, Dantzig Selector, LAR Predictor Screening Strategies,

Informative Missing Values, Basic Classification Methods, KNN, Naive Bayes.

Risk Assessment.

87
3 Logistic Regression, Poisson Regression and Dealing with Nominal Predictors

(C2: Comprehension)

Distinguish Decision Trees, Random Forests, Boosted Trees (C4: Analysis)

Construct Neural Net Models, Boosted Neural Nets and Uplift models (C6:
Synthesis)

4 Discriminant Analysis, linear, quadratic, and regularized and Text Mining (C4:
Analysis)

Implement Support Vector Machine model (C3: Application)

Introduction to Forecasting (C1: Knowledge)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

88
Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Introduction to Data Mining by Tan, Steinbach & Kumar
2. Modeling With Data by Ben Klemens
3. Data Mining: Practical Machine Learning Tools and
Techniques by Ian H. Witten & Eibe Frank

89
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data mining and Predictive Modelling Lab
Academic Year I
Semester II
Number of Credits 2
Course Prerequisite Foundations of Data Science
Course Synopsis In this course, students will learn about different features of WEKA
tool, Preprocessing of data, Association rules etc.
Course Outcomes:
At the end of the course students will be able to:
CO1 Use different features of WEKA tool
CO2 Preprocess the data for mining
CO3 Determine association rules
CO4 Model various classifiers.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 1 2 2 - 1 1 - 2 - -

CO2 3 2 2 - - - - - - 1 1

CO3 3 - 2 - - - - - - 2 2

CO4 3 2 2 3 - 3 3 - 2 - -

Average 3 1.2 2 1.2 - 1 1 - 1 0.7 0.7

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4

90
Unit Content & Competencies
1 Basics of WEKA tool a. Investigate the Application interfaces. b. Explore the default datasets.
(C1: Knowledge)
2 Pre-process a given dataset based on the following: a. Attribute Selection b. Handling Missing
Values (C1: Knowledge)
3 Pre-process a given dataset based on the following: a. Discretization b. Eliminating Outliers
(C1: Knowledge)

4 Create a dataset in ARFF (Attribute-Relation File Format) for any given dataset and perform
Market-Basket Analysis. (C6: Synthesis)
5 Generate Association Rules using the Apriori algorithm (C6: Synthesis)
6 Generate Association Rules using the FP-Growth algorithm (C6: Synthesis)
7 Build a Decision Tree using ID3 algorithm (C6: Synthesis)
8 Demonstrate classification process on a given dataset using Naïve Bayesian Classifier (C3:
Application)
9 Demonstrate classification process on a given dataset using Rule based Classifier (C3:
Application)
10 Demonstrate classification process on a given dataset using Nearest neighbor Classifier (C3:
Application)
11 Build a distance matrix of the given data using various distance measures (C6: Synthesis)
12 Cluster the given dataset by using the k-Means algorithm and visualize the cluster mean
values and standard deviation of dataset attributes (C5: Evaluation)
13 Cluster the given dataset using a hierarchical clustering algorithm (C5: Evaluation)
14 Detect anomalies using any clustering algorithm (C4: Analysis)
15 Implement density-based outlier detection (C3: Application)

91
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

92
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √

Mid Semester Examination 1


Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Machine Learning mastery with WEKA by Jason Brownlee
2. Modeling with Data by Ben Klemens
3.Data Mining: Practical Machine Learning Tools and Techniques
by Ian H. Witten & Eibe Frank

93
SEMESTER - III

Course Code Course Title

Object oriented Development using C++

Object oriented Development using C++ Lab

Personality Development & Career Building

Summer Internship-I

PE-I

Algorithms Design and Complexity Theory

PE-I Lab

Algorithms Design and Complexity Theory


Lab
Minor Electives Courses-III

Cloud Computing Securitization (CC)

Natural Language processing (AIML)

MGEC-III

AECC-III

VAC-III

SEC-I

Web Development using HTML and CSS

94
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Object oriented Development using C++

Academic Year II
Semester III
Number of Credits 2
Course Prerequisite Introduction to Programming Methodology
Course Synopsis In this course, Students will learn about Object oriented
Programming concepts
Course Outcomes:
At the end of the course students will be able to:
CO1 Basic understanding of programming.
CO2 Implement Object Oriented Programming concepts.
CO3 Explain arrays and strings and create programs using them.

CO4 Use functions and pointers in your C++ program.

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program


Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO PO PS PSO PSO3
7 8 O1 2
CO1 3 3 2 1 - 1 - - 1 2 1

CO2 2 3 2 1 - 2 - - 2 - 2

CO3 - 3 2 1 - - - - 1 - -

CO4 1 3 2 1 - - - - - 1 1

Average 1.5 3 2 1 - 0.7 - - 1 0.7 1

Course Content:

95
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction:

Discuss Object oriented programming approach (C2: Comprehension)

Describe characteristics of object-oriented languages (C1: Knowledge)

Explain Bridging C & C++ (Overview of C Concepts) (C1: Knowledge)

Analyze Structures and Unions: Declaration of structures (C4: Analysis)

Describe how to access structure members (C2: Comprehension)

Implement Structure Initialization, Arrays of structure, nested structures,


structure with pointers, functions & structures, Unions (C3: Application)

Describe Class Declaration: Data Members, Member Functions, Private and


Public Members, Data Hiding and Encapsulation, Array within a class (C2:
Comprehension)

96
2 Class Function Definition:

Definition of Member Function inside the class and outside the class (C1:
Knowledge)

Create Friend Function, Inline Function, Static Members & Functions, Scope
Resolution Operator, Private and Public Member Functions, Nesting of
Member Functions (C6: Synthesis)

Creating Objects, accessing class data members, accessing member functions,


Arrays of Objects, Objects as function arguments: Pass by value, Pass by
reference (C6: Synthesis)

Implement Constructors and Destructors: Declaration and Definition, Default


Constructors, Parameterized Constructors, Constructor Overloading, Copy
Constructors. Destructors: Definition and use. (C3: Application)
3 Inheritance:

Describe the concept of Extending Classes (C2: Comprehension)

Concept of inheritance, Base class, Derived class, defining derived classes


(C2: Comprehension)

Compare Visibility modes: Private, public, protected; Single inheritance:


Privately derived, publicly derived (C4: Analysis)

Implement Multilevel inheritance, Nesting of classes (C3: Application)


4 Polymorphism:

Define Polymorphism and early Binding (C1: Knowledge)

Explain Polymorphism with pointers (C2: Comprehension)

Construct Virtual Functions (C6: Synthesis)

Describe late binding, pure virtual functions (C2: Comprehension)

Classify Input/output files: Streams, buffers & Iostreams, header files,


redirection, file input and output (C2: Comprehension)

97
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

98
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books

1.Object Oriented Programming with C++, E. Balagurusami,


Fourth Edition, Tata Mc-Graw Hill
2.Object Oriented Programming in Turbo C++, Robert Lafore,
Fourth Edition Galgotia Publications.
3.The C++ Programming Language, Bjarna Stroustrup, Third
Edition, Addison-Wesley Publishing Company.
4. Object Oriented Programming Using C++, Salaria, R. S, Fourth
Edition, Khanna Book Publishing

99
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Object oriented Development using C++ Lab
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite Introduction to Programming methodology using C
Course Synopsis In this course, Students will learn about Object oriented
Programming concepts.
Course Outcomes:
At the end of the course students will be able to:
CO1 Develop applications for a range of problems using object-oriented programming
techniques
CO2 Implement Object Oriented Programming concepts.
CO3 know concepts in operator overloading, function overloading
CO4 write, compile and debug programs in C++ language.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 3 2 2 - 3 - 1 1 2 -

CO2 3 3 3 2 - 2 - 1 2 - -

CO3 3 3 - 2 - - - 1 3 2 -

CO4 3 3 2 2 - 1 - 1 - 1 -

Average 3 3 1.7 2 - 1.5 - 1 1.5 1.2 -

Course Content:

100
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4
Unit Content & Competencies
1 Write a C++ Program to display Names, Roll No., and grades of 3 students who have
appeared in the examination. Declare the class of name, Roll No. and grade. Create an
array of class objects. Read and display the contents of the array (C1: Knowledge)
Write a C++ program to declare Struct. Initialize and display contents of member
2 variables (C1: Knowledge)
3 Write a C++ program to declare a class. Declare a pointer to class. Initialize and display
the contents of the class member (C1: Knowledge)

4 Write a program that illustrates the following forms of inheritances Single Multiple
Multilevel Hierarchical (C1: Knowledge)
5 Write a program that demonstrates function overloading, operator overloading,
overriding (C1: Knowledge)
6 Write a program that demonstrates friend functions, inline functions (C1: Knowledge)
7 Write a program that demonstrates virtual, static functions (C1: Knowledge)
8 Design a program that handles Exceptions. Use a Try Block to Throw it and a Catch
Block to Handle it Properly (C6: Synthesis)
9 Design a Program to demonstrates user defined exceptions (C6: Synthesis)
10 Design a program to create a generic template for adding two integers and two float
values and make use of the template to perform addition (C6: Synthesis)
11 Design a C++ program to use scope resolution operators. Display the various values of
the same (C6: Synthesis)
12 Develop a C++ program to allocate memory using new operator (C6: Synthesis)
13 Develop a CPP Program to write and read text in a file. Use ofstream and ifstream
classes (C6: Synthesis)
14 Develop a CPP Program to find the factorial of a number (C6: Synthesis)

101
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods

Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz

102
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Object Oriented Programming with C++, E. Balagurusami,
Fourth Edition, Tata Mc-Graw Hill.
2. Object Oriented Programming in Turbo C++, Robert Lafore,
Fourth Edition Galgotia Publications.
3. The C++ Programming Language, Bjarna Stroustrup, Third
Edition, Addison-Wesley Publishing Company.
4. Object Oriented Programming Using C++, Salaria, R. S, Fourth
Edition, Khanna Book Publishing.

103
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Personality Development & Career Building
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite NIL
Course Synopsis This course will enable students to demonstrate knowledge
of personal beliefs and values and a commitment to
continuing personal reflection and reassessment.
Course Outcomes:
At the end of the course students will be able to:
CO1 The student will be able to understand, analyze develop and exhibit
accurate sense of self.
CO2 Think critically.
CO3 Demonstrate knowledge of personal beliefs and values and a commitment to
continuing personal reflection and reassessment.
CO4 Learn to balance confidence with humility and overcome problems associated
with personality.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 - 2 1 3 2 - 3 1 - -

CO2 2 - 1 - 3 2 - 3 2 - -

CO3 2 - 2 - 3 2 - 3 - 2 -

CO4 2 - 3 3 3 2 - 3 2 1 -

Average 2 - 2 1 3 2 - 3 1.2 0.7 -

104
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction to Personality Development

The concept of personality - Dimensions of personality (C1: Knowledge)

Theories of Freud & Erickson-Significance of personality development.

(C1: Knowledge)

The concept of success and failure: What is success? - Hurdles in achieving

Success, Overcoming hurdles - Factors responsible for success (C2:


Comprehension)

What is failure - Causes of failure. SWOT analysis (C1: Knowledge)

2 Attitude & Motivation Attitude

Concept - Significance - Factors affecting attitudes - Positive attitude –


Advantages –Negative attitude- Disadvantages - Ways to develop positive
attitude (C1: Knowledge)

Differences between personalities having positive and negative attitude.


Concept of motivation (C4: Analysis)

Evaluate Significance – Internal and external motives - Importance of self-


motivation- Factors leading to de-motivation (C5: Evaluation)

105
3 Self-esteem
Term self-esteem - Symptoms - Advantages - Do's and Don’ts to develop
positive self-esteem (C1: Knowledge)

Low self- esteem - Symptoms - Personality having low self-esteem - Positive


and negative self-esteem. (C1: Knowledge)

Analyzing Interpersonal Relationships – Defining the difference between


aggressive, submissive and assertive behaviors - Lateral thinking (C4: Analysis)
4 Other Aspects of Personality Development

Define Body language - Problem-solving - Conflict and Stress Management (C1:


Knowledge)
Describe Decision-making skills - Leadership and qualities of a successful
leader (C2: Comprehension)
Explain Character building -Team-work – Time management Work ethics –
Good manners and etiquette (C2: Comprehension)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

106
Assessment Methods
Formative Summative
Multiple Choice Questions (MCQ) Mid Semester Examination 1
Viva-voce Mid Semester Examination 2
Quiz University Examination
Seminars Short Answer Questions (SAQ)
Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs


Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6
Quiz
Assignment / Presentation
Unit test
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination

Feedback Process Student’s Feedback

References: 1. Hurlock, E.B (2006). Personality Development, 28th Reprint. New


Delhi: Tata McGraw Hill.
2. Stephen P. Robbins and Timothy A. Judge (2014), Organizational
Behavior 16th Edition: Prentice Hall.
3. Andrews, Sudhir. How to Succeed at Interviews. 21st (rep.) New Delhi.
Tata McGraw-Hill 1988.
4. Heller, Robert. Effective leadership. Essential Manager series. Dk
Publishing, 2002

107
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Summer Internship-I
Academic Year II
Semester III
Number of Credits 1
Course Prerequisite NIL
Course Synopsis This course enables students to face the real time problems
which are usually faced by working professional while working
in the industry. While on this training program, students come
to know about technical as well individual skills required by a
professional for survival in the market. In fact, this course is
about industrial implementation of the technologies. This
course enables students to learn technologies on industrial
level. The student will be working closely with the technical
team. This course enhances student’s ability to think out of the
box and suggest new ways of implementing ideas in a better
manner and should be able to brainstorm and come up with
innovative ideas.
Course Outcomes:
At the end of the course students will be able to:
CO1 Have an exposure to industrial practices and to work in teams.
CO2 Understand the impact of engineering solutions in a global, economic,
environmental and societal context.
CO3 Develop the ability to engage in research and to involve in life-long learning
CO4 Communicate effectively and learn to be a team player.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:

108
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 2 2 1 3 - - 3 - - 1

CO2 2 3 2 - 3 - - 3 - - 2

CO3 2 - 2 - 3 - - 3 - 2 -

CO4 2 2 2 3 3 - - 3 - 1 2

Average 2 1.7 2 1 3 - - 3 - 0.7 1.2

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) CL (Hours/Week) Total
Hour/Week

Content & Competencies

The students will be evaluated based on 4 weeks of work at industry site


after second semester. Supervised by an expert at the industry.

Modes of Evaluation: Internship Report, Presentation and Project Review

Assessment Methods:
Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

109
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

110
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Algorithms Design and Complexity Theory

Academic Year II
Semester III
Number of Credits 2
Course Prerequisite Programming Fundamentals
Course Synopsis In this course, students will learn about a variety of data structures
such as hash tables, search trees, tries, heaps, graphs, and analyze
the algorithms to determine the time and computation complexity.
Course Outcomes:
At the end of the course students will be able to:
CO1 Analyze the algorithms to determine the time and computation complexity
and justify the correctness
CO2 Write algorithms concerning various data structures like Stack, Queue, Linked list,
Graph search and traversal techniques
CO3 Introduces a variety of data structures such as hash tables, search trees,heaps, graphs
CO4 Introduces sorting and pattern matching algorithms.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 2 1 2 - - - 1 - 1

CO2 3 - 2 - 2 - - - - 3 1

CO3 3 - 2 3 2 - - - - - 1

CO4 3 3 2 - 2 - - - 2 1 1

Average 3 1.2 2 1 2 - - - 0.7 1 1

111
Course Content:
L (Hours/Week) T P (Hours/Week) Total Hour/Week
(Hours/Week)
2 2
Unit Content & Competencies
1 Introduction:

Definition of data structures and abstract data types, Static and Dynamic
implementations, Examples and real-life applications (C1: Knowledge)

Construct Arrays: ordered lists, representation of arrays, sparse matrices, polynomial


arithmetic (C6: Synthesis)

Running time:
Analysis of Algorithms and their complexities: Time Complexities, Big – Oh -
notation, Running Times, Best Case, Worst Case, Average Case, Factors depends on
running time (C4: Analysis)
Implement Recursion (C3: Application)
Implement Divide and Conquer Algorithm, Time & Space Trade-off (C3:
Application)

Queues and Lists:


Construct Linked Lists: Singly linked lists (C6: Synthesis)
Analyze the Representation of linked lists in memory (C4: Analysis)
Apply Traversing, Searching, Insertion into, Deletion from linked list
(C3: Application)

112
2 The Stacks:

Evaluate ADT Stack and its operation (C5: Evaluation)

Apply Array based implementation of stacks (C3: Application)

Apply Linked List based implementation of stacks (C3: Application)

Examples: Infix, postfix, prefix representation, Conversions, Applications, Algorithms


and their complexities
3 Trees:

Basic Terminology (C1: Knowledge)

Construct Binary Trees and their representation, expression evaluation, Complete


Binary trees, Extended binary trees, traversing binary trees (C6: Synthesis)

Graphs:

Describe Terminology and Representations (C2: Comprehension)

Design Graphs & Multigraphs, Directed Graphs, Sequential representation of graphs


(C6: Synthesis)
4 Sorting Algorithms:

Introduction to sorting algorithms (C1: Knowledge)

Implement Sorting by exchange, selection sort, insertion sort, Bubble sort, Straight
selection sort, Efficiency of above algorithms (C3: Application)

Apply Merge sort, Quick sort Algorithm analysis, heap sort: Heap Construction, Heap
sort, bottom – up, Top – down (C3: Application)

Analyze Heap sort approach (C4: Analysis)

Design Searching Algorithms: Straight Sequential Search, Binary Search (C6:


Synthesis)

113
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

114
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA
Assignment / Presentation √ √ √ √
Unit test √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: 1.E. Horowitz and S. Sahani, “Fundamentals of Data Structures”,


Galgotia Book source Pvt. Ltd.
2. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structures and program
design in C”, PHI
3. Schaum’s outline series, “Data Structure”, McGraw Hills.

115
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Algorithms Design and Complexity Theory Lab
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite Programming Fundamentals
Course Synopsis In this course, students will learn to design and implement data
structure algorithms using C.
Course Outcomes:
At the end of the course students will be able to:
CO1 Analyze the algorithms to determine the time and computation complexity
and justify the correctness.
CO2 Implement a given Search problem (Linear Search and Binary Search).
CO3 Write algorithms concerning various data structures like Stack, Queue, Linked list,
Graph search and traversal techniques and analyze the same to determine the time and
computation complexity
CO4 Write an algorithm for Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge
Sort, Heap sort and compare their performance in terms of Space and time complexity.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 2 3 1 2 - 1 - 1 2 -

CO2 2 - 3 - 2 - - - - - -

CO3 2 - 3 - 2 - - - 3 - -

CO4 2 2 3 3 2 - 3 - 2 1 -

Average 2 1 3 1 2 - 1 - 1.5 0.75 -

116
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4
Unit Content & Competencies
1 Write a program for multiplication and transpose of array (C1: Knowledge)
2 Write a program to compute the transpose of a sparse matrix (C1: Knowledge)
3 Implement a program to implement push and pop operation in Stack (C3: Application)
4 Write a program to convert an Infix notation to postfix notation using stacks (C1:
Knowledge)
5 Develop a program to evaluate postfix notation using stacks (C6: Synthesis)
6 Write a program to implement a linear queue (C1: Knowledge)
7 Demonstrate a program for swapping two numbers using call by value and call by
reference strategies (C3: Application)
8 Develop a program to insert and delete a node in the linked list. The number of nodes
to inserted and deleted should be governed by user (C6: Synthesis)
9 Write a program to implement a linear search arrays and linked list (C1: Knowledge)
10 Using iteration and recursion concepts write programs for finding the element in the
array using the Binary search method (C6: Synthesis)
11 Write the programs to implement bubble sort (C1: Knowledge)
12 Write a program using iteration and recursion concepts for quicksort (C1: Knowledge)
13
Write a program to implement the tree traversal methods (C1: Knowledge)
14
Write a program that implements the following i) Insertion sort ii) Merge sort iii) Heap
sort (C1: Knowledge)
15
Write a program to perform the following operations: a) Insert an element into a AVL
tree. b) Delete an element from a AVL tree. c) Search for a key element in a AVL tree.
(C1: Knowledge)

117
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

118
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: 1. E. Horowitz and S. Sahani, “Fundamentals of Data Structures”,


Galgotia Book source Pvt. Ltd.
2. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structures and
program design in C”, PHI
3. Schaum’s outline series, “Data Structure”, McGraw Hills.

119
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Cloud Computing Securitization

Academic Year II
Semester III
Number of Credits 3
Course Prerequisite Fundamentals of Cloud Computing
Course Synopsis In this course, Students will learn about cloud security
challenges, Web services, Encrypting Data and Key
Management
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand cloud security challenges
CO2 Know Threats and Vulnerabilities to Infrastructure
CO3 Understand Web services, Web 2.0, Web OS, Security challenges and
preventive measures

CO4 Learn Encrypting Data and Key Management

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program


Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO PO7 PO8 PSO1 PSO2 PSO3
6
CO1 2 2 1 3 3 - - 1 1 2 1

CO2 2 3 1 3 2 - - 1 - 3 -

CO3 2 - - 3 2 - - - 3 - -

CO4 2 2 3 3 1 - - 3 2 1 1

Average 2 1.7 1.2 3 2 - - 1.2 1.5 1.5 0.5

120
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 Discuss Cloud Security Challenges (C2: Comprehension)

Describe Cloud Information Security Objectives (C2: Comprehension)

Explain Cloud Security Services, Secure Cloud Software Requirements (C2:


Comprehension)

Implementation of Cloud Security Policy (C3: Application)

Describe Infrastructure Security, Data Security and Storage, Privacy in Cloud (C2:
Comprehension)
2 Evaluate Threats and Vulnerabilities to Infrastructure (C5: Evaluation)

Analyze Data, and Access Control (C3: Application)

Risk Management and Risk Assessment in Cloud (C4: Analysis)

Interpret Cloud Service Provider Risks (C3: Application)

Discuss Virtualization Security Management in the Cloud (C2: Comprehension)

Explain Trusted Cloud Computing, Identity Management and Access Control (C2:

Comprehension)
3 Discuss about Cloud Security: Web services, Web 2.0, Web OS (C2:
Comprehension)

Describe Security challenges and preventive measures: Infrastructure layer, Network


layer and Application layer of cloud computing architecture (C2: Comprehension)

Implement Security models in cloud, Resource management in cloud computing (C3:


Application)

Evaluate Static and dynamic load balancing in cloud computing (C5: Evaluation)

Identity access management and Trust in cloud computing, thin client (C4: Analysis)

121
4 Implement standards for Security: SAML OAuth, OpenID, SSL/TLS (C3:
Application)

Apply Encrypting Data and Key Management (C3: Application)

Creating a Cloud Security Strategy (C6: Synthesis)

Discuss about the Future of Security in Cloud Computing (C2: Comprehension)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 38
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 4
Revision 3
Others If any: -
Total Number of Contact Hours 45

122
Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. B. Sosinsky, “Cloud Computing Bible”, 1st Edition, Wiley-India, 2011/
Latest Edition.
2. Thomas Erl, Zaigam Mahmood, Ricardo Puttini, “Cloud Computing
Concepts, Technology & Architecture”, 1st Edition, Pearson India, 2013/
Latest Edition.
3. M. Miller, “Cloud Computing: Web-Based Applications That Change the
Way You Work and Collaborate Online”, 1st Edition, Pearson Education
India, 2008/ Latest Edition

123
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Natural Language Processing
Academic Year II
Semester III
Number of Credits 3
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about fundamentals of
Natural Language Processing. the use of CFG and PCFG in
NLP.
Course Outcomes:
At the end of the course students will be able to:
CO1 learn the fundamentals of Natural Language Processing
CO2 understand the use of CFG and PCFG in NLP
CO3 understand the role of semantics of sentences and pragmatics

CO4 apply the NLP techniques to IR applications

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program


Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO PO7 PO8 PSO1 PSO2 PSO3
6
CO1 2 2 3 - - 1 - - 1 - -

CO2 2 3 3 2 - - - - 2 - -

CO3 2 - 3 3 - - - - 3 2 2

CO4 2 - 3 - - 3 - - - 1 1

Average 2 1.2 3 1.2 - 1 - - 1.5 0.7 0.7

Course Content:

124
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 INTRODUCTION

Discuss origins and challenges of NLP (C2: Comprehension)

Construct Language Modelling: Grammar-based LM, Statistical LM (C6:


Synthesis)

Build Regular Expressions, Finite-State Automata English Morphology (C6:


Synthesis)

Describe Transducers for lexicon and rules, Tokenization (C2: Comprehension)

Detecting and Correcting Spelling Errors, Minimum Edit Distance (C5: Evaluation)

2 WORD LEVEL ANALYSIS

Discuss Unsmoothed N-grams (C2: Comprehension)

Evaluating N-grams, Smoothing (C5: Evaluation)

Interpolation and Backoff – Word Classes,

Discuss Part-of-Speech Tagging (C2: Comprehension)

Describe Rule-based, Stochastic and Transformation-based tagging (C2:


Comprehension)

Explain Issues in PoS tagging – Hidden Markov and Maximum Entropy models (C2:
Comprehension)

125
3 SYNTACTIC ANALYSIS

Design Context-Free Grammars (C6: Synthesis)

Formulate Grammar rules for English, Treebanks (C6: Synthesis)

Explain Normal Forms for grammar Dependency Grammar – Syntactic Parsing (C2:
Comprehension)

Describe Ambiguity, Dynamic Programming (C2: Comprehension)

Analyze Parsing – Shallow parsing – Probabilistic CFG, Probabilistic CYK (C4:


Analysis)

Probabilistic Lexicalized CFGs - Feature structures (C5: Evaluation)

Implement Unification of feature structures (C3: Application)


4 SEMANTICS AND PRAGMATICS

Classify Requirements for representation, First-Order Logic (C2: Comprehension)

Description Logics – Syntax-Driven Semantic analysis (C2: Comprehension)

Semantic attachments – Word Senses, Relations between Senses, Thematic Roles,


selection restrictions – Word Sense Disambiguation (C4)

WSD using Supervised, Dictionary & Thesaurus,

Discuss Bootstrapping methods – Word Similarity using Thesaurus and


Distributional methods (C2: Comprehension)

126
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 39
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

127
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Daniel Jurafsky, James H. Martin―Speech and Language Processing:
An Introduction to Natural Language Processing, Computational
Linguistics and Speech, Pearson Publication, 2014.
2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language
Processing with Python‖, First Edition, O‗Reilly Media, 2009.
3. Breck Baldwin, ―Language Processing with Java and Ling Pipe
Cookbook, Atlantic Publisher, 2015.
4. Richard M Reese, ―Natural Language Processing with Java‖,
O‗Reilly Media, 2015.

128
Faculty of Engineering & Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Web Development using HTML and CSS
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite Basics of Programming
Course Synopsis In this course, Students will study about basic and advanced
concepts of HTML and CSS Programming.
Course Outcomes:
At the end of the course students will be able to:
CO1 Demonstrate problem solving skills by developing and implementing
algorithms to solve problems.
CO2 Implement programs using functional program pedagogy.
CO3 Demonstrate an understanding of array, structures and pointers.
CO4 Implement programs using functional program pedagogy.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO PSO3
2
CO1 3 3 3 2 - - - - 2 2 -

CO2 2 3 - - 1 - - - - - -

CO3 - 3 - - - - - - - - -

CO4 2 3 2 3 2 - - - 3 1 -

Average 1.7 3 1.2 1.2 0.7 - - - 1.2 0.7 -

Course Content:

129
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content & Competencies
1 Write an HTML code to display your education details in a tabular format.
(C1: Knowledge)
2 Write an HTML code to display your CV on a web page. (C1: Knowledge)
Write an HTML code to create a Home page having three links: About Us, Our
3 Services and Contact Us. Create separate web pages for the three links. (C1:
Knowledge)
Write an HTML code to create a login form. On submitting the form, the user
4 should get navigated to a profile page. (C1: Knowledge)
5 Write an HTML code to create a Registration Form. On submitting the form, the
user should be asked to login with this new credentials. (C1: Knowledge)
6 Write an HTML code to create your Institute website, Department Website and
Tutorial website for specific subject. (C1: Knowledge)
7 Write an HTML code to illustrate the usage of the following: Ordered List
Unordered List Definition List (C1: Knowledge)
8 Write an HTML code to create a frameset having header, navigation and content
sections. (C1: Knowledge)
9 Write an HTML code to demonstrate the usage of inline CSS. (C1: Knowledge)
10 Write an HTML code to demonstrate the usage of internal CSS. (C1: Knowledge)
11 Write an HTML code to demonstrate the usage of external CSS. (C1: Knowledge)
12 Creating Style Sheet (C6:Synthesis)
13 CSS Styling(Background, Text Format, Controlling Fonts) (C6:Synthesis)
14 CSS Id and Class (C6:Synthesis)
15 CSS Advanced(Grouping, Dimension, Display, Positioning, Floating, Align,
Pseudo class, Navigation Bar, Image Sprites, Attribute sector) (C6:Synthesis)
16 Creating page Layout and Site Designs. (C6:Synthesis)

130
17 Writing program in XML and create a style sheet in CSS & display the document in
internet explorer. (C1: Knowledge)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

131
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3


Quiz √
VIVA √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: 1. Learning Web Design: A beginner’s Guide To HTML, CSS,


JavaScript, and Web Graphics by Jennifer Robbins

2. Responsive Web Design with HTML5 and CSS3

132
SEMESTER - IV

Course Code Course Title

Database Management Systems

Database Management Systems Lab

Quantitative Aptitude & Logical Reasoning

Problem Solving using Python

Problem Solving using Python Lab

PE-II

Advances in Operating Systems

PE-II Lab

Advances in Operating Systems Lab

Minor Electives Courses-IV

Cloud Computing architecture and


Deployment models (CC)
R Programming for Data Analytics and
visualization (AIML)
Minor Electives Courses-IV Lab

Cloud Computing architecture and


Deployment models Lab (CC)
R Programming for Data Analytics and
visualization Lab (AIML)
AECC-IV

SEC-II

Embedded system development

133
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Database Management Systems
Academic Year II
Semester IV
Number of Credits 2
Course Prerequisite Basic data concepts
Course Synopsis In this course, students will learn about database concepts,
relationship between data, for a given query optimize its
execution using Query optimization algorithms.
Course Outcomes:
At the end of the course students will be able to:
CO1 write relational algebra expressions for a given query and optimize the developed
expressions
CO2 For a given specification of the requirement design the databases using E‐R
method and normalization.
CO3 For a given query optimize its execution using Query optimization algorithms
CO4 determine the transaction atomicity, consistency, isolation, and durability.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 - 2 - - - - 2 -

CO2 3 2 - 2 2 - - - 2 - -

CO3 3 2 3 - 2 - - - 3 - -

CO4 3 2 - 3 2 - - - - 1 -

Average 3 2 1 1.2 2 - - - 1.2 0.6 -

134
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Database system architecture & Data Models:

Describe Data Abstraction, Data Independence, Data Definition Language


(DDL), Data Manipulation Language (DML). (C2: Comprehension)

Analyze Data models: Entity-relationship model, network model, relational and

object oriented data models (C4: Analysis)

Implement integrity constraints, data manipulation operations (C3: Application)


2 Relational query languages:

Explain Relational algebra, Tuple and domain relational calculus, SQL3, DDL and
DML constructs (C2: Comprehension)

Describe Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL
server. (C2: Comprehension)

Relational database design:

Evaluate Domain and data dependency, Armstrong's axioms, Normal forms,


Dependency preservation, Lossless design. (C5: Evaluation)

Execute Query processing and optimization: Evaluation of relational algebra


expressions, Query equivalence, Join strategies, Query optimization algorithms. (C3:
Application)

135
3 Storage strategies:

Define Indices, B-trees, hashing, Transaction processing: Concurrency Control (C1)

Discuss ACID property, Serializability of scheduling, Locking and timestamp-based

schedulers, (C2: Comprehension)

Explain multi-version and optimistic Concurrency Control schemes, Database

recovery. (C2: Comprehension)


4 Database Security:

Authentication, Authorization and access control, DAC, MAC and RBAC models,
Intrusion detection (C5: Evaluation)

Describe SQL injection. Advanced topics: Object oriented and object relational
databases, Logical databases, Web databases (C2: Comprehension)

136
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

137
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. “Database System Concepts”, 6th Edition by Abraham Silberschatz,
Henry F.Korth, S. Sudarshan, McGraw-Hill
2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J.
D. Ullman, Computer Science Press.
3. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and
S. Navathe, Pearson Education

138
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Database Management Systems Lab
Academic Year II
Semester IV
Number of Credits 2
Course Prerequisite Introduction to Data science
Course Synopsis In this course, students will learn about database system
concepts and design databases for different applications,
Identify different types of DDL, DML, DCL and TCL
commands and their usage.
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand the database system concepts and design databases for different
applications.
CO2 Identify different types of DDL, DML, DCL and TCL commands and their usage.
CO3 For a given specification of the requirement design, the databases using E‐R
method and normalization.
CO4 For a given specification construct the SQL queries for Open source and
Commercial DBMS - MYSQL, ORACLE, and DB2.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO PO PO4 PO5 PO PO7 PO8 PSO1 PSO2 PSO3
1 2 3 6
CO1 3 2 3 - 2 - - - - 2 -

CO2 2 2 3 2 2 - - - 2 - -

CO3 - 2 3 - 2 - - - 3 - -

CO4 1 2 3 3 2 - - - - 1 -

Average 1.5 2 3 1.2 2 - - - 1.2 0.6 -

139
Course Content:
L (Hours/Week) T P (Hours/Week) Total Hour/Week
(Hours/Week)
4 4
Unit Content & Competencies
1 Implement different types of DDL, DML, DCL queries. (C3: Application)

2 Explore the “SELECT” clause using where, order by, between, like, group by,
having etc. (C4: Analysis)
3 For a given specification construct the SQL queries for Open source and
Commercial DBMS – MYSQL, ORACLE, and DB2.

4 Design a Database and create required tables. For e.g., Bank, College Database (C6:
Synthesis)
5 Apply the constraints like Primary Key, Foreign key, NOT NULL to the tables. (C3:
Application)
6 Write a SQL statement for implementing ALTER, UPDATE and DELETE. (C1:
Knowledge)
7 Write the queries to implement the joins. (C1: Knowledge)
8 Write the queries for implementing the following functions: MAX (), MIN (), AVG
(), COUNT () (C1: Knowledge)
9 Write the queries to implement the concept of Integrity constraints
(C1: Knowledge)
10 Write the queries to create the views. (C1: Knowledge)
11 Perform the following operation for demonstrating the insertion, updating and
deletion using the referential integrity constraints. (C3: Application)
12 Write a PL/SQL block that handles all types of exceptions (C1: Knowledge)
13 Creation of Procedures (C6: Synthesis)
14 Creation of database triggers and functions (C6: Synthesis)
15 Mini project- Hotel Management System (C6: Synthesis)

140
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

141
Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Database System Concepts”, 6th Edition by Abraham Silber Schatz,
Henry F.Korth, S. Sudarshan, McGraw-Hill
2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D.
Ullman, Computer Science Press.
3. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S.
Navathe, Pearson Education

142
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Quantitative Aptitude & Logical Reasoning

Academic Year II
Semester IV
Number of Credits 2
Course Prerequisite NIL
Course Synopsis This course deals with students to use their logical thinking
and analytical abilities to solve Quantitative aptitude
questions from company specific and other competitive tests.
Course Outcomes:
At the end of the course students will be able to:
CO1 Use their logical thinking and analytical abilities to solve Quantitative aptitude
questions from company specific and other competitive tests.
CO2 Solve questions related to Time and distance and time and work etc. from
company specific and other competitive tests.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO PSO PSO
1 2 3
CO1 3 2 1 1 - 1 - - 1 2 2

CO2 2 2 1 2 - 2 - - 2 - -

Average 2.5 2 1 1.5 - 1.5 - - 1.5 1 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

143
Unit Content & Competencies
1 Quantitative Ability (Basic Mathematics)
Number Systems, LCM and HCF, LCM and HCF, LCM and HCF (C1)
Determine Square Roots and Cube Roots, Average (C5)
Apply Problems on Ages, Surds & Indices, Percentages, Problems on
Numbers (C3)
2 Apply Quantitative Ability (Applied & Engineering Mathematics) (C3)
Evaluate Logarithm, Permutation and Combinations (C5)
Solve problems on Probability, Profit and Loss, Simple and Compound Interest
(C3)
3 Data Interpretation, Bar Graphs, Line Charts. Pie Chart Venn Diagrams (C4)
4 Logical Reasoning (Deductive Reasoning) Analogy, Blood Relation, Directional
Sense, Number and Letter Series, Coding – Decoding, Calendars, Clocks, Venn
Diagrams, Seating Arrangement

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

144
Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Viva-voce Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz √
Assignment / Presentation √ √
Unit test
Mid Semester Examination 1 √ √
Mid Semester Examination 2 √ √
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.The Pearson Guide to Quantitative Aptitude for Competitive
Examinations
2. Quantitative Aptitude For Competitive Examinations – R.S Aggarwal

145
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Problem Solving using Python

Academic Year II
Semester IV
Number of Credits 2
Course Prerequisite Object oriented Programming
Course Synopsis In this course, Student will learn core Python scripting
elements such as variables and flow control structures
Course Outcomes:
At the end of the course students will be able to:
CO1 Master the fundamentals of writing Python scripts.
CO2 Learn core Python scripting elements such as variables and flow control
structures
CO3 Discover how to work with lists and sequence data.
CO4 Perform File management using Python
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 2 - 2 - 1 1 2 -

CO2 3 2 - 2 - 2 - 1 2 - -

CO3 3 2 3 2 - 2 - 1 - 2 -

CO4 - 2 - 2 - 2 - 1 - - -

Average 3 2 1.3 2 - 2 - 1 0.5 1.3 -

Course Content:

146
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction to Python Programming Language:

Explain Programming Language, History and Origin of Python Language (C2:


Comprehension)

Describe Features of Python, Limitations, Major Applications of Python (C2:


Comprehension)

Installing Python, setting up Path and Environment Variables (C6: Synthesis)

Running Python, First Python Program, Python Interactive Help Feature (C6:
Synthesis)

Analyze Python differences from other languages (C4: Analysis)

Python Data Types & Input/Output:

Explain Keywords, Identifiers, Python Statement, Indentation, Documentation,


Variables, Multiple Assignment (C2: Comprehension)

Understanding Data Type, Data Type Conversion, Python Input and Output
Functions, Import command (C2: Comprehension)

Operators and Expressions:

Analyze Operators in Python, Expressions, Precedence, Associativity of


Operators, Non-Associative Operators (C4: Analysis)

147
2 Control Structures:

Design Decision making statements, Python loops, Python control statements.

(C6: Synthesis)

Python Native Data Types:

Explain Numbers, Lists, Tuples, Sets, Dictionary, Functions & Methods of


Dictionary,

Strings (in detail with their methods and operations). (C2: Comprehension)
3 Python Functions:

Describe Functions, Advantages of Functions, Built-in Functions, User defined


functions, Anonymous functions (C2: Comprehension)

Implement Pass by value Vs. Pass by Reference, Recursion (C3: Application)

Explain Scope and Lifetime of Variables (C2: Comprehension)

Python Modules:

Module definition, Need of modules (C1: Knowledge)

Creating a module, importing module, Path Searching of a Module (C6: Synthesis)

Analyze Module Reloading, Standard Modules, Python Packages (C4: Analysis)

148
4 Exception Handling:
Analyze Exceptions, Built-in exceptions, Exception handling, User defined
exceptions in Python (C4: Analysis)
File Management in Python:
Implement Operations on files (opening, modes, attributes, encoding, closing), read
() & write () methods, tell () & seek () methods, renaming & deleting files in
Python, directories in Python. (C3: Application)
Classes and Objects:
Describe the concept of OOPS in Python (C2: Comprehension)
Designing classes, Creating objects (C6: Synthesis)
Accessing attributes, Editing class attributes,
Describe Built-in class attributes, Garbage collection, Destroying objects (C2:
Comprehension)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

149
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Learning Python, 7th Edition. ―Written by Mark Lutz Python,2020
2.Python for Data Analysis. ―Written by Wes McKinney
3.Core Python Programming, R. Nageswara Rao, 2nd Edition,
Dreamtech.

150
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Problem Solving using Python Lab

Academic Year II
Semester IV
Number of Credits 2
Course Prerequisite Object oriented Programming
Course Synopsis In this course, students will learn the basic fundamentals and
advanced Python programming
Course Outcomes:
At the end of the course students will be able to:
CO1 Describe the basic fundamentals of python programming
CO2 Student will be able to describe the basic fundamentals of python
programming
CO3 Use Python lists, tuples and dictionaries for representing
compound data.
CO4 Develop Python programs using files
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 1 - 2 - - 1 - 2

CO2 3 2 1 2 - 2 - - 2 - -

CO3 3 2 - - - 2 - - - - -

CO4 3 2 3 - - 2 - - 2 - 1

Average 3 2 1.2 0.7 - 2 - - 1.2 - 0.7

Course Content:

151
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content & Competencies
1 Develop programs to understand the control structures of python (C6: Synthesis)
2 Develop programs to implement list (C6: Synthesis)
3 Develop programs to implement Dictionary (C6: Synthesis)
4 Develop programs to implement tuples (C6: Synthesis)
5 Develop programs to implement function with stress on scoping (C6: Synthesis)
6 Develop programs to implement classes and objects (C6: Synthesis)
7 Develop programs to implement exception handling (C6: Synthesis)
8 Develop programs to implement linear search and binary search (C6: Synthesis)
9 Develop programs to implement insertion sort (C6: Synthesis)
10 Demonstrate the following Conditional statements in Python with suitable
examples. i) if statement ii) if else statement iii) if – elif – else statement (C3:
Application)
11 Demonstrate the following Iterative statements in Python with suitable examples.
i) while loop ii) for loop (C3: Application)
12 Demonstrate the following control transfer statements in Python with suitable
examples. i) break ii) continue iii) pass (C3: Application)
13 Write a Python program to demonstrate various ways of accessing the string. i)
By using Indexing (Both Positive and Negative) ii) By using Slice Operator.
(C1: Knowledge)
14 Demonstrate the following functions/methods which operates on strings in Python
with suitable examples: i) len( ) ii) strip( ) iii) rstrip( ) iv) lstrip( ) v) find( ) vi)
rfind( ) vii) index( ) viii) rindex() (C3: Application)
15 Write a Python program to perform read and write operations on a file
(C1: Knowledge)
16 Demonstrate the following with suitable example programs: i) List slicing ii) List
Comprehensions (C3: Application)

152
17 Write a Python program to demonstrate Local and Global variables (C1:
Knowledge)
18 Demonstrate the different ways of creating set objects with suitable example
programs (C3: Application)
19 Demonstrate the different ways of creating dictionary objects with suitable
example programs (C3: Application)
20 Implement the following Searching and Sorting techniques in Python by using
functions. i) Linear Search ii) Binary Search iii) Selection Sort iv) Bubble Sort
(C3: Application)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

153
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Learning Python, 7th Edition. ―Written by Mark Lutz
Python,2020
2.Python for Data Analysis. ―Written by Wes McKinney

154
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Advances in Operating Systems

Academic Year II
Semester IV
Number of Credits 3
Course Prerequisite Software Engineering
Course Synopsis In this course, students will learn about Operating system
concepts such as scheduling, Process management, memory
management
Course Outcomes:
At the end of the course students will be able to:
CO1 Create processes and threads. optimize the developed expressions
CO2
Develop algorithms for process scheduling for a given specification of
CPU utilization, throughput, Turnaround Time, Waiting Time,
Response Time.
CO3 For a given specification of memory organization develop the techniques for
optimally allocating memory to processes by increasing memory utilization and
for improving the access time.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PS
O3
CO1 3 2 1 1 - 1 - - 1 2 -

CO2 2 3 - 2 - 2 - - - 3 -

CO3 1 - 3 3 - 3 - - 3 - -

Average 2 1.6 1.3 2 - 2 - - 1.3 1.6 -

155
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 Introduction:

Explain Concept of Operating Systems, Generations of Operating Systems, Types


of Operating Systems, (C2: Comprehension)

Describe OS Services, System Calls, Structure of an OS-Layered, Monolithic,


Microkernel Operating Systems (C2: Comprehension)

Explain Concept of Virtual Machine (C2: Comprehension)

Case study on UNIX and WINDOWS Operating System.


2 Process Management: Processes:
Definition, Process Relationship, Different states of a Process, Process State
transitions, Process Control Block (PCB), Context switching. (C1: Knowledge)

Thread: Definition, Various states, Benefits of threads, Types of threads, Concept


of multi threads, ((C1: Knowledge, C2: Comprehension)

Process Scheduling:

Distinguish Foundation and Scheduling objectives, Types of Schedulers (C4:


Analysis)

Evaluate Scheduling criteria: CPU utilization, Throughput, Turnaround Time,


Waiting Time, Response Time (C5: Evaluation)
Scheduling algorithms:
Implement Pre-emptive and Non-preemptive, FCFS, SJF, RR (C3: Application)
Explain Multiprocessor scheduling: Real Time scheduling: RM and EDF (C2:
Comprehension)

156
3 Memory Management: Memory Management:

Explain basic concept such as Logical and Physical address map (C2:
Comprehension)

Classify Memory allocation: Contiguous Memory allocation (C2: Comprehension)

Explain Fixed and variable partition–Internal and External fragmentation and


Compaction Paging (C2: Comprehension)

Implement Page Replacement algorithms: Optimal, First in First Out (FIFO),


Second Chance (SC), Not recently used (NRU) and Least Recently used (LRU)
(C3: Application)
4 Process-Synchronization & Deadlocks:
Inter-process Communication:
Describe Critical Section, Race Conditions, Mutual Exclusion, Hardware Solution,
Strict Alternation, Peterson’s Solution (C2: Comprehension)
Analyze The Producer\ Consumer Problem, Semaphores, Event Counters, Monitors,
Message Passing (C4: Analysis)
Evaluate Classical IPC Problems: Reader’s & Writer Problem, Dining Philosopher
Problem etc. (C5: Evaluation)
Definition of Deadlocks, Necessary and sufficient conditions for Deadlock (C1:
Knowledge)
Implement Deadlock Prevention, Deadlock Avoidance: Banker’s algorithm (C3:
Application)
Execute Deadlock detection and Recovery (C3: Application)

157
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 39
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

158
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Practical Log Book/ Record Book

Mid Semester Examination 1 √ √ √


Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Silbersachatz and Galvin, “Operating System Concepts”,
Pearson
2.Tannenbaum, “Operating Systems”, PHI, 4th Edition,
William Stallings, “Operating Systems Internals and
Design Principles”, PHI
3.HallMadnick, J. Donovan, “Operating Systems”, Tata
McGraw Hill.

159
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Advances in Operating Systems Lab

Academic Year II
Semester IV
Number of Credits 1
Course Prerequisite NIL
Course Synopsis In this course students will learn about Unix commands and
shell programming
Course Outcomes:
At the end of the course students will be able to:
CO1 To learn Unix commands and shell programming
CO2 To implement various CPU Scheduling Algorithm
CO3 To implement Process Creation and Inter Process Communication.
CO4 To implement Deadlock Avoidance and Deadlock Detection Algorithms
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 2 3 1 - - - - 1 - -

CO2 2 - 3 2 - 1 - - - 3 -

CO3 2 - 3 - - - - - 3 - -

CO4 2 2 3 3 - 3 - - 2 1 -

Average 2 1 3 1.5 - 1 - - 1.5 1 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

160
2 2
Unit Content & Competencies
1 Basics of UNIX commands (C1: Knowledge)
2 Write programs using the following system calls of UNIX operating system fork,
exec, getpid, exit, wait, close, stat, opendir, readdir (C1: Knowledge)
3 Write C programs to simulate UNIX commands like cp, ls, grep, etc. (C1:
Knowledge)
4 Demonstrate Shell Programming (C3: Application)

5 Write C programs to implement the various CPU Scheduling Algorithms


(C1: Knowledge)
6 Implementation of Semaphores (C3: Application)

7 Implementation of Shared memory and IPC (C3: Application)

8 Bankers Algorithm for Deadlock Avoidance

9 Implementation of Deadlock Detection Algorithm (C3: Application)

10 Write C program to implement Threading & Synchronization Applications (C1:


Knowledge)
11 Implementation of the following Memory Allocation Methods for fixed partition
a) First Fit b) Worst Fit c) Best Fit (C3: Application)
12 Implementation of Paging Technique of Memory Management (C3: Application)

13 Implementation of the following Page Replacement Algorithms a) FIFO b) LRU c)


LFU (C3: Application)

14 Implementation of the various File Organization Techniques (C3: Application)


15 Implementation of the following File Allocation Strategies
a) Sequential b) Indexed c) Linked (C3: Application)

161
-Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 24
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 6
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

162
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books

1.Silbersachatz and Galvin, “Operating System


Concepts”, Pearson

2.Tannenbaum, “Operating Systems”, PHI, 4th


Edition. William Stallings, “Operating Systems
Internals and Design Principles”, PHI

3.HallMadnick, J. Donovan, “Operating Systems”,


Tata McGraw Hill.

163
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Cloud computing architecture and deployment models

Academic Year II
Semester IV
Number of Credits 3
Course Prerequisite Fundamentals of Cloud Computing
Course Synopsis In this course, students will learn about Overview of Cloud
Computing; Cloud Service models and Cloud Deployment
Models
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand Cloud Segments and Cloud Deployment Models
CO2 Importance of security in cloud computing
CO3 Static Application Development using Service models
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 1 - - - - 1 2 -

CO2 2 3 1 2 - - - - 2 3 -

CO3 1 2 3 3 - - - - 3 2 -

Average 1 2 3 3 2 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3

164
Content & Competencies
Unit
1 OVERVIEW OF DELIVERY MODELS IN CLOUD COMPUTING

Introduction; Overview of Cloud Computing (C1: Knowledge)

Analyse Cloud Service models and Cloud Deployment Models (C4: Analysis)

Discuss Cloud History – Internet technologies (SOA, Web Services, Web 2.0,
mashups) (C2: Comprehension)

Explain Distributed computing – Utility and Grid Computing, Hardware –


VMWare ESXi, Xen, KVM (C2: Comprehension)

Identify Virtual Appliances and the open Virtualization format; System


Management; Anatomy of Cloud (C2: Comprehension)

Evaluate Benefits of Cloud; Cloud Transformation roadmap; cloud delivery models


and their advantages (C5: Evaluation)

Implement Cloud computing architecture (C3: Application)

2 INFRASTRUCTURE AS A SERVICE (IAAS)

Introduction to Infrastructure as a Service delivery model (C1: Knowledge)

Describe characteristics of IaaS, Architecture, examples of IaaS (C2:


Comprehension)

Applicability of IaaS in the industry (C3: Application)

Compare ISPs and IaaS, Motivations for renting the infrastructure (C4: Analysis)

IaaS Case studies; IaaS enabling Technology; Trusted cloud, Amazon EC2.

165
3 PLATFORM AS A SERVICE (PAAS)

Introduction to Platform as a Service delivery model (C1: Knowledge)

Discuss Characteristics of PaaS, patterns, architecture and examples of PaaS (C2:


Comprehension)

Applicability of PaaS in the industry (C3: Application)

Implement Integrated Lifecycle Platform (C3: Application)

Describe Anchored Lifecycle platform; Enabling Technologies as a Platform; PaaS


– best option or not (C2: Comprehension)

Design Google App Engine (C6: Synthesis)


4 SOFTWARE AS A SERVICE (SAAS)

Introduction to Software as a Service delivery model (C1: Knowledge)

Describe characteristics of SaaS, SaaS Origin (C2: Comprehension)

Evolvement of SaaS – Salseforce.com approach; SaaS Economics and Ecosystem;

Describe types of SaaS Platforms (C2: Comprehension)

Implementation of Architecture, SaaS – Providers; Collaboration as a Service;


Enabling and Management tools as a Service (C3: Application)

Applicability of SaaS in the industry (C3: Application)

166
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 38
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 5
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

167
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Cloud Computing: Concepts, Technology &
Architecture, Zaigham Mahmood, Ricardo Puttini,
Thomas Erl, O'Rilley.

168
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Cloud computing architecture and deployment models Lab
Academic Year II
Semester IV
Number of Credits 1
Course Prerequisite Fundamentals of Cloud computing Programming
Course Synopsis In this course, students will learn about Cloud Segments and
Cloud Deployment Models
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand Cloud Segments and Cloud Deployment Models
CO2 Importance of security in cloud computing
CO3 Static Application Development using Service models
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO
3
CO1 3 2 2 1 2 1 2

CO2 3 - 2 - 2 - 3

CO3 3 2 2 - 2 3 -

Average 3 1.3 2 0.3 2 1.3 1.6

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

169
Unit Content & Competencies
1 Creating a Warehouse Application in SalesForce.com (C6: Synthesis)
2 Deploy the own cloud storage server using Docker (C6: Synthesis)

3 Implementation of SOAP Web services in C#/JAVA Applications (C3: Application)

4 Install a C compiler in the virtual machine created using virtual box and execute
Simple Programs (C6: Synthesis)
5 Install Google App Engine. Create hello world app and other simple web
applications using python/java (C6: Synthesis)
6 Use GAE launcher to launch the web applications (C3:application)

7 Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not
present in Cloud Sim (C6: Synthesis)
8 Implement procedure to transfer the files from one virtual machine to another virtual
machine (C3: Application)
9 Case Study: PAAS (Facebook, Google App Engine)
10 Case Study: Amazon Web Services.

170
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

171
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz
VIVA √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Cloud Computing: Concepts, Technology & Architecture,
Zaigham Mahmood, Ricardo Puttini, Thomas Erl, O'Rilley

172
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title R Programming for Data Analytics
Academic Year II
Semester IV
Number of Credits 3
Course Prerequisite Data Mining & Predictive Modeling
Course Synopsis In this course, students will learn how to program in R and how
to use R for effective data analysis and visualization.
Course Outcomes:
At the end of the course students will be able to:
CO1 Develop an R script and execute it
CO2
Install, load and deploy the required packages, and build new packages for
sharing and reusability
CO3 Visualize and summarize the data
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 2 1 1 2

CO2 3 3 2 2 2 -

CO3 3 - 2 - - 2

Average 3 1.2 2 1.3 1.3 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 3
Unit Content & Competencies

173
1 Introduction:
Introduction to R interpreter (C1: Knowledge)
Introduction to major R data structures like vectors, matrices, arrays, list and data frames
(C1: Knowledge)
Implement Control Structures, vectorized if and multiple selection, functions (C3:
Application)
2 Installing, loading and using packages (C6: Synthesis)

Implement Read/write data from/in files (C3: Application)

Extracting data from web-sites, clean data, Transform data by sorting (C5: Evaluation)

Apply adding/removing new/existing columns, centering, scaling and normalizing the


data values (C3: Application)

Evaluate Converting types of values, using string in-built functions (C5: Evaluation)

Statistical analysis of data for summarizing and understanding data (C4: analysis)

Visualizing data using scatter plot, line plot, bar chart, histogram and box plot (C5:
Evaluation)
3 Designing GUI: Building interactive application and connecting it with database (C6:
Synthesis)

4 Building Packages (C6: Synthesis)

174
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 35
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 10
Case/Project Based Learning (CBL) -
Revision -
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

175
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Cotton, R., Learning R: a step-by-step function guide to data
analysis. 1st edition. O’Reilly Media Inc.
2.Gardener, M. (2017). Beginning R: The statistical
programming language, WILEY.
3. Lawrence, M., & Verzani, J. (2016). Programming Graphical
User Interfaces in R. CRC press.

176
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title R Programming for Data Analytics Lab
Academic Year II
Semester IV
Number of Credits 1
Course Prerequisite Data Mining & Predictive Modeling
Course Synopsis In this course, students will learn how to program in R and how
to use R for effective data analysis and visualization.
Course Outcomes:
At the end of the course students will be able to:
CO1 Develop an R script and execute it
CO2
Install, load and deploy the required packages, and build new packages for
sharing and reusability
CO3 Visualize and summarize the data
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 3 1 1 - - - - 1 2 -

CO2 2 3 - 2 - - - - - 3 -

CO3 2 3 3 - - - - - 3 - -

Average 2 3 1.3 1.3 - - - - 1.3 1.6 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies

177
1 R interpreter, Introduction to major R data structures like vectors, matrices, arrays, list and
data frames (C1: Knowledge)
2
Implement User-defined functions (C3: Application)

3 Installing, loading different packages for file handling (C6: Synthesis)

Demonstrate Reading and writing files of different formats using inbuilt packages (C3:
4 Application)

5 Using inbuilt packages for data cleaning (C3: Application)

6
Transformation of data for statistical analysis (C3: Application)

7 Exploring and summarizing data using statistical methods: mean, median, mode (C5:
Evaluation)
8 Exploring and summarizing data using statistical methods: quantiles, Building contingency
table (C5: Evaluation)
9 Data visualization using Scatter Plot, line graph, histogram, bar chart, boxplot
(C5: Evaluation)
10 Designing GUI (C6: Synthesis)

Using inbuilt packages for database connectivity (C3: Application)


11
12 Building complete application with GUI and database connectivity (C6: Synthesis)

178
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 25
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 5
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

179
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Cotton, R., Learning R: a step-by-step function guide to data
analysis. 1st edition. O’reilly Media Inc.
2.Gardener, M. (2017). Beginning R: The statistical programming
language, WILEY.
3. Lawrence, M., & Verzani, J. (2016). Programming Graphical
User Interfaces in R. CRC press.

180
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Embedded system development

Academic Year II
Semester IV
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, students will learn usage of various on-chip
resources like GPIO, Timers, Interrupts, ADC, DAC,
Comparator, SPI and Design embedded systems to suit
market requirements
Course Outcomes:
At the end of the course students will be able to:
CO1 Demonstrate knowledge in designing complex energy efficient
embedded systems.
CO2 Analyze usage of various on-chip resources like GPIO, Timers, Interrupts,
ADC, DAC, Comparator, SPI.
CO3 Design embedded systems to suit market requirements.
CO4 Solve engineering problems by proposing potential solutions using industry
choice advanced Microcontrollers.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO PSO
2 3
CO1 2 3 3 2 - - - - 2 2 -

CO2 2 3 - - 1 - - - - - -

CO3 2 3 - - - - - - - - -

181
CO4 2 3 2 3 2 - - - 2 1 -

Average 2 3 1.2 1.2 0.7 - - - 1 0.7 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content & Competencies
1 Introduction to MSP430 launch pad and Programming Environment (C1:
Knowledge)
2 Read input from switch and Automatic control/flash LED (soft-ware delay) (C1:
Knowledge)
3 Show Interrupts programming example using GPIO (C3: Application)

4 Configure watchdog timer in watchdog & interval mode (C6: Synthesis)


5 Configure timer block for signal generation (with given frequency). (C6:
Synthesis)
6 Read Temperature of MSP430 with the help of ADC (C1: Knowledge)

7 Test various Power Down modes in MSP430 (C5: Evaluation)


8 Implement PWM Generator (C3: Application)
9 Use Comparator to compare the signal threshold level (C3: Application)

10 Implement Speed Control of DC Motor (C3: Application)

11 Master slave communication between MSPs using SPI.


12 Networking MSPs using Wi-Fi.
13 Interface and Control a DC Motor (C6: Synthesis)
14 Interface a Stepper motor and rotate it in clockwise and anti-clockwise direction
(C6: Synthesis)
15 Interface a 4x4 keyboard and display the key code on an LCD (C6: Synthesis)

182
Learning Strategies and Contact Hours
Learning Strategies Contact Hours
Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:
Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

183
Mapping of Assessment with COs
Nature of Assessment CO1 CO2 CO3 CO4
Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: 1. Embedded Systems Architecture by Daniele Lacamera

2.Embedded Systems Development by Alberto Sangiovanni-


Vincentelli

3.Better Embedded System software by Philip Koopman

184
SEMESTER - V

Course Code Course Title

Data Warehousing and Data Mining

Data Warehousing and Data Mining Lab

Java Programming

Java Programming Lab

Innovations & Entrepreneurship

Summer Internship – II

PE-III

Computer Graphics & Vision

PE-III Lab

Computer Graphics & Vision Lab

Minor Electives Courses-V

Introduction to Windows Azure (CC)

Data Visualization and Story Telling (AIML)

Minor Electives Courses-V Lab

Introduction to Windows Azure Lab (CC)

Data Visualization and Story Telling Lab


(AIML)
SEC-III

MATLAB

185
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data warehousing and Data Mining

Academic Year III


Semester V
Number of Credits 2
Course Prerequisite Data mining
Course Synopsis In this course, students will learn about the Data warehouse
system and perform business analysis with OLAP tools.
Course Outcomes:
At the end of the course students will be able to:
CO1 Design a Data warehouse system and perform business analysis with OLAP
tools.
CO2 Apply suitable pre-processing and visualization techniques for
data analysis
CO3 Apply frequent pattern and association rule mining techniques
for data analysis
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 P PSO1 PSO2 PSO3
O8
CO1 3 2 1 1 1 2

CO2 3 3 - - 2 -

CO3 3 - 3 3 - 2

Average 3 1.6 1.3 1.3 1 1.3

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

186
Unit Content & Competencies
1 Introduction:

Explain Basic Concepts of Data Warehousing and its Components (C2:


Comprehension)

Building a Data Warehouse (C6: synthesis)

Analyze Database Architectures for Parallel Processing – Parallel DBMS


Evaluate Vendors - Multidimensional Data Model – Data Warehouse Schemas
for Decision Support (C3: Analysis)

Describe Concept Hierarchies (C2: Comprehension)

Discuss Characteristics of OLAP Systems, Typical OLAP Operations, OLAP


and OLTP (C2: Comprehension)
2 Introduction to Data Mining Systems –

Knowledge Discovery Process (C1: Knowledge)

Analyze Data Mining Techniques, Issues (C4: Analysis)

Applications- Data Objects and attribute types (C3: Application)

Implement Statistical description of data (C3: Application)

Apply Data Preprocessing – Cleaning, Integration, Reduction (C3: Application)

Transformation and discretization, Data Visualization, Data similarity and


dissimilarity measures (C6: synthesis)

187
3 FREQUENT PATTERN ANALYSIS

Mining Frequent Patterns (C6: synthesis)

Apply Associations and Correlations (C3: Application)

Compare Mining Methods, Pattern Evaluation Method, Pattern Mining in


Multilevel, Multi-Dimensional Space (C4: Analysis)

Implement Constraint Based Frequent Pattern Mining (C3: Application)

Classification using Frequent Patterns (C2: Comprehension)

4 CLASSIFICATION AND CLUSTERING

Decision Tree Induction - Bayesian Classification (C2: Comprehension)

Rule Based Classification – Classification by Backpropagation (C2:


Comprehension)
Evaluate Support Vector Machines, Lazy Learners, Model Evaluation and
Selection-Techniques to improve Classification Accuracy (C5: Evaluation)
Discuss about Clustering Techniques (C2: Comprehension)

Cluster analysis (C4: Analysis)

Analyze Partitioning Methods, Hierarchical Methods, Density Based Methods,


Grid Based Methods (C4: Analysis)
Evaluation of clustering: Clustering high dimensional data, Clustering with
constraints, Outlier analysis-outlier detection methods (C5: Evaluation)

188
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

189
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Practical Logbook/ Record Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Jiawei Han and Micheline Kamber, ―Data Mining
Concepts and Techniques‖, Third Edition, Elsevier,
2012.
2. Alex Berson and Stephen J.Smith, ―Data Warehousing,
Data Mining & OLAP‖, Tata McGraw – Hill Edition,
35th Reprint 2016.

190
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data warehousing and Data Mining Lab

Academic Year III


Semester V
Number of Credits 2
Course Prerequisite Data mining
Course Synopsis In this course, students will learn about the Data warehouse
system and perform business analysis with OLAP tools.
Course Outcomes:
At the end of the course students will be able to:
CO1 Demonstrate the classification, clustering and etc. in large data sets.
CO2 Ability to understand the various kinds of tools.
CO3 Apply frequent pattern and association rule mining techniques
for data analysis
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO PSO3
2
CO1 3 2 1 1 - - - - 1 - -

CO2 3 - 1 2 - - - - - - -

CO3 3 2 - - - - - - 3 - -

Average 3 1.3 0.5 1.5 - - - - 1.3 - -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4

191
Unit Content & Competencies
1 Build Data Warehouse and Explore WEKA (C6: Synthesis)

Apply data preprocessing tasks and demonstrate performing association rule


2 mining on data sets (C3: Application)
Demonstrate performing classification on data sets (C3: Application)
3
Demonstrate performing clustering on data sets (C3: Application)
4
5 Demonstrate performing Regression on data sets (C3: Application)
6 Credit Risk Assessment. Sample Programs using German Credit Data (C6:
Synthesis)
7 Sample Programs using Hospital Management System (C6: Synthesis)
8 Create Simple Project on Data Preprocessing (C6: Synthesis)
9 Apply Naïve bayes classification on a given data set (C3: Application)
10 Applying k-means clustering on a given data set (C3: Application)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

192
Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

Mapping of Assessment with COs

CO1 CO2 CO3


VIVA √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1

Feedback Process Student’s Feedback

References: List of reference books


1. Jiawei Han and Micheline Kamber, ―Data Mining Concepts
and Techniques‖, Third Edition, Elsevier, 2012.
2. Alex Berson and Stephen J.Smith, ―Data Warehousing, Data
Mining & OLAP‖, Tata McGraw – Hill Edition, 35th Reprint
2016.

193
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Computer Graphics and Vision
Academic Year III
Semester V
Number of Credits 3
Course Prerequisite C Programming
Course Synopsis In this course, Student will learn about computer graphics
concepts in the development of computer games,
information visualization, and business applications
Course Outcomes:
At the end of the course students will be able to:
CO1 Apply principles and techniques of computer graphics, e.g., the graphics
pipeline, and Bresenham algorithm for speedy line and circle generation.
CO2 Apply computer graphics concepts in the development of computer
games, information visualization, and business applications.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 2 2 1 1 1 2

CO2 2 1 2 2 1 2 -

Average 2 1.5 2 1.5 1 1.5 0.6

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3

194
Unit Content & Competencies
1 Types of computer graphics

Design Graphic Displays- Random scan displays (C6: Synthesis)

Develop Raster scan displays (C6: Synthesis)

Explain Frame buffer and video controller (C2: Comprehension)

Implement Points and lines (C3: Application)

Develop Line drawing algorithms (C6: Synthesis)

Construct Circle generating algorithms (C6: Synthesis)


2 Basic transformation

Implement Matrix representations and homogeneous coordinates (C3:


Application)

Analyze Composite transformations, Reflections and shearing (C4: Analysis)

Windowing and Clipping: Viewing pipeline,

Viewing transformations, 2-D Clipping Algorithms-Line clipping against non-


rectangular clip windows (C4: Analysis)

Construct Polygon clipping – Sutherland Hodgeman polygon clipping (C6:


Synthesis)
3 3-D geometric primitives

Analyze 3-D Object representation (C4: Analysis)

Analyze 3-D Transformation (C4: Analysis)

Analyze 3-D viewing, projections,3- D Clipping (C4: Analysis)

Build Quadric surfaces, Spheres, Ellipsoid, Blobby objects (C6: Synthesis)

Introductory concepts of Spline, B Spline and Bezier curves and surfaces (C1:
Introduction)

195
4 Back Face Detection algorithm,

Implement Depth buffer method, A- buffer method (C3: Application)

Analyze Scan line method (C4: Analysis)

Implement Basic illumination models – Ambient light, Diffuse reflection,


Specular reflection and Phong model (C3: Application)

Evaluate Combined approach, Warn model, Intensity Attenuation, Color


consideration, Transparency and Shadows (C5: Evaluation)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 38
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 4
Case/Project Based Learning (CBL) -
Revision 1
Others If any: -
Total Number of Contact Hours 45

196
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Viva-voce Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs


CO1 CO2 CO3 CO4 CO5 CO6
Quiz √ √
Assignment / Presentation √ √
Unit test √ √
Mid Semester Examination 1 √ √
Mid Semester Examination 2 √ √
University Examination √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Computer Graphics C Version - Donald Hearn and M
Pauline Baker, Pearson Education
2. Computer Graphics: A Programming Approach - Steven
Harrington, TMH Publications
3. Procedural Elements of Computer Graphics - Rogers,
McGraw Hill

197
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Computer Graphics and Vision Lab
Academic Year III
Semester V
Number of Credits 1
Course Prerequisite C Programming
Course Synopsis In this course, Student will learn about computer graphics
concepts in the development of computer games, information
visualization, and business applications
Course Outcomes:
At the end of the course students will be able to:
CO1 Concepts of 2D & 3D object representation
CO2 Implementation of various scan & clipping algorithms
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 2 1 1 - - 1 - 1 - 2

CO2 2 - - 2 - - 2 - 2 - -

Average 2 1 0.5 1.5 1.5 1.5 - 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies
1 Implement Brenham’s line drawing algorithm for all types of slope (C3: Application)

Create and rotate a triangle about the origin and a fixed point (C6: Synthesis)
2

198
3 Draw a color cube and spin it using OpenGL transformation matrices (C6: Synthesis)

4 Draw a color cube and allow the user to move the camera suitably to experiment with
perspective viewing (C6: Synthesis)
5 Clip a lines using Cohen-Sutherland algorithm (C6: Synthesis)
6 To draw a simple shaded scene consisting of a tea pot on a table. Define suitably the
position and properties of the light source along with the properties of the surfaces of
the solid object used in the scene (C6: Synthesis)
7 Design, develop and implement recursively subdivide a tetrahedron to form 3D
sierpinski gasket. The number of recursive steps is to be specified by the user (C6:
Synthesis)
8 Develop a menu driven program to animate a flag using Bezier Curve algorithm (C6:
Synthesis)
9 Develop a menu driven program to fill the polygon using scan line algorithm using Open
GL API. Consider all types of attributes like color, thickness, styles, font, background,
speed etc., while doing mini project (C6: Synthesis)
10 Develop a menu driven program to fill the polygon using scan line algorithm (C6:
Synthesis)

199
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 25
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 5
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

200
Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz
VIVA √ √
Assignment / Presentation
Unit test
Clinical/Practical Log Book/ Record √ √
Book
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Computer Graphics C Version - Donald Hearn and M Pauline Baker,
Pearson Education
2. Computer Graphics: A Programming Approach - Steven Harrington,
TMH Publications
3. Procedural Elements of Computer Graphics - Rogers, McGraw Hill

201
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Java Programming

Academic Year III


Semester V
Number of Credits 2
Course Prerequisite Object oriented Programming using C++
Course Synopsis In this course, student will learn various java concept
using programs, Event handling and input/output
programming in Java.

Course Outcomes:
At the end of the course students will be able to:
CO1 Describe Java concepts
CO2 Evaluate various java concepts using programs
CO3 Event handling in Java
CO4 Input/Output Programming in Java
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PS
O3
CO1 3 2 1 2 - - 1 - 1 2 1

CO2 3 2 - 2 - 2 1 - - 3 -

CO3 3 2 3 2 - - 1 - 3 - 3

CO4 3 2 - 2 - 2 1 - - 3 -

Average 3 2 1 2 - 1 1 - 1 - 1

Course Content:

202
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction to Java:

Importance and Features of Java (C1: Knowledge)

Explain Keywords, constants, variables and Data Types (C2:


Comprehension)

Discuss Operators and Expressions (C2: Comprehension)

Analyze Decision Making, Branching and Looping: if. Else, switch, operator,
while, do, for statements, labelled loops, jump statements: break, continue
return (C4: Analysis)

Introducing classes, objects and methods: defining a class, adding variables


and methods, creating objects, constructors, class inheritance (C1:
Knowledge)
2 Arrays and String:

Creating an array, one- and two-dimensional arrays (C6: Synthesis)

Implement string array and methods (C3: Application)

Construct Classes: String and String Buffer classes, Wrapper classes: Basic
types, using super, Multilevel hierarchy abstract and final classes (C6:
Synthesis)

Describe Object class, Packages and interfaces, Access protection, Extending


Interfaces, packages (C2: Comprehension)

203
3 Exception Handling:

Fundamentals exception types (C1: Knowledge)

Analyze Uncaught exceptions, throw, throw, final, built in exception, creating


your own exceptions (C4: Analysis)

Multithreaded Programming: Fundamentals (C1: Knowledge)

Build Java thread model (C6: Synthesis)

Evaluate Priorities, synchronization, messaging (C5)

Create Thread classes, Runnable interface (C6: Synthesis)

Distinguish Inter thread Communication, Suspending, Resuming and

Stopping threads (C4: Analysis)


4 Input/output Programming:

Basics Streams, Byte and Character Stream, predefined streams (C1:


Knowledge)

Analyze Reading and writing from console and files (C4: Analysis)

Using Standard Java Packages (lang, util, io, net) (C3: Application)

Describe Different Mechanism for Event Handling (C2: Comprehension)

Build Delegation Event Model, Event Classes, Event Listener Interfaces (C6:
Synthesis)

Define Adapter and Inner Classes (C1: Knowledge)

204
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

205
Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Horstmann, “Computing Concepts with Java 2 Essentials”, John
Wiley.
2.Java - The Complete Reference, Herbert Schildt, 11th Edition,
McGraw Hill Education

206
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Java Programming Lab

Academic Year III


Semester V
Number of Credits 2
Course Prerequisite Object oriented Programming using C++
Course Synopsis In this course, student will learn various java concept
using programs.

Course Outcomes:
At the end of the course students will be able to:
CO1 Describe Java concepts
CO2 Evaluate various java concept using programs
CO3 Event handling and input/output programming in java
CO4 Design web pages using Java
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO
3
CO1 3 2 1 2 - - - - 1 - -

CO2 3 2 3 2 - - - - - 3 -

CO3 3 2 2 2 - - - - 3 - -

CO4 - 2 - 2 - - - - - 1 -

Average 3 2 2 2 1 1

Course Content:

207
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content & Competencies
1 Write a Java program to understand how to accept input using Scanner or
Buffered Reader and print output using System.out.println statement.
(C1: Knowledge)
Write a Java program to display the default value of all primitive data types in
2 Java.
(C1: Knowledge)
3 Develop a Java Program to perform arithmetic operations on two numbers
using scanner class
(C6: Synthesis)
4 Design a Java Program to find the greatest of three numbers with user input.
(C6: Synthesis)
5 Develop a Java program to check Even or Odd numbers with User input.
(C6: Synthesis)
6 Develop a Java program to print a series of numbers using For loop and do-
while loop. (C6: Synthesis)
7 Design a Java Program to print a pyramid using For loop (C6: Synthesis)

8 Design a Factorial Program in Java using For loop (C6: Synthesis)

9 Write a java program to test whether string is palindrome or not (C1:


Knowledge)
10 Write a java program to count number of alphabets, digits, special symbols,
blank spaces and words from the given sentence. (C1: Knowledge)
11 Write a Java program to demonstrate Method overloading (C1: Knowledge)
12 Design a Java Program for creating a multi-dimensional array and accessing its
elements. (C6: Synthesis)
13 Develop a Java program for making a basic calculator (C6: Synthesis)
14 Develop a Fibonacci series program in Java (C6: Synthesis)

208
15 Write a Java Program showing the use of Constructors (C1: Knowledge)

16 Write a Java Program to implement concept of classes and Inheritance in Java.


(C1: Knowledge)

17 Develop a Java Program showing String array and its Methods (C6: Synthesis)
18 Develop a Java Program for Exception Handling (C6: Synthesis)

19 Develop a Java Program for creating Thread classes (C6: Synthesis)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

209
Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

Mapping of Assessment with COs

CO1 CO2 CO3 CO4


Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Logbook/ Record Book √ √ √ √
Mid Semester Examination 1
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Horstmann, “Computing Concepts with Java 2 Essentials”, John
Wiley.
2.Java - The Complete Reference, Herbert Schildt, 11th Edition,
McGraw Hill Education

210
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Innovations & Entrepreneurship
Academic Year III
Semester V
Number of Credits 3
Course Prerequisite NIL
Course Synopsis In this course, Students will learn about the nature of
entrepreneurship and will develop skills in innovation and
business planning for entrepreneurial ventures.

Course Outcomes:
At the end of the course students will be able to:
CO1 Develop an understanding of the nature of entrepreneurship.
CO2 Understand how to identify opportunities (problems), develop creative solutions
and build a viable business model around these.
CO3 Identify and understand the driving forces of new venture success and to
develop skills in innovation and business planning for entrepreneurial ventures.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PS PSO2 PSO3
O1
CO1 3 2 1 2 - - - 3 1 2 -

CO2 3 3 - - - - - 3 2 - -

CO3 3 - 3 3 - - - 3 - 2 -

Average 3 1.6 1.3 1.6 3 1 1.3

Course Content:

211
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 The entrepreneurial perspective

Describe Evolution, Characteristics, Nature, Types, Functions of Entrepreneur


(C2: Comprehension)

Distinguish between an Entrepreneur and a Manager (C4: Analysis)

Explain Concept, Growth of Entrepreneurship in India, The entrepreneurial


perspective, the entrepreneurial decision process (C2: Comprehension)

Describe Types of startups, role of entrepreneurs in economic development (C2:


Comprehension)

Evaluate the future of entrepreneurs, entrepreneurial process, manager vs


entrepreneur decision making, intrapreneurship (C5: Evaluation)
2 The individual Entrepreneur

Describe Entrepreneur background and characteristics (C2: Comprehension)

Analyze motivation role models and support systems (C4: Analysis)

Distinguish male versus female entrepreneurship (C4: Analysis)

Compare entrepreneurs versus inventors (C4: Analysis)

212
3 Theories and Types of entrepreneurships

Describe Entrepreneur, Theories of entrepreneurship: Economic, Classical, Neo


Classical, Austrian Market process, Psychological, Personality Traits, need for
achievement, Sociological, Anthropological entrepreneurial (C2:
Comprehension)

Evaluate Opportunity based Entrepreneurship theory, Resource based


Entrepreneur, Financial Capital/ Liquidity, Social Capital or Social Network
Theory (C5: Evaluation)

Analyze Types of entrepreneurs, Entrepreneurial Motivation – The Needs


Framework, Manifest Needs Theory (C4: Analysis)
4 Creating and starting the Venture

Describe Sources of new Idea, methods of generating ideas (C2: Comprehension)

Creative problem solving, opportunity recognition, product planning and


development, opportunity recognition, Business Structure (C4: Analysis)

Creating a Business Plan, Market Size Analysis, E-commerce and startups,


financial support for Business Plan, Regulations to set up and Laws (C6:
Synthesis)

Analyze Legal issues in setting up the organization, patents, business methods


patents, trademarks, copyrights, trade secrets, licensing, product safety and
liability, insurance, contracts (C4: Analysis)

213
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 40
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

214
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Practical Logbook/ Record Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Hisrich, Robert. Michael Peters and Dean Shepherd,
Mathew. (2014). Entrepreneurship. New Delhi: Tata
McGraw-Hill Education.
2 Poornima M (2014), Entrepreneurship Development and
Small Enterprise, Pearson Education.
3.Hatten, Timothy S. (2011). Small Business Management:
Entrepreneurship and Beyond, Mason: Cengage Learning.

215
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Summer Internship-II
Academic Year III
Semester V
Number of Credits 2
Course Prerequisite NIL
Course Synopsis This course enables students to face the real time
problems which are usually faced by working
professional while working in the industry. While on
this training program, students come to know about
technical as well individual skills required by a
professional for survival in the market. In fact, this
course is about industrial implementation of the
technologies. This course enables students to learn
technologies on industrial level. The student will be
working closely with the technical team. This course
enhances student’s ability to think out of the box and
suggest new ways of implementing ideas in a better
manner and should be able to brainstorm and come up
with innovative ideas.
Course Outcomes:
At the end of the course students will be able to:
CO1 Have an exposure to industrial practices and to work in teams.
CO2
Understand the impact of engineering solutions in a global, economic,
environmental and societal context.

CO3 Develop the ability to engage in research and to involve in life-long


learning.

216
CO4 Communicate effectively and learn to be a team player.

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program


Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PS
O3
CO1 2 3 1 1 1 - - - 1 - 1

CO2 2 3 1 1 1 - - - 1 - 1

CO3 2 3 3 1 1 - - - 1 - 3

CO4 2 3 3 1 1 - - - 1 - 3

Average 2 3 2 1 1 - - - 1 - 2

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

Unit Content & Competencies

The student will be evaluated based on six weeks of work at industry site.
Supervised by an expert at the industry.

Modes of Evaluation: Internship Report, Presentation and Project Review

217
CO1 CO2 CO3 CO4 CO5 CO6
Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Logbook/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

218
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Introduction to Windows Azure
Academic Year III
Semester V
Number of Credits 3
Course Prerequisite Fundamentals of Cloud
Course Synopsis In this course, students will learn about Operating system
concepts such as scheduling, Process management, memory
management
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand core services available with Microsoft Azure
CO2
Understand Core Azure architectural components
CO3 Know the use of Azure management tools
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 1 - - - - 1 2 1

CO2 3 3 - 2 - - - - - 3 1

CO3 3 - 3 3 - - - - 3 - 1

Average 3 1.6 1.3 2 - - - - 1.3 1.6 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3

219
Unit Content & Competencies
1 Cloud Computing & Microsoft Azure Fundamentals

Introduction to Azure (C1: Knowledge)

Analyse Different segments SaaS, PaaS, and IaaS, Azure Regions and Data
Centres (C4)

Understanding of Microsoft Azure portal (C2: Comprehension)

Introduction to all Azure services (C1: Knowledge)

Windows Azure Subscription, Setting Up a Trial Subscription

2 Azure Virtual Machines

Describe Operating System Images Supported, Virtual Machine instances (C2:


Comprehension)

Explain Azure VM types and Pricing (C1: Knowledge)

Evaluate Types of Provisioning Disks & Images (C5: Evaluation)

Implement Virtual Machine management, automation and scripting (C3:


Application)

Implement Cloud Service and Resource Model Deployment (C3: Application)

3 Introduction to Azure Virtual Network and Services

Evaluate Types of Azure Virtual Network VNET to VNET (C5: Evaluation)


Analyze point-to-site and site-to-site, Express Route (C4)

Creating Virtual Networks in Azure (C6: Synthesis)

Implement Azure Subnet and IP ranges Endpoints (C3: Application)

Load Balancing Endpoints, Understanding Network ACL and Network


Security

Introduction to Azure Traffic Manager (C1: Knowledge)

220
4 Microsoft Azure Storage

Overview of Microsoft Azure Storage (C1: Knowledge)

Describe Storage Account, Storage Account Replication Techniques, Protocols


and Consistency Model (C2: Comprehension)

Evaluate Type of Azure Storage Account, Storage Services Blob, Table, queue,
File (C5: Evaluation)

Introduction to Azure Data Factory (C1: Knowledge)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 40
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

221
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √
Assignment / Presentation √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Learn Microsoft Azure for Beginners by Henry Stromm
2.Amazon Web Services and MS Azure for beginners by
Solomon
3.Beginners guide to MS Azure infrastructure with labs by Syed
Fridi

222
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Introduction to Windows Azure Lab
Academic Year III
Semester V
Number of Credits 1
Course Prerequisite Fundamentals of Cloud Computing
Course Synopsis In this course, students will learn about Operating system
concepts such as scheduling, Process management, memory
management
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand core services available with Microsoft Azure
CO2
Understand Core Azure architectural components
CO3 Know the use of Azure management tools
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO PO6 PO7 PO8 PSO1 PS PSO3
5 O2
CO1 3 3 1 1 1 1 2

CO2 2 3 - 2 - - 3

CO3 1 3 3 3 3 3 -

Average 2 3 1.3 2 1.3 1.3 1.6

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

223
2 2

Unit Content & Competencies


1 Installation of Azure cmdlets on windows PowerShell (C6: Synthesis)

2 Creation of VMs with portal, ARM Templates and PowerShell (C6:


Synthesis)

3 Demonstrate Types of Azure Virtual Network VNET to VNET, point-to-site


and site-to-site, Express Route (C3: Application)

4 Create a point-to-site virtual network (C6: Synthesis)

5 Demonstrate Load Balancing using Azure Traffic Manager (C3:


Application)

6 Create an Azure Storage Account (C6: Synthesis)

7 Implement Azure Active Directory (C3: Application)

8 Implement Azure AD Identity Protection (C3: Application)

9 Deploy Web App (C6: Synthesis)

10 Migrate a database from on premise to SQL Azure (C6: Synthesis)

224
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

225
Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA √ √ √
Assignment / Presentation
Unit test
Practical Logbook/ Record Book √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Learn Microsoft Azure for Beginners by Henry Stromm
2.Amazon Web Services and MS Azure for beginners by Solomon
3.Beginners guide to MS Azure infrastructure with labs by Syed Fridi

226
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data Visualization and Story Telling
Academic Year III
Semester V
Number of Credits 3
Course Prerequisite NIL
Course Synopsis In this course, students will learn about Operating system concepts
such as scheduling, Process management, memory management
Course Outcomes:
At the end of the course students will be able to:
CO1 Design and create data visualizations.
CO2
Conduct exploratory data analysis using visualization.
CO3 Craft visual presentations of data for effective communication.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 3 1 1 - - - - 1 2 -

CO2 2 3 - 2 - - - - - 3 -

CO3 1 3 3 3 - - - - 3 - -

Average 2 3 1.3 2 - - - - 1.3 1.6 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 3
Unit Content & Competencies

227
1 Introduction

Descriptive Statistics (C2: Comprehension)

Define Basic of Grouping, ANOVA, Correlation (C1: Knowledge)

Explain Polynomial Regression and Pipelines (C2: Comprehension)

Describe R-squared and MSE for In-Sample Evaluation (C2: Comprehension)

Evaluate Prediction and Decision Making, Grid Search, Model Refinement, Binning,
Indicator variables (C5: Evaluation)
2 Introduction to Data Manipulation using Function

Distinguish Heat Map, Tree Map, Smart Chart, Azure Machine learning (C4: Analysis)

Design Column Chart, Line Chart, Pie, Bar, Area, Scatter Chart, Data Series, Axes, Chart
Sheet, Trend line, Error Bars, Spark lines (C6: Synthesis)

Implement Frequency Distribution (C3: Application)

Design Pivot Chart, Slicers, Tables: Structured References, Table Styles, What-If Analysis:
Data Tables| Correlation model |Regression model (C6: Synthesis)
3 Tableau

Implement Tableau: Exploring the program interface, connecting to a data source, Joining
related data sources (C3: Application)

Creating a visualization using Show Me, Changing the order of the fields in visualization,
Changing the summary operation, Splitting text into multiple columns (C6: Synthesis)

Presenting data using storylines, Presenting Tableau operators and built-in functions (C4:
Analysis)
4 Sorting and Filtering Tableau Data

Analyse Sorting and Filtering Tableau Data: Sorting based on a field’s values (C4: Analysis)

Creating a wildcard filter, creating a condition filter, creating a top filter, adding a quick filter
to a worksheet, Editing, clearing, and deleting filters (C6: Synthesis)

Creating Basic Charts: Creating column and stacked column charts (C6: Synthesis)

Creating bar charts, stacked bar charts, and side by-side bars, creating line charts and area fill
charts, Creating pie charts (C6: Synthesis)

228
Learning Strategies and Contact Hour

Learning Strategies Contact Hours


Lecture 40
Practical -
Seminar/Journal Club 2
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 1
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

229
Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √ √
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Stephen Few, Information Dashboard Design: Displaying Data for At-a-
glance Monitoring, Analytics Press.
2.McKinney, W. (2017). Python for Data Analysis: Data Wrangling with
Pandas, NumPy and IPython.2nd edition. O’Reilly Media.

230
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Data Visualization and Story Telling Lab
Academic Year III
Semester V
Number of Credits 1
Course Prerequisite
Course Synopsis This course of study builds on the skills gained by
students in Java programming Students will design
object-oriented applications with Java and will create
Java programs using hands-on, engaging activities
Course Outcomes:
At the end of the course students will be able to:
CO1 Design and create data visualizations.
CO2 Conduct exploratory data analysis using visualization.
CO3 Craft visual presentations of data for effective communication.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO PO PO PSO1 PSO PSO
6 7 8 2 3
CO1 3 2 1 1 - - - - 1 2 -

CO2 3 3 - 2 - - - - - 3 -

CO3 3 - 3 3 - - - - 3 - -

Average 3 1.6 1.3 2 - - - - 1.3 1.6 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

231
2 2
Unit Content & Competencies
1 Analysis of Data with Tableau (C4: Analysis)
2 Formatting and Exporting of Graphs (C6: Synthesis)

3 Using the Rows and Columns Shelves (C3: Application)

4 Understanding the Marks Card (C1: Knowledge)

5 Removing Outliers Using Scatterplot and Filtering and Groups

6 Analyzing Data-Related over Time Using Date Hierarchies, Trend Lines,


and Box (C4: Analysis)
7 Implementation of Linear Regression (C6: Synthesis)
8 Using Visual Story Points in Tableau (C3: Application)

9 Using Visualization Science to Influence Business Decisions (C3:


Application)

10 Storyboarding Your Presentation (C6: Synthesis)

232
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

233
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Practical Logbook/ Record Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Stephen Few, Information Dashboard Design: Displaying
Data for At-a-glance Monitoring, Analytics Press.
2.Visual Analytics with Tableau, 1st Edition, by Alexander
Loth

234
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title MATLAB
Academic Year III
Semester V
Number of Credits 2
Course Prerequisite Programming skills
Course Synopsis In this course, students will learn features of MATLAB as a
programming tool.
Course Outcomes:
At the end of the course students will be able to:
CO1 Learn features of MATLAB as a programming tool.
CO2 learn graphic features of MATLAB
CO3 Use MATLAB as a simulation tool
CO4 Work as a ‘MATLAB programmer’ in the industry because of the hands-on
practical sessions
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO
3
CO1 3 1 3 2 - - - - 2 2 -

CO2 3 1 - - 1 - - - - - -

CO3 3 - - - - - - - 1 - -

CO4 3 2 2 3 2 - - - 1 1 -

Average 3 1 1.2 1.2 0.7 - - - 1 0.7 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week

235
4 4
Unit Content & Competencies
1 Introduction to MATLAB: To define & use variables, vectors, Matrices & its
functions in MATLAB. To study various arithmetic operators and mathematical
functions in MATLAB. To create & use m-files. (C1: Knowledge)
2 Practicing MATLAB environment with simple exercises to familiarize Command
Window, History, Workspace, Current Directory, Figure window, Edit window,
Shortcuts, Help files. (C1: Knowledge)
3 Write a MATLAB program to obtain linear convolution of the given sequences.
(C1: Knowledge)
4 To study on basic Matrix Constructors and Operations. (C1: Knowledge)
5 To study on Matrix Bitwise operations, Relational Operations and Logical
Operations. (C1: Knowledge)
6 To write and execute programs that demonstrate on Control Structures (If-Else, If-
elseif –else, Select) using SCI Notes. (C1: Knowledge)
7 To write and execute programs that demonstrate on Control Structures (for, while,
break and continue) using SCI Notes. (C1: Knowledge)
8 To work on basic graphics -- 2D Plots. (C1: Knowledge)
9 To develop a program that finds out whether a tank is overflowing or not wrt the
shape of the tank, its dimensions and rate of flow.
(C1: Knowledge)
10 Solution of Linear equations for Underdetermined and Overdetermined cases.
(C1: Knowledge)
11 Examples of MATLAB Applications (C3: Application)

236
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

237
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: 1.Gilat, Amos, 2008, “MATLAB An Introduction With Applications”, 3rd


Ed., JOHN WILEY & SONS, INC., USA .
2.Hunt, Brian R. & others, 2001, “A Guide to MATLAB for Beginners and
Experienced Users”, Cambridge University Press, USA.
3.McMahon, David, 2007,” MATLAB Demystified”, The McGraw-Hill
Companies, USA.
4.Davis, Timothy A. & Sigmon, Kermit, 2007, “MATLAB Primer”, 7th
Ed., Chapman & Hall/CRC, USA.

238
SEMESTER - VI

Course Code Course Title

Web Development using PHP

Web Development using PHP Lab

Essentials of Cyber Security

Capstone Project

PE-IV

Enterprise Mobile Application Development

PE-IV Lab

Enterprise Mobile Application Development


Lab
Minor Electives Courses-VI

Applications of Cloud Systems (CC)

Big Data Analytics & applications (AIML)

Minor Electives Courses-VI Lab

Applications of Cloud Systems Lab (CC)

Big Data Analytics & applications Lab (AIML)

SEC-IV

Drone Remote Sensing

239
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Web Development using PHP

Academic Year III


Semester VI
Number of Credits 2
Course Prerequisite HTML basics
Course Synopsis In this course, students will learn about the use of
control structures, data types used in PHP, Implement
database connectivity

Course Outcomes:
At the end of the course students will be able to:
CO1 Explain the use of control structures, data types used in PHP
CO2 Develop Dynamic Website that can interact with different kinds of
Database Languages.
CO3 Implement database connectivity
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PS
O3
CO1 3 3 2 1 - - - - 1 2 -

CO2 2 3 2 2 - - - - 2 - -

CO3 - 3 2 - - - - - - 2 -

Average 1.6 3 2 1 - - - - 1 1.6 -

Course Content:

240
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction to PHP:

Evolution of PHP & its comparison Interfaces to External systems (C1:


Knowledge)

Describe Hardware and Software requirements (C2: Comprehension)

Explain PHP Scripting (C2: Comprehension)

Basic PHP Development (C1: Knowledge)

Working of PHP scripts, Basic PHP syntax, PHP data types (C3:
Application)

Displaying type information (C4: Analysis)

Testing for a specific data type (C5: Evaluation)

Describe Changing type with Set type (C2: Comprehension)

Explain Operators, Variable manipulation (C2: Comprehension)

Describe Dynamic variables and Variable scope (C2: Comprehension)

241
2 Control Statements:

Analyze if () and elseif () condition Statement, The switch statement (C4:


Analysis)

Using the? Operator, Using the while () Loop, the do while statement, Using
the for () Loop (C3: Application)

Functions:

Evaluate Function definition, Creation, Returning values, Library Functions


(C1: Knowledge) (C5: Evaluation)

Distinguish User Defined functions, Dynamic function, default arguments,

Passing arguments to a function by value (C4: Analysis)

String Manipulation:

Apply Formatting String for Presentation, Formatting String for Storage,


Joining and Splitting String (C3: Application)

Comparing String (C4: Analysis)

Array:

Analyze Anatomy of an Array (C4: Analysis)

Creating index based and Associative array (C6: Synthesis)

Implement Looping array using each () and foreach () loop (C3:


Application)

242
3 Forms:

Working with Forms, Super global variables, Super global array (C3:
Application)

Explain the process of Importing user input, accessing user input, Combine
HTML and PHP code (C2: Comprehension)

Implement Using hidden fields, Redirecting the user (C3: Application)

Working with File and Directories:

Understanding file & directory, Opening and closing a file, Coping,


renaming and deleting a file (C2: Comprehension)

Working with directories, File Uploading & Downloading (C3:


Application)

Generating Images with PHP: Basics computer Graphics, Creating Image

(C6: Synthesis)
4 Database Connectivity with MySQL:

Introduction to RDBMS (C1: Knowledge)

Implement Connection with MySQL Database (C3: Application)

Performing basic database operation (DML) (Insert, Delete, Update,


Select) (C3: Application)

243
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 24
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 30

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

244
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. PHP: The Complete Reference, “Steven Holzner”, Tata
McGraw Hill
2. Programming PHP, “Kevin Tetroi”, O' Reilly.
3.Robin Nixon, Learning PHP, MySQL, and JavaScript,
Shroff/O'Reilly.

245
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Web Development using PHP Lab

Academic Year III


Semester VI
Number of Credits 2
Course Prerequisite HTML basics
Course Synopsis In this course, students will learn about the use of control
structures, data types used in PHP, Implement database
connectivity.

Course Outcomes:
At the end of the course students will be able to:
CO1 Explain the use of control structures, data types used in PHP
CO2 Develop Dynamic Website that can interact with different kinds of Database
Languages.
CO3 Implement database connectivity
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 1 - - - - 1 2 - -

CO2 2 - - 2 - - - - 2 - - -

CO3 1 2 3 - - - - - - 2 - -

Average 2 1.3 1.3 1 - - - - 1 1.6 - -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4

246
Unit Content & Competencies
1 Get name of the user from a form and show greeting text (C1: Knowledge)

Write a php program to check whether given number is palindrome or not


2 (C1: Knowledge)
3 Write a php program to check whether given number is Armstrong or not
(C1: Knowledge)

4 Write a php program to find largest values of two numbers using nesting of
function. (C1: Knowledge)
5 Develop a Mathematical calculator program. (C6: Synthesis)
6 Write a Age calculator program. (C1: Knowledge)
7 Write a php program to check whether given number is String palindrome or not
(C1: Knowledge)
8 Write a php program using function. (C1: Knowledge)
9 Create a PHP page for login page without sql connection.
10 Write a php program to Array manipulation. (C1: Knowledge)
11 Write a php program to design personal information (C1: Knowledge)
12 Create a PHP page for login page with sql connection. (C6: Synthesis)
13 Write a php program to Read from existing file. (C1: Knowledge)
14 Write a php program to Write a file (C1: Knowledge)
15 Write a php program to calculate Date and Time function. (C1: Knowledge)
16 Write a php program to design Curriculum Vitae. (C1: Knowledge)
17 Create a web page to advertise a product of the company using images and audio. (C1:
Knowledge)
18 Create a PHP page for login system using session. (C1: Knowledge)

247
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

248
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz √
VIVA √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process 2. Student’s Feedback

References: List of reference books


1. PHP: The Complete Reference, “Steven Holzner”, Tata
McGraw Hill
2.Programming PHP, “Kevin Tetroi”, O' Reilly.
3.Robin Nixon, Learning PHP, MySQL, and JavaScript,
Shroff/O'Reilly.

249
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Essentials of Cyber Security
Academic Year III
Semester VI
Number of Credits 3
Course Prerequisite Networks and Systems
Course Synopsis In this course, students will learn about networks and computer
systems to secure an IT infrastructure. Design, develop, test and
evaluate secure software.
Course Outcomes:
At the end of the course students will be able to:
CO1 Analyze and resolve security issues in networks and computer systems to
secure an IT infrastructure. Design, develop, test and evaluate secure software
CO2 Develop policies and procedures to manage enterprise security risks
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3 PSO4

CO1 3 2 3 2 - - - - 2 2 3 -

CO2 2 2 - - 1 - - - - - - -

Average 2.5 2 1.5 1 0.5 - - - 1 1 1.5 -

L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week


3 3
Unit Content & Competencies

250
1 The Security Environment:
Explain about Threats, vulnerabilities, and consequences, Advanced persistent threats,
The state of security today (C1: Knowledge)
Describe Principles of Cybersecurity: The interrelated components of the computing
environment (C2: Comprehension)
Explain Cybersecurity Management Concepts: Security governance, Management
models, roles, and functions (C2: Comprehension)
2 Security Plans and Policies:
Evaluate Levels of planning, Planning misalignment (C5: Evaluation)
Analyze The System Security Plan (SSP) (C4: Analysis)
Policy development and implementation (C3: Application)
Describe Security Standards and Controls (C2: Comprehension)
Analyze Certification and accreditation (C&A) (C4: Analysis)
Apply Risk Management: Principles of risk, Types of risk, Risk strategies, The Risk
Management Framework (C3: Application)
3 Private ordering solutions:
Analyze Regulation and Jurisdiction for global Cyber security (C4: Analysis)
Evaluate Copyright-source of risks, Pirates, Internet Infringement (C5: Evaluation)
4 Legal Aspects of Cyber Security:
Describe Fair Use, postings, criminal liability, First Amendments, Data Loss (C2:
Comprehension)
Analyze Ethics, Legal Developments, Cyber security in Society, Security in cyber
Laws (C4: Analysis)

251
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 39
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

252
Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz
VIVA
Assignment / Presentation √ √ √
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Cyber security Essentials by Charles J. Brooks, Christopher Grow, et al
2.Cyber security – Attack and Defense Strategies by Yuri Diogenes, 2018
3.Jonathan Rosenoer, “Cyber Law: The law of the Internet”, Springer-
Verlag, 1997. Mark F Grady, FransescoParisi, “The Law and Economics
of Cyber Security”, Cambridge University Press, 2006

253
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Capstone Project
Academic Year III
Semester VI
Number of Credits 1
Course Prerequisite Programming skills
Course Synopsis The purpose of the Capstone Project is for the students to
apply theoretical knowledge acquired during the
specialization program to a project involving actual data in
a realistic setting.
Course Outcomes:
At the end of the course students will be able to:
CO1 Integrate and/or apply what they have learned in their general
education and major/minor coursework (and co-curricular activities,
as appropriate).
CO2 Implement theoretical and Practical knowledge gained during the course
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 1 2 1 3 1 1 2

CO2 1 2 2 3 2 1 2

Average 1 2 1.5 3 1.5 1 2

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

254
Unit Content & Competencies
(GUIDELINES FOR CAPSTONE PROJECT)
The aim of the Capstone Project(s) is to lay a foundation of Practical
implementation for the students during 6th Semester of BCA Programme.
Each student should carry out Capstone Project(s) using the software
development tools/languages/technologies that they have learnt and/or have
studied during the concerned semester. It should be compulsorily done by the
student in-house under the supervision of the staff(s) assigned by Head of the
Department/Director/Principal.
The Capstone Project(s) will be assessed by the concerned supervisor(s) and
shall award marks out of 100 for each student as Internal and External
Assessment.

CO1 CO2 CO3 CO4 CO5 CO6


Quiz
VIVA √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


NA

255
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Enterprise Mobile Application Development
Academic Year III
Semester VI
Number of Credits 2
Course Prerequisite Programming concepts
Course Synopsis In this course, Student will learn about Mobile application
and web application development.
Course Outcomes:
At the end of the course students will be able to:
CO1 Ability to apply general programming knowledge in the field of
developing mobile applications
CO2 Understanding of the specific requirements, possibilities and challenges when
developing for a mobile context
CO3 Design User Interface and develop activity for Android App
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 3 1 2 - 1 - - 2 -

CO2 3 2 3 - - 3 - - - 2

CO3 3 1 - 1 - - - - 1 1

Average 3 2 1.3 1 - 1.3 - - 1 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

256
Unit Content & Competencies
1 Mobile Device:

Describe about Mobile Phone Evolution, Mobile Handset Characteristics, Bluetooth,


Display, Keypad, Camera, Mobile Handset Categories, Handset Components, Handset
Design, Handset hardware architecture, Elements inside a Mobile Handset (C2:
Comprehension)

Analyze Hardware Architecture Evolution, Hardware architectural trends, CPU and

Memory, Internal storage, Handset Power Oberoi (C4: Analysis)


Mobile Application Development –
2
Describe Mobile Application Development Paradigm (C2: Comprehension)

Evaluate Mobile Programming Tools, Mobile Application Evolution, Thin Client, Fat

Client (C5: Evaluation)

Analyze Future of Mobile App Development (C4: Analysis)

Implement Mobile Client Server App Architecture (C3: Application)

Develop Mobile App Programming in different languages (C6: Synthesis)

Analyze Pros and Cons of Mobile Web App, SIM based (C4: Analysis)

Apply Mobile App Development, SIM as a Platform, SIM as Service Differentiator

(C3: Application)

257
3 Web Application –

Explain about World Wide Web, Web Application, Web Application Architecture,
Web Server, Web Server Features, Web Application Server, Mobile Internet Access
(C2: Comprehension)

Interpret Mobile Web browser Evolution, Mobile Web Development Approaches,

Dynamic Content (C3: Application)


4 Mobile Operating System –

Introduction to Mobile Operating Systems and why they are needed (C1: Knowledge)

Compare Open Platforms, Mobile OS Features, Symbian, BlackBerry, Android, IOS,


Windows, Tizen, Ubuntu, etc. (C4: Analysis)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 24
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 30

258
Assessment Methods:
Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz
VIVA
Assignment / Presentation √ √ √
Unit test √ √ √
Practical Log Book/ Record Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Android Programming with Kotlin for beginners by John Horton
2.Android app development for dummies by Michael Burton, Wiley
publisher

259
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Enterprise Mobile Application Development Lab

Academic Year III


Semester VI
Number of Credits 2
Course Prerequisite Programming concepts
Course Synopsis In this course, Student will learn about Mobile application
and web application development
Course Outcomes:
At the end of the course students will be able to:
CO1 Ability to apply general programming knowledge in the field of
developing mobile applications
CO2 Understanding of the specific requirements, possibilities and challenges when
developing for a mobile context
CO3 Design User Interface and develop activity for Android App
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 2 3 3 2 - 2 - - 2 - -

CO2 2 2 3 3 - 3 - - - 2 -

CO3 2 1 3 1 - 1 - - 1 1 -

Average 2 1.3 3 1 - 1 - - 1 1 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4

260
Unit Content & Competencies
1 Develop an application that uses GUI components, Font and Colors. (C6: Synthesis)

2 Develop an application that uses Layout Managers and event listeners. (C6: Synthesis)
3 Develop a native calculator application. (C6: Synthesis)

4 Write an application that draws basic graphical primitives on the screen.


(C1: Knowledge)
5 Develop an application that makes use of database. (C6: Synthesis)
6 Develop an application that makes use of RSS Feed. (C6: Synthesis)
7 Implement an application that implements multi-threading. (C3: Application)
8 Develop a native application that uses GPS location information. (C6: Synthesis)
9 Implement an application that creates an alert upon receiving a message.
(C3: Application)
10 Write a mobile application that creates alarm clock. (C1: Knowledge)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

261
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

Mapping of Assessment with COs

CO1 CO2 CO3


Quiz
VIVA √ √ √
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1. Android Programming with Kotlin for beginners by John
Horton
2. Android app development for dummies by Michael Burton,
Wiley publisher

262
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Big data analytics and Applications
Academic Year III
Semester VI
Number of Credits 3
Course Prerequisite Data Analytics
Course Synopsis In this course, Student will learn about Hadoop
distributions, configuring Hadoop and performing File
management tasks
Course Outcomes:
At the end of the course students will be able to:
CO1 Get familiar with Hadoop distributions, configuring Hadoop and
performing File management tasks
CO2 Experiment MapReduce in Hadoop frameworks
CO3 Implement MapReduce programs in variety applications
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 3 1 2 - 1 - - 2 - -

CO2 3 - 3 - - 3 - - - 2 -

CO3 3 1 - 1 - - - - 1 1 -

Average 3 1.3 1.3 1 - 1.3 - - 1 1 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies

263
1 Introduction to Big Data

Introduction to Big Data, Big Data characteristics (C1: Knowledge)

Evaluate Challenges of Conventional System, Types of Big Data, Intelligent data


analysis, Traditional vs. Big Data business approach (C5: Evaluation)

Case Study of Big Data Solutions.


2 Hadoop

Analyze History of Hadoop (C4: Analysis)

Describe Hadoop Distributed File System: Physical organization of Compete Nodes


(C2: Comprehension)

Explain Components of Hadoop (C2: Comprehension)

Analyzing the Data with Hadoop, Scaling Out, Hadoop Streaming (C4: Analysis)

Design of HDFS, Java interfaces to HDFS Basics (C6: Synthesis)

Developing a Map Reduce Application, How Map Reduce Works, Anatomy of a Map
Reduce Job run (C6: Synthesis)

Evaluate Failures, Job Scheduling, Shuffle and Sort, Task execution (C5: Evaluation)

Compare Map Reduce Types and Formats, Map Reduce Features (C4: Analysis)

Design Hadoop environment. Setting up a Hadoop Cluster, Cluster specification,


Cluster Setup and Installation (C6: Synthesis)
3 Mining Data Stream:

Introduction to Streams Concepts, Stream Data Model and Architecture, Stream


Computing (C1: Knowledge)

Sampling Data in a Stream, Filtering Streams, Counting Distinct Elements in a


Stream, Estimating moments, Counting oneness in a Window, Decaying Window
(C5: Evaluation)

264
Real time Analytics Platform (RTAP) applications, Case Studies (C3: Application)

Apply Real Time Sentiment Analysis, Stock Market Predictions. Using Graph
Analytics for Big Data: Graph Analytics (C3: Application)
4 Frameworks:
Applications on Big Data Using Pig and Hive (C3: Application)
Data processing operators in Pig, Hive services, HiveQL, Querying Data in Hive
Fundamentals of HBase and ZooKeeper (C1: Knowledge)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 39
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

265
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Viva-voce Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
Assignment / Presentation √ √ √
Unit test √ √ √
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1) Michael Berthold, David J. Hand, “Intelligent Data Analysis”,
Springer, 2007
2) Bill Franks , “Taming The Big Data Tidal Wave: Finding
Opportunities In Huge Data Streams With Advanced
Analytics”, Wiley

266
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Big data analytics and Applications Lab
Academic Year III
Semester VI
Number of Credits 1
Course Prerequisite Data Analytics
Course Synopsis In this course, Student will learn about Hadoop distributions,
configuring Hadoop and performing File management tasks
Course Outcomes:
At the end of the course students will be able to:
CO1 Get familiar with Hadoop distributions, configuring Hadoop and
performing File management tasks
CO2 Experiment MapReduce in Hadoop frameworks
CO3 Implement MapReduce programs in variety applications
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO
3
CO1 2 3 1 2 - 3 - - 2 - -

CO2 2 - 3 - - - - - - 2 -

CO3 2 1 - 1 - - - - 1 1 -

Average 2 1.3 1.3 1 - 1 - - 1 1 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2

267
Unit Content & Competencies
1 Install Apache Hadoop (C6: Synthesis)

Develop a MapReduce program to calculate the frequency of a given word in a given


2 file. (C6: Synthesis)
3 Develop a MapReduce program to calculate the frequency of a given word in a given
file. (C6: Synthesis)

4 Develop a MapReduce program to find the grades of student’s. (C6: Synthesis)


5 Develop a MapReduce program to implement Matrix Multiplication. (C6: Synthesis)
6 Develop a MapReduce to find the maximum electrical consumption in each year given
electrical consumption for each month in each year (C6: Synthesis)
7 Develop a MapReduce to analyze weather data set and print whether the day is shinny
or cool day. Develop a MapReduce to analyze weather data set and print whether the
day is shinny or cool day. (C6: Synthesis)
8 Implement matrix multiplication with Hadoop Map Reduce. (C3: Application)
9 Installation of PIG, Write Pig Latin scripts sort, group, join, project, and filter your data.
(C6: Synthesis)
10 Run the Pig Latin Scripts to find Word Count. (C6: Synthesis)
11 Installation of HIVE, Use Hive to create, alter, and drop databases, tables, views,
functions, and indexes. (C6: Synthesis)

268
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 24
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

269
Mapping of Assessment with COs

CO1 CO2 CO3


Quiz
VIVA √ √ √
Assignment / Presentation
Unit test
Clinical assessment
Clinical/Practical Log Book/ Record √ √ √
Book
Mid Semester Examination 1
Mid Semester Examination 2
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1) Michael Berthold, David J. Hand, “Intelligent Data
Analysis”, Springer, 2007
2) Bill Franks , “Taming The Big Data Tidal Wave: Finding
Opportunities In Huge Data Streams With Advanced
Analytics”, Wiley
3) Hadoop in Practice, Alex Holmes, Publisher: Manning
4) Pro Hadoop, Jason Venner, Apress Publications

270
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Applications of Cloud Systems
Academic Year III
Semester VI
Number of Credits 3
Course Prerequisite Cloud computing architecture and deployment models
Course Synopsis In this course, students will learn various applications of
Cloud systems
Course Outcomes:
At the end of the course students will be able to:
CO1 Explain cloud computing, virtualization and classify services of cloud
computing
CO2 Illustrate architecture and programming in cloud
CO3
Describe the platforms for development of cloud applications and List the
application of cloud.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3

CO1 3 2 1 1 - - - - 1 2 -

CO2 3 3 1 2 - - - - 2 3 -

CO3 3 2 3 3 - - - - 3 2 -

Average 3 2.3 1.6 2 - - - - 2 2.3 -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3

271
Unit Content & Competencies
1 Introduction

Describe Cloud Computing at a Glance, The Vision of Cloud Computing, Defining


a Cloud, A Closer Look (C2: Comprehension)

Analyze Cloud Computing Reference Model, Characteristics and Benefits,


Challenges Ahead, Historical Developments, Distributed Systems (C4: Analysis)

Virtualization, Web 2.0, Service-Oriented Computing, Utility-Oriented


Computing, Building Cloud Computing Environments (C6: Synthesis)

Application Development, Infrastructure and System Development, Computing


Platforms and Technologies (C3: Application)

Distinguish Amazon Web Services (AWS), Google App Engine, Microsoft Azure,
Hadoop, Force.com and Salesforce.com (C4: Analysis)
Concurrent Computing:
2
Explain Thread Programming, Introducing Parallelism for Single Machine
Computation

Programming Applications with Threads (C1: Knowledge)

What is a Thread? Thread APIs, Techniques for Parallel Computation with Threads
(C1: Knowledge)

Discuss Multithreading with Aneka (C2: Comprehension)

Introducing the Thread Programming Model, Aneka Thread vs. Common Threads
(C1: Knowledge)

Programming Applications with Aneka Threads, Aneka Threads Application Model


(C3: Application)

Domain Decomposition: Matrix Multiplication, Functional Decomposition: Sine,


Cosine, and Tangent.

272
3 Data Intensive Computing:

Introduce Map-Reduce Programming (C1: Knowledge)

What is Data-Intensive Computing (C1: Knowledge)

Characterizing Data-Intensive Computations, Challenges Ahead

Distinguish Technologies for Data-Intensive Computing, Storage Systems,


Programming Platforms (C4: Analysis)

Introducing the MapReduce Programming Model (C1: Knowledge)

Application of MapReduce Programming (C3: Application)


4 Cloud Platforms in Industry:

Describe Cloud Platforms in Industry (C2: Comprehension)

Compare Amazon Web Services, Compute Services, Storage Services,


Communication Services, Additional Services (C4: Analysis)

Implement Google AppEngine, Architecture and Core Concepts, Application Life-


Cycle

Cost Model (C3: Application)

Analyze Microsoft Azure, Azure Core Concepts, SQL Azure, Windows Azure
Platform Appliance (C4: Analysis)

Cloud Applications: Scientific Applications, Healthcare: ECG Analysis in the Cloud,


Social Networking, Media Applications, Multiplayer Online Gaming (C3:
Application)

273
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 39
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 3
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Viva-voce Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

274
Mapping of Assessment with COs

CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √ √
VIVA
Assignment / Presentation √ √ √
Unit test
Practical Log Book/ Record Book
Mid Semester Examination 1 √ √ √
Mid Semester Examination 2 √ √ √
University Examination √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi Mastering
Cloud. Computing McGraw Hill Education
2. Dan C. Marinescu, Cloud Computing Theory and Practice, Morgan
Kaufmann, Elsevier 2013

275
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Applications of Cloud Systems Lab
Academic Year III
Semester VI
Number of Credits 1
Course Prerequisite Cloud computing architecture and deployment models
Course Synopsis In this course, students will learn various applications of Cloud
systems
Course Outcomes:
At the end of the course students will be able to:
CO1 develop web applications in cloud
CO2 learn the design and development process involved in creating a cloud-based
application
CO3 learn to implement and use parallel programming using Hadoop
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program Specific
Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PSO1 PSO2 PSO3 PSO
4
CO1 3 2 1 1 - - - - 1 2 - -

CO2 2 3 1 2 - - - - 2 3 - -

CO3 1 2 3 3 - - - - 3 2 - -

Average 2 2.3 1.6 2 - - - - 2 2.3 - -

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies

276
1 Install Oracle Virtual box and create two VMs on your laptop (C6: Synthesis)
Test ping command to test the communication between the guest OS and Host OS ( C5:
2 Evaluation)
3 Install Hadoop single node setup. (C6: Synthesis)
4 Develop a simple Hadoop application called Word Count. It counts the number of
occurrences of each word in a given input set. (C6: Synthesis)
5 Develop hadoop application to process given data and produce results such as finding
the year of maximum usage, year of minimum usage. (C6: Synthesis)
6 Establish an AWS account. Use the AWS Management Console to launch an EC2
instance and connect to it. (C6: Synthesis)
7 Use the Zookeeper to implement the coordination model in Problem 10. (C3:
Application)
8 Develop a Hello World application using Google App Engine (C6: Synthesis)
9 Develop a Guestbook Application using Google App Engine. (C6: Synthesis)
10 Develop a Windows Azure Hello World application using.
(C6: Synthesis)

Learning Strategies Contact Hours


Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

277
Assessment Methods:
Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

Mapping of Assessment with COs

CO1 CO2 CO3


Quiz
VIVA √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √
Mid Semester Examination 1
University Examination

Feedback Process Student’s Feedback

References: List of reference books


1.Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi
Mastering Cloud. Computing McGraw Hill Education

2. Dan C. Marinescu, Cloud Computing Theory and Practice,


Morgan Kaufmann, Elsevier 2013.

278
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Drone Remote Sensing
Academic Year III
Semester VI
Number of Credits 2
Course Prerequisite Networks and systems
Course Synopsis In this course, Students will study about basic components of
remote Sensing and gain knowledge about various surveying
techniques
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand basic components of remote Sensing
CO2 Obtain knowledge of the sensor characteristics of various RS Systems
CO3 Gain knowledge of various surveying methods and their data generation and
output
CO4 Gaining knowledge about various surveying techniques
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO1 PO2 PO3 PO4 PO5 PO PO7 PO8 PSO1 PSO PSO3
6 2
CO1 3 3 3 2 - - - - 2 2 -

CO2 2 3 - 2 1 - - - - - -

CO3 - 3 - 2 - - - - - - -

CO4 2 3 2 2 2 - - - 1 1 -

Average 1.7 3 1.2 2 0.7 - - - 0.7 0.7 -

Course Content:

279
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
4 4
Unit Content & Competencies
1 Survey of an area by Chain Survey (Closed Traverse) & Plotting (C4: Analysis)
2 Chaining across Obstacles (C6: Synthesis)

3 Determination of two inaccessible points with Compass (C5: Evaluation)

4 Survey of a given area by Prismatic Compass (Closed Traverse) and plotting after
adjustment
5 Radiation, Intersection Methods of Plane Table Surveying (C6: Synthesis)

6 Two Point and Three Point Problem in Plane Table Survey (C6: Synthesis)

7 Traversing by Plane Table Surveying (C6: Synthesis)


8 Fly Leveling (Differential Leveling) (C6: Synthesis)
9 An exercise of L.S. and Plotting (C3: Application)
10 Two Exercises on Contouring (C3: Application)
11 Basics of remote surveying and GIS (C1: Knowledge)
12 Advanced Surveying (C3: Application)
13 Post processing in drone surveying (C3: Application)
14 Advanced aerial systems and applications (C3: Application)
15 Image processing (C6: Synthesis)
16 Graphics Designing (C6: Synthesis)

280
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

281
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3


Quiz
VIVA √ √ √
Practical Log Book/ Record Book √ √ √

Feedback Process Student’s Feedback

References: 1.B.C. Punmia, “Surveying Vol.2”, Laxmi Publications pvt. Ltd.,


New Delhi, 2018
2. K.R. Arora, “Surveying Vol. 1” Standard Book House, New Delhi,
2019
3.T.M Lillesand,. R.W Kiefer,. and J.W Chipman, Remote sensing
and Image interpretation , 5th edition, John Wiley and Sons India

282
Program Electives pool

PE-I Algorithms Design and Digital Electronics Game Programming


Complexity Theory with HTML5

PE-II Advances in Operating IoT Networks and Industrial and Medical


Systems Protocols IoT

PE-III Computer Graphics & Automata Theory Reinforcement Learning


Vision and Computability

PE-IV Enterprise Mobile Compiler Design Image and Video


Application Development Processing

283
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Digital Electronics
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, student can acquire the basic knowledge of
measurement principles and their application in electrical
engineering
Course Outcomes:
At the end of the course students will be able to:
CO1 The student can acquire the basic knowledge of measurement principles
and their application in electrical engineering.
CO2 The students will be able to effectively employ electrical and electronics
instruments for measurements of various electrical quantities.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO PO PO PSO1 PSO2 PSO
1 3 4 6 7 8 3

CO1 - - 1 - - 2 - 2 - -

CO2 2 3 1 2 - - - - - -

Average 1 1.5 1 1 1 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 - 2
Unit Content & Competencies

284
1 Number system and codes:

Implement Binary, octal, hexadecimal and decimal Number systems and their
inter conversion (C3: Application)

Apply BCD numbers (8421-2421), gray code, excess–3 code, cyclic code, code
conversion, ASCII, EBCDIC codes (C3: Application)

Apply Binary addition and subtraction, signed and unsigned binary numbers, 1's
and 2's complement representation (C3: Application)
2 Boolean Algebra: Basic logic circuits:

Implement Logic gates (AND, OR, NOT, NAND, NOR, Ex-OR, Ex NOR and
their truth tables) (C3: Application)

Implement Universal Gates, Laws of Boolean algebra, De-Morgan's theorem,


Min term, Max term, POS, SOP, KMap (C3: Application)

Simplification by Boolean theorems, don’t care condition


3 Logic Families:

Introduction to digital logic family such as RTL, DTL, TTL, ECL, CMOS, IIR,
HTL etc., their comparative study (C1: Knowledge)

Basic circuit, performance characteristics, Wired logic, open collector output etc
(C1: Knowledge)
4 Combinational Logic:

Implement The Half adder, the full adder, subtractor circuit. Multiplexer
demultiplexer, decoder (C3: Application)

Implement BCD to seven segment Decoder, encoders. Flip flop and Timing
circuit: set-reset laches, D-flipflop, R-S flip-flop, J-K Flip-flop (C3:
Application)

Master slave Flip flop, edge triggered flip-flop, T flip-flop (C3: Application)

285
Learning Strategies and Contact Hour

Learning Strategies Contact Hours


Lecture 26
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

286
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Digital Fundamentals by Morris and Mano, PHI Publication
2. Fundamental of digital circuits by A. ANANDKUMAR, PHI Publication
3. Digital Fundamentals by FLOYD & JAIN, Pearsons Pub
4. Fundamentals of Logic Design by Charles H. Roth Thomson

287
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Digital Electronics Lab
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite NIL
Course Synopsis This course will help the students to acquire the basic
knowledge of measurement principles and their application
in Electrical Engineering.
Course Outcomes:
At the end of the course students will be able to:
CO1 The student can acquire the basic knowledge of measurement principles and
their application in electrical engineering.
CO2 The students will be able to effectively employ electrical and electronics
instruments for measurements of various electrical quantities.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO PO8 PSO PSO PSO3
1 3 4 6 1 2
CO1 - - 1 - 2 2

CO2 2 3 1 2 - -

Average 1 1.5 1 1 1 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4
Unit Content & Competencies

288
To verify (a) Demorgan’s Theorem for 2 variables (b) The sum-of product and
1
product-of-sum expressions using universal gates. (C5)
To design and implement 4-bit Parallel Adder/ subtractor using IC 7483 (C6)
2
To realize (a) 4:1 Multiplexer using gates (b) 3-variable function using IC

3
74151(8:1 MUX) (c) 1:8 Demux and 3:8 Decoder using IC74138 (C6)
To realise the following flip-flops using NAND Gates. (a) Clocked SR Flip-
4
Flop (b) JK Flip-Flop (C6)
5 To realize the following shift registers using IC7474 (a) SISO (b) SIPO
(c)PISO (d) PIPO (C6)
6 To realize the Ring Counter and Johnson Counter using IC7476 (C6)

7 To realize the Mod-N Counter using IC7490 (C6)

8 To capture CMOS inverter schematic and check for its functionality (selecting
suitable technology 130nm and below, connecting 0.01pF of load capacitance
and setting lengths & widths of transistor geometries) (C3)
9 To capture schematic of NAND, NOR, AND using NAND and Inverter, OR
using NOR & Inverter. Verify functionality of gates using CMOS logic,
measure propagation delay of gates by setting widths of transistors (C3)

289
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Game Programming with HTML5
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite NIL
Course Synopsis HTML5 is now popular in developing Games and related
applications. This course helps in understanding the
fundamentals of Game Programming in HTML5 along
with the elements of programming in two-dimensional
environment for the creation of Games. This Course also
involves creation of games for the desktop machine and
Internet using the different tools available.
Course Outcomes:
At the end of the course students will be able to:
CO1 Understanding the fundamentals of Game Programming in HTML5
CO2 Understanding the elements of programming in two-dimensional
environment for the creation of Games.
CO3 Create the games for the desktop machine and Internet using the different
tools available in a major programming language like HTML5.
CO4 Understanding the fundamentals of HTTP Polling.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO7 PO PSO1 PSO2 PSO
1 3 4 8 3

CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

290
CO3 2 1 - 3 - 2

CO4 - - 1 - - -

Average 2.3 1.3 1 2.3 1 2.3

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 - 2
Unit Content & Competencies
1 Introduction: Using the Framerate Class, Using Active Rendering (C1)

Creating Custom Rendering Thread, Creating an Active Rendered Thread (C6)

Changing the Display Mode, Active Rendering in Full-Screen Display Mode.


Input: Handling Keyboard Input, Keyboard Improvements, Handling Mouse
Input, Relative Mouse Movement.

Transformations: Using the Vector 2f Class, Using Polar Coordinates,


Understanding Points and Vectors, Using Matrix Transformations, Row-Major
vs Column-Major Matrices (C3)
2 Intersection Testing: Point in Polygon Testing, Using AABB (C3)

Using Circles for Intersections, Using the Separating Axis Method, Using the
Line-Line Overlap Method, Using the Rectangle-Rectangle Overlap Method,
Optimizing the tests (C3)

Development Setup: Exploring the Game Library, Introduction to XML,


Deploying an Applet, Executable JAR, Deploying Multiple Apples. Swing
Animation: Component Animator, Repaint Collector, Loop Governor,
Animated Component. Animation Library: Component Painter, Component
Updater (C6)

291
3 Game Architecture: Interfaces, Inheritance, Model-View-Controller,
Component View MVC (C3)

Data Driven Design. A* Algorithm: Cartographer, NodeInfo, AStar, AStarTest,


SpaceTester, GridCartographer, GradientCartographer, TankConsole,
TankOperator, StateSpaceMode, TankCartographer, DefaultTankOperator (C6)

4 Describe HTTP Polling: Reusable Client-Side Code (C2)

Implement Game-Specific Client-Side Code (C3)

Implement Reusable Server-Side Code, Game-Specific Server-Side Code.


HTTP Pulling: Reusable Client-Side Code, Game-Specific Client-Side Code,
Server-Side Code. (C3)
Note: The course plan included as an annexure has the details of each unit with the number of
hours and mode of delivery and pedagogical approach.

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 26
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

292
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

293
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


Textbooks:

1. James L. Williams, Learning HTML5 Game Programming: A Hands-on


Guide to Building Online Games Using Canvas, SVG, and We (1 ed.),
Pearson Education India, 2011. ISBN 978-0321767363.
References:
1.Timothy M. Wright, Fundamental Game Programming with Java (1 ed.),
Cengage Learning PTR, 2014. ISBN 978-1305076532.
2. David Wallace Croft, Advanced Java Game Programming (1 ed.),
Apress, 2004. ISBN 978-1590591239.
3. Wallace Jackson, Beginning Java 8 Games Development (1 ed.),
Apress, 2014. ISBN 978-1484201466.
4. Joel Fan, Calin Tenitchi and Eric Ries, Black Art of Java Game
Programming (1 ed.), Waite Group Pr, 1996. ISBN 978-1571690432.

294
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Game Programming with HTML5 Lab
Academic Year II
Semester III
Number of Credits 2
Course Prerequisite NIL
Course Synopsis HTML5 is now popular in developing Games and related
applications. This course helps in understanding the
fundamentals of Game Programming in HTML5 along with
the elements of programming in two-dimensional
environment for the creation of Games. This Course also
involves creation of games for the desktop machine and
Internet using the different tools available.
Course Outcomes:
At the end of the course students will be able to:
CO1 Understanding the fundamentals of Game Programming in HTML5
CO2 Understanding the elements of programming in two-dimensional
environment for the creation of Games.
CO3 Create the games for the desktop machine and Internet using the different
tools available in a major programming language like HTML5.
CO4 Understanding the fundamentals of HTTP Polling.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO PO6 PO PO8 PSO1 PSO2 PSO3
1 3 4 5 7
CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

295
CO3 2 1 - 3 - 2

CO4 - - 1 - - -

Average 2.3 1.3 1 2.3 1 2.3

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4
Unit Content & Competencies
JavaScript Language Fundamentals
1 A. Introduction to JavaScript and HTML5 B. Project design and organization C.
Programming language fundamentals 1. Data types (C1)
Object-oriented programming Containers, Exceptions, Delegates and Events
2 String manipulation (C3)
Mathematics: A. Cartesian Coordinate Systems B. World space, object space,
3 camera space C. Vectors D. Matrices (C3)
Game Design and Development A. Cultural and function definition of games B.
4 Rudiments of game design C. Development processes D. Documentation (C6)
5 Game Development Technical Aspects A. User input B. Graphics C. Audio (C6)
6 Game Engine Architecture i. Collision Detection ii. Publication iii. Lessons
from the Underground: DIY/Indie techniques iv. XNA Content Pipeline (C3)

296
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title IOT Networks and Protocols

Academic Year II
Semester IV
Number of Credits 3
Course Prerequisite NIL
Course Synopsis The objective of this course is to impart necessary and
practical knowledge of components of Internet of Things
and develop skills required to build real-time IoT based
projects
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand IoT and its hardware and software components

CO2 Interface I/O devices, sensors and communication mobiles

CO3 Remotely monitor data and control devices


CO4 Develop real life IoT based projects

Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program


Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO8 PSO1 PSO2 PSO3
1 3 4
CO1 3 - 2 2 2 2 2

CO2 2 3 1 2 1 3 1

CO3 2 1 - 3 - 2 -

CO4 - - 1 - - - - -

Average 2.3 1.3 1 2.3 1 2.3 1

297
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 - 3
Unit Content & Competencies
1 Introduction to IoT

Defining IoT, Characteristics of IoT, Physical design of IoT, Logical design


of IoT, Functional blocks of IoT (C1)

Describe Communication models & APIs. Machine to Machine, Difference


between IoT and M2M, Software Define Network (C2)

2 Network and Communication Aspects

Describe Wireless medium access issues, MAC protocol survey, Survey


routing protocols, Sensor deployment & Node discovery, Data aggregation
& dissemination (C2)

3 Challenges in IoT

Design challenges, Development challenges, Security challenges, other


challenges. Home automation, Industry applications, Surveillance applications,
Other IoT applications (C6)

4 Developing IoT’s

Explain Input/output Programming: Introduction to different IoT tools,


developing applications through IoT tools (C2)

Developing sensor-based application through embedded system platform,


Implementing IoT concepts with python (C6)

298
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 34
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 8
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

299
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1. Vijay Madisetti, ArshdeepBahga, “Internet of Things: A Hands-On
Approach”
2. Waltenegus Dargie, Christian Poellabauer, "Fundamentals of Wireless
Sensor Networks: Theory and Practice"

300
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title IOT Networks and Protocols Lab

Academic Year II
Semester IV
Number of Credits 1
Course Prerequisite NIL
Course Synopsis The objective of this course is to impart necessary and
practical knowledge of components of Internet of Things
and develop skills required to build real-time IoT based
projects
Course Outcomes:
At the end of the course students will be able to:
CO1 Setup a basic IoT hardware.
CO2 Apply IoT concept in simple real-life applications.
CO3 Apply IoT concepts in advance applications.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO PO8 PSO PSO2 PSO3
1 3 4 7 1
CO1 3 - 2 2 - 2 2

CO2 2 3 1 2 3 3 1

CO3 2 1 - 3 1 2 -

Average 2 1 1 2 1 2 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2

301
Unit Content & Competencies
1 Connection of an Arduino board with ESP8266 wifi module (C3)
2 IoT based control of an LED using Arduino (C3)
3 IoT and cloud-based data logger using LM35 and Arduino (C3)
4 IoT based home automation using Arduino (C3)
5 IoT based street light control using Arduino (C3)
6 IoT based DC motor speed control using Arduino (C3)

302
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Industrial and Medical IOT

Academic Year II
Semester IV
Number of Credits 3
Course Prerequisite NIL
Course Synopsis In this course, student will learn basics and advanced
features of Industrial IOT and Medical IOT
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand the basics of Industrial IOT and Medical IOT
CO2 Identify the technical and industrial requirement procedures for IIOT
applications
CO3 Develop various applications using IIOT architectures
CO4 Choose selected IOT devices for understanding the system architecture of
medical IOT
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO PO6 PO PO8 PSO1 PSO PSO3
1 3 4 5 7 2

CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

CO3 2 1 - 3 - 2

CO4 - - 1 - - -

Average 2.3 1.3 1 2.3 1 2.3

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week

303
3 - 3
Unit Content & Competencies

Introduction to Industrial IoT: Technical requirements, IoT Background-


1
History and definition, IoT enabling factors (C1)

IoT applications, IoT key technologies, I-IoT, IoT and I-IoT – similarities and
differences, Industry environments and scenarios covered by I-IoT (C3)

Industrial Data Flow and Devices: Technical requirements, The I-IoT data flow
in the factory, Measurements and the actuator chain. Sensors (C1)
2
The converters - Digital to analogical, Analog to digital, Actuators, Controllers
- Microcontrollers, Embedded microcontrollers, Microcontrollers with external
memory, DSP’s. Industrial protocols -Automation networks, The fieldbus (C2)

Developing Industrial IoT and Architecture Introduction to the I-IoT platform


and architectures, OSGi, micro service, containers, and server less computing,
The standard IIoT flow (C6)

Internet of Medical Things Introduction and system architecture: Introduction,


3
IoMT Devices-On-Body Devices, in-home Devices (C1)

Community Devices, In-Clinic Devices, In-Hospital Devices, IoMT System


Architecture-Data Collection Layer, Data Management Layer, Medical Server
Layer (C3)

Explain Internet of Medical Things Security Threats, Security Challenges and


4
Potential Solutions: IoMT Attack Types, Challenges in IoMT Security Schemes
(C2)

Describe Current Security Plans for IoMT, Potential Solutions for Security
Vulnerabilities (C2)

304
Learning Strategies and Contact Hours
Learning Strategies Contact Hours
Lecture 34
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 8
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

305
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References List of reference books


1. Veneri, Giacomo, and Antonio Capasso- Hands-on Industrial Internet of
Things: Create a Powerful Industrial IoT Infrastructure Using Industry
4.0, 1stEd., Packt Publishing Ltd, 2018.
2.D. Jude Hemanth and J. Anitha George A. Tsihrintzis- Internet of
Medical Things Remote Healthcare Systems and Applications, covered
by Scopus.
3.Alasdair Gilchrist- Industry 4.0: The Industrial Internet of Things, 1st
Ed., Apress, 2017.
4.Reis, Catarina I., and Marisa da Silva Maximiano, eds.- Internet of
Things and advanced application in Healthcare, 1st Ed., IGI Global, 2016.

306
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Industrial and Medical IOT Lab

Academic Year II
Semester IV
Number of Credits 1
Course Prerequisite NIL
Course Synopsis In this course, student will learn basics of Industrial IOT
and Medical IOT
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand the basics of Industrial IOT and Medical IOT
CO2 Identify the technical and industrial requirement procedures for IIOT
applications
CO3 Develop various applications using IIOT architectures
CO4 Choose selected IOT devices for understanding the system architecture of
medical IOT
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO PO6 PO PO8 PSO1 PSO PSO3
1 3 4 5 7 2

CO1 3 - 2 2 2 2 2

CO2 2 3 1 2 1 3 1

CO3 2 1 - 3 - 2 -

CO4 - - 1 - 1 - -

Average 2.3 1.3 1 2.3 1 2.3 1

Course Content:

307
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies
1 The definition of the Internet of Things, main assumptions and perspectives:
Platform for IOT devices Device Architectures-Conventional and renewable
power sources for resource-constrained devices-Operating systems for resource-
constrained devices. (C1)
The data link layer for IoT: Wireless communication technologies-Wire
2 communication technologies-Manet Networks.
3 The network layer for IOT: 6lowPAN adaptation layer for devices with limited
resources. Dynamic routing protocols for wireless ad-hoc network 2 / 4
4 Communication protocols for IOT: Service oriented protocols (COAP)-
Communication protocols based on the exchange of messages (MQTT)-Service
discovery protocols.
5 The data processing for IOT: Organization of data processing for the Internet of
things Cloud computing-Fog computing. Applications: Smart Grid-Home
Automation-Smart City.
6 Interacting with device peripherals (using GPIO, ADC, servos)
7 Connecting to the Internet (e.g., the device showing the current weather forecast)
8 Exposition of device functionality as services (1) (COAP protocol)
9 Machine-to-machine communication (broadcast communication protocols)

308
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

309
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Practical Log Book/ Record Book
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process 3. Student’s Feedback

References: List of reference books


1. Veneri, Giacomo, and Antonio Capasso- Hands-on Industrial Internet of
Things: Create a Powerful Industrial IoT Infrastructure Using Industry
4.0, 1stEd., Packt Publishing Ltd, 2018.
2.D. Jude Hemanth and J. Anitha George A. Tsihrintzis- Internet of
Medical Things Remote Healthcare Systems and Applications, covered
by Scopus.
3.Alasdair Gilchrist- Industry 4.0: The Industrial Internet of Things, 1st Ed.,
Apress, 2017.
4.Reis, Catarina I., and Marisa da Silva Maximiano, eds.- Internet of Things
and advanced application in healthcare, 1st Ed., IGI Global, 2016.

310
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Automata Theory and Computability

Academic Year III


Semester V
Number of Credits 3
Course Prerequisite NIL
Course Synopsis This course will help students to learn how to write a formal
notation for strings, languages and machines, design finite
automata to accept a set of strings of a language.
Course Outcomes:
At the end of the course students will be able to:
CO1 Write a formal notation for strings, languages and machines.
CO2 Design finite automata to accept a set of strings of a language.
CO3 For a given language determine whether the given language is regular or not.
Design context free grammars to generate strings of context free language
CO4 Write the hierarchy of formal languages, grammars and machines.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO7 PO8 PSO PSO2
1 3 4 1
CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

CO3 2 1 - 3 - 2

CO4 - - 1 - - -

Average 2.3 1.3 1 2.3 1 2.3

Course Content:

311
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 - 3
Unit Content & Competencies
1 Introduction: Alphabet, languages and grammars, productions and derivation,
Chomsky hierarchy of Languages (C1)
Regular languages and finite automata: Regular expressions and languages,
deterministic finite automata (DFA) and equivalence with regular expressions,
nondeterministic finite automata (NFA) and equivalence with DFA
2 Regular grammars and equivalence with finite automata, properties of regular
languages, pumping lemma for regular languages, minimization of finite
automata.
Describe Context-free languages and pushdown automata: Context-free
grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms
3 (C1)
Analyze Non-deterministic pushdown automata (PDA) and equivalence with
CFG, parse trees, ambiguity in CFG (C4)
Explain Pumping lemma for context-free languages, deterministic pushdown
automata, closure properties of CFLs (C2)
Analyze Context-sensitive languages: Context-sensitive grammars (CSG) and
4 languages, linear bounded automata and equivalence with CSG (C4)
Implement Turing machines: The basic model for Turing machines (TM),
Turing-recognizable (recursively enumerable) and Turing-decidable (recursive)
languages and their closure properties, variants of Turing machines (C3)

312
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 34
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 8
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

313
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √ √
VIVA
Assignment / Presentation √ √ √
Unit test √ √
Clinical assessment
Clinical/Practical Log Book/ Record
Book
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process 4. Student’s Feedback

References: List of reference books


1. K.L.P Mishra, Theory of Computer Science: Theory, Automata, And
Computation, 3rd Edition, PHI,2006
2. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction
to Automata Theory, Languages, and Computation, Pearson Education
Asia, 3rd Edition,2016
3.Michael Sipser, Introduction to the Theory of Computation, PWS
Publishing.,3rd Edition ,2014

314
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Automata Theory and Computability Lab
Academic Year III
Semester V
Number of Credits 1
Course Prerequisite NIL
Course Synopsis This course will help students to learn how to write a formal
notation for strings, languages and machines, for a given
language determine whether the given language is regular
or not, Design context free grammars to generate strings of
context free language.
Course Outcomes:
At the end of the course students will be able to:
CO1 Write a formal notation for strings, languages and machines.
CO2 Design finite automata to accept a set of strings of a language.
CO3 For a given language determine whether the given language is regular or not,
Design context free grammars to generate strings of context free language
CO4 Write the hierarchy of formal languages, grammars and machines.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO7 PO8 PSO1 PSO2
1 3 4
CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

CO3 2 1 - 3 - 2

CO4 - - 1 - - -

315
Average 2.3 1.3 1 2.3 1 2.3

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies
1 Design Deterministic Finite Automata (DFA) (C6: Synthesis)
2 Design Nondeterministic Finite Automata (NFA) (C6: Synthesis)
3 Conversion of NFA to DFA (C3: Application)
4 Apply DFA Minimization (C3: Application)
5 Apply DFA to regular grammar conversion (C3: Application)
6 Apply DFA to regular expression conversion (C3: Application)
7 Combining automata
8 Apply Regular expression to DFA conversion (C3: Application)
9 Implement Mealy and Moore machine (C3: Application)
10 Implement Pushdown automata (C3: Application)

316
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Reinforcement Learning

Academic Year III


Semester V
Number of Credits 3
Course Prerequisite NIL
Course Synopsis This course will help students to develop an understanding
of where and how AI can be used and understand reasoning
Patterns in propositional logic
Course Outcomes:
At the end of the course students will be able to:
CO1 Develop an understanding of where and how AI can be used.
CO2 Understand reasoning Patterns in propositional logic
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO PO PSO PSO PSO3
1 3 4 7 8 1 2

CO1 - - 1 2 2 1

CO2 2 3 1 - 2 1

Average 1 1.5 1 1 2 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 - 3
Unit Content & Competencies

317
1 Introduction: Uninformed search strategies (C1)
Implement Greedy best-first search, And-Or search, Uniform cost search, A*
search, Memory-bounded heuristic search, Local and evolutionary searches (C3)
2 Evaluate Constraint Satisfaction Problems: Backtracking search for CSPs, Local
search for CSPs (C5)
Implement Adversarial Search: Optimal Decision in Games, The minimax
algorithm, Alpha-Beta pruning, Expect Imax search (C3)
Knowledge and Reasoning: Propositional Logic, Reasoning Patterns in
3 propositional logic; First order logic: syntax, semantics (C1)
Inference in First order logic, unification and lifting, backward chaining,
resolution (C3)
Representation: Information extraction, representation techniques, foundations of
Ontology (C5)
Explain Planning: Situation Calculus, Deductive planning, STRIPES, sub-goal,
4 Partial order planner Bayesian Network, Causality, and Uncertain Reasoning (C2)
Implement Probabilistic models, directed and undirected models, inferencing,
causality, Introduction to Probabilistic reasoning, Introduction to RL: MDP,
Policy, Q-value (C3)

318
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 34
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 8
Case/Project Based Learning (CBL) -
Revision 3
Others If any: -
Total Number of Contact Hours 45

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

319
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4 CO5 CO6


Quiz √
VIVA
Assignment / Presentation √
Unit test √ √
Practical Log Book/ Record Book
Mid Semester Examination 1 √ √
Mid Semester Examination 2 √ √
University Examination √ √

Feedback Process 5. Student’s Feedback

References: List of reference books


1.Russel S and Norvig P, (2015), Artificial Intelligence: A Modern
Approach, 3rd Edition, Prentice Hall
2.Department of Computer Science, University of California, Berkeley

320
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Reinforcement Learning Lab

Academic Year III


Semester V
Number of Credits 1
Course Prerequisite NIL
Course Synopsis This course will help students to develop an understanding
of where and how AI can be used.
Course Outcomes:
At the end of the course students will be able to:
CO1 Develop an understanding of where and how AI can be used.
CO2 Understand reasoning Patterns in propositional logic
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO PO PSO PSO PSO3
1 3 4 7 8 1 2

CO1 - - 1 2 2 1

CO2 2 3 1 - 2 1

Average 1 1.5 1 1 2 1

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 2
Unit Content & Competencies
1 Introduction and Basics of RL (C1: Knowledge)
2 Defining RL Framework and Markov Decision Process (C1: Knowledge)
3 Implement Polices, Value Functions and Bellman Equations (C3: Application)

321
4 Exploration vs. Exploitation (C4: Analysis)
5 Code Standards and Libraries used in RL (Python/ Keras /Tensorflow)
6 Planning through the use of Dynamic Programming and Monte Carlo (C5:
Evaluation)
7 Temporal-Difference learning methods (TD (0), SARSA, Q-Learning)
8 Deep Q-networks (DQN, DDQN, Dueling DQN, Prioritized Experience Replay)
(C4: Analysis)
9 Introduction to policy-based methods (C1: Knowledge)

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture -
Practical 20
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL)
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 30

322
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

Mapping of Assessment with COs

Nature of Assessment CO1 CO2


Quiz √
VIVA
Assignment / Presentation √ √
Unit test √
Practical Log Book/ Record Book
Mid Semester Examination 1 √ √
Mid Semester Examination 2 √ √
University Examination √ √

323
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Compiler design

Academic Year III


Semester VI
Number of Credits 2
Course Prerequisite NIL
Course Synopsis This course will provide students an understanding of the
fundamental principles in compiler design
Course Outcomes:
At the end of the course students will be able to:
CO1 Understand fundamentals of compiler and identify the relationships among
different phases of the compiler.
CO2 Understand the application of finite state machines, recursive descent,
production rules, parsing, and language semantics.
CO3 Analyze & implement required module, which may include front-end, back-
end, and a small set of middle-end optimizations.
CO4 Use modern tools and technologies for designing new compiler.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO3 PO4 PO PO6 PO7 PO PSO1 PSO2 PSO
1 5 8 3

CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

CO3 2 1 - 3 - 2

CO4 - - 1 - - -

Average 2.3 1.3 1 2.3 1 2.3

324
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
2 - 2
Unit Content & Competencies
1 Introduction to Compiler, Phases and passes, Bootstrapping, Finite state
machines and regular expressions and their applications to lexical analysis (C1:
knowledge)

Implement Optimization of DFA-Based Pattern Matchers implementation of


lexical analyzers, lexical-analyzer generator, LEX-compiler, Formal grammars
and their application to syntax analysis, BNF notation, ambiguity, YACC (C3:
Application)

Describe the syntactic specification of programming languages: Context free


grammars, derivation and parse trees, capabilities of CFG (C2: Comprehension)

Evaluate Parsers, Shift reduce parsing, operator precedence parsing, top-down


2
parsing, predictive parsers (C5: Evaluation)

Automatic Construction of efficient Parsers: LR parsers, the canonical


Collection of LR (0) items, Constructing SLR parsing tables, constructing
Canonical LR parsing tables (C6: Synthesis)
3 Syntax-directed Translation schemes, Implementation of Syntax directed
Translators (C3: Application)
Construct Intermediate code, postfix notation, Parse trees & syntax trees, three
address code, quadruple & triples (C6: Synthesis)
Translation of assignment statements, Boolean expressions, statements that
alter the flow of control, postfix translation, translation with a top-down parser.

325
4 Implement Data structure for symbols tables, representing scope information.
Run-Time Administration (C3: Application)
Implementation of simple stack al-location scheme, storage allocation in block
structured language (C3: Application)
Evaluate Error Detection & Recovery: Lexical Phase errors, syntactic phase
errors semantic errors (C5: Evaluation)
Note: The course plan included as an annexure has the details of each unit with the number of
hours and mode of delivery and pedagogical approach.

Learning Strategies and Contact Hours


Learning Strategies Contact Hours
Lecture 26
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

326
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs


Nature of Assessment CO1 CO2 CO3 CO4
Quiz √ √
Assignment / Presentation √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.Ullman―Principles of Compiler Design. Addison-Wesley, 2002
2.Aho, Sethi& Ullman, Compilers: Principles, Techniques and Tools,
Pearson Education,2ndedition,
3.Charles Fischer and Ricard LeBlanc, Crafting a Compiler with C‖,
Pearson Education

327
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Compiler design Lab
Academic Year III
Semester VI
Number of Credits 2
Course Prerequisite NIL
Course Synopsis This course will provide students an understanding of the
fundamental principles in compiler design
Course Outcomes:
At the end of the course students will be able to:
CO1 Design Lexical analyzer for given language using C and LEX tools
CO2 Design and convert BNF rules into YACC form to generate various parsers
CO3 Generate machine code from the intermediate code forms
CO4 Implement Symbol table
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PO7 PO8 PSO PSO2
1 3 4 1
CO1 3 - 2 2 2 2

CO2 2 3 1 2 1 3

CO3 2 1 - 3 - 2

CO4 - - 1 - - -

Average 2.3 1.3 1 2.3 1 2.3

Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
4 4

328
Unit Content & Competencies
1 Design a Lexical analyzer for the given language. The lexical analyzer should
ignore redundant spaces, tabs and new lines. It should also ignore comments.
Although the syntax specification states that identifiers can be arbitrarily long,
you may restrict the length to some reasonable value (C6: Synthesis)
2 Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer
generating stools (C3: Application)
3 Design Predictive parser for the given language (C6: Synthesis)
4 Design LALR bottom-up parser for the given language (C6: Synthesis)
5 Convert the BNF rules into Yacc form and write code to generate abstract
syntax tree (C3: Application)
6 Write program to generate machine code from the abstract syntax tree
generated by the parser (C1: Knowledge)
7 Implementation of Symbol Table (C3: Application)
8 Generation of Code for a given Intermediate Code (C3: Application)

329
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

330
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √

Mid Semester Examination 1


Mid Semester Examination 2
University Examination

331
Faculty of Engineering and Technology
Name of the Computer Science and Engineering
Department
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Image and Video Processing
Academic Year III
Semester VI
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, students will learn the image processing
fundamentals and enhancement techniques in spatial and
frequency domain
Course Outcomes:
At the end of the course students will be able to:
CO1 Comprehend the image processing fundamentals and enhancement
techniques in spatial and frequency domain.
CO2 Describe the color image fundamentals, models and various restoration
techniques.
CO3 Design and analyze the image compression systems.
CO4 Outline the various image segmentation and morphology operations.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) &
Program Specific Outcomes:
COs PO1 PO2 PO PO PO5 PO6 PO7 PO8 PSO1 PSO2
3 4
CO1 3 2 2 - 2 2

CO2 2 1 2 3 1 3

CO3 2 - 3 1 - 2

CO4 - 1 - - - -

332
Average 2.3 1 2.3 1.3 1 2.3

Course Content:
L (Hours/Week) T P (Hours/Week) Total Hour/Week
(Hours/Week
)
2 - 2
Unit Content & Competencies
1 INTRODUCTION AND IMAGE ENHANCEMENT:
Digital image fundamentals, Concept of pixels and gray levels (C1: Knowledge)

Applications of image processing, Introduction to image enhancement, spatial


domain methods: point processing - intensity transformations, histogram
processing, image averaging, image subtraction, Spatial filtering- smoothing
filters, sharpening filters, Frequency domain methods: low pass filtering, high
pass filtering, Homomorphic filtering (C3: Application)
2 IMAGE RESTORATION:
Introduction to Image restoration, Degradation model, Restoration in the
presence of Noise Only-Spatial Filtering, Periodic Noise reduction by
Frequency domain Filtering (C1: Knowledge)

Implement Algebraic approaches- Inverse filtering, Wiener filtering,


Constrained Least squares restoration (C3: Application)
3 IMAGE COMPRESSION:
Introduction, Need for image compression, Redundancy in images (C1:
Knowledge)

Classification of redundancy in images, image compression scheme,


Classification of image compression schemes (C2: Comprehension)

Apply Huffman coding, Arithmetic coding, Predictive coding, transformed


based compression, Image compression standards, Wavelet-based image
compression (C3: Application)

Introduction to image segmentation (C1: Knowledge)

333
4 DIGITAL VIDEO & CODING:
Basics of Video, Time-varying Image formation Models (C1: Knowledge)

Explain Spatiotemporal Sampling, Optical flow, General methodologies (C2:


Comprehension)

Overview of coding systems, Video Compression Standards (C1: Knowledge)

Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture 26
Practical -
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) 2
Case/Project Based Learning (CBL) -
Revision 2
Others If any: -
Total Number of Contact Hours 30

334
Assessment Methods:

Formative Summative

Multiple Choice Questions (MCQ) Mid Semester Examination 1

Mid Semester Examination 2

Quiz University Examination

Seminars Short Answer Questions (SAQ)

Problem Based Learning (PBL) Long Answer Question (LAQ)

Mapping of Assessment with COs:

Nature of Assessment CO1 CO2 CO3 CO4


Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books


1.M. Tekalp, “Digital Video Processing”, Prentice-Hall
2.Rafael C. Gonzalez, Richard E Woods and Steven L.
Eddins, “Digital Image Processing using MAT LAB”,
Pearson Edu.

335
Faculty of Engineering and Technology
Name of the Department Computer Science and Engineering
Name of the Program Bachelor of Computer Applications
Course Code
Course Title Image and Video Processing Lab
Academic Year III
Semester VI
Number of Credits 2
Course Prerequisite NIL
Course Synopsis In this course, students will learn the image processing
fundamentals and enhancement techniques in spatial and
frequency domain.
Course Outcomes:
At the end of the course students will be able to:
CO1 Comprehend the image processing fundamentals and enhancement
techniques in spatial and frequency domain.
CO2 Describe the color image fundamentals, models and various restoration
techniques.
CO3 Design and analyze the image compression systems.
CO4 Outline the various image segmentation and morphology operations.
Mapping of Course Outcomes (COs) to Program Outcomes (POs) & Program
Specific Outcomes:
COs PO PO2 PO PO PO5 PO6 PSO PSO PSO PSO4
1 3 4 1 2 3
CO1 3 - 2 2 - - 2 2 - -

CO2 2 3 1 2 - - 3 1 - -

CO3 2 1 - 3 - - 2 - - -

CO4 - - 1 - - - - - - -

Average 2.3 1.3 1 2.3 2.3 1

336
Course Content:
L (Hours/Week) T (Hours/Week) P CL Total Hour/Week
(Hours/We (Hours/We
ek) ek)
4 4
Unit Content & Competencies
1 Simulation and Display of an Image, Negative of an Image (Binary & Gray
Scale) (C6: Synthesis)
2 Implementation of Relationships between Pixels (C3: Application)
3 Implementation of Transformations of an Image (C3: Application)
4 Contrast stretching of a low contrast image, Histogram, and Histogram
Equalization (C5: Evaluation)
5 Display of bit planes of an Image (C4: Analysis)
6 Display of FFT (1-D & 2-D) of an image (C4: Analysis)
7 Computation of Mean, Standard Deviation, Correlation coefficient of the given
Image (C5: Evaluation)
8 Implementation of Image Smoothening Filters (Mean and Median filtering of
an Image) (C3: Application)
9 Implementation of image sharpening filters and Edge Detection using Gradient
Filters (C3: Application)
10 Implement Image Compression by DCT, DPCM, HUFFMAN coding (C3:
Application)

337
Learning Strategies and Contact Hours

Learning Strategies Contact Hours


Lecture -
Practical 50
Seminar/Journal Club -
Small group discussion (SGD) -
Self-directed learning (SDL) / Tutorial -
Problem Based Learning (PBL) -
Case/Project Based Learning (CBL) 10
Revision -
Others If any: -
Total Number of Contact Hours 60

Assessment Methods

Formative Summative

Multiple Choice Questions (MCQ) Practical Examination & Viva-voce

Viva-voce

Problem Based Learning (PBL)

Seminars

Quiz

338
Mapping of Assessment with COs

Nature of Assessment CO1 CO2 CO3 CO4


Quiz
VIVA √ √ √ √
Assignment / Presentation
Unit test
Practical Log Book/ Record Book √ √ √ √

Feedback Process Student’s Feedback

References: List of reference books

1.M. Tekalp, “Digital Video Processing”, Prentice-Hall, 1995.

2.Rafael C. Gonzalez, Richard E Woods and Steven L. Eddins, “Digital


Image Processing using MAT LAB” , Pearson Edu.

339
9. MAPPING OF COURSE OUTCOMES, PROGRAM OUTCOMES AND
PROGRAM SPECIFIC OUTCOMES
S Cou Course Title C PO PO PO PO PO PO PO PO8 PS PSO2 PSO3
e rse 1 2 3 4 5 6 7 O1
m Cod
. e
I Mathematics-I 3 3 2 1.2 2 - - 1 - 2 2 -

I Fundamentals of 2 3 2 1.2 2 - - 1 - 2 2 -

Computers and
Information
Technology
I Fundamentals of 2 2 3 1.2 2.5 - 1 - 1 2 - 2
Computers and
Information
Technology Lab
I Networks and 3 3 2 1.2 2 - - - 1 2 2 -

Systems
I Networks and 1 2 2 1.2 2.5 2 - - 1 2 - 2
Systems Lab
I Virtualization 2 3 2 1.2 2 - - 1 - 2 2 -

Concepts
I Virtualization 2 3 2 1.6 2 - 1.3 - - 1 - 1
Concepts Lab
I Foundation of 2 2 3 1.5 1 - 1.5 - - 1.7 1.5 -

Data Science
I Foundation of 2 2.5 2 1.5 2 - - - 1 1.5 1 0.5
Data Science Lab
II Statistics for 3 2.7 - 2.2 2 2.2 - - 2 - 1.7 1.5
Computing
II Introduction to 2 2 3 3 2 1.5 - - - 2 1.5 -

Programming

340
Methodology
using C
II Introduction to 2 3 2 1.2 1.2 0.7 - 1 - 0.7 - 0.7
Programming
Methodology
using C Lab
II Empirical 3 2.2 2 2 2 - - 3 - 1.2 0.7 -

Software
Engineering
II Empirical 1 2 2 1.7 3 1 - 1 - 0.7 0.7 1
Software
Engineering Lab
II Fundamentals of 2 2 2 3 1.2 - - - - 1.2 0.5 1
Cloud
Computing
II Fundamentals of 2 3 2 1 2 - - - 1 1 1.2 -

Cloud Computing
Lab
II Data mining and 2 2 1.2 1.7 1.2 - - 3 - 1 1 0.5
Predictive
Modelling
II Data mining and 2 3 1.2 2 1.2 - 1 1 1 0.7 0.7
Predictive
Modelling Lab
III Object oriented 2 1.5 3 2 1 - 0.7 - - 1 0.7 1
Development
using C++
III Object oriented 2 3 3 1.7 2 - 1.5 - 1 1.5 1.2 3
Development
using C++ Lab

341
III Personality 2 2 - 2 1 3 2 - 3 1.2 0.7 2
Development &
Career Building
III Summer 1 2 1.7 2 1 3 - - 3 - 0.7 1.2
Internship-I
III Algorithms 2 3 1.2 2 1 2 - - - 0.7 1 1
Design and
Complexity
Theory
III Algorithms 2 2 1 3 1 2 - 1 - 1.5 0.75 -

Design and
Complexity
Theory Lab
III Cloud Computing 3 2 1.7 1.2 3 2 - - 1.2 1.5 1.5 0.5
Securitization
III Natural 3 2 1.2 3 1.2 - 1 - - 1.5 0.7 0.7
Language
Processing
III Web 2 1.7 3 1.2 1.2 0.7 - - - 1.2 0.7 -

Development
using HTML
and CSS
IV Database 2 3 2 1 1.2 2 - - - 1.2 0.6 -

Management
Systems
IV Database 2 1.5 2 3 1.2 2 - - - 1.2 0.6 -

Management
Systems Lab
IV Quantitative 2 2.5 2 1 1.5 - 1.5 - - 1.5 1 1
Aptitude &

342
Logical
Reasoning
IV Problem Solving 2 3 2 1.3 2 - 2 - 1 0.5 1.3 -

using Python
IV Problem Solving 2 3 2 1.2 0.7 - 2 - - 1.2 - 0.7
using Python Lab
IV Advances in 3 2 1.6 1.3 2 - 2 - - 1.3 1.6 -
Operating
Systems
IV Advances in 1 2 1 3 1.5 - 1 - - 1.5 1 -

Operating
Systems Lab
IV Cloud computing 3 1 2 3 3 - - - - 2 1 -

architecture and
deployment
models
IV Cloud 1 3 1.3 2 0.3 2 - - - 1.3 1.6 -

computing
architecture and
deployment
models Lab
IV R Programming 3 3 1.2 2 1.3 - - - - 1.3 1 -

for Data
Analytics
IV R Programming 1 2 3 1.3 1.3 - - - - 1.3 1.6 -
for Data Analytics
Lab
IV Embedded 2 2 3 1.2 1.2 0.7 - - - 1 0.7 -
system
development

V Data warehousing 2 3 1.6 1.3 1.3 - - - 1 1.3 -


and Data Mining

343
V Data warehousing 2 3 1.3 0.5 1.5 - - - - 1.3 - -
and Data Mining
Lab
V Computer 3 2 1.5 2 1.5 - - 1 - 1.5 0.6 -
Graphics and
Vision
V Computer 1 2 1 0.5 1.5 - - 1.5 - 1.5 - 1
Graphics and
Vision Lab
V Java 2 3 2 1 2 - 1 1 - 1 - 1
Programming
V Java 2 3 2 2 2 - - - - 1 1 -

Programming Lab
V Innovations & 3 3 1.6 1.3 1.6 - - - 3 1 1.3 -

Entrepreneurshi
p
V Summer 2 2 3 2 1 1 - - - 1 - 2
Internship-II
V Introduction to 3 3 1.6 1.3 2 - - - - 1.3 1.6 1
Windows Azure
V Introduction to 1 2 3 1.3 2 - 1.3 - - 1.3 1.6 -

Windows Azure
Lab
V Data 3 2 3 1.3 2 - - - - 1.3 1.6 -

Visualization
and Story
Telling
V Data 1 3 1.6 1.3 2 - - - - 1.3 1.6 -

Visualization
and Story
Telling Lab

344
V MATLAB 2 3 1 1.2 1.2 0.7 - - - 1 0.7 -

VI Web 2 1.6 3 2 1 - - - - 1 1.6 -

Development
using PHP
VI Web 2 1.3 1.3 1 - - - - 1 1.6 - -

Development
using PHP Lab
VI Essentials of 3 2.5 2 1.5 1 0.5 - - - 1 1 1.5
Cyber Security
VI Capstone Project 1 1 2 1.5 - 3 - - 1.5 1 - 2
VI Enterprise 2 3 2 1.3 1 - 1.3 - - 1 1 -

Mobile
Application
Development
VI Enterprise Mobile 2 2 1.3 3 1 - 1 - - 1 1 -

Application
Development Lab
VI Big data 3 3 1.3 1.3 1 - 1.3 - - 1 1 -

analytics and
Applications
VI Big data 1 2 1.3 1.3 1 - 1 - - 1 1 -

analytics and
Applications
Lab
VI Applications of 3 3 2.3 1.6 2 - - - - 2 2.3 -

Cloud Systems
VI Applications of 1 2 2.3 1.6 2 - - - - 2 2.3 -

Cloud Systems
Lab
VI Drone Remote 2 1.7 3 1.2 2 0.7 - - - 0.7 0.7 -

Sensing
Note: C-Credits

345
346

You might also like