Set0125 B.SC Cs 2023 Syllabus
Set0125 B.SC Cs 2023 Syllabus
Set0125 B.SC Cs 2023 Syllabus
Bachelor of Science
Specialization in Computer Science
CSA, SSET, SU
Sharda School of Engineering & Technology
Department of Computer Science & Applications
B. Sc. (Computer Science)
Batch: 2023-2026 SEMESTER: I
Type of Course
1. CC
Teaching Load
2. DSE
Course Paper
S. No. Course Credits 3. OE
Code ID
4. SEC
L T P 5. AECC
L T P 6. VAC-I
THEORY SUBJECTS
1 BCO151 Problem Solving Using C 4 0 0 4 CC
2 BCO153 Digital Electronics & Computer Organization 4 0 0 4 DSE
BCO174 Introduction to Entrepreneurship Development
3 3 0 0 3 OE
BCO176 Introduction to Computers & Technology
4 BCO041 Introduction to IoT 2 0 0 2 SEC
5 ARP103 Communicative English-1 2 0 0 2 AECC
6 BCO173 Ethics and Social Implications of AI 3 0 0 3 VAC-1
Practical/Viva-Voce/Jury
7 BOL151 Problem Solving Using C Lab 0 0 2 1 CC
8 BOL041 Introduction to IOT with hands-on lab Implementation 0 0 2 1 SEC
TOTAL
20
CREDITS
CSA, SSET, SU
Sharda School of Engineering & Technology
Department of Computer Science & Applications
B. Sc. (Computer Science)
Batch: 2023-2026 SEMESTER: II
Type of Course
Teaching Load 1. CC
CSA, SSET, SU
Sharda School of Engineering & Technology
Department of Computer Science & Applications
B. Sc. (Computer Science)
Batch: 2023-2026 SEMESTER: III
Type of Course
Teaching Load 1. CC
Course Paper 2. DSE
S. No. Course Credits 3. OE
Code ID
4. SEC
5. AECC
L T P 6. Audit Course
THEORY SUBJECTS
1 BCO156 Object Oriented Programming Using Java 4 0 0 4 CC
2 BCO154 Principles of Data Base Management System 3 0 0 3 CC
3 BCO222 Computational Methods 4 0 0 4 DSE
BCO330 Introduction to Blockchain Technology
4 3 0 0 3 OE
BCO331 Cyber Analytics
5 VOC201 Augmented Reality Applications Development 2 0 0 2 SEC
6 ARP209 Logical Skills Building and Soft Skills 2 0 0 2 AECC
Practical/Viva-Voce/Jury
8 BOL156 Object Oriented Programming Using Java Lab 0 0 2 1 CC
9 BOL154 Principles of Data Base Management System Lab 0 0 2 1 CC
10 VOC201 Augmented Reality Applications Development Lab 0 0 2 1 SEC
11 RBL001 Research Based Learning-1 0 0 2 0 Audit Course
TOTAL
21
CREDITS
CSA, SSET, SU
Sharda School of Engineering & Technology
Department of Computer Science & Applications
B. Sc. (Computer Science)
Batch: 2023-2026 SEMESTER: IV
Type of Course
1. CC
Teaching Load
S. Course Paper 2. DSE
Course Credits
No. Code ID 3. OE
4. AECC
L T P 5. Audit Course
THEORY SUBJECTS
1 BCO224 Design and Analysis of Algorithm 4 0 0 4 CC
2 BCO221 Computer Networks and Data Communication 4 0 0 4 CC
3 BCO220 Application based Programming in Python 4 0 0 4 DSE
BCO403 Social Media Analytics
4 3 0 0 3 OE
BCO402 Data Warehousing and Data Mining
5 ARP210 Quantitative and Qualitative Aptitude Skill Building 2 0 0 2 AECC
Practical/Viva-Voce/Jury
7 BOL224 Design and Analysis of Algorithm Lab 0 0 2 1 CC
8 BOL220 Application based Programming in Python Lab 0 0 2 1 DSE
9 RBL002 Research Based Learning-2 0 0 2 0 Audit Course
TOTAL
19
CREDITS
CSA, SSET, SU
Sharda School of Engineering & Technology
Department of Computer Science & Applications
B. Sc. (Computer Science)
Batch: 2023-2026 SEMESTER: V
1. CC
S. Course Paper Credit
Course 2. DSE
No. Code ID s
L T P 3. INTERNSHIP
THEORY SUBJECTS
1 BCO321 Web Technologies 4 0 0 4 CC
2 BCO225 Introduction to R 4 0 0 4 CC
Software Engineering and Quality
3 BCO322 4 0 0 4 CC
Assurance
4 BRM002 Research Methodology 3 0 0 3 DSE
Practical/Viva-Voce/Jury
6 BOL321 Web Technology Lab 0 0 2 1 CC
7 BOL225 Introduction to R Lab 0 0 2 1 CC
8 RBL003 Research Based Learning-3 0 0 4 2 DSE
9 INC003 Industry Connect 0 0 2 1 INTERNSHIP
TOTAL
20
CREDITS
CSA, SSET, SU
Sharda School of Engineering & Technology
Department of Computer Science & Applications
B. Sc. (Computer Science)
Batch: 2023-2026 SEMESTER: VI
S. Course Paper 1. CC
Course Credits
No. Code ID 2. OE
3. DSE
L T P 4. VAC
THEORY SUBJECTS
1 BCO606 DotNet framework using C# 4 0 0 4 CC
2 BCO368 Machine Learning 4 0 0 4 CC
3 BCO190 Cloud Computing Fundamentals 4 0 0 4 CC
BCO604 Information Security and Cyber Laws
4 3 0 0 3 OE
BCO605 Big Data Analytics
Practical/Viva-Voce/Jury
6 BOL606 DotNet framework using C# Lab 0 0 2 1 CC
7 BOL368 Machine Learning Lab 0 0 2 1 CC
8 RBL004 Research Based Learning-4 0 0 4 2 DSE
9 CCU108 Community Connect 0 0 2 1 VAC
TOTAL
20
CREDITS
CSA, SSET, SU
Course Modules
TERM-I
CSA, SSET, SU
Syllabus: Problem solving using C Programming
CSA, SSET, SU
B Operators and expressions, Types of Statements:
Assignment, Control, jumping, Control
statements: Decisions, Loops, break, continue
C Dynamic memory allocation (malloc, calloc,
realloc, free), recursion-definition, Example-
Tower of Hanoi problem, Tail Recursion.
Unit 3 Arrays and Functions CO3, CO6
A Arrays: One dimensional and multidimensional
arrays: Declaration, Initialization and array
manipulation
B Functions: Definition, Declaration/Prototyping
and Calling, Types of functions, Parameter
passing: Call by value, Call by reference.
C Passing and Returning Arrays from Functions,
Recursive Functions.
Unit 4 Pre-processors and Pointers CO4, CO6
A Pre-processors: Types, Directives, Pre-processors
Operators (#,##,\)
B Pointer: Introduction, declaration of pointer
variables, Operations on pointers: Pointer
arithmetic, Arrays and pointers, Dynamic memory
allocation.
C String: Introduction, predefined string functions,
Manipulation of text data, Command Line
Arguments.
Unit 5 User Defined Data Types and File Handling CO5, CO6
A Structure and Unions: Introduction, Declaration,
Difference, Application, Nested structure, self-
referential structure, Array of structures, Passing
structure in function.
B Files: Introduction, concept of record, I/O
Streaming and Buffering, Types of Files: Indexed
file, sequential file and random file, creating a data
file, Opening and closing a data file, Various I/O
operations on data files: Storing data or records in
file, adding records, Retrieving, and updating
Sequential file/random file.
C Industry oriented Question solving, Expert talk on
Coding challenges.
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* Kernighan, Brian, and Dennis Ritchie. The C
Programming Language
Other 1. B.S. Gottfried - Programming With C -
References Schaum's Outline Series - Tata McGraw
Hill 2nd Edition - 2004.
CSA, SSET, SU
2. E. Balagurusamy - Programming in ANSI
C - Second Edition - Tata McGraw Hill-
1999
Course outline
This course implements array and pointer and Recursive applications. The course talks
primarily about Array, string, functions, structure & union and Pointers etc.
Course Evaluation
Attendance None
Any other CA judged on the practicals conducted in the lab , weightage may
be specified
References
Text book Kernighan, Brian, and Dennis Ritchie. The C Programming
Language
Other References 1. B.S. Gottfried - Programming With C - Schaum's Outline
Series - Tata McGraw Hill 2nd Edition - 2004.
2. E. Balagurusamy - Programming in ANSI C - Second Edition
- Tata McGraw Hill- 1999
Software Turbo C
CSA, SSET, SU
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) & Programme
No. Specific Outcomes (PSO)
1. CO1: Enumerate core concept of C PO1,PO2,PO3, PO9, PSO1,PSO2
Programming
2. CO2: Discuss programs using Array and PO1,PO3, PO4, PO5, PO9, PO11,PSO1,PSO2
String.
.
3. CO3: Develop Functions for any problem PO1,PO3,PO4, PO9, PSO2
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name- Problem solving using C
Programming Lab (Course Code BCO151)
P P P P P P P P PS
Course Code_ Course CO’
O PO O PO O O O O O O O PSO
Name s
1 2 3 4 5 6 7 8 9 10 1 2
CO1 2 2 3 2 2 2 - - 2 - 3 2
CO2 3 2 3 2 2 2 - - 3 - 3 3
CO3 2 2 3 2 2 3 - - 2 2 2 3
CO4 1 1 2 1 1 2 - 2 2 1 2 2
BCO151_Programmin
g for problem solving CO5 2 3 3 2 2 2 - 2 3 2 3 2
Lab CO6 3 2 3 3 1 3 - 3 2 2 2 3
Cou
rse P P P P P P P P P PS PS
Course Name
Cod O P O O O O O O O O O O
e 1 O2 3 4 5 6 7 8 9 10 1 2
BCO 2.1 2.8 1.6 2.3 2.3 2.3 1.7 2.5 2.5
Problem Solving using C
151 7 2 3 2 7 3 - 3 3 5 0 0
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
CSA, SSET, SU
Syllabus: Digital Electronics & Computer Organization
CSA, SSET, SU
A Latch, Flip Flops- R-S, J-K, Master-Slave J-K Flip-Flop, Race CO3, CO6
Condition, Removing Race Condition
B D Flip-Flop, T Flip-Flop, Sequential Circuits: Registers and CO3, CO6
Counters: Shift Registers, Ripple Counter, Synchronous
Counter, Ring counter
C Asynchronous Circuits: Analysis procedure, circuit with latches, CO3, CO6
Design procedure, Race free state assignment, hazards
Unit 4 Basic Computer Organization and Design
A Digital computer: functional units and their interconnections, CO4, CO6
buses, Bus architecture, types of buses and bus arbitration. Bus
and memory transfer, micro-operations
B Control Unit: Processor organization: general register CO4, CO6
organization, stack organization and addressing modes
C Memory Unit: Basic concept and hierarchy, semiconductor CO4, CO5, CO6
devices, RAM memories and types, ROM memories and types
Unit 5 Memory Management & I/O Interfaces
A Virtual memory vs Cache memory, Cache memory: concept and CO5, CO6
design issues, performance, address mapping and replacement
techniques
B Peripheral devices, I/O interface, I/O ports, interrupts, types of CO5, CO6
interrupts, modes of data transfer: programmed I/O, interrupt
initiated I/O and Direct Memory Access
C Memory Management CO5, CO6
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Moris Mano, “Digital Logic and Computer Design”, PHI
Publications, 2002
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky,
“Computer Organization”, McGraw-Hill, Fifth Edition,
Reprint 2012
3. David A. Patterson and John L. Hennessy, “Computer
Organization and Design: The Hardware/Software
Interface”
CSA, SSET, SU
CO and PO Mapping
S. No. Course Outcome (CO) Programme Outcomes (PO) &
Programme Specific Outcomes
(PSO)
1. CO1: Define the basic logic operations and simplify using Boolean PO1, PO2, PO3, PO4, PO8, PO9,
algebra and/or Karnaugh mapping techniques, sum of products PO10, PSO1
(SOP) and product of sums (POS).
2. CO2: Illustrate combinatorial logic circuits and explain their PO1, PO2, PO3, PO4, PO8, PO10
operation.
3. CO3: Construct different types of sequential logic circuits using Flip PO1, PO2, PO3, PO4, PO8, PO10,
Flops. PSO1
4. CO4: Analyze the basic structure and functional units of a digital PO1, PO2, PO3, PO4, PO8, PO10,
computer & understand basic processing unit and organization of PSO1
simple processor.
5 CO5: Explain hierarchical memory systems including cache PO1, PO2, PO3, PO4, PO6, PO10
memories & select appropriate interfacing standards for I/O devices.
6 CO6: Finding and highlighting the applications of digital electronics PO1, PO2, PO3, PO4, PO5, PO6,
and computer organization in real life. PO8, PO9, PO10, PSO1
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Digital Electronics & Computer
Organization (Course Code: BCO153)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 3 3 - 3 - - - 2 2 3 3 -
CO2 3 3 3 3 - - - 3 - 2 3 -
CO3 3 3 3 3 - - - 3 - 3 2 -
CO4 3 3 3 3 - - - 3 - 3 3 -
CO5 2 2 2 3 - 2 - - - 2 - -
CO6 2 3 3 3 2 2 - 3 3 3 3 -
Course Code PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
BCO153 2.67 2.83 2.80 3.00 2.00 2.00 - 2.80 2.50 2.67 2.80 -
CSA, SSET, SU
Syllabus: Introduction to Entrepreneurship Development
6 Course Outcomes After successfully completion of this course students will be able to:
CO1. To understand how start up entrepreneurship is supportive for enhancing
business.
CO2. Outline different ways of idea generation as innovator.
CO3. Identify & utilize various Government policy for Small Scale Enterprises and its
impact on Business.
CO4. Analyze various financial schemes available to start up their enterprise.
CO5. Assess the importance & significance of institutional support at various levels for
determining the entrepreneurial climate.
CO6. Develop the art of creativity and innovations in managing the entrepreneurial
activities effectively.
7 Outline syllabus CO
Mapping
Unit 1 Introduction to Entrepreneurship CO1
Meaning, Definition and concept of Enterprise, Entrepreneurship and CO1
A
Entrepreneurship Development, Evolution of Entrepreneurship
Theories of Entrepreneurship. Characteristics of Entrepreneurship, CO1
B Concepts of Intrapreneurship, Entrepreneur v/s Intrapreneur, Entrepreneur
Vs. Entrepreneurship, Entrepreneur Vs. Manager
Role of Entrepreneurship in Economic Development, Factors affecting CO1
C
Entrepreneurship, Problems of Entrepreneurship
Unit 2 Entrepreneurship Journey as Innovator CO2
A Idea generation, Feasibility Study and opportunity assessment CO2
B Business Plan: meaning, purpose and elements, Execution of Business Plan CO2
Entrepreneurs as problem solvers, Innovations and Entrepreneurial CO2, CO6
C
Ventures – Global and Indian,
Unit 3 Setting Up Small Business Enterprises CO3
Identifying the business Opportunity – Business opportunity in various CO3
A
Sectors – Formalities for setting up a small Business Enterprise
Benefits to Small Scale Enterprises: Tax Holiday, Rehabitation Allowance, CO3
B
Investment Allowance,
Government policy for Small Scale Enterprises: New Small Enterprise CO3, CO6
C Policy 1991, Micro Small & Medium Enterprises Development (MSMED)
Act 2006
Unit 4 Role of Government in promoting Entrepreneurship CO4
CSA, SSET, SU
MSME policy in India, Agencies for Policy Formulation and CO4, CO6
A Implementation: District Industries Centres (DIC), Entrepreneurship
Development Institute of India (EDII),
National Institute of Entrepreneurship & Small Business Development CO4, CO6
B
(NIESBUD), National Entrepreneurship Development Board (NEDB),
Financial Support System: long term and short-term financial support, CO4, CO6
C
Investment Institutions.
Unit 5 IPM & Institutional support for small businesses in India CO5
Intellectual Property Management, Importance of innovation, patents & CO5
A
trademarks in small businesses,
Introduction to laws relating to IPR in India, Support in areas of CO5
B
entrepreneurship development
Case Studies based on Role of Industry 4.0 in innovations, Case Studies CO5, CO6
B
based on IPR & Patents
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA CE (VIVA) ESE
Distribution 25% 25 50%
Text book/s* 1. Udyamita by Dr. MMP. Akhouri and S.P Mishra, By National
Institute for Entrepreneurship and Small Business Development
(NIESBUD), NSIC-PATC Campus, Okhla
2. Entrepreneurial Development by Dr S S Khanka, S Chand &
Company Ltd
3. Entrepreneurship Development & Small Business Enterprises by
Poornima M Charantimath, Pearson.
4. Lall & Sahai: Entreprenurship (Excel Books 2 edition) Couger, C-
Creativity and Innovation (IPP, 1999)
5. Kakkar D N - Enterpreneurship Development (Wiley Dreamtech)
CSA, SSET, SU
CO and PO Mapping
S. No. Course Outcome Programme Outcomes (PO) &
Programme Specific Outcomes (PSO)
1. CO1. To understand how start up entrepreneurship is supportive PO1, PO5, PO9,
for enhancing business.
2. CO2. Outline different ways of idea generation as innovator. PO1, PO2, PO3, PO4, PO5, PO6
3. CO3. Identify & utilize various Government policy for Small PO10,
Scale Enterprises and its impact on Business.
4. CO4. Analyze various financial schemes available to start up their PO8, PO10,
enterprise.
5. CO5. Assess the importance & significance of institutional PO4, PO7,
support at various levels for determining the entrepreneurial
climate.
6. CO6. Develop the art of creativity and innovations in managing PO2, PO3, PO4, PO5,
the entrepreneurial activities effectively.
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name Introduction to Entrepreneurship
Development (BOL451)
CO2 1 1 2 3 3 3 - - - - - -
BOL451
Introduction to CO3 - - - - - - - - - 3 - -
Entrepreneurship - - - - - - - - - - -
CO4 1
Development
CO5 - - - 1 - - 3 - - - - -
CO6 - 1 3 2 1 - - - - - - -
Strength of Correlation
CSA, SSET, SU
Syllabus: Introduction to Artificial Intelligence
School: School of Engineering & Technology
Department Department of Computer Science &Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester: I
1 Course Code BCO283
2 Course Title Introduction to Artificial Intelligence
3 Credits 4
4 Contact Hours 4-0-0
(L-T-P)
Course Status Open Elective
5 Course Objective The objective of the course is to introduce basic fundamental concepts in Artificial
Intelligence (AI) and Expert Systems, with a practical approach in understanding them.
To visualize the scope of AI and its role in futuristic development.
6 Course Outcomes After the completion of this course, students will be able to:
CO1: Relate the goals of Artificial Intelligence and AI and non-AI solution.
CO2: Analyze and various AI uninformed and informed search algorithms.
CO3: Extend knowledge representation, reasoning, and theorem proving techniques to
real-world problems.
CO4: Make use of various learning techniques to understand AI problems.
CO5: Explain about Expert system & discuss various case studies of it.
CO6: Develop independent (or in a small group) research with help of AI techniques
and communicate it effectively.
7 Course Description In this course students will learn basic introduction of Artificial Intelligence, problem
solving agents, reasoning, learning and applications of artificial intelligence.
8 Outline syllabus CO
Mapping
Unit 1 INTRODUCTION TO AI
A Foundation of AI, Goals of AI, The AI Problems, Importance of AI, AI CO1
and its related field, AI techniques, Criteria for success.
B Introduction to Intelligent Agents; Environment; Structure of Agent CO1
C Problems, problem space and search: Defining the problem as a state CO1, CO2
space search, Production system and its characteristics, Issues in the
design of the search problem.
Unit 2 SEARCH METHODS
A Problem Characteristics Searching strategies –Uninformed search and CO1, CO2
Informed search strategies. State space search, Uniformed search
techniques: Depth first search, Breadth first search, Bidirectional Search,
B Informed search: Heuristic function, Hill climbing search, Best first CO1, CO2
search, A* & AO* Search, Generate and Test, Heuristic Search
Techniques Hill climbing– issues in hill climbing. Problem solving using
Search Techniques;
C Constraint satisfaction problem; Game tree, Evaluation function, Mini- CO1, CO2
Max search, Alpha-beta pruning, Games of chance.
Unit 3 KNOWLEDGE REPRESENTATION & REASONING
A Introduction to KR, Knowledge agent, Predicate logic, Inference rule & CO3
theorem proving forward chaining, backward chaining,
B Propositional knowledge, Boolean circuit agents; Rule Based Systems, CO3
Forward reasoning: Conflict resolution,
C Backward reasoning: Structured KR: Semantic Net - slots, inheritance CO3
Unit 4 LEARNING
A Common Sense Vs Learning; Components; Representations; Feedback CO3, CO4
B Learning Types: Supervised; Unsupervised; Reinforcement Learnings CO3, CO4
CSA, SSET, SU
C Rote learning, Learning by Taking Advice, Learning in Problem-solving, CO3, CO4
Learning from example: induction, Explanation-based learning.
Unit 5 EXPERT SYSTEM
A What is Expert system, Components of Expert System, Representing and CO5, CO6
using Domain Knowledge, Reasoning with knowledge, Expert System
Shells, Knowledge acquisition examples
B Robotics – Hardware; Vision; Navigation based case studies; CO5, CO6
C Case studies on Expert System CO5, CO6
Mode of examination Theory
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Rich E & Knight K, Artificial Intelligence, Tata McGraw
Hill, Edition 3.
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name Introduction to Artificial
Intelligence (BCO0283)
Course
Course Name
Code PO 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 11 PSO 2
Introduction to
BCO283 Artificial 2.2 2.8 3.0 2.7 2.5 1.8 1.5 2.0 3.0 1.8 2.2 2.8
Intelligence
Strength of Correlation
CSA, SSET, SU
Syllabus: Introduction to IoT
CSA, SSET, SU
B Sensor Functions: Light Sensor Functions, Temperature Sensor CO1, CO4, CO5
Functions, Humidity Sensor Functions
C Pressure and Temperature sensor Functions, GPS Functions, Passive CO1, CO4, CO5
Infrared Functions
Unit 5 Domain specific applications of IoT
A Home automation concept and case study CO1, CO3, CO6
B Industry applications concept and case study CO1, CO3, CO6
C Surveillance applications concept and case study, Other IoT CO1, CO3, CO6
applications
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. The Internet of Things: Connecting Objects to the Web edited by
HakimaChaouchi, Reference for Unit-1.
2. Introduction to Internet of Things, Prof. SudipMisra, NPTEL
Lectures Notes, Department of Computer Science and
Engineering, Indian Institute of Technology Kharagpur,
Reference for Unit 2, 3 (c), 4.
3. Internet of Things, RajkumarBuyya, Reference for Unit 3 (c)
4. ArshdeepBahga and Vijay Madisetti, “Internet of Things – A
Hand-on Approach”, Universities press, 2015, Reference for Unit
3 (B)
5. API REFERENCE GUIDE: SENSEnuts WSN sensation
Other References 1. CharalamposDoukas , "Building Internet of Things with the
Arduino", Create space, April 2002
2. Dr.OvidiuVermesan and Dr. Peter Friess, “Internet of Things:
From research and innovation to market deployment”, River
Publishers 2014.
3. Contiki : The open source for IOT, www.contiki-os.org
CSA, SSET, SU
CO and PO Mapping
S. No. Course Outcome Programme Outcomes (PO) & Programme
Specific Outcomes (PSO)
1. CO1: Understand the general concepts of Internet of PO1, PO2, PO3, PO6, PO7, PSO2
Things.
2. CO2: Recognize the basic M2M Ecosystem and PO1, PO2, PO3, PO6, PO7, PSO2
change from M2M to IoT.
3. CO3: Outline the concepts of SENSEnut platform PO1, PO4, PO5, PO6, PO9, PO10, PSO2
4. CO4: Explain basic sensor functions available with PO1, PO2, PO3, PO4, PO5, PO6, PO7, PO9,
SENSEnuts devices PO10, PSO2
5. CO5: Explain the challenges in IoT specific PO1, PO2, PO3, PO4, PO5, PO6, PO7, PSO2
application.
6. CO6: Discuss the various domains where IOT can be PO1, PO2, PO3, PO4, PO5, PO6, PO7, PO9,
applied successfully. PSO2
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name Introduction to IoT
Course Code_ PO PO PO
CO’s PO 1 PO4 PO 5 PO 6 PO 7 PO 8 PO 9 PSO1 PSO2
Course Name 2 3 10
CO1 3 1 1 - - 2 1 - - - - 3
CO2 2 2 1 - - 1 3 - - - - 3
Introduction to CO3 2 2 2 2 3 2 2 - 2 2 - 3
IoT
CO4 2 3 2 2 3 2 2 - 2 2 - 3
CO5 3 3 3 3 3 2 3 - - - - 3
CO6 2 2 2 2 3 2 3 - - - - 3
Course PO PO
Course Name
Code 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 10 PSO 1 PSO 2
Introduction to
2.3 2.2 1.8 2.3 3.0 1.8 2.3 0.0 2.0 2.0 0.0 3.0
IoT
Strength of Correlation
CSA, SSET, SU
Syllabus: Communicative English-1
CO5 Develop, share and maximise new ideas with the concept
of brainstorming and the documentation of key critical thoughts
articulated towards preparing for a career based on their
potentials and availability of opportunities.
CSA, SSET, SU
CO
Unit A Sentence Structure Mappin
g
Topic 1 Subject Verb Agreement
CO1
Topic 2 Parts of speech
Topic 3 Writing well-formed sentences
Unit B Vocabulary Building & Punctuation
CO1,
Topic 1 Homonyms/ homophones, Synonyms/Antonyms
CO2
CO1,
Topic 2 Punctuation/ Spellings (Prefixes-suffixes/Unjumbled Words)
CO2
CO1,
Topic 3 Conjunctions/Compound Sentences
CO2
Unit C Writing Skills
Topic 1 Picture Description – Student Group Activity CO3
Positive Thinking - Dead Poets Society-Full-length feature film
CO3,
- Paragraph Writing inculcating the positive attitude of a learner
Topic 2 CO2,
through the movie | SWOT Analysis – Know yourself
CO3
Story Completion Exercise –Building positive attitude - The CO2,
Topic 3
Man from Earth (Watching a Full length Feature Film ) CO3
Topic 4 Digital Literacy | Effective Use of Social Media CO3
Unit D Speaking Skill
Topic 1 Self-introduction/Greeting/Meeting people – Self branding CO4
Describing people and situations - To Sir With Love ( CO4
Topic 2
Watching a Full length Feature Film )
Topic 3 Dialogues/conversations (Situation based Role Plays) CO4
Unit 4 Professional Skills | Career Skills
CO4,
Topic 1 Exploring Career Opportunities
CO5
CO4,
Topic 2 Brainstorming Techniques & Models
CO5
CO4,
Topic 3 Social and Cultural Etiquettes
CO5
CO4,
Topic 4 Internal Communication
CO5
Leadership and
Unit 5
Management Skills
CO6
Topic 1 Managerial Skills
CO6
Topic 2 Entrepreneurial Skills
CSA, SSET, SU
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 - - - - - - - - 1 3 - -
CO2 - - - - - - - - 1 3 - -
CO3 - - - - - - - - 1 3 - -
CO4 - - - - - - - - 1 2 - -
CO5 - - - - - - - - 1 2 - -
CO6 - - - - - - - - 1 2 - -
CSA, SSET, SU
Syllabus: Problem solving using C Programming Lab
CSA, SSET, SU
Write a c program to find largest number from
array using pointers
Unit 5 User Defined Data Types and File Handling CO5, CO6
Write a c program to store information of a student
using structure
Write a c program to store information of a student
using union
Mode of Practical
examination
Weightage CA CE ESE
Distribution 25% 25% 50%
Text book/s* Kernighan, Brian, and Dennis Ritchie. The C
Programming Language
Other 1. B.S. Gottfried - Programming With C -
References Schaum's Outline Series - Tata McGraw
Hill 2nd Edition - 2004.
2. E. Balagurusamy - Programming in ANSI
C - Second Edition - Tata McGraw Hill-
1999
Course outline
This course implements array and pointer and Recursive applications. The course talks
primarily about Array, string, functions, structure & union and Pointers etc.
Course Evaluation
Attendance None
Any other CA judged on the practicals conducted in the lab , weightage
may be specified
References
Text book Kernighan, Brian, and Dennis Ritchie. The C Programming
Language
Other References 1. B.S. Gottfried - Programming With C - Schaum's Outline
Series - Tata McGraw Hill 2nd Edition - 2004.
2. E. Balagurusamy - Programming in ANSI C - Second
Edition - Tata McGraw Hill- 1999
Software Turbo C
CSA, SSET, SU
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO) &
No. Programme Specific Outcomes
(PSO)
1. CO1: Enumerate core concept of C Programming PO1,PO2,PO3, PO9, PSO1,PSO2
2. CO2: Discuss programs using Array and String. PO1,PO3, PO4, PO5,
. PO9,PSO1,PSO2
3. CO3: Develop Functions for any problem PO1,PO3,PO4, PO9, PSO2
4. CO4: Classify Union and Structure to write any PO1,PO3,PO4, PO9, PSO2
program
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name- Problem solving using C
Programming Lab (Course Code BCP151)
P
CO P P P P P P P O PS
Course Code_ Course Name
’s O PO O P O O O O O 1 O PS
1 2 3 O4 5 6 7 8 9 0 1 O2
BCP151_Programming for CO
problem solving Lab 1 2 2 3 2 2 2 - - 2 - 3 2
CO
2 3 2 3 2 2 2 - - 3 - 3 3
CO
3 2 2 3 2 2 3 - - 2 2 2 3
CO
4 1 1 2 1 1 2 - 2 2 1 2 2
CO
5 2 3 3 2 2 2 - 2 3 2 3 2
CO
6 3 2 3 3 1 3 - 3 2 2 2 3
Cour P P P P P P P P P P PS PS
se Course Name O O O O O O O O O O O O
Code 1 2 3 4 5 6 7 8 9 10 1 2
BCP Programming for problem 2. 2. 1. 2. 2. 2. 1. 2.5 2.5
181 solving Lab 17 2 83 2 67 33 - 33 33 75 0 0
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
CSA, SSET, SU
Syllabus: Introduction to IoT Lab
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester: I
School: School of Engineering & Technology
1 Course Code BOL041
2 Course Title Introduction to IoT Lab
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status
5 Course Objective The objective of the course is to deploy a network for statistical analysis or control
applications. This course can help in connecting thesensors to platform to get the desired
readings using extender.
6 Course Outcomes CO1: Understand the working of IoT Platforms.
CO2:Recognize the various sensors and actuators.
CO3: Outline the concepts of SENSEnut platform
CO4: Demonstrate Blink application using SENSEnutsdevices
CO5: Experiment with environment sensors onSENSEnuts GUI.
CO6: Design embedded applications using SENSEnut Platform
7 Course Description SENSEnuts platform can be used to test newly developed routing and application
layeralgorithms. It provides a flexible mac with around 9 parameters that can be
controlled at mac and4 at physical giving user the kind of flexibility to control their
network environment.
8 Outline syllabus CO Mapping
Unit 1 Introduction to IoT Platforms
CSA, SSET, SU
To develop a code for LED blinks operation for SENSEnuts device.
CO3, CO4
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Introduction to IoT Lab
(BOL041)
Course Course
PO 1 PO2 PO 3 PO 4 PO 5 PO 6 PO7 PO8 PO9 PO10 PSO1 PSO 2
Code Name
BOL0 Introduc
tion to 2.3 2.2 2.2 2.0 3.0 2.0 2.0 2.2 2.5 2.5 0.0 2.0
41 IoT Lab
Strength of Correlation
CSA, SSET, SU
TERM-II
CSA, SSET, SU
Syllabus: Data Structures Using C
3 Credits 4
4 Contact Hours (L-T-P) 4-0-0
6 Course Outcomes After the completion of this course, students will be able to:
CO-1. Apply the basic operations on arrays.
CO-2. Construct complex programs like matrix implementations on
arrays.
CO-3. Apply the concept of stacks and queues in real life problem solving.
CO-4. Apply the concepts of data structure, like linked list to solve complex
problems.
CO-5. Solving the real-life problems based on trees.
CO-6 Implementing the graphs and apply graph concept in computer
networks.
7 Course Description The purpose of this course is to understand and use data structures that are
backbone of computer science. A basic understanding of data structure topics
is fundamental for work in computer science. In this course we will discover
taking form arrays to stacks, queues, linked list, trees and graphs including
searching and sorting.
CSA, SSET, SU
C Representation of stacks & queues using linked, sequential and CO2, CO6
their applications. Making a program that implement Stack and
Queue.
Unit 3 Linked list sorting and searching
A Linked list, singly linked list and doubly linked list,
CO1,CO3, CO6
representation of linked list in memory
B Algorithms like insertion, deletion at beginning, middle and at
CO1,CO3, CO6
the end of the linked list
C Various types of sorting like bubble sort, selection sort, insertion
sort, heap sort, quick sort and searching like linear and binary CO1,CO3, CO6
search algorithms
Unit 4 Introduction to Trees
A Trees: Definition, Binary tree, Binary tree traversal: pre-order,
CO4,CO5
in-order and post-order, Binary search tree.
B Binary search trees and operation like insertion deletion on
binary search trees, AVL search trees with insertion deletion and CO4,CO5
rotation.
C M-way search trees, B-Trees and B+ Trees CO4,CO5
Unit 5 Trees and Graph Theory.
A Graphs: Definition and terminology, Representation of graphs CO4,CO5
B Minimum spanning trees by Prims Algorithms and Krushkal’s
CO4,CO5
Algorithm
C Multi graphs, Bipartite graphs, Planar graphs, Isomorphism and
Homeomorphism of graphs, Euler and Hamiltonian paths, CO4,CO5, CO6
Graph colouring.
Mode of Theory/Jury/Practical/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. A Common-Sense Guide to Data Structures and
Algorithms, Second Edition: Level Up Your Core
Programming Skills 2nd Edition
2. Data Structures Through C (A Practical
Approach) Paperback – 1 January 2016
by G.S. Baluja
Other 3. Aaron M. Tenenbaum, Yedidyah Langsam and
References Moshe J. Augenstein “Data Structures Using C and
C++” , PHI
4. Horowitz and Sahani, “Fundamentals of Data
Structures”, Galgotia Publication
CSA, SSET, SU
CO and PO Mapping
S. Course Outcome Program Outcomes (PO)
No.
1. CO-1. Apply the basic operations on PO1,PO2,PO3,PO4,PO7,PO10,PSO1,PSO2
arrays.
2. CO-2. Construct complex programs PO1,PO2,PO3,PO4,PO7,PO10,PSO1,PSO2
like matrix implementations
on arrays.
3. CO-3. Apply the concept of stacks PO1,PO2,PO3,PO4,PO7,PO10,PSO1,PSO2
and queues in real life problem
solving.
4. CO-4. Apply the concepts of data PO1,PO2,PO3,PO4,PO5,PO7,PO10,PSO1,PSO2
structure, like linked list to solve
complex problems.
5. CO-5. Solving the real-life problems PO1,PO2,PO3,PO4,PO5,PO7,PO10,PSO1,PSO2
based on trees.
6. CO-6. Implementing the graphs and PO1,PO2,PO3,PO4,PO5,PO7,PO10,PSO1,PSO2
apply graph concept in computer
networks.
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Data Structures Using C
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
2 1 1 1 - - 2 - 1 1 1
CO1
2 2 2 1 - - 2 - - 1 1 2
CO2
2 2 2 1 - - 2 - - 1 2 2
CO3
2 1 2 3 2 - 2 - - 1 1 1
CO4
2 2 3 2 2 - 2 - - 1 2 2
CO5
3 3 3 2 2 - 2 - - 1 2 2
CO6
Avg. PO
2.16 1.8 2.16 1.67 2 2 1 1.5 1.67
attained
CSA, SSET, SU
Syllabus: Operating Systems and Unix Shell Programming
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester: I
1 Course Code BCO155
6 Course Outcomes CO1: Define role, responsibilities, features, and design of operating system.
CO2: Demonstrate the Process Management and Scheduling techniques
CO3: Implement tools and utility of operating systems.
CO4: Apply various memory management techniques to understand file and disk
management and analyze it.
CO5: Understand the concepts of Unix and shell programming.
CO6: Design and develop solutions to real world problem using Unix
7 Course Description This course introduces the design principles of operating systems, resource
management, identifying challenges and applying respective algorithms. This
course will also provide the basics of unix and shell programming.
8 Outline syllabus CO Mapping
Unit 1 Introduction to Operating System Concepts
A Operating System Concepts and functions, Components of CO1, CO2
Computer System, Need of Operating system,
B Types of Operating Systems- Batch, Multiprogramming, CO1, CO2
Multi-Tasking, Multiprocessing, Distributed, Clustered,
Embedded and Real Time Operating System.
C User Mode Vs Kernel Mode, Threading, Comparison CO1, CO2
between Process and Thread
Unit 2 Process Management and Scheduling
A Process Concepts- PCB, Process States, Process Operations. CO1, CO2
B CPU Scheduling: Concept , Types of schedulers- (Short CO1, CO2, CO4
term, Long term, Middle term), Dispatcher,
CSA, SSET, SU
B Virtual memory concept, demand paging, Page replacement CO3, CO5
algorithms(FCFS, Optimal, LRU),
C File Concept ,File operations, File Directories, Case study CO2,CO3, CO5
of Windows Operating System, Disk structure , Disk
scheduling(FCFS,SSTF, SCAN, LOOK,C-SCAN, C-
LOOK)
Unit 5 Unix and Shell Scripting
A Unix file system, Commands related to Process and File CO1, CO2,CO3
Handling.
B System Calls (File related, Device related, Information CO1, CO4,CO6
related, Process Control Related and Communication
related)
C Fork System Call, Creating a Parent - Child Process CO1, CO4,CO6
Mode of examination Theory/Jury/Practical/Viva
Weightage Distribution CA MTE ESE
25% 25% 50%
Text book/s* 1. Silberschatz G, Operating System Concepts, Wiley
Other References 1. W. Stalling, “Operating System”, Maxwell
Macmillan
2. Tannenbaum A S, Operating System Design and
Implementation, Prentice Hall India
3. Milenkovic M, Operating System Concepts,
McGraw Hill
CSA, SSET, SU
CO and PO Mapping
S. No. Course Outcome Programme Outcomes (PO) &
Programme Specific Outcomes (PSO)
1. CO1: Define role, responsibilities, features, and design of PO1,PO2,PO3,PO4,PSO1
operating system.
2. CO2: Demonstrate the Process Management and Scheduling PO1, PO3, PO4, PSO2
techniques
3. CO3: Implement tools and utility of operating systems. PO1,PO2,PO3,PO4
4. CO4: Apply various memory management techniques to PO9, PO10,PO11
understand file and disk management and analyze it.
5. CO5: Understand the concepts of Unix and shell PO1,PO2,PO8,PO9,PO10,PSO1
programming.
6. CO6: Design and develop solutions to real world problem PO1,PO2,PO10,PSO1,PSO2
using Linux
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Operating Systems and Unix
shell Programming (Course Code BCO155)
Course
Code_
CO’s
Course PO PO PSO
Name PO 1 2 3 PO4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 1 PSO2
3 3 3 3 -- -- -- 2 2 1 3 2
CO1
3 2 3 3 -- -- -- 2 2 2 2 3
CO2
3 3 3 3 -- -- -- 1 1 1 3 2
CO3
2 2 2 2 1 -- -- 2 3 3 2 2
BCO155
OS & CO4
Shell 2 2 2 3 3 1 3
Programm CO5
ing CO6 3 2 2 2 2
Course Course
Code Name PO 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 1 PSO 2
OS & shell
Programmin 2.83 2.67 1.67 1.67 1.00 1.00 1.00 2.00 1.00 2.67 2.50
g
Strength of Correlation
CSA, SSET, SU
Syllabus: Ethics and social Implications of AI
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester: I
1 Course Code BCO173
2 Course Title Ethics and Social Implications of AI
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status OE
5 Course The objective of the course "Ethics and Social Implications of AI" is to provide students with
Objective a comprehensive understanding of the ethical considerations and broader societal implications
associated with artificial intelligence (AI) technologies
6 Course After the completion of this course, students will be able to:
Outcomes CO1: Relate and explain the ethical considerations in the development and deployment of
AI.
CO2: Analyze and evaluate the social and ethical impacts of AI on various stakeholders and
society as a whole.
CO3: Extend propose ethical decision-making models relevant to AI applications.
CO4: Make use of the implications of AI on privacy, data protection, bias, fairness,
transparency, and accountability.
CO5: Explain and address ethical challenges in AI research, development, and governance.
CO6: Develop and discuss the ethical responsibilities of AI practitioners, policymakers, and
organizations.
7 Course The course "Ethics and Social Implications of AI" is designed to explore the ethical dimensions
Description and social implications of AI technologies. It provides an in-depth examination of the ethical
considerations that arise in the development, deployment, and use of AI systems.
8 Outline syllabus CO
Mapping
Unit 1 Introduction to Ethics and Social Implications of AI
A Introduction to Ethics and AI, Historical and philosophical foundations of CO1
ethics, Ethical theories and frameworks ,Ethical decision-making models
B Impact of AI on society Ethical considerations in AI development and CO1
deployment Privacy and data protection in AI,
C Bias ,fairness, and accountability in AI Transparency and explainability in AI CO1, CO2
systems Ethical challenges in AI research
Unit 2 Ethical Issues in AI Governance and Policy
A AI governance frameworks and initiatives, Ethical considerations in AI CO1, CO2
regulation and policy-making, Intellectual property and AI, Ethical
implications of AI patents
B Ethical issues in AI transparency and auditability, Algorithmic accountability CO1, CO2
and responsibility, Ethical considerations in AI procurement and use by
governments
C AI ethics committees and their role, Ethical challenges in AI governance and CO1, CO2
policy, International perspectives on AI ethics and regulation
Unit 3 AI and Human Rights
A AI and privacy rights, Ethical considerations in AI surveillance technologies, CO3
AI and freedom of expression
B Ethical implications of AI in law enforcement and criminal justice, AI and CO3
discrimination in employment and hiring, AI and social inequality
C Ethical issues in AI-powered decision-making systems, AI and the right to CO3
access information, Ethical considerations in AI-mediated communication,AI
and the right to a fair trial
Unit 4 AI and Workforce Ethics
CSA, SSET, SU
A AI and the future of work, Ethical implications of AI in job displacement and CO3, CO4
automation, AI and job creation
B Ethical considerations in AI-based hiring and recruitment, AI and workplace CO3, CO4
surveillance, Bias and discrimination in AI-based employment systems
C Ethical challenges in AI-driven skill assessment and training, AI and worker CO3, CO4
well-being, AI and ethical implications for professional responsibilities, AI and
labor rights
Unit 5 Ethical AI Development and Deployment
A Ethical considerations in AI system design and development, Ethical use of data CO5, CO6
in AI, responsible AI research and innovation
B Ethical implications of AI in healthcare, AI and autonomous systems ethics, AI CO5, CO6
and environmental sustainability, Ethical considerations in AI for social good
C AI and the ethical challenges in autonomous vehicles, AI and ethical CO5, CO6
implications in education,AI and the future of humanity
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Paula Boddington, ―Towards a Code of Ethics for Artificial
Intelligence‖, Springer, 2017
2. Markus D. Dubber, Frank Pasquale, Sunit Das, ―The Oxford
Handbook of Ethics of AI‖, Oxford University Press Edited book,
2020.
Reference 3. Wallach, W., & Allen, C, ―Moral machines: ceaching robots right
Books from wrong‖, Oxford University Press, 2008.
4. Bostrom and E. Yudkowsky. ―The ethics of artificial intelligence‖. In
W. M. Ramsey and K. Frankish, editors, The Cambridge Handbook of
Artificial Intelligence, Cambridge University Press, Cambridge, 2014.
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Ethics and Social Implications of
AI(BCO173)
BCO173 CO2 2 3 3 2 3 - - - - 2 3 3
Ethics and CO3 3 3 3 3 2 1 1 - - 1 3 2
Social
Implications of CO4 3 3 3 3 2 2 1 - - 2 3 2
AI CO5 2 3 3 3 3 2 2 2 3 2 3 3
CO6 2 3 3 3 3 2 2 2 3 2 3 3
PO
Course Code Course Name PO2 PO 3 PO 4 PO 5 PO 6 PO7 PO8 PO9 PO10 PSO1 PSO 2
1
Ethics and 2.2 2.8 3.0 2.7 2.5 1.8 1.5 2.0 3.0 1.8 3.0 2.5
Social
BCO173 Implications
of AI
Strength of Correlation
CSA, SSET, SU
Syllabus: Design Thinking and Creative Learning
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester: II
1 Course Code VOC102 Course Name: Design Thinking and Creative Learning
2 Course Title Design Thinking and Creative Learning
3 Credits 1
4 Contact Hours (L-T-P) 1-0-0
7 Course Description This course introduces Design Thinking methodologies, processes and tools that
can be used to make the world a better place. Students explore Design thinking
theories and how they can be applied to practical situations relevant to various
academic disciplines and organizational roles. Among the topics covered are
ideation, prototyping, iteration and innovation. Through personal reflection,
students will also examine how they can harness the power of design thinking for
leading the creation of value for businesses, organizations and society.
8 Outline syllabus CO Mapping
Unit 1 Skills in Design Thinking
B As a first step toward user innovation, learn to identify consumer CO1, CO6
requirements and write customer needs statements.
Unit 2 Product Specifications and Applying Creativity
CSA, SSET, SU
A Learn how to statistically translate customer needs into product CO2
specifications and how product metrics can aid in the definition
of those specs.
B Learn how to design needs solutions using creativity, CO2, CO6
brainstorming, and concept generation.
CSA, SSET, SU
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Explain the basics concepts of Design PO1,PO2,PO3,PO4,PO7,PO9,PSO1,PSO2
Thinking
2. CO2: Design solutions as per needs and PO1,PO2,PO3,PO4,PO7,PO9,PSO1,PSO2
Translate customer needs into product
specifications
3. CO3: To apply product development concepts PO1,PO2,PO3,PO4,PO7,PO9,PSO1,PSO2
to the service environment.
4. CO4: Design the Architecture of a product. PO1,PO2,PO3,PO4,PO6,PO7,PO9,PSO1,PSO2
5. CO5: To apply environmental design concepts PO1,PO2,PO3,PO4,PO6,PO7,PO9,PSO1,PSO2
to the life cycle of a product.
6. CO6: To apply Design Thinking approach to PO1,PO2,PO3,PO4,PO6,PO7,PO9,PSO1,PSO2
various examples and real life applications.
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Design Thinking and Creative
Learning (VOC102)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
2 1 1 1 - - 2 1 - 1 1
CO1
2 2 2 1 - - 2 1 - 1 2
CO2
2 2 2 1 - - 2 1 - 2 2
CO3
2 1 2 3 - 2 2 1 - 1 1
CO4
2 2 3 2 - 2 2 1 - 2 2
CO5
3 3 3 2 - 2 2 1 - 2 2
CO6
Avg. PO
2.16 1.8 2.16 1.67 2 2 1 1.5 1.67
attained
CSA, SSET, SU
Syllabus: Communicative English-2
The course takes the learnings from the previous semester to an advanced
level of language learning and self-comprehension through the introduction
of audio-visual aids as language enablers. It also leads learners to an
7 Course Description
advanced level of writing, reading, listening and speaking abilities, while
also reducing the usage of L1 to minimal in order to increase the
employability chances.
8
Acquiring Vision, Goals and Strategies through Audio-visual CO
Unit 1
Language Texts Mapping
Topic 1 Pursuit of Happiness / Goal Setting & Value Proposition in life
Topic 2 12 Angry Men / Ethics & Principles
CO1
The King’s Speech / Mission statement in life | strategies & Action Plans
Topic 3
in Life
CSA, SSET, SU
Unit C Writing Skills 1
Topic 1 Precis
Topic 2 Paraphrasing CO2
Topic 3 Essays (Simple essays)
CSA, SSET, SU
PO and PSO mapping with level of strength for Communicative English-2(ARP105)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 - - - - - - - - 1 3 - -
CO2 - - - - - - - - 1 3 - -
CO3 - - - - - - - - 1 3 - -
CO4 - - - - - - - - 1 2 - -
CO5 - - - - - - - - 1 2 - -
CO6 1 - - - - - - - 1 2 - -
CSA, SSET, SU
Syllabus: Data Structures Using C Lab
CSA, SSET, SU
Text book/s* 1. A Common-Sense Guide to Data Structures and
Algorithms, Second Edition: Level Up Your Core
Programming Skills 2nd Edition
2. Data Structures Through C (A Practical
Approach) Paperback – 1 January 2016 by G.S. Baluja
CSA, SSET, SU
CO and PO Mapping
S. No. Course Outcome Program Outcomes (PO) & Program Specific
Outcomes (PSO)
1. CO-1 Apply the basic operations on arrays (K2) PO1, PO3, PO4, PO8, PO9, PO10, PSO1
2. CO-2 Construct complex programs like matrix PO1, PO2, PO3, PO4, PO8, PO9, PO10
implementations on arrays (K2)
3. CO-3 Apply the concept of stacks and queues in real life PO1, PO2, PO3, PO4, PO8, PO9, PO10
problem solving (K3)
4. CO-4. Apply the concepts of data structure, like linked list to PO1, PO2, PO3, PO4, PO8, PO9, PO10, PSO1
solve complex problems (K4)
5 CO-5. Solving the real-life problems based on trees (K5) PO1, PO2, PO3, PO4, PO8, PO9, PO10, PSO1
6 CO-6 Implementing the graphs and apply graph concept in PO1, PO2, PO3, PO4, PO5, PO7, PO8, PO9,
computer networks (K6) PO10, PSO1
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name Data Structure Using C lab
(BOL226)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 3 - 3 2 - - - 2 2 2 1 -
CO2 3 3 3 2 - - - 3 2 2 - -
CO3 3 3 3 2 - - - 3 2 2 - -
CO4 3 3 3 3 - - - 3 2 2 2 -
CO5 3 3 3 2 - - - 3 2 2 2 -
CO6 3 3 3 2 2 - 2 3 2 2 3 -
Average of non-zeros entry in following table (should be auto calculated).
Course Code/
PO 1 PO2 PO 3 PO 4 PO5 PO6 PO7 PO8 PO9 PO10 PSO 1 PSO 2
Name
DS lab 3 3 3 2.2 2 - 2 2.8 2 2 2 -
Strength of Correlation
CSA, SSET, SU
Syllabus: Operating Systems and Unix Shell Programming Lab
3 Credits 1
5 Course Objective Introduces the UNIX operating system, including: task scheduling and
management, memory management, input/output processing, internal and
external commands, shell configuration, and shell customization. Explores
the use of operating system utilities such as text editors, electronic mail,
file management, scripting, and C/C++ compilers
CSA, SSET, SU
Unit 1 Practical based on Basic Unix Commands
C Basic unix commands: pwd, cd, mkdir, rmdir, ls, help, CO1, CO2,
man, whatis CO4
CSA, SSET, SU
C Using command line arguments, loops , condition CO1, CO2,
CO3, CO4,
CO6
Mode of Jury/Practical/Viva
examination
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name Operating Systems Using unix
shell programming Lab (Course Code: BOL155)
CO1 3 3 3 3 -- -- -- 2 2 1 3 2
CO2 3 2 3 3 -- -- -- 2 2 2 2 3
CO3 3 3 3 3 -- -- -- 1 1 1 3 2
BOL155_OS &
shell
Programming lab
CO4 2 2 2 2 2 -- -- 2 3 3 2 2
CO5 2 2 2 2 2 -- -- 2 3 3 2 2
CO6 2 2 2 2 2 -- -- 2 3 3 2 2
Course Course
PO PO
Code Name 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 10 PSO 1 PSO 2
OS & shell
BOL155 Programmin 2.5 2.33 2.5 2.5 1.0 1.8 2.3 2.1 2.3 2.1
g lab
Strength of Correlation
CSA, SSET, SU
Syllabus: Design Thinking and Creative Learning Lab
3 Credits 2
4 Contact Hours (L-T-P) 0-0-4
7 Course Description This course introduces Design Thinking methodologies, processes and tools that
can be used to make the world a better place. Students explore Design thinking
theories and how they can be applied to practical situations relevant to various
academic disciplines and organizational roles. Among the topics covered are
ideation, prototyping, iteration and innovation. Through personal reflection,
students will also examine how they can harness the power of design thinking for
leading the creation of value for businesses, organizations and society.
8 Outline syllabus CO Mapping
Unit 1 Skills in Design Thinking
CSA, SSET, SU
B As a first step toward user innovation, learn to identify consumer CO1, CO6
requirements and write customer needs statements.
Unit 2 Product Specifications and Applying Creativity
A Learn how to statistically translate customer needs into product CO2
specifications and how product metrics can aid in the definition
of those specs.
B Learn how to design needs solutions using creativity, CO2, CO6
brainstorming, and concept generation.
CSA, SSET, SU
CO and PO Mapping
S. Course Outcome Programme Outcomes (PO)
No.
1. CO1: Explain the basics concepts of Design PO1,PO2,PO3,PO4,PO7,PO9,PSO1,PSO2
Thinking
2. CO2: Design solutions as per needs and PO1,PO2,PO3,PO4,PO7,PO9,PSO1,PSO2
Translate customer needs into product
specifications
3. CO3: To apply product development concepts PO1,PO2,PO3,PO4,PO7,PO9,PSO1,PSO2
to the service environment.
4. CO4: Design the Architecture of a product. PO1,PO2,PO3,PO4,PO6,PO7,PO9,PSO1,PSO2
5. CO5: To apply environmental design concepts PO1,PO2,PO3,PO4,PO6,PO7,PO9,PSO1,PSO2
to the life cycle of a product.
6. CO6: To apply Design Thinking approach to PO1,PO2,PO3,PO4,PO6,PO7,PO9,PSO1,PSO2
various examples and real life applications.
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Design Thinking and
Creative Learning Lab (VOC102)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
2 1 1 1 - - 2 1 - 1 1
CO1
2 2 2 1 - - 2 1 - 1 2
CO2
2 2 2 1 - - 2 1 - 2 2
CO3
2 1 2 3 - 2 2 1 - 1 1
CO4
2 2 3 2 - 2 2 1 - 2 2
CO5
3 3 3 2 - 2 2 1 - 2 2
CO6
Avg. PO
2.16 1.8 2.16 1.67 2 2 1 1.5 1.67
attained
CSA, SSET, SU
TERM-III
CSA, SSET, SU
Syllabus: Object Oriented Programming Using Java
CSA, SSET, SU
Unit 4 Exception and Multithreading
A Exception Handling, Introduction to try, catch, throw and throws. CO4, CO6
B Checked and Unchecked exceptions, User define exception, CO4, CO6
C Introduction to Multithreading: multithreading advantages and issues, creating CO3, CO6
thread using Runnable interface and Thread class, Thread life cycle.
Unit 5 Html & Style sheets
A Basics of HTML, formatting and fonts, commenting code, color, hyperlink, lists, CO5, CO6
tables, images,
B forms, XHTML, frames and frame sets, Overview and features of HTML 5. CO5, CO6
C Need for CSS, introduction to CSS, basic syntax and structure, using CSS, CO5, CO6
background images, colors and properties, using fonts, borders and boxes,
margins, padding lists, positioning using CSS, CSS2, Overview and features of
CSS3.
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s*
1.Schildt H, “The Complete Reference JAVA2”, TMH
2. Douglas Comer “The Internet Book - Pearson Education”, Asia
Reference Books 1. Balagurusamy E, “Programming in JAVA”, TMH
2. Professional Java Programming: BrettSpell, WROX Publication
3. Douglas E. Comer “Internetworking with TCP/IP”, Volume-I, PHI
4. HTML 5, Black Book, Dreamtech Press
CSA, SSET, SU
CO and PO Mapping
Sl. No. Course Outcome (CO) Programme Outcome (PO) and Programme Specific
Objectives(PSO)
1. CO1: Compare and contrast different features of java PO1, PO2
with other programming paradigms.
2. CO2: Describe the fundamental of object-oriented PO1, PO2, PO4
concepts in java.
3. CO3: Explain the concept of inheritance, polymorphism, P01, PO2, PO3, PO4, PO10, PSO1
interfaces and multithreading.
4. CO4: Analyze Exception and Error in java programs. PO1, PO2, PO3, PO10
5. CO5: Design web pages by using HTML & CSS. PO2, PO3, PO4, PO10
6. CO6: Develop real world related problems using object- PO1, PO2, PO3, PO4, PO5, PO6, PO8, PO10, PSO1,
oriented concepts of java. PSO2
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name Object Oriented Programming
Using Java and Web Designing (Course Code BCO156)
CSA, SSET, SU
Syllabus: Principles of Database Management Systems
CSA, SSET, SU
Functional Dependency, Different anomalies in
A CO3, CO6
designing a Database, loss less join decompositions
Normal Forms: First, Second, Third normal forms and
B Boyce Codd normal form (BCNF), Multivalued CO3, CO6
dependencies, fourth normal forms
Case Study based on Relational Database Design &
C CO3, CO6
Normalization
Unit 4 TRANSACTION PROCESSING CONCEPTS
A Introduction to Transaction processing; ACID property,
CO4
Testing of Serializability, Serializability of Schedules,
B Conflict & View Serializable, Schedule,
Recoverability, Recovery from Transaction Failures, CO4
Log Based Recovery, Checkpoints, Deadlock,
C Case Study based on Transaction Processing System CO4
Unit 5 CONCURRENCY CONTROL TECHNIQUES
Concurrency Control, Two-Phase Locking Techniques
A for Concurrency Control, Time Stamping Protocols for CO5
Concurrency Control,
Validation Based Protocol, Multiple Granularity, Multi
B CO5
Version Schemes,
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Korth , Silberschatz& Sudarshan, Data base Concepts, Tata McGraw-Hill
2. Elmasri, Navathe, Fundamentals of Database Systems, Pearson Education Inc.
Other 1. Thomas Connolly, Carolyn Begg, Database Systems: A Practical Approach to
References design, Implementation and Management, Pearson Education, Latest Edition.
2. Jeffrey D. Ullman, Jennifer Windon, A first course in Database Systems, Pearson
Education.
3. Date C.J., An Introduction to Database Systems, Addison Wesley.
4. Richard T. Watson, Data Management: databases and organization, Wiley.
CSA, SSET, SU
CO and PO Mapping
CSA, SSET, SU
PO and PSO mapping with level of strength for Course Name: Database Management Systems
(Course Code: BCO154)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 3 - - 3 - - - 2 2 3 - -
CO2 3 3 - 3 - - - 3 - 2 - -
CO3 3 3 3 3 - - - 3 - 2 - -
CO4 2 2 2 3 - - - 2 - - -
CO5 2 2 2 3 - - - - - 2 - -
CO6 2 3 3 3 2 2 2 3 3 3 2 2
Average of non-zeros entry in following table (should be auto calculated).
Course Code/ PO
PO1 PO2 PO3 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
Name 4
CSA, SSET, SU
Syllabus: Computational Methods
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester: III
1 Course Code BCO222
2 Course Title Computational Methods
3 Credits 4
4 Contact Hours 4-0-0
(L-T-P)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 3 - - 3 - - - 2 2 3 - -
CO2 3 3 - 3 - - - 3 - 2 - -
CO3 3 3 3 3 - - - 3 - 2 - -
CO4 2 2 2 3 - - - 2 - - - -
CO5 2 2 2 3 - - - - - 2 - -
CO6 2 3 3 2 2 2 2 3
Course PO PO
Course Name
Code 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 10 PSO 1 PSO 2
Computational
BCO222 2.5 2.6 2.5 3 2 2 2 2.5 2 2.2 2 3
Methods
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
Syllabus: Introduction to Blockchain Technology
CO1: Define principles of Blockchain networks, distributed ledger, and the layered
architecture of blockchain
CO2: Demonstrate an understanding of key terms related to cryptocurrencies
CO3: Evaluate the differences among key consensus algorithms
CO4: Evaluate the Ethereum and Hyperledger Fabric blockchain frameworks and
their applications in enterprise contexts
CO5: Apply the knowledge of smart contracts to design and develop simple
programs using the Solidity programming language and Remix IDE
CO6: Evaluate the benefits and challenges of using blockchain technology in
various domains and identify potential use cases
7 Course Description Decentralized blockchain-based systems, such as Bitcoin and Ethereum, are
successful beyond all expectations. Although still in their infancy, they promise to
revolutionize how we think of financial, information, and other infrastructures.
This course covers the technical aspects of public distributed ledgers, blockchain
systems, cryptocurrencies, and smart contracts. Students will learn how these
systems are built, how to interact with them, how to design and build secure
distributed applications.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A CO1 , CO2
Introduction to Blockchain networks, distributed ledger,
layered architecture of blockchain
B Blockchain principles: Decentralization, immutability, CO1 , CO2
transparency, hashing and digital signature
C Types of Blockchain: Public, private and consortium. CO1 , CO2
Permissionless and permissioned
Unit 2 Cryptocurrency
A Definition, Types, Benefits, Limitations CO1, CO3
B Different Cryptocurrencies: Bitcoin, Ethereum, Altcoins. CO1, CO3
C Crypto Wallets, Mining, Initial Coin Offering, Merkle Tree CO1, CO3
Unit 3 Consensus Algorithms
A Proof of Work(PoW), Proof of Stake(PoS), Proof of Elapsed CO3, CO4
Time (PoET)
B Practical Byzantine Fault Tolerance: Definition, Working, CO3, CO4
Limitations
C Delegated Byzantine Fault Tolerance, Directed Acyclic Graphs, CO3, CO4
Unit 4 Ethereum and Hyperledger
A Ethereum blockchain, Ethereum Virtual Machine ( EVM), CO4,CO5
Ether and Gas
B Smart Contracts: Definition, Features, Working of Smart CO3,CO5
Contracts, Benefits and Limitations, Basic programming
concepts of Solidity, Introduction to Remix IDE
C Hyperledger Project, Hyperledger Fabric, Working and CO3,CO5
Consensus algorithm
Unit 5 Application and future of Blockchain
A Blockchain in Finance, Blockchain in Governance, Blockchain CO5, CO6
in smart energy
B Blockchain in supply chain management, Blockchain and CO5, CO6
Artificial Intelligence, Blockchain and Internet of Things
C Applications: Electronic Health Record Management System, CO5, CO6
Land Record Management, Blockchain based traceability
systems, Hashgraphs
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* Blockchain Technology and Applications, Manoj Kumar M. V., Likewin Thomas,
Sourav Kanti Addya, Niranjana Murthy M., Annappa B. CRC Press, 2022
Other References 1. Joseph Bonneau et al, SoK: Research perspectives and challenges for Bitcoin
and cryptocurrency, IEEE Symposium on security and Privacy, 2015 ( article
available for free download) { curtain raiser kind of generic article, written by
seasoned experts and pioneers}.
2. J.A.Garay et al, The bitcoin backbone protocol - analysis and applications
EUROCRYPT 2015 LNCS VOl 9057, ( VOLII ), pp 281-310. ( Also available at
eprint.iacr.org/2016/1048) . ( serious beginning of discussions related to formal
models for bitcoin protocols).
3. R. Pass et al, Analysis of Blockchain protocol in Asynchronous networks,
EUROCRYPT 2017, ( eprint.iacr.org/2016/454) . A significant progress and
consolidation of several principles).
4. R.Pass et al, Fruitchain, a fair blockchain, PODC 2017 (
eprint.iacr.org/2016/916).
CO and PO Mapping
Course
Code_ P
Course CO PO PO PO PO PO PO PO PO O PO PSO PSO
Name ’s 1 2 3 4 5 6 7 8 9 10 1 2
CO
1 3 3 2 2 - - - - - 3 2 3
CO
2 3 3 2 2 - - - - - 3 2 3
CO
Introductio 3 3 3 2 2 - - - - - 3 2 3
n to CO
Blockchain 4 3 3 3 3 - - - - - 3 3 3
Technology CO
5 3 3 3 3 - - - 2 - 3 3 3
CO
6 3 2 3 2 2 2 2 2 - 3 3 3
AV 3.0 2.8 2.5 2.3 2.0 2.0 2.0 2.0 3.0
G 0 3 0 3 0 0 0 0 - 0 2.50 3.00
Strength of Correlation
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 3 3 3 -- -- -- 2 2 1 3 2
CO2 3 2 3 3 -- -- -- 2 2 2 2 3
CO3 3 3 3 3 -- -- -- 1 1 1 3 2
CO4 2 2 2 2 1 -- -- 2 3 3 2 2
CO5 3 2 3 3 1 - 1 3 2 2 2 2
CO6 2 2 3 -- 3 -- 3 -- 2 3 3 3
Strength of Correlation
7 Course This Course introduce the concept of augmented reality and its utilization to develop
Description various applications using unity engine. The future utilization of this course will be to
merge with computer vision.
Course Course
Code Name
PO 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 1 PSO 2
Augmented
Reality
VOC201 Application
Developmen
t 2.67 2.75 2.20 2.20 1.50 1.50 1.33 1.80 1.50 1.67 2.50 2.50
Strength of Correlation
CO1: Ascertain a competency level through Building Essential Language and Life Skills
CO2: Build positive emotional competence in self and learn GOAL Setting and SMART
Goals techniques
CO3: Apply positive thinking, goal setting and success-focused attitudes, time
Management, which would help them in their academic as well as professional career
6 Course Outcomes
CO4: Acquire satisfactory competency in use of aptitude, logical and analytical reasoning
CO5: Develop strategic thinking and diverse mathematical concepts through building
number puzzles
CO6: Demonstrate an ability to apply various quantitative aptitude tools for making
business decisions
This Level 1 blended training approach equips the students for Industry employment
Course readiness and combines elements of soft skills and numerical abilities to achieve this
Description purpose.
7
8 Outline syllabus
Unit 1 BELLS ( Building Essential Language and Life Skills) CO Mapping
Know Yourself: Core Competence. A very unique and interactive approach through an
engaging questionnaire to ascertain a student’s current skill level to design, architect
A
and expose a student to the right syllabus as also to identify the correct TNI/TNA levels CO1
of the student.
Techniques of Self Awareness | Self Esteem & Effectiveness| Building Positive Attitude
B
| Building Emotional Competence CO1, CO2
Positive Thinking & Attitude Building | Goal Setting and SMART Goals – Milestone
C Mapping | Enhancing L S R W G and P (Listening Speaking Reading Writing Grammar CO1,
and Pronunciation) | CO2,CO3
Unit 2 Introduction to APTITUDE TRAINING- Reasoning- Logical/ Analytical
A Syllogism | Letter Series | Coding, Decoding , Ranking & Their Comparison Level-1 CO4
B Number Puzzles CO5
C Selection Based On Given Conditions CO5
Unit 3 Quantitative Aptitude
A Number Systems Level 1 | Vedic Maths Level-1 CO6
B Percentage ,Ratio & Proportion | Mensuration - Area & Volume |Algebra CO6
Unit 4 Verbal Abilities - 1
A Reading Comprehension CO1
B Spotting the Errors CO2
Unit 5 Time & Priority Management
A Steven Covey Time Management Matrix CO3
B Creating Self Time Management Tracker CO3
Practical Basis - Class Assignment/Free Speech Exercises / JAM | Group
Evaluation
Presentations/Mock Interviews/GD/ Reasoning, Quantitative Aptitude and Logical
Weightage
Reasoning ( CA,CE and ESE component ) and NO MSE
Distribution
CA-25%; CE-25%; ESE-50%
Wiley's Quantitative Aptitude-P Anand | Quantum CAT – Arihant Publications | Quicker
Maths- M. Tyra | Power of Positive Action (English, Paperback, Napoleon Hill) | Streets
Text book/s* of Attitude (English, Paperback, Cary Fagan, Elizabeth Wilson) The 6 Pillars of self-
esteem and awareness – Nathaniel Brandon | Goal Setting (English, Paperback, Wilson
Dobson
PO and PSO mapping with level of strength for Logical Skills Building and Soft Skills
(APR209)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 - - - - 1 - - - 1 3 - -
CO2 - - - - 1 - - - 1 3 - -
CO3 - - - - 1 - - - 1 3 - -
CO4 - - - - - - - - 1 2 - -
CO5 1 - - - - - - - 1 2 - -
CO6 1 - - - - - - - 1 2 - -
Syllabus: Object Oriented Programming Using Java Lab
CO2 2 2 2 2 2 2
CO3 2 3 3 3 2 2 2 3
BOL156_ CO4 3 3 2 2 2 2
Introduction 3 3 2 2 2 2
CO5
to OOP using
Java Lab CO6 3 3 3 3 2 2 3 3
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
List of Experiments
1. WAP in Java to print Hello and explore the difference between print() and println()
2. WAP in Java with two classes create an object of first class and call into another class (having
main method)
3. WAP in Java to find product of two numbers.
4. WAP in Java product of two numbers (Input by the user)
5. WAP in Java to illustrate the concept of local, instance and static variable
6. WAP in Java to count the total number of vowels and consonants in a string.
7. WAP in Java input a string and check whether it is palindrome or not.
8. WAP in Java to implement implicit and explicit type casting
9. WAP in Java to implement various operators in java
10. WAP in Java to check whether the given number is prime or not.
11. WAP in Java for constructor overloading
12. WAP in Java for method overloading
13. WAP in Java for method overriding
14. WAP in Java to find the factorial of a given number.
15. WAP in Java to show run time polymorphism (up casting)
16. WAP in Java for access specifiers (all four)
17. WAP in Java to implement the single dimension array
18. WAP in Java to copy the elements from one array to another array
19. WAP in Java to perform the addition and multiplication in 2-D array
20. WAP in Java to print the duplicate elements of an array.
21. WAP in Java to find the sum of each row and each column of a matrix
22. WAP in Java to sort the elements of an array in ascending/ descending order using Bubble Sort
and Insertion sort.
23. WAP in Java for simple inheritance
24. WAP in Java for Final keyword
25. WAP in Java for super keyword
26. WAP in Java to create package (user defined)
27. WAP in Java for abstract method, class
28. WAP in Java for interface
29. WAP in Java multiple inheritance
30. WAP in Java for exception handling by using try, catch and finally
31. WAP in Java for throw and throws exception
32. WAP in Java to throw your own exceptions
33. WAP in Java to reading and writing through console class.
34. WAP in Java how to create thread using Thread Class.
35. WAP in Java how to create thread using runnable interface.
36. WAP in Java to implement the multithreading.
37. WAP in Java to implement the concept of Priorities in threads.
Syllabus: Principles of Database Management System Lab
PO and PSO mapping with level of strength for Course Name Database Management System lab
(Course Code: BOL154)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 3 - 3 2 - - - 2 2 2 1 -
CO2 3 3 3 2 - - - 3 2 2 - -
CO3 3 3 3 2 - - - 3 2 2 - -
CO4 3 3 3 3 - - - 3 2 2 2 -
CO5 3 3 3 2 - - - 3 2 2 2 -
CO6 3 3 3 2 2 - 2 3 2 2 3 -
Strength of Correlation
7 Course This Course introduce the concept of augmented reality and its utilization to develop
Description various applications using unity engine. The future utilization of this course will be to
merge with computer vision.
1. Create multiple virtual buttons, which show case – CV, CO2, CO4
Achievement, Participation, experience.
Course Course
Code Name PO PO
1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 10 PSO 1 PSO 2
Augmented 2.67 2.75 2.20 2.20 1.50 1.50 1.33 1.80 1.50 1.67 2.50 2.50
Reality
VOC201 Application
Developmen
t Lab
Strength of Correlation
1. CO1: Identify and formulate problem statement with systematic PO1, PO2,
approach.
2. CO2: Develop teamwork and problem-solving skills, along with PO2,PO8,PO10
the ability to perform literature revie with others.
3. CO3: Plan the solution of problem as per the problem statement PO3,PO4
framed.
4. CO4: Classify and understand basic methodology for hypothesis PO2,PO3,PO7,
verification and validation of Research successfully.
5. CO5: Implement the solution by using different aspects of PO2,PO4
programming language/other tools and techniques.
6. CO6: Develop a glory of the need to engage in life-long PO10
learning
PO and PSO mapping with level of strength for Course Name Research Based Learning -1
(Course Code RBL001)
Cos Programme Outcomes(POs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 2 - - - - - - - - - -
CO2 - 2 - - - - - 3 - 2 - -
CO3 - 2 2 - - - - - - - -
CO4 - 2 2 - - - 2 - - - - -
CO5 - 2 2 - - - - - - - -
CO6 - - - - - - - - - 2 - -
Batch: 2023-26
Semester: IV
1 Course Code BCO224
5 Course The objective of this course is to teach student about the techniques for designing
Objective algorithms and provide an ability to compare and analyze various algorithms.
6 Course After completion of this course, the student shall be able to :
Outcomes CO1:Analyze the asymptotic performance of algorithms
CO2: Describe the dynamic-programming and Greedy paradigm and explain when an
algorithmic design situation calls for it.
CO3: Demonstrate a familiarity with major algorithms and data structures
CO4:Apply important algorithmic design paradigms and methods of analysis
CO5: Discuss NP-complete problems and develop algorithms to solve the problems.
CO6: Choose appropriate algorithm design techniques for solving problems.
7 Course
Description This course introduces concepts related to the design and analysis of algorithms.
Specifically, it discusses recurrence relations, and illustrates their role in asymptotic and
probabilistic analysis of algorithms. It covers in detail study of greedy strategies, divide
and conquer techniques, dynamic programming paradigms for designing algorithms,
and illustrates them using a number of well-known problems and applications. It also
covers advanced concepts in data structures for solving newer problems. The
programming assignments can be coded in C/Python/Java.
C Graph Algorithms: Breadth First Search and Depth First Search – CO1,CO2,CO3,
applications and analysis. CO4
Unit 5 Selected Topics
A String Matching- Definition, Naive String Matching and its CO1, CO2, CO3,
complexity, Robin Karp Algorithm, Complexity, Concept of CO4
Spurious Hits, and Numerical Example.
2. CO2Describe the dynamic-programming and Greedy PO1, PO2, PO3, PO4, PO9, PSO1, PSO2
paradigm and explain when an algorithmic design
situation calls for it.
3. CO3: Demonstrate a familiarity with major algorithms PO1, PO2, PO3, PO9, PSO1, PSO2
and data structures
4. CO4: Apply important algorithmic design paradigms and PO1, PO2, PO3, PO4, PO9, PSO1, PSO2
methods of analysis
5. CO5: Discuss NP-complete problems and develop PO1, PO2, PO3, PO4, PO9, PSO1, PSO2
algorithms to solve the problems.
6 CO6: Choose appropriate algorithm design techniques for PO1, PO2, PO3, PO4, PO5, PO9, PSO1,
solving problems. PSO2
PO and PSO mapping with level of strength for Course Name: Design and Analysis of Algorithm
(Course Code: BCO224)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 2 3 1 2 - -- -- - 2 - 3 2
CO2 2 2 2 2 - -- -- - 3 - 2 3
CO3 2 1 2 - - -- -- - 1 - 3 2
CO4 1 2 2 3 - -- -- - 2 - 2 2
CO5 3 3 1 3 - - - - 3 - 2 1
CO6 2 2 3 2 2 - - -- 2 - 3 2
3 Credits 4
Unit 1 Introduction:
Mode of Theory
examination
1. CO1: Classify the basic network infrastructure to learn the PO1, PO2, PO3,PO4 PSO2
overall function of networking systems and transmission
mediums.
2. CO2: Demonstrate analog and digital transmission techniques. PO1, PO2, PO3,PO4 PSO2
3. CO3: Apply knowledge of switching and error detection and PO1, PO2, PO3,PO4 PSO2
correction.
4 CO4: Illustrate the network layer and transport layer including PO1, PO2, PO3,PO4 PSO2
IP Addressing, routing, TCP and UDP services.
5 CO5: Explain the functionality of application layer. PO1, PO2, PO3,PO4 PSO2
6. CO6: Outline the cryptography and network security. PO1, PO2, PO3,PO4 PSO2
PO and PSO mapping with level of strength for Course Name Computer Networks and Data
Communication (BCO221)
C P P P P P P P P P P P P
O O O O O O O O O O O S S
s 1 2 3 4 5 6 7 8 9 1 O O
0 1 2
CO1 3 2 2 2 -- -- -- -- -- -- -- 2
CO5 3 2 2 2 -- -- -- -- -- -- -- 2
CO6 3 2 2 2 -- -- -- -- -- -- -- 2
AVG. 3 2 2 2 -- -- -- -- -- -- 2
Syllabus: Application based Programming in Python
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester IV
1 Course Code BCO220
2 Course Title Application based Programming in Python
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status Compulsory
5 Course Objective Emphasis is placed on procedural programming and object oriented , algorithm design,
and language constructs common to most high-level languages through Python
Programming and Machine Learning.
6 Course Outcomes Upon successful completion of this course, the student will be able to:
CO1. Apply the concepts of decision-making and looping structures in programming.
CO2. Understanding Modular programming approach using methods and functions.
CO3.Understand and Implement the use of Python lists, tuples and dictionaries.
CO4. Incorporate object-oriented programming concept in programming.
CO5: Creating python packages in Complex applications.
CO6: Design real life Applications in python using Machine Learning
7 Course Python is a language with a simple syntax, and a powerful set of libraries. It is widely used
Description in many scientific areas for data exploration. This course is an introduction to the Python
programming language for students without prior programming experience. We cover data
types, control flow, object-oriented programming and apply to basic concepts of Machine
learning.
8 Outline syllabus CO Mapping
Unit 1 Introduction CO1
A History, Python Environment, Variables, Data Types, Operators.
B Conditional Statements: If, If- else, Nested if-else.
Looping: For, While, Nested loops.
C Control Statements: Break, Continue, And Pass. Comments
Unit 2 List, Tuple , Dictionaries and Functions CO2, CO3
A Lists and Nested List: Introduction, Accessing list, Operations,
Working with lists, Library Function And Methods with Lists.
B Tuple: Introduction, Accessing tuples, Operations, Working,
Library Functions and Methods with Tuples. Dictionaries
:Introduction, Accessing values in dictionaries, Working with
dictionaries, LibraryFunctions
C Functions: Defining a function, Calling a function, Types of
functions, Function Arguments
Anonymous functions, Global and local variables
Unit 3 Exception Handling , OOP and File Handling CO4
A Exception Handling: Definition Exception, Exception handling
Except clause, Try,finally clause
B OOPs concept : Class and object, Attributes, Abstraction,
Encapsulation, Polymorphism and Inheritance
C Static and Final Keyword, Access Modifiers and specifiers, scope
of a class User Defined Exceptions
Unit 4 Module and Applications CO5
A Modules: Importing module, Math module, Random module
B Matplotlib, Packages
C Applications: Searching Linear Search, Binary Search. Sorting:
Bubble Sort
Unit 5 Introduction to python Applications CO6
A Introduction to machine learning,Problems under the category of
machine learning, Basic algorithms of machine learning with labeled
data, Naïve Bays classifiers concepts
B ,Confusion matrix, precision and Recall and other metrics
C Django frameworks basics for web designing
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. The Complete Reference Python, Martin C. Brown,
McGrwHill
Other References 1. Introduction to computing in problem solving using Python,
E Balahurusamy, McGrwHill
2. Introduction to programming using Python, Y. Daniel
Liang, Pearson
3. Mastering Python, Rick Van Hatten, Packet Publishing
House
4. Starting out with Python, Tony Gaddis, Pearson
CO and PO Mapping
S. No. Course Outcome Programme outcomes (PO) &
Programme Specific outcomes (PSO)
1. CO1. Apply the concepts of decision-making and looping PO1,PO2,PO3,PO4,PO8,PO10,
structures in programming. PSO1,PSO2
3. CO3.Understand and Implement the use of Python lists, tuples and PO1,PO2,PO3,PO4,PO8,PO10,
dictionary. PSO1,PSO2
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 3 3 3 - - - 1 - 1 1 2
CO2 3 3 3 3 - - - 1 - 1 1 2
CO3 3 3 3 3 - - - 1 - 1 1 2
CO4 3 2 3 3 2 - - 1 - 2 2 1
CO5 3 3 3 3 2 - - 1 - 2 2 1
CO6 3 2 3 3 2 - - 1 - 2 2 1
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 3 3 3 -- -- -- 2 2 1 3 2
CO2 3 2 3 3 -- -- -- 2 2 2 2 3
CO3 3 3 3 3 -- -- -- 1 1 1 3 2
CO4 2 2 2 2 1 -- -- 2 3 3 2 2
CO5 3 2 3 3 1 - 1 3 2 2 2 2
CO6 2 2 3 -- 3 -- 3 -- 2 3 3 3
Strength of Correlation
3 Credits 3
4 Contact 3-0-0
Hours
(L-T-P)
Course Status Elective
7 Course This course introduces advanced aspects of data warehousing and data
Description mining, encompassing the principles, analyse the data, identify the problems,
and choose the relevant models and algorithms to apply.
Unit 1 Introduction
A Evolution of Data mining and introductory CO1
concepts, Kind of Data & issues in Data Mining
C Introduction to outlier.
C correlation Analysis.
4. CO4: Compare & Contrast PO1, PO2 PO3, PO4, PSO1, PSO2
Classification& Prediction Mechanism
CO - - - - - - - - - -
3 3
1
CO - - - - - - - - - -
3 3
2
CO - - - - - - -
2 2 2 - 2
3
CO - - - - -
- 2 2 2 3 2 2
4
CO - - - - -
2 3 3 3 3 2 2
5
CO
- 3 3 3 2 2 2 2 3 2 - 3
6
P
Course Code/ PO PO PO PO PO PO PO PO PO1 PSO PS
O
Name 1 2 3 5 6 7 8 9 0 1 O2
4
CO1: Develop and deliver the effective presentations to interpret the deeper meaning of life.
CO2: Improve listening skills so as to understand complex business communication in a variety of global
English accents through proper pronunciation
CO5: Develop higher level strategic thinking and diverse mathematical concepts through building
number puzzles
CO6: Demonstrate higher level quantitative aptitude tools for making business decisions
This course bundle allows students to build vision, mission and strategy statements while exposing them
Course to various models of communication along with MTI reduction and the 2nd level of quant, aptitude and
7
Description reasoning abilities
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 - - - - - - - - 1 2 - -
CO2 - - - - - - - - 1 2 - -
CO3 - - - - - - - - 1 2 - -
CO4 - - - - - - - - 1 2 - -
CO5 1 - - - - - - - 1 2 - -
CO6 1 - - - - - - - 1 2 - -
Syllabus: Design & Analysis of Algorithm Lab
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester IV
1 Course Code BOL224
2 Course Title Design and Analysis of Algorithm Lab
3 Credits 1
4 Contact 0-0-2
Hours
(L-T-P)
Course Core/Compulsory
Status
5 Course The objective of this course is to teach student about the techniques for designing algorithms and provide
Objective an ability to compare and analyze various algorithms.
6 Course After completion of this course, the student shall be able to :
Outcomes CO1: Apply and analyze the complexity of certain divide and conquer algorithms.
CO2: Apply and analyze the complexity of certain greedy algorithms.
greedy, dynamic programming and backtracking
CO3: Apply and analyze the complexity of certain dynamic programming algorithms.
CO4: Establish the classes P, NP, and NP-Complete problems and be able to prove that a certain problem
is NP-Complete.
CO5: Analyze the working of string-matching algorithms.
CO6: Analyze the criteria and specifications appropriate to new problems, and choose the appropriate
algorithmic design technique for their solution.
7 Course This course introduces concepts related to the design and analysis of algorithms. Specifically, it
Description discusses recurrence relations, and illustrates their role in asymptotic and probabilistic analysis of
algorithms. It covers in detail study of greedy strategies, divide and conquer techniques, dynamic
programming paradigms for designing algorithms, and illustrates them using a number of well-known
problems and applications. It also covers advanced concepts in data structures for solving newer
problems. The programming assignments can be coded in C/Python/Java.
8 Outline syllabus CO Mapping
Unit 1 Introduction
A WAP to demonstrate difference between linear search and binary search. CO1
B WAP to demonstrate the concept of CO1
a) Insertion Sort,
b) Merge sort,
c) quick sort
C WAP to search min and max element out of an array. CO1
Unit 2 Greedy Methods
A WAP to implement Kruskal’s algorithm to find the minimum spanning tree from a CO2
given undirected graph.
WAP to implement Prim’s algorithm to find the minimum spanning tree from a
given undirected graph.
B WAP to demonstrate concept of Fractional Knapsack Problem CO2
C WAP to implement Dijkastra’s algorithm to find the single source shortest path. CO2
WAP to implement Bellman Ford Algorithm to find the single source shortest path.
Unit 3 Dynamic programming
A WAP to implement Matrix Chain Multiplication problem, CO2, CO3
B WAP to demonstrate concept of 0 – 1 Knapsack Problem. CO2, CO3
C WAP to demonstrate the concept of Longest Common Subsequence(LCS) CO2, CO3
Unit 4 Advanced data structures
A WAP to demonstrate concept of Red Black Trees along with insertion. CO1,CO2,CO3,
CO4
B WAP to demonstrate concept of height balanced B-Trees. CO1,CO2,CO3,
CO4
C WAP to demonstrate concept of graph traversal algorithms BFS and DFS. CO1,CO2,CO3,
CO4
Unit 5 Selected topics
A WAP to demonstrate concept of Naïve String Matching. CO4, CO5, CO6
B WAP to demonstrate concept of Rabin Karp algorithm for string matching. CO4, CO5, CO6
C WAP to demonstrate concept of approx. vertex cover algorithm. CO4, CO5, CO6
Mode of Practical/Jury/Viva
examination
Weightage CA CE(Viva) ESE
Distribution 25% 25% 50%
Text book/s* Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
"Introduction to Algorithms", 3/e, TMH
Other 1. Sahni et al., “Fundamentals of Computer Algorithms”, Galgotia Publication.
References 2. Hopcroft A., “The Design and Analysis Computer Algorithms”, Addison
Wesley
References
Text book Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. "Introduction to
Algorithms", 3/e, TMH
Other References 1. Sahni et al., “Fundamentals of Computer Algorithms”, Galgotia Publication.
2. Hopcroft A., “The Design and Analysis Computer Algorithms”, Addison Wesley
Software Turbo C/Python/Java
PO and PSO mapping with level of strength for Course Name Design and Analysis of Algorithm
Lab(BOL224)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 2 3 1 2 - -- -- - 2 - 3 2
CO2 2 2 2 2 - -- -- - 3 - 2 3
CO3 2 1 2 - - -- -- - 1 - 3 2
CO4 1 2 2 3 - -- -- - 2 - 2 2
CO5 3 3 1 3 - - - - 3 - 2 1
CO6 2 2 3 2 2 - - -- 2 - 3 2
Course Course PO PO
Code Name 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 10 PSO 1 PSO 2
Design and
Analysis of
BOL224 2 2.17 1.83 2.4 2 - - - 2.2 - 2.5 2
Algorithm
Lab
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
Syllabus: Application based Programming in Python Lab
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester IV
1 Course Code BOL220
2 Course Title Application based Programming in Python lab
3 Credits 2
4 Contact Hours 0-0-4
(L-T-P)
Course Status Compulsory
5 Course Objective Emphasis is placed on procedural programming, algorithm design, and language
constructs common to most high-level languages through Python Programming and
Machine Learning.
6 Course Outcomes Upon successful completion of this course, the student will be able to:
CO1. Apply the concepts of decision-making and looping structures in programming.
CO2. Understanding Modular programming approach using methods and functions.
CO3.Understand and Implement the use of Python lists, tuples and dictionaries.
CO4. Incorporate object-oriented programming concept in programming.
CO5: Creating python packages in Complex applications.
CO6: Design real life Applications in python using Machine Learning
7 Course Python is a language with a simple syntax, and a powerful set of libraries. It is widely used
Description in many scientific areas for data exploration. This course is an introduction to the Python
programming language for students without prior programming experience. We cover data
types, control flow, object-oriented programming and apply to basic concepts of Machine
learning.
8 Outline syllabus CO Mapping
Unit 1 Introduction CO1,CO2
A 1. Getting started with python environment like Jupyter,
Spyder, Pycharm
2. Demonstrate basic data type in python.
Demonstrate the working of ‘id’ and ‘type’
B 3. Demonstration of type casting.
4. Demonstrate different in-built string functions.
5. Program to implement all conditional statements
C 6. Program to implement different control structures
Unit 2 List, Tuple , Dictionaries and Functions CO3
A 1. Program to implement operations on lists
2. Program to implement operations on Dictionaries.
B 3. Program to implement operations on Tuple
4. Program to implement Exception Handling
Mode of Practical/Viva
examination
Weightage CA CE (Viva) ESE
Distribution 25% 25% 50%
Text book/s* 1. The Complete Reference Python, Martin C. Brown,
McGrwHill
Other References 1. Introduction to computing in problem solving using Python,
E Balahurusamy, McGrwHill
2. Introduction to programming using Python, Y. Daniel
Liang, Pearson
3. Mastering Python, Rick Van Hatten, Packet Publishing
House
4. Starting out with Python, Tony Gaddis, Pearson
CO and PO Mapping
S. No. Course Outcome Programme outcomes (PO) &
Programme Specific outcomes (PSO)
1. CO1. Apply the concepts of decision-making and looping PO1,PO2,PO3,PO4,PO8,PO10,
structures in programming. PSO1,PSO2
3. CO3.Understand and Implement the use of Python lists, tuples and PO1,PO2,PO3,PO4,PO8,PO10,
dictionaries. PSO1,PSO2
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 3 3 3 - - - 1 - 1 1 2
CO2 3 3 3 3 - - - 1 - 1 1 2
CO3 3 3 3 3 - - - 1 - 1 1 2
CO4 3 2 3 3 2 - - 1 - 2 2 1
CO5 3 3 3 3 2 - - 1 - 2 2 1
CO6 3 2 3 3 2 - - 1 - 2 2 1
Strength of Correlation
CO1 3 3 - - 2 2 - - - - - -
CO2 - 3 2 3 - - - 2 - - - -
CO3 - 3 2 3 - - - - - - - -
CO4 - - 2 2 - - - - - - - -
CO5 - - 3 2 - - - - - 2 2 2
CO6 - - - - - - - 3 3 3 -
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
TERM-V
School: School of Engineering & Technology
Batch: 2023-26
Semester V
3 Credits 4
Course
Code_ CO’ P PS
Course s O PO PO PO PO PO PO PO PO PO O PSO
Name 1 2 3 4 5 6 7 8 9 10 1 2
BCO225 2 1 1 2 - - - 2 - - 2 -
Introductio CO1
n to R 2 2 2 2 - - - 2 - - 2 -
CO2
2 2 1 2 - - - 2 - - 2 -
CO3
2 2 2 2 - - - 2 - - 2 -
CO4
2 2 2 2 - - - 2 - - 2 -
CO5
3 3 2 2 - - - 2 - - 2 -
CO6
P P P P P PS PS
Course
Course Name PO PO PO PO O O O O O O O
Code
PO 1 2 3 4 5 6 7 8 9 10 1 2
Introduction to
BCO22
R 2.1 2 1.7 2 - - - 2 - - 2
5
Programming
Strength of Correlation
6 Course Outcomes CO1: Illustrate and compare an effective software engineering process, based on
knowledge of widely used development lifecycle model.
CO2: Apply effective requirement elicitation techniques to develop SRS for a project.
CO3: Construct design documents with the help of designing tools.
CO4: Analyze testing strategies for a software system.
CO5: Develop and deliver quality software as an individual or as part of a
multidisciplinary team.
CO6: Adapt techniques and tools necessary for software engineering practices.
7 Course This course provides knowledge of software engineering. It introduces concepts such as
Description software processes and agile methods and essential software development activities, from
initial specification to system maintenance. Formalisms and tools to assist in software
development are also presented, including common design patterns and UML notation.
Course focuses on all levels of testing.
8 Outline syllabus CO Mapping
Unit 1 Introduction to Software Engineering and Process Models
A Significance, challenges and Software Myths in software engineering, CO1
Software Characteristics
B Software Development Methodologies: Waterfall model, prototyping CO1
model, Incremental model, Spiral model, V model
C Agility, Agile Process models: Extreme Programming (XP), Adaptive CO1
Software Development (ASD), Scrum
Unit 2 Requirement Engineering
A Types of Requirements, Feasibility study CO2
B Requirement Engineering process, Elicitation techniques CO2
C Requirement Documentation: Document SRS according to IEEE CO2
standards, Characteristics of SRS
Unit 3 Software Design
A Design Concepts, Design Strategies: Function Oriented Design, Object CO3, CO6
Oriented Design, Top-Down and Bottom-Up Design
B Effective modular design: Cohesion, Coupling CO3, CO6
C UML Diagrams and Tools: Introduction to UML Diagrams, Use Case, CO3, CO6
Object and Class, Interaction diagrams: Sequence & Collaboration
Unit 4 Software Implementation and Testing
A Fundamental of testing: Objectives, principles, myths and facts, CO4
limitations of testing
B Levels of testing, Acceptance Testing and its types, Integration CO4, CO6
techniques
C White Box Testing, Black Box Testing, Verification and Validation, CO4, CO6
Test case designing, Debugging
Unit 5 Maintenance & Quality Management
A Introduction to Maintenance, Need for Maintenance, Categories of CO5, CO6
Maintenance, Cost of Maintenance
B Quality Concepts: Quality, Quality Control, Cost of Quality, Software CO5, CO6
Quality Assurance, SQA Plan
C Statistical Software Quality Assurance: Six Sigma, The ISO 9000 CO5, CO6
Quality Standards, Capability Maturity Model
Mode of Theory/Jury/Viva
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Pressman R S, Software Engineering: A Practitioners Approach,
McGraw Hill.
Other References 1. Datta S, Software Engineering: Concepts and Applications, Oxford
University Press, 2010.
2. K.K. Aggrawal and Yogesh Singh, “Software Engineering”, New
Age International Publication
3. Sommerville, Ian. “Software Engineering”, Pearson(Latest Ed).
CO and PO Mapping
S. No. Course Outcome Programme outcomes (PO) & Programme Specific
outcomes (PSO)
1. CO1: Illustrate and compare an effective PO1,PO3,PO8,PO9,PO10,PSO1,PSO2
software engineering process, based on
knowledge of widely used development lifecycle
model
2. CO2: Apply effective requirement elicitation PO1,PO2,PO3,PO4,PO5,PO8,PO9,PO10,
techniques to develop SRS for a project PSO1,PSO2
3. CO3: Construct design documents with the help PO1,PO2,PO3,PO4,PO5, PO8,PO9,PO10,
of designing tools PSO1,PSO2
4. CO4:Analyze testing strategies for a software PO1,PO2,PO4,PO5,PO6,PO7,PO8,PO9,PO10,
system PSO1,PSO2
5. CO5: Develop and deliver quality software as an PO1,PO2,PO3,PO4,PO5, PO6,PO7, PO8,PO9,PO10,
individual or as part of a multidisciplinary team. PSO1,PSO2
6. CO6: Adapt techniques and tools necessary for PO1,PO4,PO5,PO8,PO9,PO10, PSO2
software engineering practices
.
PO and PSO mapping with level of strength for Course Name Software Engineering and Quality
Assurance (Course Code BCO322)
Course PO PO
Course Name
Code 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 10 PSO 1 PSO 2
Software
Engineering
BCO322 2.8 1.75 2.5 2.2 3 2.5 2.5 1.3 2.3 2.8 1.4 0
and Quality
Assurance
Strength of Correlation
3 Credits 3
A Research Population and Sample. Target Population, Accessible CO1, CO4, CO5
Population
B Sampling techniques – The nature of sampling, Probability sampling CO1, CO4, CO5
design
A Types of Data Sources, Web Data, Survey Data CO1, CO3, CO6
Data attributes, Discrete vs Continuous Data attributes
CO1, CO3, CO6
B Mean, Median, Mode; Range, Quartile, Variance, SD, Interquartile
Range
Report generation, report writing, and APA format – Title page, CO1, CO3, CO6
C Abstract, Introduction, Methodology, Results, Discussion,
References, and Appendices
Mode of Theory
examination
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 3 2 2 2 - - - - 2 2 2 3
CO2 2 3 3 3 - 2 - - - - 3 3
CO3 2 2 - 2 2 - 2 2 - 2 2 2
CO4 3 3 3 3 - 3 - - 3 - 3 3
CO5 2 - 3 2 3 - 3 3 2 3 3 2
CO6 3 - - 3 2 2 2 2 2 2 2 3
Course
Course Name
Code PO 1 PO 2 PO 3 PO 4 PO5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 1 PSO 2
Research
BRM002 2.5 2.5 2.75 2.5 2.3 2.3 2.3 2.3 2.25 2.25 2.5 2.7
Methodology
Strength of Correlation:
1-Slight (Low)
2-Moderate (Medium)
3-Substantial (High)
Syllabus: Web Technology Lab
Batch: 2023-26
Semester V
3 Credits 1
Unit 1 Introduction
Introduction to various HTML Tags.
A CO1
Write a program to display list of items in different styles.
B CO1
Write an HTML program to design an entry form of student details.
C CO1
CSS
Unit 2
Create Style sheet to set formatting for text tags and embed that style
A CO2
sheet on web pages created for your site.
Develop and demonstrate the usage of inline, internal and external
B CO2
style sheet using CSS
Write an HTML page that contains a selection box with a list of 5
C CO2
countries. When the user selects a country, its capital should be
printed next in the list. Add CSS to customize the properties of the
font of the capital (color, bold and font size).
Unit 3 Java Script
A Design signup form to validate username, password, and phone CO3
numbers etc. using Java script.
B Write a JavaScript program to convert temperatures to and from CO3
Celsius, Fahrenheit.
C Write a JavaScript that calculates the squares and cubes of the CO3
numbers from 0 to 10 and outputs HTML text that displays the
resulting values in an HTML table format.
Unit 4
PHP
A Implement the basic construct of PHP CO4
B Write programs to implement arrays and functions in PHP CO4
C Implement the advanced features of PHP like, Cookies and Sessions CO4
Unit 5 MYSQL
A Create the database-on-database server like MYSQL, Orcale. CO5
Perform basic DDL operation on it.
B Perform the basic operation like Insert, update, delete and select CO5, CO6
C Write an HTML program to design an entry form of student details CO6
and send it to store at database server like MYSQL, Oracle etc.
Mode of Practical/Viva
examination
Other References
CO and PO Mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
COs
CO1 2 2 3 - 2 - - - - 2 3 3
CO2 2 3 3 3 - - - - 2 2 3 3
CO3 2 3 3 - 3 2 - 2 - - 3 3
CO4 3 2 3 2 - 2 - 2 - 2 3 2
CO5 2 3 3 3 - - 2 - 2 - 2 3
CO6 2 3 3 3 2 3 3 2 3 3 3 3
Course
Course Name
Code PO 1 PO 2 PO 3 PO 4 PO5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 1 PSO 2
Web
BOL321 Technology 2.2 2.7 3 2.75 2.3 2.3 2.5 2 2.3 2.25 2.8 2.8
Lab
Strength of Correlation:
1-Slight (Low)
2-Moderate (Medium)
3-Substantial (High)
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester V
1 Course Code. BOL225
2 Course Title Introduction to R Lab
3 Credits 1
Contact Hours
4
(L-T-P) 0-0-2
Course status Compulsory
To familiarize the students with the basics of programming in R language, and
5
Course Objectives its applications in data analysis.
Upon successful completion of this course, student will be able to:
CO1: Demonstrate R programming using Decision statements, Loops and
Functions. (K3)
CO2: Apply functions to improve readability of programs. (K3)
CO3: Select and construct programs using different data structures available in
Course Outcomes R. (K1, K3)
CO4: Summarize data using descriptive statistics and perform distribution
analysis. (K2, K4)
CO5: Design visualizations of data using different types of graphs and plots.
(K5)
CO6: Estimate data using complex statistical testing. (K6)
7 Course Description R is a programming language and software environment for statistical analysis,
graphics representation and reporting. This course provides an introduction to
the basics of programming in R, and its applications in data analysis.
8 Outline syllabus: CO Mapping
Unit 1 Introduction to R Programming, Decisions, Loops and Functions
A P1. Write a R Program to make simple calculate. CO1, CO2
P2. Write a R program to demonstrate the usage of different
types of operators.
P3. Write a R program to find whether a given year is leap
year or not.
P4. Write a R program to calculate factorial of a given number.
Unit 2 Data Structures in R
A P5. Write R programs to create vector using c, rep, paste and CO3, CO2, CO6
seq functions.
P6. Write a R program to find transpose of a given matrix.
P7. Write R programs to create and manipulate data frames.
UNIT 3 Descriptive Statistics
A P8. Write a R Program to print summary statistics of a given CO4
dataset.
P9. Write a R Program to perform Shapiro Wilk Test,
Kolmogorov Smirnov test.
P10. Write a R program to plot quantile quantile plots.
Unit 4 Data Visualization in R
A
P11. Write R programs to create bar chart, histogram, pie CO5, CO6
chart, scatter plot, line chart, stem leaf plot.
Unit 5 Hypothesis Testing and Correlation Analysis
A P12. Write R programs to implement Student t and Mann CO6
Whitney Test.
P13. Write a R program to perform correlation analysis of a
given dataset.
P14. Write a R program to implement ANOVA technique.
Mode of examination Theory
Weightage CA CE(Viva) ETE
Distribution 25% 25% 50%
Text book/s* 1. Gardener, M (2012): Beginning R: The Statistical
Programming Language, Wiley Publications.
2. Braun W J, Murdoch D J (2007): A First Course in
Statistical Programming with R. Cambridge University Press.
New York
Other References 1. Crawley, M.J. (2015): Statistics: An Introduction Using R,
2nd Edition. Wiley.
2. Crawley, M.J. (2012): The R Book, 2nd Edition. Wiley.
CO and PO Mapping
S. No. Course Outcome Programme Outcomes (PO) & Programme Specific
Outcomes (PSO)
1. CO1. Demonstrate R programming using PO1, PO2, PO3, PO4, PO8, PO10, PSO1
Decision statements, Loops and Functions.
2. CO2. Apply functions to improve PO1, PO2, PO3, PO4, PO8, PO10, PSO1
readability of programs
3. CO3. Select and construct programs using PO1, PO2, PO3, PO4, PO8, PO10, PSO1
different data structures available in R.
4. CO4. Summarize data using descriptive PO1, PO2, PO3, PO4, PO8, PO10, PSO1
statistics and perform distribution
analysis.
5. CO5. Design visualizations of data using PO1, PO2, PO3, PO4, PO8, PO10, PSO1
different types of graphs and plots.
6. CO6. Estimate data using complex PO1, PO2, PO3, PO4, PO8, PO 10, PSO1
statistical testing.
PO and PSO mapping with level of strength for Course Name Introduction to R Lab (Course
Code: BOL225)
Course
Code_ CO’ P PS
Course s O PO PO PO PO PO PO PO PO PO O PSO
Name 1 2 3 4 5 6 7 8 9 10 1 2
BOL225 2 1 1 2 2 2
Introductio CO1
n to R Lab 2 2 2 2 2 2
CO2
2 2 1 2 2 2
CO3
2 2 2 2 2 2
CO4
2 2 2 2 2 2
CO5
3 3 2 2 2 2
CO6
P P P P P P P P P PS PS
Course
Course Name PO O O O O O O O O O O O
Code
1 2 3 4 5 6 7 8 9 10 1 2
BOL22 1.
Introduction to R lab 2.1 2 2 - - - 2 - - 2
5 7
Strength of Correlation
CO1 3 3 - 2 - 1 - 1 2 - 2 1 2 2 3
CO2 3 2 2 2 2 - - 1 2 - 2 1 2 1 1
CO3 3 2 2 2 2 3 - 1 2 - 2 1 2 2 -
CO4 3 3 2 2 3 - - 1 2 - - 1 2 2 2
CO5 3 2 - - 3 - - 1 2 - - 1 2 2 -
CO6 1 - 1 - - - 2 2 3 3 3 1 - 1
Avg. PO
attained 3 2.2 1 1.5 1.7 0.7 0 1.2 2 1 2 1 2 1.5 1.2
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester V
1 Course Code INC003
2 Course Title Industry connect
3 Credits 1
4 Contact Hours 0-0-2
(L-T-P)
Course Status
5 Course Objective 1. Experience the activities and functions of business professionals.
2. Develop and refine oral and written communication skills.
3. Identify areas for future knowledge and skill development.
6 ● Students will be able to:
Course Outcomes
● CO1. Integrate the concepts and strategies of academic study in a real time environment.
● CO2. Identify, formulate and model problems and find engineering solution based on a
systems approach.
CO3. Develop teamwork and apply prior acquired knowledge in problem solving.
● CO4. Develop communication, interpersonal and other critical skills required for career
growth.
● CO5. Practice engineer’s responsibilities, self-understanding, self-discipline and ethical
standards.
● CO6. Explore career alternatives prior to graduation.
7 Course The opportunity to explore potential career paths while putting classroom knowledge
Description and abilities into practise in a professional context is provided by an internship. Students
also have the chance to network professionally and have a better understanding of what
they still need to study thanks to the experience.
8 Outline syllabus CO Mapping
Unit 1 Establish the internship's goals and requirements and make CO1,CO2
sure students understand how they relate to their University
study plan.
Unit 2 Definition and identification of the problem, creation of CO2
teams and groups, and project assignment. completing the
problem definition and, if necessary, the resource
requirements.
Unit 3 The work plan for the internship is created by encouraging CO3
teamwork and using previously learned problem-solving
skills.
Unit 4 Execute the project with the team and demonstrate it. the CO4
intern's final report and assessment form must be submitted.
Unit 5 Final evaluation form completed by the supervisor at the CO5,CO6
Host Organization and final presentation before
departmental committee.
Mode of Practical
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Scrum: The Art of Doing Twice the Work in Half the Time by Jeff Sutherland
and J.J. Sutherland
Other References 1. A Guide to the Project Management Body of Knowledge by Project
Management Institute
2. Project Management for The Unofficial Project Manager by Kory Kogon,
Suzette Blakemore, & James Wood
3. Project Management Absolute Beginner’s Guide by Gregory M. Horine
CO and PO Mapping
S. No. Course Outcome Programme outcomes (PO) and Programme
Specific Outcome(PSO)
1. CO1. Integrate the concepts and strategies PO1,PO2,PO4,PO5,PO7,PO8,PO9,PSO1,PSO2
of academic study in a real
time environment.
2. CO2. Identify, formulate and model problems and find PO1,PO2,PO3,PO4,PO5,PO7,PO8,PO9, PSO1,PSO2
engineering solution based on a systems approach.
3. CO3. Develop teamwork and apply prior acquired PO1,PO3,PO4,PO5, PO8,PO9, PSO1,PSO2
knowledge in problem solving.
4. CO4. Develop communication, interpersonal and other PO8,PO10
critical skills required for career growth.
5. CO5. Practice engineer’s responsibilities, self- PO6,PO8
understanding, self-discipline and ethical standards.
6. CO6. Explore career alternatives prior to graduation. PSO1,PSO2
PO and PSO mapping with level of strength for Course Name Industry connect
CO1 2 2 - 3 2 - 1 1 1 - 1 2
CO2 1 2 1 2 2 - 1 1 1 - 1 2
CO3 2 - 2 2 2 - - 1 3 - 1 2
CO4 - - - - - - - 1 - 3 - -
CO5 - - - - - 2 - 3 - - - -
CO6 - - - - - - - - - - 2 2
Course Course
Code Name PO 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 1 PSO 2
Industry
INC003 1.6 2 1.5 2.3 2 2.0 1 1.4 1.7 3 1.25 2
connect
Strength of Correlation:
1-Slight (Low)
2-Moderate (Medium)
3-Substantial (High)
TERM-VI
Reference 1 Mark Michaelis, “Essential C# 3.0: For .NET Framework 4.5, 2/e,
Books Pearson Education
2 Fergal Grimes,” Microsoft .Net for Programmers”. (SPI)
CO and PO Mapping
Sl. No. Course Outcome (CO) Programme Outcome(PO) and Programme Specific
Outcome(PSO)
1. CO1: Uunderstand the philosophy and architecture of PO1, PO2
.NET Framework.
2. CO2: Describe the fundamental of C# programming PO1, PO2, PO4
language and learn how to build object-oriented
applications using C#.
3. CO3: Explain the concept of Namespace system, P01, PO2, PO3, PO4, PO10, PSO1
multithreading and exception handling.
4. CO4: Implement the ASP.Net web controls in web PO1, PO2, PO3, PO10
form.
5. CO5: Apply the validation controls and ADO.NET. PO2, PO3, PO4, PO10
6. CO6: Develop real world problems using C# & PO1, PO2, PO3, PO4, PO5, PO6, PO8, PO10, PSO1,
ASP.NET. PSO2
PO and PSO mapping with level of strength for Course Name
Dot Net framework using C# (BCO606)
P PO PO PO PO PO PO PO PO PO PSO PSO
Course 3
Course Name O 2 4 5 6 7 8 9 10 1 2
Code
1
Dot Net 2 2.6 2 2.7 3 2 0 2 0 2 2 1.5
BCO6 . 7 5
framework
06 using C# 2
Syllabus: Machine Learning
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester VI
1 Course Code BCO368 Course Name: Machine Learning
2 Course Title Machine Learning
3 Credits 4
4 Contact Hours 4-0-0
(L-T-P)
Course Status Compulsory
5 Course The objective of the course is to introduce basic fundamental concepts in Artificial
Objective Intelligence (AI), with a practical approach in understanding them. To visualize the scope
of AI and its role in futuristic development.
6 Course Students will be able to:
Outcomes CO1: Compare AI and non-AI solutions. Basics of machine learning and differentiation
with AI
CO2: To Apply machine learning on labelled and unlabelled data.
CO3: To explore the concept of machine learning for various problem solving in AI
CO4: Classify supervised and unsupervised learning and knowledge representation and
introduction to fuzzy logic
CO5: Learning extension in the form of deep learning concepts.
CO6: Practical implementation on various types of data of Machine Leaning algorithms
7 Course This course introduces basic aspects of Artificial intelligence and how the concept of AI
Description can be extended in the sub domain of machine learning with overall coverage starting from
supervised learning, unsupervised learning up to deep learning.
8 Outline syllabus CO Mapping
Unit 1 INTRODUCTION TO AI and ML
A Foundation of AI, Goals of AI, History and AI course line CO1, CO5
B Introduction to Intelligent Agents; Environment; Structure of CO1, CO5
Agent, AI Solutions Vs Conventional Solutions; a
philosophical, approach; a practical approach.
2. CO2: To Apply machine learning on labelled and unlabelled PO1, PO2, PO3, PO4, PO5, PO10,
data. PSO1, PSO2
3. CO3: To explore the concept of machine learning for various PO1, PO2, PO3, PO4, PO5, PO6,
problem solving in AI PO7,PO10,PSO1, PSO2
4. CO4: Classify supervised and unsupervised learning and PO1, PO2, PO3, PO4, PO5, PO6,
knowledge representation and introduction to fuzzy logic PO7,PSO1, PSO2,
5. CO5: Learning extension in the form of deep learning PO1, PO2, PO3, PO4, PO5, PO6, PO7,
concepts. PO8, PO9, PO10, PSO1, PSO2
6 CO6: Practical implementation on various types of data of PO1, PO2, PO3, PO4, PO5, PO6, PO7,
Machine Leaning algorithms PO8, PO9, PO10, PSO1, PSO2
PO and PSO mapping with level of strength for Course Name: Machine Learning(BCO368)
P P PS
Course Code_ CO’
PO O O PO PO PO PO PO PO O PSO
Course Name s
1 2 3 PO4 5 6 7 8 9 10 1 2
CO1 1 2 3 2 2 - - - - 2 3 2
CO2 2 3 3 2 3 - - - - 2 3 3
Machine Learning CO3 3 3 3 3 2 1 1 - - 1 3 2
(BCO368) CO4 3 3 3 3 2 2 1 - - 2 3 2
CO5 2 3 3 3 3 2 2 2 3 2 3 3
CO6 2 3 3 3 3 2 2 2 3 2 3 3
2. Gain insight into the challenges and limitations Models of cloud computing.
3. To learn the various technologies of the cloud computing paradigm and learn about
recent advances in Cloud Computing and enabling technologies.
4. Prepare students for research in the area of cloud Computing risks and cloud security
challenges.
6 Course Outcomes At the end of the course, students will have achieved the following learning objectives.
CO 1. Define the basics of cloud and recall the computer Science concepts which are
helpful in understanding on demand service architecture.
CO 2. Classify and describe the architecture and taxonomy of parallel and distributed
computing, including shared and distributed memory
CO 3. Apply and Manage Virtualization and Workflow to use the cloud in file systems and
applications.
CO 5. Evaluate the importance of cloud using monitoring and management of services for
performance improvement of HPC and to follow the Governance and Compliances.
CO 6. Elaborate the design concept and formulate to build the solution using cloud service
providers.
7 Course This course introduces advanced aspects of Cloud Computing, encompassing the principles, to
Description analyze the cloud, identify the problems, and choose the relevant models and algorithms to
apply.
8 Outline syllabus CO Mapping
Unit 1 Cloud Computing Fundamentals
A. Types of Computing, Grid computing, distributed computing, CO1, CO2, CO3
Client-server computing, Introduction to distributed systems,
Mode of Theory
examination
Weightage CA MTE ETE
Distribution
25% 25% 50%
Text book/s* 1. CLOUD COMPUTING Principles and Paradigms, Edited by
Other References Rajkumar Buyya, Jam
2. Cloud Computing: A Practical Approach, Anthony T. Velte,
Toby J. Velte, Robert Elsenpeter
3. Barrie Sosinsky “Cloud Computing (Bible)”,Wiley.
4. Ronald L. Krutz and Russell Dean Vines, “Cloud Security: A
comprehensive Guide to Secure Cloud Computing”, WILEY.
CO and PO Mapping
S. No. Course Outcome Programme outcomes (PO) &
Programme Specific outcomes (PSO)
1. Define the basics of cloud and recall the computer Science concepts PO1, PO2,PO3,PSO3
which are helpful in understanding on demand service architecture.
2. Classify and describe the architecture and taxonomy of parallel and PO1, PO2,PO3,PSO1,PSO3
distributed computing, including shared and distributed memory
3. Apply and Manage Virtualization and Workflow to use the cloud in PO1,PO2,PO3,PSO1,PSO2
file systems and applications.
4. Categorize and Characterize between Infrastructure services, PO1,PO2,PO4,PSO1,PSO2
deployment models, and governance in cloud computing
5. Evaluate the importance of cloud using monitoring and management PO1,PO2,PO4,PSO1,PSO3
of services for performance improvement of HPC and to follow the
Governance and Compliances.
6 Elaborate the design concept and formulate to build the solution PO1,PO2,PO3,PSO1,PSO2,PSO3
using cloud service providers.
PO and PSO mapping with level of strength for Course Name: Cloud Computing(BCO190)
CO4
2 2 2 3 3 1 3
CO5
CO6 3 2 2 2 2
Course PSO
Course Name
Code PO 1 PO2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PSO 1 2
BCO190 Cloud
Computing 2.83 2.67 1.67 1.67 1.00 1.00 1.00 2.00 1.00 2.67 2.50
Fundamentals
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
Syllabus: Information Security and Cyber Laws
3 Credits 3
7 Course This course introduces aspects of cyber security, encompassing the principles,
Description to analyze the data, identify the problems, and choose the relevant
countermeasures to apply.
Unit 5 Tools
Other
References
CO and PO Mapping
3 CO3: Formulate various security measures for PO1, PO2, PO6, PO7, PO8, PO10,
cyber-attacks. PSO1, PSO2
4 CO4: Apply the principles in real life situations. PO1, PO2, PO3, PO4, PO5, PO10,
PSO1
5 CO5: Identify various Cybercrimes and take PO1, PO2, PO3,PO4, PO5,PO6,PO7,
necessary actions. PO9,PO10, PSO1, PSO2
P P
Course Code_ CO P P P P P P
O O PSO
Course Name ’s PO PO O O O O O O PSO
1 2 3 4 5 6 7 8 9 10 1 2
BCO604 CO 2 2 3 3 3 2
Information 1
Security and
CO 3 3 2 2 3 3 3 2
Cyber Laws
2
CO 2 2 2 2 2 2 3 3
3
CO 2 2 2 3 3 3 2
4
CO 2 2 2 2 2 2 2 2 2 2 3
5
CO 3 2 2 2 3 3 2 2
6
P P P P P P P
Course Course
PO PO PO O O O O O O O PSO PSO
Code Name
1 2 3 4 5 6 7 8 9 10 1 2
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester VI
1 Course Code BCO605 Course Name: Big Data Analytics
2 Course Title Big Data Analytics
3 Credits 3
4 Contact Hours 3-0-0
(L-T-P)
Course Status Elective
5 Course ObjectiveUnderstand the Big Data Platform and its Use cases
• Provide an overview of Apache Hadoop
• Provide HDFS Concepts and Interfacing with HDFS
• Understand Map Reduce Jobs
• Provide hands on Hodoop Eco System
• Apply analytics on Structured, Unstructured Data.
• Exposure to Data Analytics with
6 Course Outcomes The students will be able to:
CO1: Identify Big Data and its Business Implications.
CO2: List the components of Hadoop and Hadoop Eco-System
CO3: Access and Process Data on Distributed File System
CO4: Manage Job Execution in Hadoop Environment
CO5: Develop Big Data Solutions using Hadoop Eco System
CO6: Develop big data handling applications for end user
7 Course This course provides a comprehensive introduction to big data, covering concepts,
Description tools, and techniques for processing and analyzing large datasets. Students will learn
about data storage and retrieval, data preprocessing, data mining, and data
visualization. They will gain hands-on experience with popular big data frameworks
such as Hadoop and Spark, as well as programming languages like Python and R. The
course will also explore the ethical and legal considerations surrounding big data,
including privacy and security issues. By the end of the course, students will be
equipped with the skills to tackle real-world big data challenges and make data-driven
decisions.
8 Outline syllabus CO Mapping
Unit 1 INTRODUCTION TO BIG DATA AND HADOOP
A Types of Digital Data, Introduction to Big Data, Big Data CO1, CO2
Analytics, History of Hadoop, Apache Hadoop
B Analysing Data with Unix tools, Analysing Data with Hadoop, CO1, CO2
Hadoop Streaming,
C Hadoop Echo System, IBM Big Data Strategy, Introduction to CO1, CO2
Infosphere BigInsights and Big Sheets.
Unit 2 HDFS(Hadoop Distributed File System)
A The Design of HDFS, HDFS Concepts, Command Line Interface CO1, CO2,CO4
B Hadoop file system interfaces, Data flow, Data Ingest with Flume CO1, CO2,CO4
and Scoop and Hadoop archives,
C Hadoop I/O: Compression, Serialization, Avro and File-Based CO1, CO2,CO4
Data structures..
Unit 3 Map Reduce
A Anatomy of a Map Reduce Job Run, Failures, Job Scheduling CO1,CO2,CO3
B Shuffle and Sort, Task Execution, CO1,CO2,CO3
C Map Reduce Types and Formats, Map Reduce Features. CO4
Unit 4 Hadoop Eco System
A Pig : Introduction to PIG, Execution Modes of Pig, Comparison CO1,CO2,CO3
of Pig with Databases, Grunt, Pig Latin, User Defined Functions,
Data Processing operators.
B Hive: Hive Shell, Hive Services, Hive Metastore, Comparison CO1,CO2,CO3
with Traditional Databases, HiveQL, Tables, Querying Data and
User Defined Functions.
C Hbase : HBasics, Concepts, Clients, Example, Hbase Versus CO1,CO2,CO3
RDBMS. Big SQL : Introduction
Unit 5 Data Analytics with R:
A Introduction, Supervised Learning, Unsupervised Learning, CO1,CO2,CO3
B Collaborative Filtering CO1,CO2,CO3
C Big Data Analytics with BigR. CO1,CO2,CO3
Mode of Theory
examination
Weightage CA MTE ETE
Distribution 25% 25% 50%
Text book/s* 1. Tom White “ Hadoop: The Definitive Guide” Third Edit
on, O’reily Media, 2012.
2. Seema Acharya, Subhasini Chellappan, "Big Data
Analytics" Wiley 2015
Other References 1. Michael Berthold, David J. Hand, "Intelligent Data
Analysis”, Springer, 2007.
2. Jay Liebowitz, “Big Data and Business Analytics”
Auerbach Publications, CRC press (2013)
3. Tom Plunkett, Mark Hornick, “Using R to Unlock the
Value of Big Data: Big Data Analytics with Oracle R
Enterprise and Oracle R Connector for Hadoop”,
McGraw-Hill/Osborne Media (2013), Oracle press.
4. Anand Rajaraman and Jef rey David Ulman, “Mining of
Massive Datasets”, Cambridge University Press, 2012.
CO and PO Mapping
S. No. Course Outcome Programme outcomes (PO) &
Programme Specific outcomes
(PSO)
1. CO1 Identify Big Data and its Business Implications. PO1,PO2,PO3,PO4,PSO1
2. CO2: List the components of Hadoop and Hadoop Eco-System PO1, PO3, PO4, PSO2
3. CO3: Access and Process Data on Distributed File System PO2,PO3,PO4,PSO3
4. CO4: Manage Job Execution in Hadoop Environment PO7, PO10,PO11, PSO5
5 CO5: Develop Big Data Solutions using Hadoop Eco System PO4,PO8
6. CO6: Develop big data handling applications for end user PO4,PO8
PO and PSO mapping with level of strength for Course Name Big Data Analytics (BCO605)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 3 3 3 -- -- -- 2 2 1 3 2
CO2 3 2 3 3 -- -- -- 2 2 2 2 3
CO3 3 3 3 3 -- -- -- 1 1 1 3 2
CO4 2 2 2 2 1 -- -- 2 3 3 2 2
CO5 3 2 3 3 1 - 1 3 2 2 2 2
CO6 3 2 3 3 1 - 1 3 2 2 2 2
Syllabus: Dot Net framework using C# Lab
Reference 3 Mark Michaelis, “Essential C# 3.0: For .NET Framework 4.5, 2/e,
Books Pearson Education
4 Fergal Grimes,” Microsoft .Net for Programmers”. (SPI)
CO and PO Mapping
Sl. No. Course Outcome (CO) Programme Outcome(PO) and Programme Specific
Outcome(PSO)
1. CO1: Demonstrate C# environment and executing C# PO1, PO2
Programs.
2. CO2: Understand and formulate the problems in basic PO1, PO2, PO4
programming constructs using C#.
3. CO3: Applying OOP concepts to solve real world P01, PO2, PO3, PO4, PO10, PSO1
problems.
4. CO4: Implement inheritance, polymorphism, PO1, PO2, PO3, PO10
multithreading features using C# and handle
run time errors.
5. CO5: Apply the validation controls in web forms and PO2, PO3, PO4, PO10
connect with database using ADO.NET
6. CO6: Develop real world problems using C# & PO1, PO2, PO3, PO4, PO5, PO6, PO8, PO10, PSO1,
ASP.NET. PSO2
PO and PSO mapping with level of strength for Course Name C# with ASP.Net (Course Code - BOL606)
P PO PO PO PO PO PO PO PO PO PSO PSO
Course 3
Course Name O 2 4 5 6 7 8 9 10 1 2
Code
1
Dot Net 2 2.6 2 2.7 3 2 0 2 0 2 2 1.5
BOL60 . 7 5
framework
6 2
using C# Lab
List of Programs
Write a Simple Program to print your name in C#
Write a program to print the given string by using the Write and Write Line Method.
Write a program how to read the values form console given by the user using Read Line Method
Write a program to make a function (addition of Two numbers) in Single Class
Write a program to make a function in first class (addition of Two numbers) and call a function
by creating object of first class in to second class and inputs given by the user.
Write a program to make a function in first class and call a function into second class by declare
static method of first class
Write a program to print the element of collections (like. Array) by using For each Loop.
Write a program to print the element of an Array by using For each Loop and inputs given by the
user.
Write a program to print the tables from 1 to 10 by using the 2- Dimensional Array
Write a program to implements the methods and properties on Array (like: Get Length(),Get
Value Get Length(),,Copy To(),Reverse(),Length)
Write a program to print the elements by using Jagged Array with For each Loop.
Write a program to print the elements by using the Array List Class and inputs given by the user.
Write a program to implements the methods and properties on Array List. (like:
Add(),Clear(),Insert(),Remove(),Sort(), Count, Capacity).
Write a program to display the given string by using Immutable String (String Class).
Write a program to implements the methods and properties on string (like: Compare(),Compare
To(), Concat(),Trim(),Insert()).
Write a program to display the given sting by using Mutable String (String Builder Class).
Write a program to implements the methods and properties on String Builder (like:
Compare(),Compare To(),Concat(),Trim(),Insert()).
Write a program to create a class for Room and make a Constructor & Destructor for Room
Class and then use the Construct to pass the values in method for Area and display it.
Write a program to calculate the Area of Circle by using the Parameterized Constructor and
inputs given by the user (Length, Width).
Write a program to calculate the Area of Rectangle and perimeter by using the Constructor
Overloaded and inputs given by the user (Length, Width)
Write a program to calculate the Area of Room and inherit the base class and calculate the
volume of Room in second class and then display the area and volume (Single Inheritance).
Write a program to design a class vehicle, car and bike by using Multi Level inheritance and
then call the method of vehicles, car and bike by creating object of bike class (Multi -level
inheritance).
Write a program to implement the interfaces which contains the methods Addition,
Multiplication respectively and create a new class which implement both methods and display
the output of these methods by creating a new class.
Write a program to create a class and make a function for Multiplication for two numbers and
overload the existing function then display the output.
Write a program how the unary minus operator is overloaded
Write a program how the binary plus operator is overloaded on addition of two complex
numbers.
Write a program to create a class and make the function Display and override the existing
Function by using the Virtual and Override keywords.
Write a program how a delegate is created and used in program.
Write a program to Create the Multicast delegate by call the several methods in one call.
Write a program to simulate a calculator by using the delegate
Write a program to create the two event handler of an event and implement by the delegate.
Write a program to handle an arithmetic exception by using try and multiple catch blocks.
Write a program to handle an arithmetic exception by using try and finally block.
Write a program how to create a thread and starts it running
Write a program how to create the multiple thread in a program
Write a program how to manage the priority of threads
Write a program to implement the methods of thread (like: Wait (), Suspend (), Resume (), Abort
()).
Write a program to connect the SQL Database by using the ADO.Net
Write a program to connect the Ms Access by using the ADO.Net
Write a program to illustrate the concept of Connected Mode by using ADO.Net
Write a program to illustrate the concept of Dis-connected Mode by using ADO.Net
Write a program to implement the Pointer in C # by using unsafe mode.
Create a Simple web application by using ASP.Net and Connect with SQL Database and also
perform some operation (like: Insert, Update, Delete and Select).
Syllabus : Machine Learning Lab
School: School of Engineering & Technology
Department Computer Science & Applications
Programme: BSc CS Current Academic Year: 2023-24
Batch: 2023-26
Semester VI
1 Course Code BOL368
2 Course Title Machine Learning Lab
3 Credits 2
4 Contact Hours 0-0-4
(L-T-P)
Course Status Compulsory
5 Course Objective The objective of the course is to introduce basic fundamental concepts in Artificial
Intelligence (AI) with machine Learning, with a practical approach in understanding
them. To visualize the scope of Machine Learning
● To develop machine learning concept.
● To workout various libraries and tool with the help of R or Python.
● To have an overview of the various processes involved in Machine
Learning in supervised and unsupervised domain
To develop a working model of real life problem base on machine learning
6 Course Outcomes After the completion of this course, students will be able to:
CO-1. To develop basic understanding of data structures required for machine
learning.
CO-2. To process the data for various statistical and probability calculation form
mathematical base.
CO-3. To extends data structure for implementation of supervised learning.
CO-4. To extend implementation from the point of view of unsupervised
machine learning .
CO-5. Select Machine learning based applications.
CO-6. To develop the artificial intelligence and machine learning approach for the
project implementation .
7 Course Description In this course students will learn basic introduction of Artificial Intelligence,
problem solving agents, reasoning, learning and applications of artificial
intelligence.
8 Outline syllabus CO Mapping
Unit 1 Practical based on basics of LISP & goal based problems
Sub unit - a, b and c detailed in Instructional Plan CO1, CO2, CO4
Practical related to uninformed search algorithm.
Sub unit - a, b and c detailed in Instructional Plan
Unit 2 Practical related to informed search algorithm. CO1, CO2. CO3,
CO4
Sub unit - a, b and c detailed in Instructional
Plan
Course
Code_
CO’s
Course PO PO PO PSO
Name PO 1 2 3 PO4 PO 5 PO 6 PO 7 PO 8 PO 9 10 1 PSO2 PSO3
BOL36 CO1 1 2 3 2 2 2 3 2 2
8 CO2 2 3 3 2 3 2 3 3 2
Machine
Learning CO3 3 3 3 3 2 1 1 1 3 2 3
Lab CO4 3 3 3 3 2 2 1 2 3 2 3
CO5 2 3 3 3 3 2 2 2 3 2 3 3 2
CO6 2 3 3 3 3 2 2 2 3 2 3 3 2
Course
PO1 PO2 PO3 PO 4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
Code/ Name
BOL368 2.16 2.83 2.8 3.0 2.5 1.5 1 0.6 1 1.83 3.0 2.33
Strength of Correlation
1. Addressed to Slight (Low=1) extent 2. Addressed to Moderate (Medium=2) extent
3. Addressed to Substantial (High=3) extent
List of Practical’s:
Unit 1 Practical based on basics of basics data structures in python/R
Week 1 a Lab expt.1 Write a python program to import and export data using Pandas library functions
Week 2, 3 b Lab expt.2 Demonstrate various data pre-processing techniques for a given dataset. Implement
Dimensionality reduction using Principle Component Analysis (PCA) method.
Week 4 c Lab expt.3 Write a Python program to demonstrate various Data Visualization Techniques.
Implement Simple and Multiple Linear Regression Models.
Unit 2
Week 5 a, b, Lab expt.4 Develop Logistic Regression Model for a given dataset.
Develop Decision Tree Classification model for a given dataset and use it to classify
a new sample.
Week 6 c Lab expt.5 Implement Naïve Bayes Classification in Python
Build KNN Classification model for a given dataset.
Unit 3 Practical related to informed search algorithm.
Week 7 Mid term
Week 8 a,b,c Lab expt.6 Build Artificial Neural Network model with back propagation on a given dataset.
Unit 4 Practical related to knowledge representations and logical reasoning
Week 9 A Lab expt.7 Implement Random forest ensemble method on a given dataset.
Week 10 B Lab expt.8 Implement Boosting ensemble method on a given dataset.
Week 11 c Lab expt.9 Write a python program to implement K-Means clustering Algorithm..
Unit 5 Practical related to machine learning algorithms
Week 12 a, Project Project Work Evaluation-0: Problem Statement with implementation of machine
learning for unsupervised/supervised machine learning
Week 13 b Project Project Work Evaluation-1: Design Specification. Identification of dataset and the
objective of project.
Week 14 c Project Project Work Evaluation-2: Development. Python or R implementation for the
development of project.
Syllabus : Research Based Learning-4
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 3 3 - 2 - 1 - 1 2 - 2 2
CO2 3 2 2 2 2 - - 1 2 - 2 1
CO3 3 2 2 2 2 3 - 1 2 - 2 2
CO4 3 3 2 2 3 - - 1 2 - 2 2
CO5 3 2 - - 3 - - 1 2 - 2 2
CO6 1 - 1 - - - 2 2 3 1 -
Avg PO 3 2.2 1 1.5 1.7 0.7 0 1.2 2 1 2 1.5
attained
Syllabus: Community Connect
7 Course In Community Connect projects, students will learn how to identify problems of rural and
Description underprivileged communities by conducting surveys, or will help the communities by
providing services or solutions for the issues faced by them.
8 Outline syllabus CO Mapping
Unit 1 Team/Group formation and Project Assignment. Problem CO1, CO2
Definition & Finalizing the problem statement, Resource
requirement, if any.
Unit 2 Develop a useful questionnaire or service to the CO2, CO3. CO4
community that will aid in achieving the objectives of
the project.
Unit 3 Learn how to interact with the community members, CO3, CO4, CO5
whether in survey or service-based project – to help
develop a more open mindset in the students.
Unit 4 Analysis of survey data and/or impact on the community CO3, CO4
members.
Unit 5 Demonstrate and justify their findings in light of the data CO4, CO5, CO6
they have gathered, or show the benefits to the
community of the actions they have taken.
CO1 1 1 2 3 1 1 1
CO2 1 2 1 3 3 1 1 1
CO3 3 3 3 3 2 3 1 2 1 1
CO4 3 3 3 3 3 3 3 1
CO5 2 1 1 1 3 3 3 2 3 1 1
CO6 2 3 1 1 3 2 2 2
Avg PO attainted 1 2.3 1.7 2.3 1 2.5 0.5 1.3 1.7 2 0.3 0.8
CO/PO Mapping
(1/2/3 indicates strength of correlation) 3-Strong, 2-Medium, 1-Low