Raj Kumar Goel Institute of Technology

Ghaziabad

OPERATING SYSTEM(KCS-401)

Unit: 1 Faculty
Passport
Size
photo

Faculty Name
Course Details
RAVISHANKAR PAL
B.TECH/4th SEM

1
 Faculty Information
Faculty
NAME:- Mr. RAVISHANKAR PAL, Passport Size
DEPARTMENT:- CSE(IOT), photo
MO NO:- 7903864510,
EMAIL ID:- [email protected],
QUALIFICATION:- B.TECH, M.TECH,
EXPERTISE IN SUBJECT:-OS, DSTL, DBMS, DATA STRUCTURE,
INTERSTED AREA:-MACHINE LEARNING,
PATENT:-IOT ENABLED PRESSURE COOKER TO CONTRAL THE
TEMPRATURE USING CELL PHONE,
PAPER1:- FACE RECOGNITION,
PAPER2:- BASED ON A MIX OF VISUAL MOTION, AND DEPTH
SALIENCY, SALIENCY MAPS FOR STEREOSCOPIC VIDEO ARE
DETECTED,

10/12/2024 Faculty Name Unit -2 2

 Evaluation Scheme

Subject L T P CT TA TOTAL PS TE PE TOTAL CREDIT

OPERATING 2 25 25 50 1
SYSTEM LAB
(KCS451)

OPERATING 3 0 0 30 20 50 100 150 4

SYSTEM(KCS401)

10/12/2024 Faculty Name Unit -2 3

 SUBJECT SYLLABUS
UNIT TOPIC PROP
OSED
LECT
URE
1 Introduction : Operating system and functions, Classification of Operating 08
systems- Batch,
Interactive, Time sharing, Real Time System, Multiprocessor Systems,
Multiuser Systems,
Multiprocessing Systems, Multithreaded Systems, Operating System
Structure- Layered structure,
System Components, Operating System services, Reentrant Kernels,
Monolithic and Microkernel
Systems.
2 Concurrent Processes: Process Concept, Principle of Concurrency, Producer / 08
Consumer
Problem, Mutual Exclusion, Critical Section Problem, Dekker’s solution,
Peterson’s solution,
Semaphores, Test and Set operation; Classical Problem in Concurrency-
Dining Philosopher
Problem, Sleeping Barber Problem; Inter Process Communication models and
Schemes, Process
generation.
10/12/2024 Faculty Name Unit -2 4
 SUBJECT SYLLABUS
03 CPU Scheduling: Scheduling Concepts, Performance Criteria, Process 08
States, Process Transition
Diagram, Schedulers, Process Control Block (PCB), Process address space,
Process identification
information, Threads and their management, Scheduling Algorithms,
Multiprocessor Scheduling.
Deadlock: System model, Deadlock characterization, Prevention,
Avoidance and detection,
Recovery from deadlock.
04 Memory Management: Basic bare machine, Resident monitor, 08
Multiprogramming with fixed
partitions, Multiprogramming with variable partitions, Protection schemes,
Paging, Segmentation,
Paged segmentation, Virtual memory concepts, Demand paging,
Performance of demand paging,
Page replacement algorithms, Thrashing, Cache memory organization,
Locality of reference.
05 I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O 08
buffering, Disk
storage and disk scheduling, RAID. File System: File concept, File
organization and access
mechanism, File directories, and File sharing, File system implementation
issues, File system
protection and security. Faculty Name
10/12/2024 Unit -2 5
Course Objective

Faculty Name Unit -2

 Course Outcome
CO1 Understand the structure and functions of OS K1,K2

CO2 Learn about Processes, Threads and Scheduling algorithms. K1, K2

CO3 Understand the principles of concurrency and Deadlocks K2

CO4 Learn various memory management scheme K2

CO5 Study I/O management and File systems. K2,K4

Faculty Name Unit -2

 Program Outcomes
•Understands the different services provided
by Operating System at different level.

•They learn real life applications of Operating

System in every field.

• Understands the use of different process

scheduling algorithm and synchronization
techniques to avoid deadlock.

• They will learn different memory

management techniques like paging,
segmentation and demand
10/12/2024 Faculty Name
paging
Unit -2
etc. 8
CO-PO-PSO MAPPING
CO-PO Mapping
CO No. PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

15CS64.1 1 - - - - - - - - - - 2 - 2 -

15CS64.2 1 1 - - - - - - - - - 2 - 2 -

15CS64.3 1 1 - - - - - - - - - 2 - 2 -

15CS64.4 1 1 - - - - - - - - - 2 - 2 -

15CS64.5 1 1 - - - - - - - - - 2 - 2 -

15CS64 1.0 1.0 - - - - - - - - - 2.0 - 2.0 -

Faculty Name Unit -2

 CO-PO-PSO JUSTIFICATION

10/12/2024 Faculty Name Unit -2 10

10/12/2024 Faculty Name Unit -2 11
10/12/2024 Faculty Name Unit -2 12
 Introduction
• What is an Operating System?
• Mainframe Systems
• Desktop Systems
• Multiprocessor Systems
• Distributed Systems
• Clustered System
• Real -Time Systems
• Handheld Systems
• Computing Environments
 What is an Operating System?

• A program that acts as an intermediary

between a user of a computer and the
computer hardware.
• Operating system goals:
– Execute user programs and make solving user
problems easier.
– Make the computer system convenient to use.
• Use the computer hardware in an efficient
manner.
 Computer System Components
1.Hardware – provides basic computing resources
(CPU, memory, I/O devices).
2.Operating system – controls and coordinates the
use of the hardware among the various
application programs for the various users.
3.Applications programs – define the ways in which
the system resources are used to solve the
computing problems of the users (compilers,
database systems, video games, business
programs).
4.Users (people, machines, other computers).
Abstract View of System Components
 Operating System Definitions

• Resource allocator – manages and

allocates resources.
• Control program – controls the
execution of user programs and
operations of I/O devices .
• Kernel – the one program running at all
times (all else being application
programs).
 Evolution of OS

Major Phases Technical Operating

Innovations Systems

Open Shop The idea of OS IBM 701 open shop

(1954)

Batch Processing Tape batching, BKS system (1961)

First-in, first-out
scheduling.

Multi- Processor multiplexing, Atlas supervisor

programming Indivisible operations, (1961),
Demand paging, Exec II system (1966)
Input/output spooling,
Priority scheduling,
Remote job entry (Contd…)
 Evolution of OS (contd..):

Timesharing Simultaneous user Multics file system

interaction, (1965),
On-line file systems Unix (1974)
Concurrent Hierarchical systems, RC 4000 system (1969),
Programming Extensible kernels, 13 Venus system
Parallel programming (1972),
concepts, Secure parallel 14 Boss 2 system
languages (1975).
Personal Computing Graphic user interfaces OS 6 (1972)
Pilot system (1980)

Distributed Systems Remote servers WFS file server (1979)

Unix United RPC (1982)
24 Amoeba system
(1990)
 A Classification of OSs
• Mainframe operating systems: OS/390
• Server operating systems: UNIX, Windows 2000,
Linux
• Multiprocessor operating systems
• PC operating systems:
• Windows 98, Windows ME, Macintosh, Linux
• Real-time operating systems: VxWorks, QNX
• Embedded operating systems:
• PalmOS, Windows CE, Windows Mobile, Symbian

Spring, 2008 TUCN. Operating Systems. Lecture 1

 Specific Terms and Concepts
• Batch systems: no user interaction
• Multiprogramming: multiple programs loaded in
memory
• Time-sharing: each process receives slices of CPU time
• Interactive systems: provides quick response to user’s
actions
• Multi-user: distinction between users
• Network OS: users aware of the existence of multiple
computers
• Distributed OS: looks like a traditional single-processor
system
• Processes, Files, System Calls
Spring, 2008 TUCN. Operating Systems. Lecture 1
 Batch Processing:

• In Batch processing same type of jobs batch (BATCH- a

set of jobs with similar needs) together and execute at a
time.
• The OS was simple, its major task was to transfer control
from one job to the next.
• The job was submitted to the computer operator in form
of punch cards. At some later time the output appeared.
• The OS was always resident in memory. (Ref. Fig. next
slide)
• Common Input devices were card readers and tape
drives.
 Batch Processing (Contd…):

• Common output devices were line printers,

tape drives, and card punches.
• Users did not interact directly with the
computer systems, but he prepared a job
(comprising of the program, the data, & some
control information).
OS

User
program
area
 Multiprogramming:

• Multiprogramming is a technique to execute number

of programs simultaneously by a single processor.
• In Multiprogramming, number of processes reside in
main memory at a time.
• The OS picks and begins to executes one of the jobs
in the main memory.
• If any I/O wait happened in a process, then CPU
switches from that job to another job.
• Hence CPU in not idle at any time.
 Multiprogramming (Contd…):

OS
• Figuredepicts the layout of
Job 1 multiprogramming system.
• The main memory consists of 5
Job 2 jobs at a time, the CPU executes
one by one.
Job 3
Advantages:
Job 4 •Efficient memory utilization
•Throughput increases
Job 5
•CPU is never idle, so
performance increases.
 OS Features Needed for Multiprogramming

• I/O routine supplied by the system.

• Memory management – the system
must allocate the memory to several
jobs.
• CPU scheduling – the system must
choose among several jobs ready to
run.
• Allocation of devices.
 Time Sharing Systems:

• Time sharing, or multitasking, is a logical extension

of multiprogramming.
• Multiple jobs are executed by switching the CPU
between them.
• In this, the CPU time is shared by different
processes, so it is called as “Time sharing
Systems”.
• Time slice is defined by the OS, for sharing CPU
time between processes.
• Examples: Multics, Unix, etc.,
 Time-Sharing Systems–Interactive Computing

• The CPU is multiplexed among several jobs that are

kept in memory and on disk (the CPU is allocated to
a job only if the job is in memory).
• A job swapped in and out of memory to the disk.
• On-line communication between the user and the
system is provided; when the operating system
finishes the execution of one command, it seeks the
next “control statement” from the user’s keyboard.
• On-line system must be available for users to access
data and code.
Operating System can also be classified as,-

• Single User Systems

• Multi User Systems

 Single User Systems:

• Provides a platform for only one user at a time.

• They are popularly associated with Desk Top operating

system which run on standalone systems where no user
accounts are required.
• Example: DOS
 Multi-User Systems:

• Provides regulated access for a number of users by maintaining a

database of known users.

• Refers to computer systems that support two or more simultaneous users.

• Another term for multi-user is time sharing.

• Ex: All mainframes and are multi-user systems.

• Example: Unix
 Desktop Systems

• Personal computers – computer system dedicated to a

single user.
• I/O devices – keyboards, mice, display screens, small
printers.
• User convenience and responsiveness.
• Can adopt technology developed for larger operating
system’ often individuals have sole use of computer
and do not need advanced CPU utilization of
protection features.
• May run several different types of operating systems
(Windows, MacOS, UNIX, Linux)
 Parallel Systems
• Multiprocessor systems with more than on CPU
in close communication.
• Tightly coupled system – processors share
memory and a clock; communication usually
takes place through the shared memory.
• Advantages of parallel system:
– Increased throughput
– Economical
– Increased reliability
• graceful degradation
• fail-soft systems
 Parallel Systems (Cont.)
• Symmetric multiprocessing (SMP)
– Each processor runs and identical copy of the
operating system.
– Many processes can run at once without performance
deterioration.
– Most modern operating systems support SMP
• Asymmetric multiprocessing
– Each processor is assigned a specific task; master
processor schedules and allocated work to slave
processors.
– More common in extremely large systems
Symmetric Multiprocessing Architecture
 Distributed Systems

• Distribute the computation among several physical

processors.
• Loosely coupled system – each processor has its own
local memory; processors communicate with one
another through various communications lines, such
as high-speed buses or telephone lines.
• Advantages of distributed systems.
– Resources Sharing
– Computation speed up – load sharing
– Reliability
– Communications
 Distributed Systems (cont)

• Requires networking infrastructure.

• Local area networks (LAN) or Wide
area networks (WAN)
• May be either client-server or peer-to-
peer systems.
General Structure of Client-Server
 Clustered Systems
• Clustering allows two or more systems to share
storage.
• Provides high reliability.
• Asymmetric clustering: one server runs the
application while other servers standby.
• Symmetric clustering: all N hosts are running the
application.
 Real-Time Systems
• Often used as a control device in a
dedicated application such as controlling
scientific experiments, medical imaging
systems, industrial control systems, and
some display systems.
• Well-defined fixed-time constraints.
• Real-Time systems may be either hard or
soft real-time.
 Real-Time Systems (Cont.)

• Hard real-time:
– Secondary storage limited or absent, data stored in
short term memory, or read-only memory (ROM)
– Conflicts with time-sharing systems, not supported by
general-purpose operating systems.

• Soft real-time
– Limited utility in industrial control of robotics
– Useful in applications (multimedia, virtual reality)
requiring advanced operating-system features.
 Embedded Operating Systems

• OS embed on the System itself

• Fast, Application specific
• Examples Processor in modern washing machines, Cell
phones, Control systems etc…
 Handheld Systems
• Personal Digital Assistants (PDAs)
• Cellular telephones
• Issues:
– Limited memory
– Slow processors
– Small display screens.
Migration of Operating-System Concepts and Features
 Hardware Protection
• Dual-Mode Operation
• I/O Protection
• Memory Protection
• CPU Protection
 Dual-Mode Operation
• Sharing system resources requires operating
system to ensure that an incorrect program
cannot cause other programs to execute
incorrectly.
• Provide hardware support to differentiate
between at least two modes of operations.
1.User mode – execution done on behalf of a user.
2.Monitor mode (also kernel mode or system mode) –
execution done on behalf of operating system.
 Dual-Mode Operation (Cont.)

• Mode bit added to computer hardware to indicate the

current mode: monitor (0) or user (1).
• When an interrupt or fault occurs hardware switches to
monitor mode.
Interrupt/fault

monitor user
set user mode

Privileged instructions can be issued only in monitor mode.

 I/O Protection
• All I/O instructions are privileged instructions.
• Must ensure that a user program could never
gain control of the computer in monitor mode
(I.e., a user program that, as part of its
execution, stores a new address in the interrupt
vector).
Use of A System Call to Perform I/O
 Memory Protection
• Must provide memory protection at least for the
interrupt vector and the interrupt service
routines.
• In order to have memory protection, add two
registers that determine the range of legal
addresses a program may access:
– Base register – holds the smallest legal physical
memory address.
– Limit register – contains the size of the range
• Memory outside the defined range is protected.
Use of A Base and Limit Register
Hardware Address Protection
 Hardware Protection
• When executing in monitor mode, the operating
system has unrestricted access to both monitor
and user’s memory.
• The load instructions for the base and limit
registers are privileged instructions.
 CPU Protection
• Timer – interrupts computer after specified
period to ensure operating system maintains
control.
– Timer is decremented every clock tick.
– When timer reaches the value 0, an interrupt occurs.
• Timer commonly used to implement time
sharing.
• Time also used to compute the current time.
• Load-timer is a privileged instruction.
 Network Structure
• Local Area Networks (LAN)
• Wide Area Networks (WAN)
 Computing Environments
• Traditional computing
• Web-Based Computing
• Embedded Computing
 Operating-System Structures

• System Components
• Operating System Services
• System Calls
• System Programs
• System Structure
• Virtual Machines
• System Design and Implementation
• System Generation
 Common System Components

• Process Management
• Main Memory Management
• File Management
• I/O System Management
• Secondary Management
• Networking
• Protection System
• Command-Interpreter System
 Process Management
• A process is a program in execution. A process needs
certain resources, including CPU time, memory, files,
and I/O devices, to accomplish its task.
• The operating system is responsible for the following
activities in connection with process management.
– Process creation and deletion.
– process suspension and resumption.
– Provision of mechanisms for:
• process synchronization
• process communication
 Main-Memory Management
• Memory is a large array of words or bytes, each with its
own address. It is a repository of quickly accessible data
shared by the CPU and I/O devices.
• Main memory is a volatile storage device. It loses its
contents in the case of system failure.
• The operating system is responsible for the following
activities in connections with memory management:
– Keep track of which parts of memory are currently being
used and by whom.
– Decide which processes to load when memory space
becomes available.
– Allocate and deallocate memory space as needed.
 File Management
• A file is a collection of related information defined by
its creator. Commonly, files represent programs (both
source and object forms) and data.
• The operating system is responsible for the following
activities in connections with file management:
– File creation and deletion.
– Directory creation and deletion.
– Support of primitives for manipulating files and directories.
– Mapping files onto secondary storage.
– File backup on stable (nonvolatile) storage media.
 I/O System Management
• The I/O system consists of:
– A buffer-caching system
– A general device-driver interface
– Drivers for specific hardware devices
 Secondary-Storage Management
• Since main memory (primary storage) is volatile and too
small to accommodate all data and programs
permanently, the computer system must provide
secondary storage to back up main memory.
• Most modern computer systems use disks as the
principle on-line storage medium, for both programs and
data.
• The operating system is responsible for the following
activities in connection with disk management:
– Free space management
– Storage allocation
– Disk scheduling
 Networking (Distributed Systems)
• A distributed system is a collection processors that do
not share memory or a clock. Each processor has its
own local memory.
• The processors in the system are connected through a
communication network.
• Communication takes place using a protocol.
• A distributed system provides user access to various
system resources.
• Access to a shared resource allows:
– Computation speed-up
– Increased data availability
– Enhanced reliability
 Protection System
• Protection refers to a mechanism for controlling
access by programs, processes, or users to both
system and user resources.
• The protection mechanism must:
– distinguish between authorized and unauthorized
usage.
– specify the controls to be imposed.
– provide a means of enforcement.
 Command-Interpreter System
• Many commands are given to the operating
system by control statements which deal with:
– process creation and management
– I/O handling
– secondary-storage management
– main-memory management
– file-system access
– protection
– networking
 Command-Interpreter System (Cont.)

• The program that reads and interprets control

statements is called variously:

– command-line interpreter
– shell (in UNIX)

Its function is to get and execute the next

command statement.
 Operating System Services
• Program execution – system capability to load a program into
memory and to run it.
• I/O operations – since user programs cannot execute I/O operations
directly, the operating system must provide some means to perform
I/O.
• File-system manipulation – program capability to read, write, create,
and delete files.
• Communications – exchange of information between processes
executing either on the same computer or on different systems tied
together by a network. Implemented via shared memory or message
passing.
• Error detection – ensure correct computing by detecting errors in the
CPU and memory hardware, in I/O devices, or in user programs.
 Additional Operating System Functions

Additional functions exist not for helping the user,

but rather for ensuring efficient system operations.
• Resource allocation – allocating resources to multiple
users or multiple jobs running at the same time.
• Accounting – keep track of and record which users use
how much and what kinds of computer resources for
account billing or for accumulating usage statistics.
• Protection – ensuring that all access to system
resources is controlled.
 System Calls
• System calls provide the interface between a running
program and the operating system.
– Generally available as assembly-language instructions.
– Languages defined to replace assembly language for
systems programming allow system calls to be made
directly (e.g., C, C++)
• Three general methods are used to pass parameters
between a running program and the operating system.
– Pass parameters in registers.
– Store the parameters in a table in memory, and the table
address is passed as a parameter in a register.
– Push (store) the parameters onto the stack by the
program, and pop off the stack by operating system.
Passing of Parameters As A Table
 Types of System Calls
• Process control
• File management
• Device management
• Information maintenance
• Communications
 MS-DOS Execution

At System Start-up Running a Program

UNIX Running Multiple Programs
 Communication Models
 Communication may take place using either message passing
or shared memory.

Msg Passing Shared Memory

 System Programs
• System programs provide a convenient environment for
program development and execution. The can be
divided into:
– File manipulation
– Status information
– File modification
– Programming language support
– Program loading and execution
– Communications
– Application programs
• Most users’ view of the operation system is defined by
system programs, not the actual system calls.
 MS-DOS System Structure
• MS-DOS – written to provide the most
functionality in the least space
– not divided into modules
– Although MS-DOS has some structure, its interfaces
and levels of functionality are not well separated
MS-DOS Layer Structure
 UNIX System Structure

• UNIX – limited by hardware functionality, the

original UNIX operating system had limited
structuring. The UNIX OS consists of two
separable parts.
– Systems programs
– The kernel
• Consists of everything below the system-call interface
and above the physical hardware
• Provides the file system, CPU scheduling, memory
management, and other operating-system functions; a
large number of functions for one level.
UNIX System Structure
 Layered Approach
• The operating system is divided into a number of
layers (levels), each built on top of lower layers.
The bottom layer (layer 0), is the hardware; the
highest (layer N) is the user interface.
• With modularity, layers are selected such that
each uses functions (operations) and services of
only lower-level layers.
An Operating System Layer
OS/2 Layer Structure
 Microkernel System Structure
• Moves as much from the kernel into “user” space.
• Communication takes place between user
modules using message passing.
• Benefits:
- easier to extend a microkernel
- easier to port the operating system to new
architectures
- more reliable (less code is running in kernel
mode)
- more secure
Windows NT Client-Server Structure
 Re-entrant Kernels

Process 1 Process 1 Process 2

USER MODE
KERNEL MODE
Excp Intr Intr

Time Intr
• Re-entrant kernel: Several processes may
be in Kernel Mode at the same time
– A re-entrant kernel is able to suspend the current running
process even if it is in the Kernel Mode
• Note: Traps are a type of exceptions.
 Re-entrant Kernels

Process 1 Process 1 Process 2

USER MODE
KERNEL MODE
Excp Intr Intr

Kernel control paths

Time Intr
• A kernel control path denotes the
sequence of instructions executed by
the kernel to handle a system call,
an exception, or an interrupt
 Re-entrant Kernels

Process 1 Process 1 Process 2

USER MODE
KERNEL MODE
Excp Intr Intr

Kernel control paths

Time Intr
• Why reentrancy
– Improves throughput of devices
controllers that raise interrupts
– Allows priorities among interrupts
 Virtual Machines
• A virtual machine takes the layered approach to
its logical conclusion. It treats hardware and the
operating system kernel as though they were all
hardware.
• A virtual machine provides an interface identical
to the underlying bare hardware.
• The operating system creates the illusion of
multiple processes, each executing on its own
processor with its own (virtual) memory.
 Virtual Machines (Cont.)
• The resources of the physical computer are
shared to create the virtual machines.
– CPU scheduling can create the appearance that users
have their own processor.
– Spooling and a file system can provide virtual card
readers and virtual line printers.
– A normal user time-sharing terminal serves as the
virtual machine operator’s console.
 System Models

Non-virtual Machine Virtual Machine

 Advantages/Disadvantages of Virtual Machines

• The virtual-machine concept provides complete protection

of system resources since each virtual machine is isolated
from all other virtual machines. This isolation, however,
permits no direct sharing of resources.
• A virtual-machine system is a perfect vehicle for operating-
systems research and development. System development is
done on the virtual machine, instead of on a physical
machine and so does not disrupt normal system operation.
• The virtual machine concept is difficult to implement due to
the effort required to provide an exact duplicate to the
underlying machine.
 Java Virtual Machine
• Compiled Java programs are platform-neutral
bytecodes executed by a Java Virtual Machine
(JVM).
• JVM consists of
- class loader
- class verifier
- runtime interpreter
• Just-In-Time (JIT) compilers increase
performance
Java Virtual Machine
 System Design Goals
• User goals – operating system should be
convenient to use, easy to learn, reliable, safe,
and fast.
• System goals – operating system should be easy
to design, implement, and maintain, as well as
flexible, reliable, error-free, and efficient.
 Mechanisms and Policies
• Mechanisms determine how to do something,
policies decide what will be done.
• The separation of policy from mechanism is a
very important principle, it allows maximum
flexibility if policy decisions are to be changed
later.
 System Implementation
• Traditionally written in assembly language,
operating systems can now be written in higher-
level languages.
• Code written in a high-level language:
– can be written faster.
– is more compact.
– is easier to understand and debug.
• An operating system is far easier to port (move
to some other hardware) if it is written in a high-
level language.
 System Generation (SYSGEN)
• Operating systems are designed to run on any of a
class of machines; the system must be configured
for each specific computer site.
• SYSGEN program obtains information concerning
the specific configuration of the hardware system.
• Booting – starting a computer by loading the
kernel.
• Bootstrap program – code stored in ROM that is
able to locate the kernel, load it into memory, and
start its execution.
 assignment

• What is an Operating System? Discuss the main

services provided by the operating system.
• Explain Batch Processing System and Spooling with
the help of a diagram.
• Distinguish between Parallel Systems and Distributed
Systems.
• What do you mean by Kernel? Explain Microkernel
architecture in detail with the help of a diagram.
• What is the purpose of System Calls? Discuss various
types of system calls.
 Faculty Video Links, YouTube & NPTEL Video
Links and Online Courses Details
 https://www.youtube.com/watch?v=i4WyGv5M
bak&list=PL_obO5Qb5QTE9s7QCNjqk97Q4UUg
OseWP
 https://www.youtube.com/watch?v=lL5EXPNbq
_A&list=PL_obO5Qb5QTE9s7QCNjqk97Q4UUgO
seWP&index=2
 https://www.youtube.com/watch?v=o-
cHkNs27gk&list=PL_obO5Qb5QTE9s7QCNjqk97
Q4UUgOseWP&index=3

Faculty Name Unit -2

 https://www.youtube.com/watch?v=qib8_f4lSr4
&list=PL_obO5Qb5QTE9s7QCNjqk97Q4UUgOse
WP&index=4
 https://www.youtube.com/watch?v=V5y4ujItn3I
&list=PL_obO5Qb5QTE9s7QCNjqk97Q4UUgOse
WP&index=5
 https://www.youtube.com/watch?v=7S7WTnfzY
M4&list=PL_obO5Qb5QTE9s7QCNjqk97Q4UUg
OseWP&index=6
 https://www.youtube.com/watch?v=PmkCl-
MHz9A&list=PL_obO5Qb5QTE9s7QCNjqk97Q4U
UgOseWP&index=7
10/12/2024 Faculty Name Unit -2 102
Thank You