OBE BCA 2023 Batch Syllabus
OBE BCA 2023 Batch Syllabus
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)
2
3. GRADUATE ATTRIBUTES
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:
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.
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.
8
6. PROGRAM SPECIFIC OUTCOME
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
10
SEMESTER – II
11
SEMESTER – III
12
SEMESTER – IV
13
SEMESTER – V
14
SEMESTER – VI
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)
SEC Courses
16
Program Electives pool
17
8. SEMESTER-WISE COURSE DETAILS
SEMESTER - I
Course Code Course Title
Mathematics-I
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.
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:
20
3 Differentiation:
(C3: Application)
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)
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:
Discuss Input devices, Output Devices. Computer Memory: Memory Cell (C2:
Comprehension)
24
3 Number Systems:
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)
Evaluate 1’s and 2’s complement: 2’s complement subtraction. (C5: Evaluation)
4 Electronic Payment System:
25
Learning Strategies and Contact Hours
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
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
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)
30
Assessment Methods:
Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz
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:
Discuss Types of Networks: LAN, MAN, WAN; Server Based LANs & Peer-to-
Peer LANs (C2: Comprehension)
Explain Design Issues of the Layer, Protocol Hierarchy, ISO-OSI Reference Model:
Functions of each Layer, Various Terminology used in Computer Network (C2:
Comprehension)
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)
Distinguish World Wide Web (WWW), Domain Name System (DNS), E-mail, File
Transfer Protocol (FTP), HTTP as an application layer protocol (C4: Analysis)
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)
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
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)
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
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
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:
41
4 Applying Virtualization
Analyze Network and Storage Virtualization: VPN, VLAN, SAN and VSAN,
NAS. (C4: Analysis)
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
Quiz √ √
Assignment / Presentation √ √ √ √
Unit test √ √
Mid Semester Examination 1 √ √ √ √
Mid Semester Examination 2 √ √ √ √
University Examination √ √ √ √
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
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
•Virtualizing servers
46
Learning Strategies and Contact Hours
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
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 -
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
49
2 2
Unit Content & Competencies
1 Introduction
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)
Construct Residual Plot, Distribution Plot, Polynomial Regression and Pipelines (C6:
Synthesis)
50
Mapping of Assessment with COs
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
3. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data
Analytics”, EMC 2013
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
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
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
3.David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big
data Analytics”, EMC 2013
56
SEMESTER - II
Course Code Course Title
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
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
Classify Arithmetic mean, Median, Mode, Harmonic Mean, Geometric mean for grouped
and ungrouped data (C2: Understand)
Measures of Dispersion
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)
59
4 Sample Space, Events and Probability:
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)
Apply Addition theorem of probability without Proof (up to three events are expected)
(C3: Application)
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)
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
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 -
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)
Explain source code, variables (with data types) variables and memory locations (C1:
Knowledge)
Explain object and executable code, Arithmetic expressions and precedence (C2:
Comprehension)
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)
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)
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
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)
67
16 Design a C program to input two matrices and perform matrix multiplication on them
(C6: Synthesis)
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
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 -
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 3
Unit Content & Competencies
1 Software:
Implement Cost Estimation Models: COCOMO Model, The S/W Equation (C3:
Application)
71
4 Testing fundamentals:
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)
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
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
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)
75
Assessment Methods:
Formative Summative
Multiple Choice Questions (MCQ) Practical Examination & Viva-voce
Viva-voce
Problem Based Learning (PBL)
Seminars
Quiz
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
Describe Cloud types and service scalability over the cloud (C2: Comprehension)
Analyze Cloud computing platforms - IaaS: Amazon EC2, PaaS: Google App
Engine, Microsoft Azure, SaaS. Open-Source platforms: OpenStack (C4:
Analysis)
78
2 Virtualization:
79
4 Cloud security fundamentals
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)
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
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
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
Exploring, Preprocessing (Query Builder) data, and Visualizing Data (C4: Analysis)
Build Statistical Model Part 1; Review MLR, Bias Variance Tradeoff, explain vs
Predict, Validation Strategies, Effect Sparsity (C6: Synthesis)
Risk Assessment.
87
3 Logistic Regression, Poisson Regression and Dealing with Nominal Predictors
(C2: Comprehension)
Construct Neural Net Models, Boosted Neural Nets and Uplift models (C6:
Synthesis)
4 Discriminant Analysis, linear, quadratic, and regularized and Text Mining (C4:
Analysis)
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)
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 - -
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
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
93
SEMESTER - III
Summer Internship-I
PE-I
PE-I Lab
MGEC-III
AECC-III
VAC-III
SEC-I
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.
CO2 2 3 2 1 - 2 - - 2 - 2
CO3 - 3 2 1 - - - - 1 - -
CO4 1 3 2 1 - - - - - 1 1
Course Content:
95
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction:
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)
97
Learning Strategies and Contact Hours
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
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 -
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
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
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 -
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
(C1: Knowledge)
105
3 Self-esteem
Term self-esteem - Symptoms - Advantages - Do's and Don’ts to develop
positive self-esteem (C1: Knowledge)
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)
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
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) CL (Hours/Week) Total
Hour/Week
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
109
Mapping of Assessment with COs
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
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)
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)
112
2 The Stacks:
Graphs:
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)
113
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
114
Mapping of Assessment with COs
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 -
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
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
118
Mapping of Assessment with COs
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
CO2 2 3 1 3 2 - - 1 - 3 -
CO3 2 - - 3 2 - - - 3 - -
CO4 2 2 3 3 1 - - 3 2 1 1
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 Infrastructure Security, Data Security and Storage, Privacy in Cloud (C2:
Comprehension)
2 Evaluate Threats and Vulnerabilities to Infrastructure (C5: Evaluation)
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)
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)
122
Assessment Methods
Formative Summative
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
CO2 2 3 3 2 - - - - 2 - -
CO3 2 - 3 3 - - - - 3 2 2
CO4 2 - 3 - - 3 - - - 1 1
Course Content:
124
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 INTRODUCTION
Detecting and Correcting Spelling Errors, Minimum Edit Distance (C5: Evaluation)
Explain Issues in PoS tagging – Hidden Markov and Maximum Entropy models (C2:
Comprehension)
125
3 SYNTACTIC ANALYSIS
Explain Normal Forms for grammar Dependency Grammar – Syntactic Parsing (C2:
Comprehension)
126
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
127
Mapping of Assessment with COs
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 -
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)
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
131
Mapping of Assessment with COs
132
SEMESTER - IV
PE-II
PE-II Lab
SEC-II
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 -
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:
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)
135
3 Storage strategies:
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
Assessment Methods
Formative Summative
137
Mapping of Assessment with COs
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 -
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
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
141
Mapping of Assessment with COs
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 - -
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
144
Assessment Methods
Formative Summative
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 - - -
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:
Running Python, First Python Program, Python Interactive Help Feature (C6:
Synthesis)
Understanding Data Type, Data Type Conversion, Python Input and Output
Functions, Import command (C2: Comprehension)
147
2 Control Structures:
(C6: Synthesis)
Strings (in detail with their methods and operations). (C2: Comprehension)
3 Python Functions:
Python Modules:
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)
149
Assessment Methods:
Formative Summative
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
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)
153
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
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 - -
155
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 Introduction:
Process Scheduling:
156
3 Memory Management: Memory Management:
Explain basic concept such as Logical and Physical address map (C2:
Comprehension)
157
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
158
Mapping of Assessment with COs
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 -
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)
161
-Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
162
Mapping of Assessment with COs
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
Analyse Cloud Service models and Cloud Deployment Models (C4: Analysis)
Discuss Cloud History – Internet technologies (SOA, Web Services, Web 2.0,
mashups) (C2: Comprehension)
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)
166
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
167
Mapping of Assessment with COs
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 -
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)
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
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
171
Mapping of Assessment with COs
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
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)
Extracting data from web-sites, clean data, Transform data by sorting (C5: Evaluation)
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)
174
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
175
Mapping of Assessment with COs
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 - -
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)
Demonstrate Reading and writing files of different formats using inbuilt packages (C3:
4 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)
178
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
179
Mapping of Assessment with COs
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 -
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)
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
Viva-voce
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
184
SEMESTER - V
Java Programming
Summer Internship – II
PE-III
PE-III Lab
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
CO2 3 3 - - 2 -
CO3 3 - 3 3 - 2
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
186
Unit Content & Competencies
1 Introduction:
187
3 FREQUENT PATTERN ANALYSIS
188
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
189
Mapping of Assessment with COs
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
CO2 3 - 1 2 - - - - - - -
CO3 3 2 - - - - - - 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)
192
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
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 -
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
Introductory concepts of Spline, B Spline and Bezier curves and surfaces (C1:
Introduction)
195
4 Back Face Detection algorithm,
196
Assessment Methods:
Formative Summative
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 - -
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
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
200
Mapping of Assessment with COs
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
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:
Analyze Decision Making, Branching and Looping: if. Else, switch, operator,
while, do, for statements, labelled loops, jump statements: break, continue
return (C4: Analysis)
Construct Classes: String and String Buffer classes, Wrapper classes: Basic
types, using super, Multilevel hierarchy abstract and final classes (C6:
Synthesis)
203
3 Exception Handling:
Analyze Reading and writing from console and files (C4: Analysis)
Using Standard Java Packages (lang, util, io, net) (C3: Application)
Build Delegation Event Model, Event Classes, Event Listener Interfaces (C6:
Synthesis)
204
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
205
Mapping of Assessment with COs
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
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)
208
15 Write a Java Program showing the use of Constructors (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)
209
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
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 -
Course Content:
211
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
Unit Content & Competencies
1 The entrepreneurial perspective
212
3 Theories and Types of entrepreneurships
213
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
214
Mapping of Assessment with COs
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.
216
CO4 Communicate effectively and learn to be a team player.
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
The student will be evaluated based on six weeks of work at industry site.
Supervised by an expert at the industry.
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
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
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
Analyse Different segments SaaS, PaaS, and IaaS, Azure Regions and Data
Centres (C4)
220
4 Microsoft Azure Storage
Evaluate Type of Azure Storage Account, Storage Services Blob, Table, queue,
File (C5: Evaluation)
221
Assessment Methods:
Formative Summative
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 -
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
223
2 2
224
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
225
Mapping of Assessment with COs
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 - -
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
3 3
Unit Content & Competencies
227
1 Introduction
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)
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
Assessment Methods:
Formative Summative
229
Mapping of Assessment with COs
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 - -
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)
232
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
233
Mapping of Assessment with COs
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 -
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
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
237
Mapping of Assessment with COs
238
SEMESTER - VI
Capstone Project
PE-IV
PE-IV Lab
SEC-IV
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
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 -
Course Content:
240
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
Unit Content & Competencies
1 Introduction to PHP:
Working of PHP scripts, Basic PHP syntax, PHP data types (C3:
Application)
241
2 Control Statements:
Using the? Operator, Using the while () Loop, the do while statement, Using
the for () Loop (C3: Application)
Functions:
String Manipulation:
Array:
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)
(C6: Synthesis)
4 Database Connectivity with MySQL:
243
Learning Strategies and Contact Hours
Assessment Methods
Formative Summative
244
Mapping of Assessment with COs
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
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 - -
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)
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
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
248
Mapping of Assessment with COs
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 - - - - - - -
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
Assessment Methods:
Formative Summative
252
Mapping of Assessment with COs
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
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.
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
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
2 2
256
Unit Content & Competencies
1 Mobile Device:
Evaluate Mobile Programming Tools, Mobile Application Evolution, Thin Client, Fat
Analyze Pros and Cons of Mobile Web App, SIM based (C4: Analysis)
(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)
Introduction to Mobile Operating Systems and why they are needed (C1: Knowledge)
258
Assessment Methods:
Formative Summative
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
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)
261
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
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 -
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
Analyzing the Data with Hadoop, Scaling Out, Hadoop Streaming (C4: Analysis)
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)
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)
265
Assessment Methods:
Formative Summative
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 -
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)
268
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
269
Mapping of Assessment with COs
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 -
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total
Hour/Week
3 3
271
Unit Content & Competencies
1 Introduction
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
What is a Thread? Thread APIs, Techniques for Parallel Computation with Threads
(C1: Knowledge)
Introducing the Thread Programming Model, Aneka Thread vs. Common Threads
(C1: Knowledge)
272
3 Data Intensive Computing:
Analyze Microsoft Azure, Azure Core Concepts, SQL Azure, Windows Azure
Platform Appliance (C4: Analysis)
273
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
274
Mapping of Assessment with COs
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 - -
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)
277
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
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 -
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)
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)
280
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
281
Mapping of Assessment with COs
282
Program Electives pool
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)
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
Assessment Methods:
Formative Summative
286
Mapping of Assessment with COs
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)
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 - - -
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)
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)
291
3 Game Architecture: Interfaces, Inheritance, Model-View-Controller,
Component View MVC (C3)
292
Assessment Methods:
Formative Summative
293
Mapping of Assessment with COs
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 - - -
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 2 3 1 2 1 3 1
CO3 2 1 - 3 - 2 -
CO4 - - 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
3 Challenges in IoT
4 Developing IoT’s
298
Learning Strategies and Contact Hours
Assessment Methods:
Formative Summative
299
Mapping of Assessment with COs
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 - - -
Course Content:
L (Hours/Week) T (Hours/Week) P (Hours/Week) Total Hour/Week
303
3 - 3
Unit Content & Competencies
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)
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
305
Mapping of Assessment with COs
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 - -
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
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
309
Mapping of Assessment with COs
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
CO2 2 3 1 2 1 3
CO3 2 1 - 3 - 2
CO4 - - 1 - - -
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
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
313
Mapping of Assessment with COs
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
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
Assessment Methods:
Formative Summative
319
Mapping of Assessment with COs
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
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)
322
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
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
CO1 3 - 2 2 2 2
CO2 2 3 1 2 1 3
CO3 2 1 - 3 - 2
CO4 - - 1 - - -
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)
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.
326
Assessment Methods:
Formative Summative
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 - - -
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
Assessment Methods:
Formative Summative
Viva-voce
Seminars
Quiz
330
Mapping of Assessment with COs
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)
333
4 DIGITAL VIDEO & CODING:
Basics of Video, Time-varying Image formation Models (C1: Knowledge)
334
Assessment Methods:
Formative Summative
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 - - - - - - -
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
Assessment Methods
Formative Summative
Viva-voce
Seminars
Quiz
338
Mapping of Assessment with COs
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
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 -
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