6th sem ISE syllabus 2022 scheme
6th sem ISE syllabus 2022 scheme
Course objectives:
● To understand the essential javascript concepts for web development.
● To style Web applications using bootstrap.
● To utilize React JS to build front end User Interface.
● To understand the usage of API’s to create web applications using Express JS.
● To store and model data in a no sql database.
Module-1
Basic JavaScript Instructions, Statements, Comments, Variables, Data Types, Arrays, Strings,
Functions, Methods & Objects, Decisions & Loops.
@#@10012025 1
Annexure-II 2
React State: Initial State, Async State Initialization, Updating State, Lifting State Up, Event Handling,
Stateless Components, Designing Components, State vs. Props, Component Hierarchy,
Communication, Stateless Components.
Express, REST API, GraphQL, Field Specification, Graph Based, Single Endpoint, Strongly Typed,
Introspection, Libraries, The About API GraphQL Schema File, The List API, List API Integration,
Custom Scalar types, The Create API, Create API Integration, Query Variables, Input Validations,
Displaying Errors.
Modularization and Webpack ,Back-End Modules Front-End Modules and Webpack Transform and
Bundle, Libraries Bundle ,Hot Module Replacement, Debugging DefinePlugin: Build Configuration,
Production Optimization.
3. Create an object student with properties: name (string), grade (number), subjects (array),
displayInfo() (method to log the student's details)
Write a script to dynamically add a passed property to the student object, with a value of true or false
based on their grade. Create a loop to log all keys and values of the student object.
4. Create a button in your HTML with the text "Click Me". Add an event listener to log "Button clicked!"
to the console when the button is clicked. Select an image and add a mouseover event listener to
change its border color. Add an event listener to the document that logs the key pressed by the user.
5. Build a React application to track issues. Display a list of issues (use static data). Each issue should
have a title, description, and status (e.g., Open/Closed). Render the list using a functional component.
6. Create a component Counter with A state variable count initialized to 0. Create Buttons to increment
and decrement the count. Simulate fetching initial data for the Counter component using useEffect
(functional component) or componentDidMount (class component). Extend the Counter component
to Double the count value when a button is clicked. Reset the count to 0 using another button.
7. Install Express (npm install express).
Set up a basic server that responds with "Hello, Express!" at the root endpoint (GET /).
Create a REST API. Implement endpoints for a Product resource: GET : Returns a list of products. POST
: Adds a new product. GET /:id: Returns details of a specific product. PUT /:id: Updates an existing
product. DELETE /:id: Deletes a product. Add middleware to log requests to the console. Use
express.json() to parse incoming JSON payloads.
@#@10012025 2
Annexure-II 3
8. Install the MongoDB driver for Node.js. Create a Node.js script to connect to the shop database.
Implement insert, find, update, and delete operations using the Node.js MongoDB driver. Define a
product schema using Mongoose. Insert data into the products collection using Mongoose. Create an
Express API with a /products endpoint to fetch all products. Use fetch in React to call the /products
endpoint and display the list of products. Add a POST /products endpoint in Express to insert a new
product. Update the Product List, After adding a product, update the list of products displayed in
React.
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.
@#@10012025 3
Annexure-II 4
● https://github.com/vasansr/pro-mern-stack
● https://nptel.ac.in/courses/106106156
● https://archive.nptel.ac.in/courses/106/105/106105084/
@#@10012025 4
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.
@#@10012025 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.
@#@10012025 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.
@#@10012025 3
Annexure-II 4
@#@10012025 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
@#@10012025 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.
@#@10012025 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
@#@10012025 3
Annexure-II 1
Course objectives:
● To understand the fundamentals of IoT with a strong knowledge of its architecture.
● To acquire solid fundamentals of IEEE 802.15.4 along with few comparative standards.
● Understand the network layer in the view of IoT along with the application protocol.
● To learn the data and analytics concepts in terms for IoT and Security concerns.
[Chapter-1, Chapter-2]
Module-2
Connecting smart things: Communications criteria, IoT access technologies (IEEE 802.15.4, IEEE
802.15.4g and IEEE 802.15.4e, IEEE 1901.2a, IEEE 802.11ah, LoRaWAN, NB-IoT)
[Chapter-4]
Module-3
@#@10012025 1
Annexure-II 2
IP as IoT network layer: The business case for IP, need for optimization, optimizing IP for IoT,
profiles and compliances.
[Chapter-5]
Module-4
Application Protocols for IoT: The Transport Layer, IoT Application Transport Methods.
Data Analytic for IoT: Introduction to data analytics for IoT, Machine learning, Big data analytics
tools and technology, Edge streaming analytics, network analytics.
[Chapter-6, Chapter-7]
Module-5
Security for IoT: Common challenges in OT security, How IT and OT security practices and
systems vary, formal risk analysis structures: OTAVE and FAIR, The phased application of
security in an operational environment.
Case study: Public safety
[Chapter-8, Chapter-15]
Course outcome (Course Skill Set)
@#@10012025 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
1. Internet of Things (Second Edition), Raj Kamal, McGraw Hill India, 2022.
2. Internet of Things: A Hands-On Approach, Aarshdeep Bahga and Vijay Madisetti, Universities
Press, 2015.
Web links and Video Lectures (e-Resources):
● https://www.geeksforgeeks.org/sensors-in-internet-of-thingsiot/
● https://www.edx.org/learn/iot-internet-of-things
● https://onlinecourses.nptel.ac.in/noc22_cs53/
@#@10012025 3
Annexure-II 4
@#@10012025 4
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
@#@10012025 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
@#@10012025 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
@#@10012025 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
@#@10012025 4
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.
Textbook 1: Chapter 1: 1.1 to 1.5
Module-2
Virtual Machines and Virtualization of Clusters and Data Centers: Implementation Levels
of Virtualization, Virtualization Structure/Tools and Mechanisms, Virtualization of
CPU/Memory and I/O devices, Virtual Clusters and Resource Management, Virtualization for
Data Center Automation.
Textbook 1: Chapter 3: 3.1 to 3.5
Module-3
Cloud Platform Architecture over Virtualized Datacenters: Cloud Computing and
Service Models, Data Center Design and Interconnection Networks, Architectural Design of
@#@10012025 1
Annexure-II 2
Compute and Storage Clouds, Public Cloud Platforms: GAE, AWS and Azure, Inter-Cloud
Resource Management.
Textbook 1: Chapter 4: 4.1 to 4.5
Module-4
Cloud Security: Top concern for cloud users, Risks, Privacy Impact Assessment, Cloud Data
Encryption, Security of Database Services, OS security, VM Security, Security Risks Posed by
Shared Images and Management OS, XOAR, A Trusted Hypervisor, Mobile Devices and
Cloud Security.
Cloud Security and Trust Management: Cloud Security Defense Strategies, Distributed
Intrusion/Anomaly Detection, Data and Software Protection Techniques, Reputation-Guided
Protection of Data Centers.
Textbook 2: Chapter 11: 11.1 to 11.3, 11.5 to 11.8, 11.10 to 11.14
Textbook 1: Chapter 4: 4.6
Module-5
Cloud Programming and Software Environments:
Features of Cloud and Grid Platforms, Parallel and Distributed Computing Paradigms,
Programming Support for Google App Engine, Programming on Amazon AWS and Microsoft,
Emerging Cloud Software Environments.
Textbook 1: Chapter 6: 6.1 to 6.5
Course outcome (Course Skill Set)
@#@10012025 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. 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
@#@10012025 3
Annexure-II 4
@#@10012025 4
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
@#@10012025 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.
@#@10012025 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
@#@10012025 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).
@#@10012025 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
@#@10012025 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
@#@10012025 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.
@#@10012025 3
3. Gerald J. Kowalski and Mark.T. Maybury, “Information Storage and Retrieval systems”,
Kluwer Academic Publishers.
@#@10012025 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
@#@10012025 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.
@#@10012025 2
TEMPLATE for AEC (if the course is a theory) Annexure-IV
@#@10012025 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
@#@10012025 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
@#@10012025 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
@#@10012025 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/
@#@10012025 3
Template for Practical Course and if AEC is a practical Course Annexure-V
Sl.NO Experiments
1 Develop a program to create histograms for all numerical features and analyze the distribution of each feature.
Generate box plots for all numerical features and identify any outliers. Use California Housing dataset.
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.
1. Label the first 50 points {x1,……,x50} as follows: if (xi ≤ 0.5), then xi ∊ Class1, else xi ∊ Class1
2. 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
@#@10012025
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):
@#@10012025
Template for Practical Course and if AEC is a practical Course Annexure-V
2. Record should contain all the specified experiments in the syllabus and each experiment write-up will
be evaluated for 10 marks.
3. Total marks scored by the students are scaled down to 30 marks (60% of maximum marks).
5. Department shall conduct a test of 100 marks after the completion of all the experiments listed in the
syllabus.
6. In a test, test write-up, conduction of experiment, acceptable result, and procedural knowledge will
carry a weightage of 60% and the rest 40% for viva-voce.
7. The suitable rubrics can be designed to evaluate each student’s performance and learning ability.
8. The marks scored shall be scaled down to 20 marks (40% of the maximum marks).
The Sum of scaled-down marks scored in the report write-up/journal and marks of a test is the total CIE
marks scored by the student.
Semester End Evaluation (SEE):
1. SEE marks for the practical course are 50 Marks.
2. SEE shall be conducted jointly by the two examiners of the same institute, examiners are appointed
by the Head of the Institute.
3. 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.
@#@10012025
Template for Practical Course and if AEC is a practical Course Annexure-V
5. (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.
6. Students can pick one question (experiment) from the questions lot prepared by the examiners
jointly.
7. Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly by
examiners.
1. 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.
1. https://www.drssridhar.com/?page_id=1053
2. https://www.universitiespress.com/resources?id=9789393330697
3. https://onlinecourses.nptel.ac.in/noc23_cs18/preview
@#@10012025
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.
@#@10012025
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.
@#@10012025
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
@#@10012025
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.
@#@10012025
Template for Practical Course and if AEC is a practical Course Annexure-V
@#@10012025
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
@#@10012025
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.
@#@10012025
Template for Practical Course and if AEC is a practical Course Annexure-V
@#@10012025
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
@#@10012025