3csesyll
3csesyll
JBOS 10.02.2023 / V5
2
JBOS 10.02.2023 / V5
Annexure-II 1
Course objectives:
● Introduce the rationale behind the cloud computing revolution and the business
drivers
● Understand various models, types and challenges of cloud computing
● Understand the design of cloud native applications, the necessary tools and the
design tradeoffs.
● Realize the importance of Cloud Virtualization, Abstraction`s, Enabling
Technologies and cloud security
Module-1
Distributed System Models and Enabling Technologies: Scalable Computing Over
the Internet, Technologies for Network Based Systems, System Models for Distributed
and Cloud Computing, Software Environments for Distributed Systems and Clouds,
Performance, Security and Energy Efficiency.
@#@11012025 1
Annexure-II 2
Module-3
Cloud Platform Architecture over Virtualized Datacenters: Cloud Computing and
Service Models, Data Center Design and Interconnection Networks, Architectural
Design of Compute and Storage Clouds, Public Cloud Platforms: GAE, AWS and
Azure, Inter-Cloud Resource Management.
Sl.NO Experiments
1 Creating a Virtual Machine: Configure and deploy a virtual machine with specific CPU
and memory requirements in Google Cloud.
OR
Exploring AWS CloudShell and the AWS Cloud9 IDE
2 Getting Started with Cloud Shell and gcloud: Discover the use of gcloud commands to
manage Google Cloud resources from Cloud Shell.
OR
Working with Amazon S3Orchestrating Serverless Functions with AWS Step Functions
3 Cloud Functions: Create and deploy a Cloud Function to automate a specific task based
on a Cloud Storage event.
OR
Working with Amazon DynamoDB
4 App Engine: Deploy a web application on App Engine with automatic scaling enabled.
OR
Developing REST APIs with Amazon API Gateway
@#@11012025 2
Annexure-II 3
5 Cloud Storage: Qwikstart: Google Cloud Storage provides scalable and secure object
storage for managing data, accessible via the Cloud Console or gsutil CLI.
OR
Creating Lambda Functions Using the AWS SDK for Python
6 Cloud SQL for MySQL: Discover how Google Cloud SQL for MySQL provide
automated management and high availability for MySQL databases?
OR
Migrating a Web Application to Docker Containers
7 Cloud Pub/Sub: Experiment how Google Cloud Pub/Sub facilitate real-time messaging
and communication between distributed applications.
OR
Caching Application Data with ElastiCache, Caching with Amazon CloudFronT, Caching
Strategies
8 Multiple VPC Networks: Explore benefits of using multiple VPC networks in Google
Cloud for organizing and isolating resources.
OR
Implementing CloudFront for Caching and Application Security
9 Cloud Monitoring: Discover how Cloud Monitoring help in tracking and analyzing the
performance and health of cloud resources?
OR
Orchestrating Serverless Functions with AWS Step Functions
10 Kubernetes Engine: Qwik Start: Deploy a containerized application to a Kubernetes
Engine cluster.
OR
Automating Application Deployment Using a CI/CD Pipeline
Complex Experiments (Not for CIE)
1. Create and Manage Cloud Resources: Challenge Lab: In this lab, Students will use
the Google Cloud Console and the gcloud command-line tool to create and manage
various cloud resources. Start by provisioning virtual machines with specific
configurations, such as CPU and memory requirements, and setting up storage
buckets for data persistence. Students also manage IAM roles to control access to these
resources, ensuring that only authorized users can perform actions. The lab emphasizes
the importance of understanding the relationships between different Google Cloud
services and how to configure them to work together effectively. Successful completion
requires a careful approach to resource management, including monitoring, security
settings, and cost optimization.
2. Set Up an App Dev Environment on Google Cloud: Challenge Lab: This lab
focuses
on setting up a complete development environment on Google Cloud, starting with
configuring Cloud Shell and installing the necessary development tools. Students
work with Cloud SDK and other programming languages or frameworks required for
your application. After setting up the environment, Deploy a sample application to test
the configuration and ensure that the environment is fully functional. This lab highlights
the importance of creating a robust and scalable environment that can support continuous
development and deployment processes. Additionally, you must ensure that the
environment is optimized for performance and ready to handle real-world application
development and testing on Google Cloud.
@#@11012025 3
Annexure-II 4
CIE for the theory component of the IPCC (maximum marks 50)
● IPCC means practical portion integrated with the theory of the course.
● CIE marks for the theory component are 25 marks and that for the practical
component is 25 marks.
● 25 marks for the theory component are split into 15 marks for two Internal
Assessment Tests (Two Tests, each of 15 Marks with 01-hour duration, are to be
conducted) and 10 marks for other assessment methods mentioned in 22OB4.2. The
first test at the end of 40-50% coverage of the syllabus and the second test after
covering 85-90% of the syllabus.
● Scaled-down marks of the sum of two tests and other assessment methods will be
CIE marks for the theory component of IPCC (that is for 25 marks).
● The student has to secure 40% of 25 marks to qualify in the CIE of the theory
component of IPCC.
CIE for the practical component of the IPCC
● 15 marks for the conduction of the experiment and preparation of laboratory record,
and 10 marks for the test to be conducted after the completion of all the laboratory
sessions.
● On completion of every experiment/program in the laboratory, the students shall be
evaluated including viva-voce and marks shall be awarded on the same day.
● The CIE marks awarded in the case of the Practical component shall be based on the
continuous evaluation of the laboratory report. Each experiment report can be
evaluated for 10 marks. Marks of all experiments’ write-ups are added and scaled
down to 15 marks.
● The laboratory test (duration 02/03 hours) after completion of all the experiments
shall be conducted for 50 marks and scaled down to 10 marks.
@#@11012025 4
Annexure-II 5
● Scaled-down marks of write-up evaluations and tests added will be CIE marks for
the laboratory component of IPCC for 25 marks.
● The student has to secure 40% of 25 marks to qualify in the CIE of the practical
component of the IPCC.
SEE for IPCC
Theory SEE will be conducted by University as per the scheduled timetable, with common
question papers for the course (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a
module (with a maximum of 3 sub-questions), should have a mix of topics under that
module.
3. The students have to answer 5 full questions, selecting one full question from each
module.
4. Marks scored by the student shall be proportionally scaled down to 50 Marks
1. The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical
portion will have a CIE component only. Questions mentioned in the SEE paper may
include questions from the practical component.
Suggested Learning Resources:
Text Books:
1. Kai Hwang, Geoffrey C Fox, and Jack J Dongarra, Distributed and Cloud Computing, Morgan Kaufmann,
Elsevier 2012
2. Dan C. Marinescu, Cloud Computing Theory and Practice, Morgan Kaufmann, 2nd Edition, Elsevier 2018
Reference Books:
1. Rajkumar Buyya, Christian Vecchiola, and Thamrai Selvi, Mastering Cloud Computing McGrawHill
Education, 1st Edition, 2017
2. Toby Velte, Anthony Velte, Cloud Computing: A Practical Approach, McGraw-Hill Education, 2017.
3. George Reese, Cloud Application Architectures: Building Applications and Infrastructure in the Cloud,
O'Reilly Publication, 1st Edition, 2009
4. John Rhoton, Cloud Computing Explained: Implementation Handbook for Enterprises, Recursive Press, 2 nd
Edition, 2009.
Web links and Video Lectures (e-Resources):
● https://freevideolectures.com/course/4639/nptel-cloud-computing/1.
● https://www.youtube.com/playlist?list=PLShJJCRzJWxhz7SfG4hpaBD5bKOloWx9J
● https://www.youtube.com/watch?v=EN4fEbcFZ_E
● https://www.youtube.com/watch?v=RWgW-CgdIk0
● https://www.geeksforgeeks.org/virtualization-cloud-computing-types/
● https://www.javatpoint.com/cloud-service-provider-companies
@#@11012025 5
Annexure-II 1
Module-1
Introduction: Need for Machine Learning, Machine Learning Explained, Machine Learning in Relation
to other Fields, Types of Machine Learning, Challenges of Machine Learning, Machine Learning Process,
Machine Learning Applications.
Understanding Data – 1: Introduction, Big Data Analysis Framework, Descriptive Statistics, Univariate
Data Analysis and Visualization.
Chapter-1, 2 (2.1-2.5)
Module-2
Understanding Data – 2: Bivariate Data and Multivariate Data, Multivariate Statistics, Essential
Mathematics for Multivariate Data, Feature Engineering and Dimensionality Reduction Techniques.
Basic Learning Theory: Design of Learning System, Introduction to Concept of Learning, Modelling in
Machine Learning.
@#@11012025 1
Annexure-II 2
Decision Tree Learning: Introduction to Decision Tree Learning Model, Decision Tree Induction
Algorithms.
Artificial Neural Networks: Introduction, Biological Neurons, Artificial Neurons, Perceptron and Learning
Theory, Types of Artificial Neural Networks, Popular Applications of Artificial Neural Networks,
Advantages and Disadvantages of ANN, Challenges of ANN.
@#@11012025 2
Annexure-II 3
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers for
the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a maximum
of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.
Reference Books
1. Murty, M. N., and V. S. Ananthanarayana. Machine Learning: Theory and Practice, Universities Press,
2024.
2. T. M. Mitchell, “Machine Learning”, McGraw Hill, 1997.
3. Burkov, Andriy. The hundred-page machine learning book. Vol. 1. Quebec City, QC, Canada: Andriy
Burkov, 2019.
@#@11012025 3
Annexure-II 4
@#@11012025 4
Annexure-II 1
Module-1
Distributed systems, CAP theorem, Byzantine Generals problem, Consensus. The history of blockchain,
Introduction to blockchain, Various technical definitions of blockchains, Generic elements of a
blockchain, Features of a blockchain, Applications of blockchain technology, Tiers of blockchain
technology, Consensus in blockchain, CAP theorem and blockchain, Benefits and limitations of
blockchain.
Chapter 1
Module-2
Decentralization using blockchain, Methods of decentralization, Blockchain and full ecosystem
decentralization, Smart contract, Decentralized organizations, Decentralized autonomous
organizations, Decentralized autonomous corporations, Decentralized autonomous societies
Decentralized applications, Platforms for decentralization.
Cryptographic primitives: Symmetric cryptography, Asymmetric cryptography, Public and private keys,
Hash functions: Compression of arbitrary messages into fixed length digest, Easy to compute, Pre-image
resistance, Second pre-image resistance, Collision resistance, Message Digest (MD),Secure Hash
Algorithms (SHAs), Merkle trees, Patricia trees, Distributed hash tables (DHTs), Digital signatures,
Elliptic Curve Digital signature algorithm (ECDSA).
Module-3
@#@11012025 1
Annexure-II 2
Bitcoin, Bitcoin definition, Transactions, The transaction life cycle, The transaction structure,
Types of transaction, The structure of a block , The structure of a block header, The genesis
block, The bitcoin network, Wallets, Smart Contracts-History, Definition, Ricardian contracts,
Smart contract templates, Oracles, Smart Oracles, Deploying smart contracts on a blockchain,
The DAO.
Chapter 9
Course outcomes (Course Skill Set)
At the end of the course, the student will be able to :
1. Explain the Blockchain terminologies with its applications. design
2. Illustrate the working principles of Blockchain and the Smart Contract Lifecycle
3. Demonstrate the principles and methodologies used in Bitcoin
4. Develop Ethereum Network, Wallets, Nodes, Smart contract and DApps.
5. Make use of Hyperledger in Blockchain Based Application Architecture.
@#@11012025 2
Annexure-II 3
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers
for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.
Reference Book
● https://nptel.ac.in/courses/106104220
● https://www.geeksforgeeks.org/blockchain/
● https://www.tutorialspoint.com/blockchain/index.htm
@#@11012025 3
Annexure-II 1
Textbook-1: Chap-1 (1.1, 1.2), Chap-2 (2.2, 2.3), Chap-3 (3.1, 3.2)
Module-2
Image processing: More neighborhood operators, Fourier transforms, Pyramids and wavelets, and
Geometric transformations.
Image Segmentation: Fundamentals, Point, Line and edge detection, thresholding (Foundation & Basic
global thresholding only), Segmentation by region growing & region splitting & merging.
@#@11012025 1
Annexure-II 2
Feature Extraction: Background, Boundary preprocessing (Boundary following & Chain codes only).
Image pattern Classification: Background, Patterns and classes, Pattern classification by prototype
matching (Minimum distance classifier only).
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers
for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
@#@11012025 2
Annexure-II 3
Reference books
1. David Forsyth and Jean Ponce, Computer Vision: A Modern Approach, 2nd Edition, Pearson, 2015.
2. Reinhard Klette, Concise Computer Vision - An Introduction into Theory and Algorithms, Springer,
2014.
@#@11012025 3
COMPILER DESIGN Semester 6
Course Code BCS613C CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 3
Examination type (SEE) Theory
Course objectives:
● Understand the working of language processors
● Apply different phases of designing a compiler
● Illustrate lexical analysis
● Explain the need of real time operating system for embedded system
applications.
Teaching-Learning Process (General Instructions)
These are sample Strategies, which teachers can use to accelerate the attainment of the various
course outcomes.
1. Lecturer methods(L) need not to be only a traditional lecture method, but alternative
effective teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Demonstration of sample code using Keil software.
5. Show the different ways to solve the same problem with different approaches and
encourage the students to come up with their own creative ways to solve them.
Module-1
Introduction: Language Processors, The structure of Compiler, The evolution of
Programming Languages, The science of Building a Compiler, Applications of
Compiler Technology, Programming Language Basics
Module-3
@#@11012025 1
Top-Down Parsing: Recursive Descent Parsing, First and Follow, LL(1) Grammars
Module-4
Introduction to LR Parsing: Simple LR, LR Parsing Algorithm, Construction of SLR
parsing Tables, Viable Prefixes
Module-5
Variants of Syntax Trees, Three Address Code, Types and Declarations. Control Flow
Code generation: Issues in the Design of a Code Generator, The target language
Chapter 6: 6.1,6.2,6.3,6.6
Chapter 8:8.1,8.2
@#@11012025 2
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks
out of 50) and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50
marks). A student shall be deemed to have satisfied the academic requirements and earned
the credits allotted to each subject/ course if the student secures a minimum of 40% (40 marks
out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.
● http://www.digimat.in/nptel/courses/video/106104123/L01.html
@#@11012025 3
Activity Based Learning (Suggested Activities in Class)/ Practical Based learning
● Students are expected (in group of 2) to develop scanner and parser for simple programming
syntax (C/Java) - 25 Marks
@#@11012025 4
ADVANCED JAVA Semester 6
Course Code BCS613D CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Total Marks 100
Credits 03 Exam Hours 03
Examination nature (SEE) Theory
Note- Students who have not opted for Java course in earlier semester, student has to undergo a bridge
course on basics of java before the commencement of 6th SEM.
Course objectives:
CLO 1. Understanding the fundamentals of collection framework
CLO 2. Demonstrate the fundamental concepts of String operations and Swing applications
CLO 3. Design and develop web applications using Java servlets and JSP
CLO 4. Apply database interaction through Java database Connectivity
MODULE-2
String Handling: The String Constructors, String Length, Special String Operations, Character Extraction,
String Comparison, Searching Strings, Modifying a String, Data Conversion Using valueOf( ), Changing the
Case of Characters Within a String, joining strings, Additional String Methods, StringBuffer , StringBuilder
Text Book 1: Ch 18
MODULE-3
Introducing Swing: The Origin of Swing, Swing Is Built on AWT, Two Key
Swing Features, The MVC Connection, Components and Containers, The Swing Packages, A Simple Swing
Application, Event Handling, Painting in Swing.
@#@11012025 1
MODULE-4
Introducing servlets: Background; The Life Cycle of a Servlet; Using Tomcat for Servlet Development; A
simple Servlet; The Servlet API; The Jakarta. Servlet Package; Reading Servlet Parameter; The
Jakarta.servlet.http package; Handling HTTP Requests and Responses; Using Cookies; Session Tracking.
Java Server Pages (JSP); JSP tags, Variables and Objects, Methods, Control statements, Loops, Request
String, Parsing other information, User sessions, Cookies, Session Objects.
Text Book 1: Ch 36
Text Book 2: Ch 11
MODULE-5
JDBC Objects: The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview of the JDBC
process; Database Connection; Associating the JDBC/ODBC Bridge with the Database; Statement Objects;
ResultSet; Transaction Processing; Metadata, Data types; Exceptions.
Text Book 2: Ch 06
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers for the
course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a maximum of 3
sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
@#@11012025 2
Marks scored shall be proportionally reduced to 50 marks.
Textbooks
1. Herbert Schildt: JAVA the Complete Reference. Twelfth Edition, Tata McGraw-Hill.
Reference Books
1. Y. Daniel Liang: Introduction to JAVA Programming, 7th Edition, Pearson Education, 2007.
2. Stephanie Bodoff et al: The J2EE Tutorial, 2nd Edition, Pearson Education,2004.
3. Uttam K Roy, Advanced JAVA programming, Oxford University press, 2015.
Web links and Video Lectures (e-Resources):
1. https://nptel.ac.in/courses/106/105/106105191/
2. https://nptel.ac.in/courses/106/105/106105225/
3. https://youtu.be/qGMxs-PbFPk
@#@11012025 3
INTRODUCTION TO DATA STRUCTURES Semester 6
Course Code BCS654A CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Examination type (SEE) Theory
Course Objectives:
● Introduce primitive and non-primitive data structures
● Understand the various types of data structure along their operations
● Study various searching and sorting algorithms
● Assess appropriate data structures during program development / problem
solving
Teaching-Learning Process (General Instructions)
These are sample strategies; which teachers can use to accelerate the attainment of the various
course outcomes.
1. Lecturer method (L) does not mean only the traditional lecture method, but different
types of teaching methods may be adopted to achieve the outcomes.
2. Utilize video/animation films to illustrate the functioning of various concepts.
3. Promote collaborative learning (Group Learning) in the class.
4. Pose at least three HOT (Higher Order Thinking) questions in the class to stimulate
critical thinking.
5. Incorporate Problem-Based Learning (PBL) to foster students' analytical skills and
develop their ability to evaluate, generalize, and analyze information rather than
merely recalling it.
6. Introduce topics through multiple representations.
7. Demonstrate various ways to solve the same problem and encourage students to
devise their own creative solutions.
8. Discuss the real-world applications of every concept to enhance students'
comprehension.
9. Use any of these methods: Chalk and board, Active Learning, Case Studies.
Module-1
Arrays: Introduction, One-Dimensional Arrays, Two-Dimensional Arrays, Initializing Two-
Dimensional Arrays, Multidimensional arrays.
Pointers: Introduction, Pointer Concepts, Accessing Variables through Pointers, Pointer
Applications, Dynamic Memory Allocation Functions.
Structures and Unions: Introduction, Declaring Structures, Giving Values to Members,
Structure Initialization, Comparison of Structure Variables, Arrays of Structures, Arrays
within Structures, Nested Structures, Unions, Size of Structures.
Textbook 1: Ch. 8.1 to 8.5, Ch. 12.1 to 12.8, 12.10, 12.11.
Textbook 2: Ch. 2.1 to 2.3, 2.5, 2.9.
Module-2
@#@11012025 1
Stacks: Introduction, Stack Operations, Stack Implementation using Arrays, Applications of
Stacks.
Queues: Introduction, Queue Operations, Queue Implementation using Arrays, Different
Types of Queues: Circular Queues, Double-Ended Queues, Priority Queues, Applications of
Queues.
Textbook 2: Ch. 6.1 to 6.3, Ch. 8.1 to 8.2.
Module-3
Linked Lists: Introduction, Singly Linked List, Self-Referential Structures, Operations on
Singly Linked Lists: Insert-Delete-Display, Implementation of Stacks and Queues using
Linked List, Concatenate two Lists, Reverse a List without Creating a New Node, Static
Allocation Vs Linked Allocation.
Circular Singly Linked List: Introduction, Operations: Insert-Delete-Display.
Textbook 2: Ch. 9.1 to 9.2, 9.3 (Only 9.3.1 to 9.3.5, 9.3.11 to 9.3.12), 9.4 to 9.5.
Module-4
Trees: Introduction, Basic Concepts, Representation of Binary Trees, Operations on Binary
Trees: Insertion-Traversals-Searching-Copying a Tree, Binary Search Trees, Operations on
Binary Search Trees: Insertion-Searching-Find Maximum and Minimum Value-Count
Nodes, Expression Trees.
Textbook 2: Ch. 10.1 to 10.4, 10.5 (Only 10.5.1, 10.5.2, 10.5.3.1, 10.5.3.2, 10.5.3.4), 10.6.3.
Module-5
Sorting: Introduction, Bubble Sort, Selection Sort, Insertion Sort.
Searching: Introduction, Linear Search, Binary Search.
Textbook 1: Ch. 17.1, 17.2.6, 17.3.2.
Textbook 2: Ch. 11.1 to 11.3, 11.10.1.
@#@11012025 2
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE)
is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of
50) and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks).
A student shall be deemed to have satisfied the academic requirements and earned the credits
allotted to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in
the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with
a maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.
Suggested Learning Resources:
Text Books:
1. E Balagurusamy, “C Programming and Data Structures”, 4th Edition, McGraw-Hill,
2007.
2. A M Padma Reddy, “Systematic Approach to Data Structures using C”, 9th Revised
Edition, Sri Nandi Publications, 2009.
Reference Books:
1. Ellis Horowitz and Sartaj Sahni, “Fundamentals of Data Structures in C”, 2nd Edition,
Universities Press, 2014.
2. Seymour Lipschutz, “Data Structures Schaum’s Outlines”, Revised 1st Edition,
McGraw-Hill, 2014.
Web links and Video Lectures (e-Resources):
● https://www.youtube.com/watch?v=DFpWCl_49i0
● https://www.youtube.com/watch?v=x7t_-ULoAZM
● https://www.youtube.com/watch?v=I37kGX-nZEI
● https://www.youtube.com/watch?v=XuCbpw6Bj1U
● https://www.youtube.com/watch?v=R9PTBwOzceo
@#@11012025 3
● https://www.youtube.com/watch?v=qH6yxkw0u78
● https://archive.nptel.ac.in/courses/106/105/106105085/
● https://onlinecourses.swayam2.ac.in/cec19_cs04/preview
Develop C programs that focus on Data Structure concepts such as arrays, pointers,
structures, stacks, queues, linked lists, trees as well as, sorting and searching algorithms
(25 Marks).
@#@11012025 4
FUNDAMENTALS OF OPERATING SYSTEMS Semester 6
Course Code BCS654B CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Examination type (SEE) Theory
Course objectives:
● To demonstrate the need and different types of OS
● To discuss suitable techniques for management of different resources
● To analyse different memory, storage, and file system management strategies.
Module-1
Introduction: What operating systems do; Computer System organization; Computer
System Organization, Computer System architecture; Operating System operations; Resource
Management
Operating System Structures: Operating System Servies, User and Operating System
interface; System calls, Application Program Interface, Types of system calls;
Textbook 1: Chapter 1: 1.1, 1.2, 1.3,1.4, 1.5 Chapter 2: 2.1, 2.2 (2.2.1, 2.2.2), 2.3 (2.3.2,
2.3.3)
Module-2
Process Management: Process concept; Process scheduling; Operations on processes;
Interprocess Communication
Multi-threaded Programming: Overview; Multithreading models, Thread Libraries
Textbook 1: Chapter 3: 3.1-3.4, Chapter 4: 4.1, 4.3 5, 4.4
Module-3
@#@11012025 1
CPU Scheduling: Basic Concepts, Scheduling criteria, Scheduling algorithms, Thread
Scheduling,
Process Synchronization: Synchronization: The critical section problem; Peterson’s
solution; Semaphores; Classical problems of synchronization;
Textbook 1: Chapter 5: 5.1, 5.2,5.3.1, 5.3.2, 5.3.3, 5.3.4, 5.4 Chapter 6: 6.1, 6.2.,6.3, 6.6
Module-4
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.
Memory Management: Background; Contiguous memory allocation; Paging; Structure of
page table
Textbook 1: Chapter 8: 8.1-8.8 Textbook 1: Chapter 9: 9.1-9.4 (9.4.1, 9.4.2)
Module-5
Virtual Memory Management: Background; Demand paging; Copy-on-write; Page
replacement;
File System Interface: File concept; Access methods; Directory Structure, Protection, File
System Implementation: File System Structure, File System Operations,
File System Internals: File Systems, File System Mounting; Partition and Mounting, File
sharing;
Textbook 1: Chapter 10: 10.1-10.3, 10.4 (10.4.1, 10.4.2, 10.4.4.) Chapter 13: 13.1, 13.2,
13.3 (13.3.1, 13.3.2, 13.3.3), 13.4 (13.4.1, 13.4.2) Chapter 15: 15.1-15.4
Course outcomes (Course Skill Set)
At the end of the course, the student will be able to:
1. Explain the fundamentals of operating systems.
2. Apply appropriate CPU scheduling algorithm for the given scenarios.
3. Analyse the various techniques for process synchronization and deadlock handling.
4. Apply the various techniques for memory management
5. Analyse the importance of File System Mounting and File Sharing
@#@11012025 2
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE)
is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of
50) and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks).
A student shall be deemed to have satisfied the academic requirements and earned the credits
allotted to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in
the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with
a maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.
Suggested Learning Resources:
Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles
10th edition, Wiley-India, 2015
Reference Books
2. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th
Edition, 2010
3. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw-
Hill, 2013, P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice
4th Edition, PHI(EEE), 2014.
4. William Stallings Operating Systems: Internals and Design Principles, 6th Edition,
Pearson, 2008
Reference Books:
1. Akshay Kulkarni, Adarsha Shivananda, “Natural Language Processing Recipes -
Unlocking Text Data with Machine Learning and Deep Learning using Python”, Apress,
2019.
2. T V Geetha, “Understanding Natural Language Processing – Machine Learning and
Deep Learning Perspectives”, Pearson, 2024.
@#@11012025 3
3. Gerald J. Kowalski and Mark.T. Maybury, “Information Storage and Retrieval systems”,
Kluwer Academic Publishers.
@#@11012025 4
TEMPLATE for AEC (if the course is a theory) Annexure-IV
(Chapters 1 & 2)
Module-2
Create the first android application: Directory Structure. Android User Interface:
Understanding the Components of a screen– Linear Layout – Absolute Layout – Frame.
Layout Relative Layout – Table Layout.
(Chapters 3 & 4)
Module-3
@#@11012025 1
TEMPLATE for AEC (if the course is a theory) Annexure-IV
Designing User Interface with View – Text View – Button – Image Button – Edit Text
Check Box – Toggle Button – Radio Button and Radio Group – Progress Bar – Auto
complete Text View – Spinner – List View – Grid View – Image View - Scroll View –
Custom Toast – Alert – Time and Date Picker.
(Chapter 5)
Module-4
Activity: Introduction – Intent – Intent filter – Activity life cycle – Broadcast life cycle
Service. Multimedia: Android System Architecture – Play Audio and Video – Text to
Speech.
(Chapters 6 & 7)
Module-5
SQLite Database in Android: SQLite Database – Creation and Connection of the database –
Transactions. Case Study: SMS Telephony and Location Based Services.
@#@11012025 2
TEMPLATE for AEC (if the course is a theory) Annexure-IV
@#@11012025 3
TEMPLATE for AEC (if the course is a theory) Annexure-IV
● .https://www.geeksforgeeks.org/android-tutorial/
● https://developer.android.com/
● https://www.tutorialspoint.com/android
● https://www.w3schools.blog/android-tutorial
@#@11012025 4
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Semester 6
Course Code BAI654D CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Examination type (SEE) Theory
Course objectives:
● To understand the primitives of AI
● To familiarize Knowledge Representation Issues
● To understand fundamentals of Statistical Reasoning, Natural Language Processing.
Teaching-Learning Process (General Instructions)
These are sample strategies; which teachers can use to accelerate the attainment of the various
course outcomes.
1. Lecturer method (L) does not mean only the traditional lecture method, but different
types of teaching methods may be adopted to achieve the outcomes.
2. Utilize video/animation films to illustrate the functioning of various concepts.
3. Promote collaborative learning (Group Learning) in the class.
4. Pose at least three HOT (Higher Order Thinking) questions in the class to stimulate
critical thinking.
5. Incorporate Problem-Based Learning (PBL) to foster students' analytical skills and
develop their ability to evaluate, generalize, and analyze information rather than
merely recalling it.
6. Introduce topics through multiple representations.
7. Demonstrate various ways to solve the same problem and encourage students to devise
their own creative solutions.
8. Discuss the real-world applications of every concept to enhance students'
comprehension.
9. Use any of these methods: Chalk and board, Active Learning, Case Studies
Module-1
What is artificial intelligence? Problems, Problem Spaces, and search
Text Book 1: Ch 1, 2
Module-2
Knowledge Representation Issues, Using Predicate Logic, representing knowledge using
Rules.
Text Book 1: Ch 4, 5 and 6.
Module-3
Symbolic Reasoning under Uncertainty, Statistical reasoning
Text Book 1: Ch 7, 8
Module-4
Game Playing, Natural Language Processing
Text Book 1: Ch 12 and 15
Module-5
Learning, Expert Systems.
Text Book 1: Ch 17 and 20
@#@11012025 1
Course outcomes (Course Skill Set)
At the end of the course, the student will be able to:
1. Identify the problems where the adaptation of AI has significant impact.
2. Analyse the different approaches of Knowledge Representation.
3. Explain Symbolic Reasoning under Uncertainty and Statistical reasoning.
4. Derive the importance of different types of Learning Techniques.
5. Explain Natural Language Processing and Expert System.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20
marks out of 50) and for the SEE minimum passing mark is 35% of the maximum marks (18
out of 50 marks). A student shall be deemed to have satisfied the academic requirements and
earned the credits allotted to each subject/ course if the student secures a minimum of 40%
(40 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE
(Semester End Examination) taken together.
Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common
question papers for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module
(with a maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each
module.
4. Marks scored shall be proportionally reduced to 50 marks.
Suggested Learning Resources:
Text Books:
1. E. Rich, K. Knight & S. B. Nair, Artificial Intelligence, 3rd Edition, McGraw
Hill.,2009
Reference Books
2. Stuart Rusell, Peter Norving, Artificial Intelligence: A Modern Approach, 2nd Edition,
Pearson Education
@#@11012025 2
3. Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems, 1st
Edition,Prentice Hal of India, 2015
4. G. Luger, Artificial Intelligence: Structures and Strategies for complex problem
Solving, 4th Edition, Pearson Education, 2002.
5. N.P. Padhy “Artificial Intelligence and Intelligent Systems”, Oxford University Press,
2015
Web links and Video Lectures (e-Resources):
1. https://nptel.ac.in/courses/106102220
2. https://nptel.ac.in/courses/106105077
3. https://archive.nptel.ac.in/courses/106/105/106105158/
4. https://archive.nptel.ac.in/courses/106/106/106106140/
@#@11012025 3
Template for Practical Course and if AEC is a practical Course Annexure-V
Book 1: Chapter 2
2 Develop a program to Compute the correlation matrix to understand the relationships between pairs of
features. Visualize the correlation matrix using a heatmap to know which variables have strong
positive/negative correlations. Create a pair plot to visualize pairwise relationships between features. Use
California Housing dataset.
Book 1: Chapter 2
3 Develop a program to implement Principal Component Analysis (PCA) for reducing the dimensionality of
the Iris dataset from 4 features to 2.
Book 1: Chapter 2
4 For a given set of training data examples stored in a .CSV file, implement and demonstrate the Find-S
algorithm to output a description of the set of all hypotheses consistent with the training examples.
Book 1: Chapter 3
5 Develop a program to implement k-Nearest Neighbour algorithm to classify the randomly generated 100
values of x in the range of [0,1]. Perform the following based on dataset generated.
a. Label the first 50 points {x1,……,x50} as follows: if (xi ≤ 0.5), then xi ∊ Class1, else xi ∊ Class1
b. Classify the remaining points, x51,……,x100 using KNN. Perform this for k=1,2,3,4,5,20,30
Book 2: Chapter – 2
6 Implement the non-parametric Locally Weighted Regression algorithm in order to fit data points. Select
appropriate data set for your experiment and draw graphs
Book 1: Chapter – 4
7 Develop a program to demonstrate the working of Linear Regression and Polynomial Regression. Use
Boston Housing Dataset for Linear Regression and Auto MPG Dataset (for vehicle fuel efficiency prediction)
for Polynomial Regression.
Book 1: Chapter – 5
8 Develop a program to demonstrate the working of the decision tree algorithm. Use Breast Cancer Data set
for building the decision tree and apply this knowledge to classify a new sample.
Book 2: Chapter – 3
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
9 Develop a program to implement the Naive Bayesian classifier considering Olivetti Face Data set for training.
Compute the accuracy of the classifier, considering a few test data sets.
Book 2: Chapter – 4
10 Develop a program to implement k-means clustering using Wisconsin Breast Cancer data set and visualize
the clustering result.
Book 2: Chapter – 4
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
● Illustrate the principles of multivariate data and apply dimensionality reduction techniques.
● Demonstrate similarity-based learning methods and perform regression analysis.
● Develop decision trees for classification and regression problems, and Bayesian models for probabilistic
learning.
• Implement the clustering algorithms to share computing resources.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50) and for the
SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures a minimum of 40% (40 marks out of 100) in the sum total of the CIE
(Continuous Internal Evaluation) and SEE (Semester End Examination) taken together
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
● https://www.drssridhar.com/?page_id=1053
● https://www.universitiespress.com/resources?id=9789393330697
● https://onlinecourses.nptel.ac.in/noc23_cs18/preview
@#@11012025
TOSCA – Automated Software testing Semester VI
Subject Code BIS657A CIE Marks 50
Teaching Hours/Week(L:T:P:S) 0:0:2:0 SEE Marks 50
Credits 01 Exam Hours 100
Examination type (SEE) Practical
Course Objectives:
• To introduce the features, components, and benefits of the Tosca platform
• To understand the Test case design, Test execution and Test data management
• To learn the concepts of Test automation
• To understand the Test scenario development
8 Dynamic objects: (a) Creates dynamic lists when Module Attributes are added for
the first time.
(b) To convert a static list into a dynamic list, delete all static Module Attributes
9 Synchronization: Wait On, Default Settings, Static Wait, Timeout, TBox Wait
and SfWaitForBusyIndicator
10 Reusable Test Step block: Create a Reusable TestStepBlock and Creating and
Using Libraries.
11 Conditional statements: create conditional statements in Tosca to run test steps
12 Practical Exercise and Wrap-Up: Build Test suit with suitable application
and complete end to end automation process, Discussion on Best Practices and
Q&A
Course outcomes (Course Skill Set):
On completion of the course students will be able to:
1) Explain of Tosca's architecture, key features and fundamentals of the Tosca
automation tool.
2) Develop test scenarios that can be run automatically.
3) Construct test cases and modules in the Tosca automation tool.
4) Design Test Suits and run tests in different browsers.
@#@11012025
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20
marks out of 50) and for the SEE minimum passing mark is 35% of the maximum marks (18
out of 50 marks). A student shall be deemed to have satisfied the academic requirements and
earned the credits allotted to each subject/ course if the student secures a minimum of 40%
(40 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE
(Semester End Examination) taken together.
@#@11012025
be evaluated for 100 marks and scored marks shall be scaled down to 50 marks (however,
based on course type, rubrics shall be decided by the examiners)
• Change of experiment is allowed only once and 15% of Marks allotted to the procedure
part are to be made zero.
• The minimum duration of SEE is 02 hours
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
REACT Semester 6
Course Code BCSL657B CIE Marks 50
Teaching Hours/Week (L:T:P: S) 0:0:1:0 SEE Marks 50
Credits 01 Exam Hours 100
Examination type (SEE) Practical
Course objectives:
● Enable students to develop React applications utilizing functional and class-based components, effectively
managing state with hooks and lifecycle methods .
● Introduce, how to pass data dynamically between parent and child components using props, ensuring modular
and reusable component design.
● Create dynamic and responsive applications, integrating forms, validation, task management systems, and styled
components.
● Use React Router for navigation, external API integration for dynamic data handling, and CSS styling techniques
for modern UI/UX design.
Sl.NO Experiments
1. Use create-react-app to set up a new project. Edit the App.js file to include a stateful component with useState.
Add an input field and a <h1> element that displays text based on the input. Dynamically update the <h1> content
as the user types.
2. Develop a React application that demonstrates the use of props to pass data from a parent component to child
components. The application should include the parent component named App that serves as the central container
for the application. Create two separate child components, Header: Displays the application title or heading. Footer:
Displays additional information, such as copyright details or a tagline. Pass data (e.g., title, tagline, or copyright
information) from the App component to the Header and Footer components using props. Ensure that the content
displayed in the Header and Footer components is dynamically updated based on the data received from the parent
component.
3. Create a Counter Application using React that demonstrates state management with the useState hook. Display the
current value of the counter prominently on the screen. Add buttons to increase and decrease the counter value.
Ensure the counter updates dynamically when the buttons are clicked. Use the useState hook to manage the
counter's state within the component. Prevent the counter from going below a specified minimum value (e.g., 0).
Add a "Reset" button to set the counter back to its initial value. Include functionality to specify a custom increment
or decrement step value.
4. Develop a To-Do List Application using React functional components that demonstrates the use of the useState
hook for state management. Create a functional component named ToDoFunction to manage and display the to-
do list. Maintain a list of tasks using state. Provide an input field for users to add new tasks. Dynamically render
the list of tasks below the input field. Ensure each task is displayed in a user-friendly manner. Allow users to
delete tasks from the list. Mark tasks as completed or pending, and visually differentiate them.
5. Develop a React application that demonstrates component composition and the use of props to pass data. Create
two components: FigureList: A parent component responsible for rendering multiple child components.
BasicFigure: A child component designed to display an image and its associated caption. Use the FigureList
component to dynamically render multiple BasicFigure components. Pass image URLs and captions as props from
the FigureList component to each BasicFigure component. Style the BasicFigure components to display the image
and caption in an aesthetically pleasing manner. Arrange the BasicFigure components within the FigureList in a
grid or list format. Allow users to add or remove images dynamically. Add hover effects or animations to the
images for an interactive experience.
6. Design and implement a React Form that collects user input for name, email, and password. Form Fields are
Name, Email, Password. Ensure all fields are filled before allowing form submission.Validate the email field to
Template for Practical Course and if AEC is a practical Course Annexure-V
ensure it follows the correct email format (e.g., [email protected]). Optionally enforce a minimum password
length or complexity. Display error messages for invalid or missing inputs. Provide visual cues (e.g., red borders)
to highlight invalid fields. Prevent form submission until all fields pass validation. Log or display the entered data
upon successful submission (optional). Add a "Show Password" toggle for the password field. Implement client-
side sanitization to ensure clean input.
7. Develop a React Application featuring a ProfileCard component to display a user's profile information, including
their name, profile picture, and bio. The component should demonstrate flexibility by utilizing both external CSS
and inline styling for its design. Display the following information: Profile picture, User's name, A short bio or
description Use an external CSS file for overall structure and primary styles, such as layout, colors, and typography.
Apply inline styles for dynamic or specific styling elements, such as background colors or alignment. Design the
ProfileCard to be visually appealing and responsive. Ensure the profile picture is displayed as a circle, and the
name and bio are appropriately styled. Add hover effects or animations to enhance interactivity. Allow the
background color of the card to change dynamically based on a prop or state.
8. Develop a Reminder Application that allows users to efficiently manage their tasks. The application should include
the following functionalities: Provide a form where users can add tasks along with due dates. The form includes
task name,Due date,An optional description. Display a list of tasks dynamically as they are added. Show relevant
details like task name, due date, and completion status. Include a filter option to allow users to view all Tasks and
Display all tasks regardless of status. Show only tasks marked as completed. Show only tasks that are not yet
completed.
9. 9Design a React application that demonstrates the implementation of routing using the react-router-dom
library. The application should include the Navigation Menu: Create a navigation bar with links to three
distinct pages, Home, About, Contact. Develop separate components for each page (Home, About, and
Contact) with appropriate content to differentiate them. Configure routes using react-router-dom to render
the corresponding page component based on the selected link. Use BrowserRouter and Route components
for routing. Highlight the active link in the navigation menu to indicate the current page
10 Design a React application featuring a class-based component that demonstrates the use of lifecycle
methods to interact with an external API. The component should fetch and update data dynamically based
on user interactions or state changes. Use the componentDidMount lifecycle method to fetch data from an
API when the component is initially rendered. Display the fetched data in a structured format, such as a table
or list. Use the componentDidUpdate lifecycle method to detect changes in the component's state or props.
Trigger additional API calls to update the displayed data based on user input or actions (e.g., filtering,
searching, or pagination). Implement error handling to manage issues such as failed API requests or empty
data responses. Display appropriate error messages to the user when necessary. Allow users to perform
actions like filtering, searching, or refreshing the data. Reflect changes in the displayed data based on these
interactions.
● Students can pick one question (experiment) from the questions lot prepared by the
examiners jointly.
● Evaluation of test write-up/ conduction procedure and result/viva will be conducted
jointly by examiners.
● General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure
and result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for
100 marks and scored marks shall be scaled down to 50 marks (however, based on course
type, rubrics shall be decided by the examiners)
Change of experiment is allowed only once and 15% of Marks allotted to the procedure part
are to be made zero.
The minimum duration of SEE is 02 hours
Suggested Learning Resources:
Books:
1. Beginning React JS Foundations Building User Interfaces with ReactJS: An Approachable Guide, Chris
Minnick, Wiley publications , 2022.
2. Learning React Functional Web Development with React and Redux , Alex Banks, Eve Porcello · 2017
● https://www.youtube.com/watch?v=V9i3cGD-mts
● https://youtu.be/PHaECbrKgs0
● https://youtu.be/uvEAvxWvwOs
● https://www.geeksforgeeks.org/state-management-with-usestate-hook-in-react/
● https://youtu.be/KU-I2M9Jm68
● https://youtu.be/H63Pd_lXkeQ
● https://youtu.be/oTIJunBa6MA
● https://youtu.be/3EbYJrAOpUs
Template for Practical Course and if AEC is a practical Course Annexure-V
Generative AI Semester 6
Course Code BAIL657C CIE Marks 50
Teaching Hours/Week (L:T:P: S) 0:0:1:0 SEE Marks 50
Credits 01 Exam Hours 100
Examination type (SEE) Practical
Course objectives:
● Understand the principles and concepts behind generative AI models
● Explain the knowledge gained to implement generative models using Prompt design frameworks.
● Apply various Generative AI applications for increasing productivity.
● Develop Large Language Model-based Apps.
Sl.NO Experiments
1. Explore pre-trained word vectors. Explore word relationships using vector arithmetic. Perform arithmetic
operations and analyze results.
2. Use dimensionality reduction (e.g., PCA or t-SNE) to visualize word embeddings for Q 1. Select 10 words from a
specific domain (e.g., sports, technology) and visualize their embeddings. Analyze clusters and relationships.
Generate contextually rich outputs using embeddings. Write a program to generate 5 semantically similar words
for a given input.
3. Train a custom Word2Vec model on a small dataset. Train embeddings on a domain-specific corpus (e.g., legal,
medical) and analyze how embeddings capture domain-specific semantics.
4. Use word embeddings to improve prompts for Generative AI model. Retrieve similar words using word
embeddings. Use the similar words to enrich a GenAI prompt. Use the AI model to generate responses for the
original and enriched prompts. Compare the outputs in terms of detail and relevance.
5. Use word embeddings to create meaningful sentences for creative tasks. Retrieve similar words for a seed word.
Create a sentence or story using these words as a starting point. Write a program that: Takes a seed word. Generates
similar words. Constructs a short paragraph using these words.
6. Use a pre-trained Hugging Face model to analyze sentiment in text. Assume a real-world application, Load the
sentiment analysis pipeline. Analyze the sentiment by giving sentences to input.
7. Summarize long texts using a pre-trained summarization model using Hugging face model. Load the
summarization pipeline. Take a passage as input and obtain the summarized text.
8. Install langchain, cohere (for key), langchain-community. Get the api key( By logging into Cohere and obtaining
the cohere key). Load a text document from your google drive . Create a prompt template to display the output in
a particular manner.
9. Take the Institution name as input. Use Pydantic to define the schema for the desired output and create a custom
output parser. Invoke the Chain and Fetch Results. Extract the below Institution related details from Wikipedia:
The founder of the Institution. When it was founded. The current branches in the institution . How many
employees are working in it. A brief 4-line summary of the institution.
10 Build a chatbot for the Indian Penal Code. We'll start by downloading the official Indian Penal Code document,
and then we'll create a chatbot that can interact with it. Users will be able to ask questions about the Indian Penal
Code and have a conversation with it.
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
● The examination schedule and names of examiners are informed to the university before
the conduction of the examination. These practical examinations are to be conducted
between the schedule mentioned in the academic calendar of the University.
● All laboratory experiments are to be included for practical examination.
● (Rubrics) Breakup of marks and the instructions printed on the cover page of the answer
script to be strictly adhered to by the examiners. OR based on the course requirement
evaluation rubrics shall be decided jointly by examiners.
● Students can pick one question (experiment) from the questions lot prepared by the
examiners jointly.
● Evaluation of test write-up/ conduction procedure and result/viva will be conducted
jointly by examiners.
● General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure
and result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for
100 marks and scored marks shall be scaled down to 50 marks (however, based on course
type, rubrics shall be decided by the examiners)
Change of experiment is allowed only once and 15% of Marks allotted to the procedure part
are to be made zero.
The minimum duration of SEE is 02 hours
Suggested Learning Resources:
Books:
1. Modern Generative AI with ChatGPT and OpenAI Models: Leverage the Capabilities of OpenAI's LLM for
Productivity and Innovation with GPT3 and GPT4, by Valentina Alto, Packt Publishing Ltd, 2023.
2. Generative AI for Cloud Solutions: Architect modern AI LLMs in secure, scalable, and ethical cloud
environments, by Paul Singh, Anurag Karuparti ,Packt Publishing Ltd, 2024.
● https://www.w3schools.com/gen_ai/index.php
● https://youtu.be/eTPiL3DF27U
● https://youtu.be/je6AlVeGOV0
● https://youtu.be/RLVqsA8ns6k
● https://youtu.be/0SAKM7wiC-A
● https://youtu.be/28_9xMyrdjg
● https://youtu.be/8iuiz-c-EBw
● https://youtu.be/7oQ8VtEKcgE
● https://youtu.be/seXp0VWWZV0
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
DEVOPS Semester 6
Course Code BCSL657D CIE Marks 50
Teaching Hours/Week (L:T:P: S) 0:0:2:0 SEE Marks 50
Credits 01 Exam Hours 100
Examination type (SEE) Practical
Course objectives:
● To introduce DevOps terminology, definition & concepts
● To understand the different Version control tools like Git, Mercurial
● To understand the concepts of Continuous Integration/ Continuous Testing/ Continuous Deployment)
● To understand Configuration management using Ansible
● Illustrate the benefits and drive the adoption of cloud-based Devops tools to solve real world problems
Sl.NO Experiments
1 Introduction to Maven and Gradle: Overview of Build Automation Tools, Key
Differences Between Maven and Gradle, Installation and Setup
2 Working with Maven: Creating a Maven Project, Understanding the POM File,
Dependency Management and Plugins
3 Working with Gradle: Setting Up a Gradle Project, Understanding Build Scripts
(Groovy and Kotlin DSL), Dependency Management and Task Automation
4 Practical Exercise: Build and Run a Java Application with Maven, Migrate the
Same Application to Gradle
5 Introduction to Jenkins: What is Jenkins?, Installing Jenkins on Local or Cloud
Environment, Configuring Jenkins for First Use
6 Continuous Integration with Jenkins: Setting Up a CI Pipeline, Integrating
Jenkins with Maven/Gradle, Running Automated Builds and Tests
7 Configuration Management with Ansible: Basics of Ansible: Inventory,
Playbooks, and Modules, Automating Server Configurations with Playbooks, Hands-On: Writing
and Running a Basic Playbook
8 Practical Exercise: Set Up a Jenkins CI Pipeline for a Maven Project,
Use Ansible to Deploy Artifacts Generated by Jenkins
9 Introduction to Azure DevOps: Overview of Azure DevOps Services, Setting Up an Azure
DevOps Account and Project
10 Creating Build Pipelines: Building a Maven/Gradle Project with Azure Pipelines,
Integrating Code Repositories (e.g., GitHub, Azure Repos), Running Unit Tests and Generating
Reports
11 Creating Release Pipelines: Deploying Applications to Azure App Services, Managing Secrets
and Configuration with Azure Key Vault, Hands-On:
Continuous Deployment with Azure Pipelines
12 Practical Exercise and Wrap-Up: Build and Deploy a Complete DevOps
Pipeline, Discussion on Best Practices and Q&A
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
● Demonstrate different actions performed through Version control tools like Git.
● Perform Continuous Integration and Continuous Testing and Continuous Deployment using Jenkins by
building and automating test cases using Maven & Gradle.
● Experiment with configuration management using Ansible.
● Demonstrate Cloud-based DevOps tools using Azure DevOps.
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
@#@11012025
Template for Practical Course and if AEC is a practical Course Annexure-V
● Students can pick one question (experiment) from the questions lot prepared by the
examiners jointly.
● Evaluation of test write-up/ conduction procedure and result/viva will be conducted
jointly by examiners.
● General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure
and result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for
100 marks and scored marks shall be scaled down to 50 marks (however, based on course
type, rubrics shall be decided by the examiners)
Change of experiment is allowed only once and 15% of Marks allotted to the procedure part
are to be made zero.
The minimum duration of SEE is 02 hours
Suggested Learning Resources:
● https://www.geeksforgeeks.org/devops-tutorial/
● https://www.javatpoint.com/devops
● https://www.youtube.com/watch?v=2N-59wUIPVI
● https://www.youtube.com/watch?v=87ZqwoFeO88
@#@11012025