A

T1'tL U-<i.-t-t' cc{1 s u:H //vi_ <)

tr ku? m. ·.-
O
\

f Cl-l-r.r ' ~ f
' • 0 C,

A CJ-u ft cu
C S' e__ w C% ._,, ~' C(, f'W"~
~ ~q ,
I '~

ex-~Ou e, Q a VY/ .::tO <l h CUvl

c~•
LV {,t../ C,,,/_,i

eaU/1., ~ Cu sd ~vt,t- of- c~e,v

frowYJ
q_ 0-Ll__ft CL{) ~~ , .J 4J C4_ ~ fro (VI-] l-1. Gt/

rn O Ut_oi o/ com h7 ~ u~CAJ;W ·

~cl C<l l .::t ~ I LI)J.-u i (_ ct_ {t,,u .
?Jo
{

.e n:~J <:)

5 U,hdC1,t
CJu~ UA_-1 s t{_;ff ~

evU t J -u,,.H '0--t

{Q m CU ~ .! -L«1 •VvJ ~ C-u Le,
:_u r 1
L
J
J.-LLt J
·
 r
Poo1{NIMA
I•' 0 lJ N-D A T I O N

(O ntl_w f) f~
(\)M.f ch 10 II
ft ➔ I/
Rr ct ) Px 4 ,~ 1I ( ,,;y,ro""iIP~
a :: Qf / ~ .Nt r e co ndj h~
w{ ~ )
• 1
)villCUV\.D~

)°f WiAllA oJ--t.W_J) of eiw.,0t-t"vvv ctv,, J e

t!)u 5UJJ
~ 0

~ -h· u.,U. J e.L:h ~ -

·t::=--
 __
,,..

I
I • .•.~ • ....._ '
l ••-•':••.'• J

PooRNIM A
;poon.NIMA.i
l "1IU'l',l; l\'f.\f.l\'lt1ll~\' ~
1-- --- . .i

-
•'j· ')j
~ '. I
~

'
i :_: , I•

COLLEGE OF ENGINEERING
DETAILED LECTURE NOTES l'Mi f: NO .......... .

Of~j Sr~-~ w0re.J',;1 o/}'--,Y) ;,t~ 1

~~ Ii~ "'Y c_~tk)·cvn 1 Tp-.,vl JJW

~J___ ~ tf ~ . ~ i~ /IA. {__,_ ~ W'1/ tM1

,: ~ ~ ·
0 H ~M £H ~~-·<W) uvv--i"(Y'\~ ~~
. . A ~ 1½~ 0°1~0'-n..,,.i §~ ~ Sjy,-,-,
~·· ·. . · !
(j . 'J.t µ \H ~ ~ ~ }Lu u-±v r:rvJ_ I

✓~~
• d) ~ .
I . @ ~ r,M¥ (s)
' @ f~~~
(J) -it~ ~'
crf~'j 7 ~ [/) ~Lf ~ [9l1Htfe>r1 {
rk4
DI

~ ~ lf<l1J_ (frn ~->o;

Jy ~ )fa w-v ~ ~ ~ ~ 71-e__

(!) s. }-1) 0. ~ v l , _ ~ ~ tL ~ eu-.W ~
~ VWC-1'o,.y
. n.-Ll. '" ,
.r - ,,-..."YL<._ PA:l tL R_ ~~ ~
~
 ·o oRNIM i '
LECTURE NOTE S
111 11 11 ' :
.. PC..£·.... . ( 1111 1,1' .. JJ>_ '. Je. .l/L.< ( L1~, i\l'rtio11 :. IJ .111
1111r 11\ l· :1nll1, · ..,.~ rf1 ..0t. . ., k .O.JYJ .(JJ.fJ . \: 11lll' 1d \11 lij r< I:.. . .... . . ..
1:1\ 1
.. < 1Jtll
' ( l'ri•p. ): ...... .... ......

- --
...... ...... . l) :111· ( I l\'\ . \: ...... ...... ...... ......
l 11il ~11. / I r1 p1 l : ... JJ1:... ........... Lt'l I '\ 11 · .•.

OB.I FCT \\ ' F : I 1) be \\I 11\('\1 bch1rc

J I
1., \, 111 ~ lhl' kc\\l l l In \\I Il l' 111 bul let
I

,, ti\ k t,iu~ht 1n 1hi, lcrturl') 110111!-, tit ,· 111<1111 l11p 1 ' •.I, I

]) l cuzlJ ock _Q~ aJt Cl l't.' (W ! on . 0

LO~ ;t~ fVl _ S CY\l dl J ~ 1 _:('YI O).,{:t _;t cl}-{ m_

___
(/ . . .-g--'!C clu
---' dAU}l.+- -™ ~!IA .±m JY1 sc~ ~
l 1\'lPORTANT & RELEVANT QUEST
ION S:

.<;l,oJ-tt uote
'Dea c/Ln us C,~ C<b CA I try
" 0
W-1 vv\
Ao1ru S ch1 d M LID , Sb r,··;t f .t ½ Vv1 ,

OUT COM E OF T H E DELIVERED

LECTUR E: To be written after taking the
students' feedback on thi s lectur e, level of lectur e (Pl. write in bullet point s about
under stand ing of this lectur e by st udent s etc.)

REF ERENCES : Text/Ref. Book with

Page No. and relevant Intern et Websites:
 ' -
Opernting System - Process Scheduling

\ OPERATING SYSTEM . PROCESS SCHEDULING

Definition
sPlection of
~'he process scheduling is t~1e activity _of the process manager that hnntlles the removal of the runnin g process from the CPU and th e
,mother process on tl,e basis of a p;nl1cular strnter~v.
lo be loaded
:roccss scheduling is an essentiai part of a Multir,:1>gramming uperuling systems. Such operating systems allow more than one procc~s
mto the executable memory at a time and the loaded !)l'OCl!S ~ shnres the CPU usi ng lime multi plex ini.;.

Proces.~ S~heduling Queues

()[ all
The OS maintains d i PCB.sin Process Scheduling Queues. The OS maintains a se1;;uate queue for each of f1e process states and PCBs
its current
processes ii~ the same execution state are pkced in the same queue ..When the stat<J of a process is changed, its PCB is unlinked from
queue ,qnd moved to its new state que11e.
The Operating Sys tem maintains the following important prot:ess scheduling queues -
• Job queue-· This queue kel'ps all the processes in the system.

• Ready q u ~ ~ e keeps a s,it of all processes re~g in main memory, ready and waiting to execute. A new pror.e.ss
is alwa:,·s put
in this queue.

• De\1ic,~ queues - Tht'. processe:.: which are block-!d due to unavailabili!v of an J/ O device constitute this q11e1,;c.

) 1•· ¥1'' ',-.. U t,,,"~• "t-- '\"•°t •·,.i•"f ~~- ;c~'of..' "I:'!' 'f' """' i 1 <(.•'f.f~ ' ;'
i
I
I
I
; I
i 1·
t
J,:,l;Queue
""~· Se~ci,j~:.z~ue . r··-·
f-··-•··•- i,{
••·,,'v•,
bit

~~=c..:..~J [.,.~L:.·~:it~~~I

Th,; OS can use different policies to manage each queue F IPO , RmmdRubin, Pi·iurity, etc .. Th~ch~~"!,0fr ,kt~rrnines
__hov. to nic-ve pro,:-cs:;l'''
merg('d w11 ii
bctw~u1 th~ ready ;:r!d nm ~~~ll_~ whi\;b~n 9.n)yJrnw.o_n_e_~l!!Q'. Per pr,oce..~s?r c<_n:~ p_n the syster:1; 1:1 th ~ aliow d1ai;rarn , 1t b " beer,
the CPU.

Two-State Proce.•;s Model

T-.l'o-:; tate process n:,idel refers to runr.:ng and mm-running states which are descrilied below -

State & Description

S.N.

Runni ng

When a new process is creatGd, it enters into the system as in the runnin g :; late.

Noi:Runuin g

Proces~~s that ,tre not running Jl't- kept in queu e, wailing for 1heir turn t·o ei;ecule. fa, ch enl1 y in the riue11e is a poiata to ,, particul.ir
process. Queue is implemented liy using linked list. UsP. of dispatcher is as follows. Wht!ll a pr xess is i11l.r1Tt1plt-t!, lhal :·Jl'ocess is
1

transferred in the wa iting queni:!. If the process has completed or aborted, t!1e process is disrardetl. III C'. ith er case, the dispatcher then
selects a process frcm the queue to execute.

Schedulers

·J/ i

, ,-..c- · //v,r,,./\AI 11 ,t n ri;il'-~nnint ,--nrn /r:.ni-hir1/nrintn::>t1, .1 r.n i

 .. ., ., ...." "'
,- , , '"
-
~~ -·

I_ J .
I<!
' . ~ ~
.\:51
-
-
~ ~~~"'
n . ·-~
-
~ ,.-.-.,.-. . i
jr ,
C.OLLEGE
NEI~]tlr~J OF ENGI
DETAILED -
LECTURE NOTES
Ca m p u s: .. ..
...... .. ...... C o u rs
N a m e o f fa e : ........ .. .. ..
c u \t y : ... .... . . Class/S ec ti
.......... ........ o n : ..... .. ......
.... ... ... .. ... . ... .. ..... .... .....
N am e of S u b je ..
ct : ...... ........ ...... D a te : .. ....
... .........
........ .. ......... .
Code : ........
........ .......... .
C
---vu\\,_-/ -1~
~
~-½ \\
, ~ l{1 <J 1~
---i:U w o-c L k1 ~~k~
~ TI W~~\
---cu. u
/.~ l!Lk9 4 _IP,~ ( -1,ip /
c~ ----~ ~Q\QY)
<J:j i-56 'i',,1\-~
-
-{Url-
~\-1'- U
") t~
l,~ w_ ia 1 g t ~
_s ~--i~, . ~ 1)~h,,
( ,'-z. u h i '6-) -f ~1 ' \ j~~
~WI
( l f 4, -1 .'1 , i ( 5
~_,/' ?J ht it\~
l 1 ~ci ~ \ \ 8
-zuw i-s- ~~l 1i~
lL{W { l 9 '\ i ·l ~~
o{-5 ~W( ~tq~\ ~
1hl~
(\.
v f _l 1 i
- i l f w s-~'°
-4 ~
cJ,( H { ~l~~ y \Lc\ ~ ~~
-i. ~1l i-06 ~~, l ~\l~i
❖
o'- ~
\;·':I
_,~~-. .s ~""' '4 _ I 1'N
'\❖'' - ~~'"' ('\ ~ /) v~ l q ~ ~rl) ~
~~).~":) 4 11',/, \.l .. '-f_;,
U1 \ t
.L- ~
'- r
Page No.:
----
,,.__
 Operating System - Process Scheduling

~
6l '~- task is to select the jobs to be submitted i11to
process schedu li ng in various ways. 111eir main
.,chr~du·i~rs are specia l system software which handle
1 .e. ~yste1!1 and to decide which process to nm. Schedulers arc of three types -

• Long-Term Schcd ulor

• Short-Term Sd1edn ler
• Mcdi11m-Tt·rn• ~:cheduler

Lon:; Term Sche dule r

ses
ed to the sy~.tern for procr.!;si~ It selects proce~
scheduler del~rmi nes which ro ra111s arc admitt
,it. is also calleJ aj oh sch cclu)cr. A long-term or (,' scl ,echrfi ng.
ion. 1-roccs s ioa s into t JP. mtmory
trom the queue anct loads them into 1i1emory Jor execut
and processor boun d,. lt also contro ls tlic de ree.
provide a balanced mix of iobs. sue\, as I O bohnd
The prim,i ry objective of the iob sch,·duler is to s creatio n must be equal to t e average epartrn
e
amn11ng ts stab le, t 1cn the aven,gr ra c of proces
cifn1ulnprogramming. !f the degree oi mul t1progr
rate of processes te:Ni11g the system .· a
ing systems have no long term schedu ler. When
not be available or minimal. Time-s haring operat
On som<! s:,•stems, t 1e long-term schedul~r ma of long-term schedu er.
there is use
process changes thr stn te trom new to ready, t 1en

Shor t Term Sche dule r

with the chosen set of criteria . It is the
ve is to increas es ste1 P.Crformance in ,:cco"dance
It is also called as CPU s chedu ler. Its main objel:ti s among the proc~s ses tha t ~re ready tc, execute a'nd allocates
s. u sc 1eduler selects a proces
change ofr,~ady state to runni ngJitl.U;: of the proces
~ Crt) to one of them.
. Short-term schedu lers are faster than lon~-
• ~o rt-term schedulers, also known as dispatchers,
term schedu lers. '\
make the: decision of which prnr.ts s to execut e next
·

MNlium Term Sche duler

s the degree of r:rnltiprogrammin,:. I he
It remov es the processes from the memo ry. It reduce
~fodiu m-term schcdul i~H! is a >art of swapp ing. . · -
medium-tf!rm s~n,xlu k:: ;s 1H:h.~ ,·5e ot air iingTh
1 ,! siv.t::ped ouf-pr~CbkS
t make any'progre s ... r < :, 1 eti . In this
;naki!s an 1/ 0 reL1ues t. A suspended prucc,: se:. canno
./_~ ,unni ng p•·occss ma) ::oeco111 e si:s1w.-:decl i!' it processes, the :;1s end ,,. cess ;~ n~oveu o the secondar; storage. Th is
:u,n make space for other
conc.1t10r:. ' .:> :;e:nove tJi,: i,roce:;s Iron· memory out. Swapp ing may be ncces·s a1y t (I 1mp;·ovt, ,i,e process mix.
said to be swapped out or rnlled
procc~s is,.-:::~,: swappini;, ar1 d the pr,'cess is

Me dium -'fr ,·:,'! S.:hcJul er

Short-Tern~ Sch.:duler
I ,. n~~-'fe rm SdwtJ ul,·1

It is a CPU ~chcdL1.lcr It is a process swap ping sci1ed11ler.

ll i~ a job srhc<1 uhr
1
Speed is fastest among other two Speed i'.: in belw~en b1ith ~,ur'. ~,11,i !on:" terr.:
'-;peed i~le:;ser thafl .'h:J rt term s<.:hed nler st· (·:cd 1.d,,r.

It prnvid es lesser .:c11trol over degree: It :·cJ11ces th e clegn·e of,.111.tl ti progw!!,m;•,g.

It contro ls the degree nf nll!ltipru~m;n minl.'.
,Jf nn1ltiprogrmnn1jng

It is also minim al in ti me shariu g It is a part of Ti me she1 ring .;y,km s.

4 It is almost absent or mini ma l in time
system
sharing system
It can re-int rod uce Lb i.! pr0 -.,·~s in to ,nemorv
and
It selects thos1) processes which ar~
5 It selects proc<.;sses fro m ;)ool and loads them execution r.an be comi'nue,.\.
ready to execute
into meJl"!O t')' fo r ex,·cut ion

Cont ext Switch

Cc,ntrol block so that a process ,':-;,'e11tion ~an b1;
restore the state or co ntext of :i CPU in Process le processes to sh;ire a single C?U. Context
A contex t switch is the mechanism to store and a contex t switch er enable s multip
this technique,
resum ed from the sam~ poi nt al a hhe, tim e. Usmg -· _____ _
features. \ , ___ ____
s"'~' .~ ss~nti.~~J~'. .~~~-~ ~ l_t~~ski~E ~~er;;t ~n! system
the current runnin g process i:; str,r . tl 111 to tile
ing one process to execut e another, the state from
When the scheduler switches the CPU from execut fro m its own PCB and used to set the PC. registers, etc. /\t that pc>i nt,
process to run next is loaded
process control block. After th is, tl1e state fo r the
ihe second process can start executing.

i- hin/nri n tn ~ r,p rr, i

b :tn c:.· //lfil\A/W t 11tAr i.::lk11nint r:r, m /r:n
 Operating System • Process Scheduling

CPU
I

I
I
J
t

I'
l'
,!.
i;av<'. tl ,::1(: re!;ic:·ed. Tc: ..voici t ·1e a·,1;,;;unt of context
1
Cont~:t s,•:i'.::hes ue l'Omput:;tJm;:,l1y i,:lem,M! :;im:e re~ste , and memory state mus··. ;>e is switched, t~,;; foi!...:,,:r: g ir.i'ormation is
:~g.i;;:t1: ·s. '.'Vhe:; r'.1e process
switching tin:c, sc,mc !·.ardware s~1sttm ~ ~n,;iloy two or more set~ uf proc.~sc!'
st;,:-ed 1.:,r late~ use.

l'r, ,grnm (\; u11wr

• Sched•.iling information
• Ba~e ~,nd limit register value
• Curreutly u:;cd rci;i:;tcr
Chan:;ed Stai e

t~ • I/ O State information
• Accounting informaticn
~ Opsrr.11:,g System Scheduling algorith11 1s

' 1
7r~~\
>
~
r
·,-t1 ps .;
1
""''1
OPERATING SYSTEM SCHEDULING ALGORITHMS
lull11 rn l'l]>om1,,,,11, ·,,111•ratin1· " ' 'l 'lllot>'
11 ,.,,.,,, ,, 1r,.,J ,,J,nr, .,J~n, ithm• hll•,

A Process Sched_uler sch~dulcs dif:erent processes to be assigned to the CPU based on particu lar schedu ling algorithms. There arc six popular
process scheduhng nl!\onth ms which we are going to discuss in this rhaptr r -
• First-Come, First-Se,ved FCFS Schrd nling
• Shortcst-.Tob-Next SJ N Schednli n~
Priority Schedulin g
• Shortest Remaining Time
• Rmmd RobinRR Schr tiuling
Multiple-Lev!'! Qnc:ncs Schedu ling

These algorithms are either non-preemptive or 1>1·eemplhe. Non-preerr,1,!ive algorithm ~are designed so that once a proress ~nters the ru nning
state, it cannot be pre~mpted un til it completes its allotted time, whereas lhe preemptive scllecl uling is based 011 priority where a scheclu ler m~y
preempt a low priority runn ing µrocess anytime when a high ptiority process enters into a ready state.

First Come Firs t Serve FCFS

• Jobs are e.xecuted un firs t come, first serve basis.
• It is a non-preemptive, pre-emptive scheduliug algorithm.
Easy to undt•t-st~nd nnd implement.
• Its imple,nentation is base,\ on FIFO queue.
Poor in nc:,-formance as average w2it tim e is hir,11.

5 a
5
i s 8
I_

, - - -~~r-... . __· --•·••··.i- -.-u

_
" _ _ _ !_____ _ 11:J
__-_ _ _.

PO Pl P2
............ . .

(; s
I
3

Wait time of each prote5s is ;:is folbws -

Pr·ocess W11it Time: Service Time - Arl"ival Time

P/J (I - 0 ·= ()

s . I '-' ·I
f'2 H- ~ = 6

P3 16 - 3 " 13

Average Wait Time: 0 + 4 I- 6 +- 1:l / 4 = 5-75

Shortest Joh Next SJ N

• This is ab c knowr, as sho1·test job firs t, or SJ F

• This is :1 i1on -;1reempti vt , pre-emplive scheduling algorithm .

• Best approach to minimize waiting time.

h ttn..: ·//v,H ~" "' 11 it n ri~ k nnin t r f .YJ/rni - hin/nrintn ~ n ,:, rni
 Operating System Scheduling algorithms

Easy to implement in Batch systems where requi red CPU time is known in adva nce.

• Impossible to implement in internctive systems where requirrd CPU timr is not known .

• The processer should know in advance how much time process will takr.

Proce~ AtrlvalTlrtte Execute Time Service Time

PO 0 5 3
Pl 1 3 0
P2 2 8 16
8
P3
-
3
'--
6
-· - --

0 8 16 22

)vait time of each proces~ is as follows -

ProccSs Wait Time: Service Time• Arrival Time

Po :J - 0 =3

P1 0-0 :: 0

P2 16-2 = 14

P3

Ave:·agr Wait Time: 3 ,. 0 +- 14 + 5 / 4 = 5.50

Pr,ority Based Scheduling

Priority scheduling is a non-preemptive algorithm and one of the most cornmo_n scheduling algorithms in batch syste ns.

• Each process is assigned a priority. Process with highest priority is to be executed first and so on.

Processes with same priority are executed on first come first served basis.

~ • Priority can be decided based on memory requirements, time requirements or any other resource requirement.

PrO!le$S Arrival Jime I

PO 0 5 9
r'l f,

P2 2 14
P3 3 6 0
-·-

PO P2

0
I
14 22

Wait time of each process is as fol lows -

Process Wait Time : Se1·vice Time - An-ival Time

h tt ,·,c:·//v.MJ\AJ t1 rtnri~: •:.nni nf r.nm /rni-hin/nrin1n.::.n ,::i, r·ni

 Operating System Scheduling algonthms

Po
9- O = 9
P1
6- I = 5
P2
14 - 2 = 12

o - o ., 0

Average Wait Time: 9 + 5 + 12 + 0 / 4 = 6_5

Shortest Remaining Time

• Shortest remaining time SRT is the preemptive version of the SJN algorithm.

• The processor is allocated to the job closest to completion but it can be preempted by a newer ready job with shorter time to co1npletion.
• Impossible to implement in· int~roctive systems where required CPU time is not b 1own.

• It is often used in batcll environments where short jobs need to give preference.

Round Robin Scheduling

• Round Robin is the preemptive process scheduling algorithm.

-_ • Each process is provided a fix time to execute, it is called a quantu~.

·'I
• Once a process is e.xecuted for a given time period, it is preempted and other process executes for a given time period.
• Coutext switching is used to save states of preempted processes.

(1 ::antum "'3

f1(l P1

I !
I I I_

6 17 20 22
iJ 3

Wait time of each process is as follows -

Wait Time : Service Time - Arrival Time

Process
0- 0 -t 12- 3 "'9
Po
3-1=2
.t Pl
6 ·- 2 + 14 - 9 + 20 - 17 " l:.!
P2
9 - 3+17 - 12=11

Average Wait Time: 9 + 2' 12 -f- 11 / 4 = 8.5

Multiple-Leve] Queues Scheduling . . .· t' lgorithms to grnuµ and sched ule jobs with
. I 'th They make use of othe1 cx1s ing a .
•d d t scheduhng a gon m.
Multiple-level que~es_ are not an 111 epen en
mmon charactenstics. . .
co 'th common charactensllcs.
- • · d for processes WI
• Multiple queues are mamtame
• Each queue can have its own schedulii:ig algorithms.

• Priorities are assigned to each queue. II 1/0-boundjobs in another queue. The Proce,s Scheduler tlien alternately
I CPU-bound jobs can be scheduled inhon~i~e:aes:~~~ the algorithm assigned to the queue.
For examp e, h queue and assigns them tot e
selects jobs from eac
 OEGO RENNGIINEM A
COLL E ERING
OF
DETAILED LECTURE NOTES
Class/Section·................................... Date· . ........................... .
Campus: .................. Course: .................... . ...........................
Name of Faculty:.....................................
Name of SubJ'ect· ............................... Code·

n·~r ~ .foo- ~U1c) ;h h F fc f1

~ Ju-¼~i v;J-· ~· . ~ ,e__ t,f v .

~r { o'1 v-t,., ~ « .

fi __, . ~ . P·1 ') r~

· ·~ i T""? ·. ·· h :...-) - ~ tN .

t f1 I h-- ]
!1
§J
.
a I
.t1 1-S
(j ·~

~~~ 1 ,tin r-r1 ---,·t) r

.
. f1- "7 t ~
p\ -J ' ~11""-3
f"-1 --:} ~\ p~

tovo-• w-e-.,' 11· 7 Ji M ~ (0 t (tl H Lu=:- :1) 2 J" ,15

f}r,._, T'\.v{l\ ~- .,J , ;¼ fl"{ '"I LJ }"':l,

U '.:- (&-t) '1 +-.a It½'". hI I~ ')~

,,
·· .
;
Page No .:
 o·
0

_J

r J ~1
f1 P:11L PJ );c ~ 2
(a-¥}' ~t ,j )irt,:J l~r1J ~: ) ;l~Jt10 Ji'M
-t vv4 bu AM 6-f- v--~ J1 ~ t, ,---q :q ~ h) ~
2

s-
~ l dt L1HJ t l )1..-,--'L) +L1 - '3) t{g ~s) ))r
~ 1'1}s 2-- 6~1-M
 "'( ~ ,P., l •~"\>T"I

A
if\f;
J•OOH.N.li\lfl\1,';

r~·
RENNG·IINM
'W!Jt•'

O
J\ \ll~ l {

O
ll (

·f_
r: .

CO LLEGE EERING OF
DETAILED LECTURE NO TES
.... Date: ........................... .
.................... Class/Section: ..............................
Campus: .............. .... Course: ............ Code: .......................... .
................... Name of Subject : ..................
Name of Faculty : ..................

-r1'1"'{_ ::: ~, ~ ~ ,t j~
&1) · T~
" lM,l XM ~ (v v } s eSJ;
i
?- c~H)) -t Ltr -o) tl I g.-LJ i-
l Rr'.:l) .

T ( \'L.,,.. j J -==- s-(IJ~ 2 11 , 2 r0 .

. ~ .tfrv-{ '.: - . .~~ .V-f-'~•f<hf .tr~
,
~
z_ br L M

/i ~~ ~-, _rcJ-e ~'1 l M1fi~~ ~ j

I~ Lu- .c k :b,VV'-l °I. ~ ~ '-1 ~ -. .
I .
~~ '.] -,, 4.
I f1~ 6 ~ ; f~ ,.-- g ~ J f']- ,f-rwJ ,

I O '1 . I._ Il I~ ~I J,
~ ~1i~ ~ ·M
I
fil ~ t J .~ v--z t7 fJ 1~ 2- ~ t_. .

I 6 ~- fl--k-rJ j-Jb}-:~ ~ J1
Page No .:
.
T filir T ::-- fJw 7 T [,, tr} ~ t.,-J,j'o,, Jtr-i ;j
~ f-r0l!,vt.
rn 0)
I 01 ~ P.. ~s t Cb-1 <2t rtJJ
 F

..r -,,;,
,, .s~~:i:~.)·<~~if,: •.J~
pOiJllNTh1A~
foi,Jlf·' '-?r:rx~1,,1:1rrm:u_1

I
1"·,
.;.:~

'
OORNIMA
-·~- COLLEGE ENGINEERING
. . '
.
.;,7
:t. .~·
.,

,·
OF
DETAILED LECTURE NOTES
Campus: .................. Course: .................... Class/Section: .................................. Date: ........................... .
Name of Faculty: ..................................... Name of Subject: .............................. Code: ...........................

.. -- - - - ··- -·- ---·- - - · - --

[-- -~~---~
lo ) ._, ,--¼

fTvJ f -=- Ccit C IO 2-) 1+1)

~
Pr r T~ h ~ 7 ,_, 7-
~ , -1,) + loJ:r - r::) ':}-r1 ) j 6, CJ
(o Jr-7' '.2- l D H--rl '-J ) ) () ___ ~ ,] 1 ~ (_
·-::::. / ~ ~ -1
Page No. :
r
.
~11Jv') fi N ~ '~ 1 Jrrt
"""

r, Jo

'1-- J - ~-
- -- -
'

~ lo
J

A_
~
l --
' ~

/j-v-J7 -::= ll CJ-j- ½) T o f I '1) / ,J--;::. 6 ~

A ~1, PvT ~ 6-t ~ /'J ~ b t £, 6~ :: l 2 , 6-;- ~
la /Pc 1 -== (_(j -+ 0
-f !YJ /J '2- ½ 61-- r.,--k_c
1
 j
f2L )

1
1

P1 pl- f2
~

P2 f1
- -

)
e) l. ) . I ~ · g l?-
)~~ / .~ C:fAJ N.j' 11 .b { ~~ ~
r fN u
th ~
LtA1 v-t-J:,ci
~ ~ \ , {NW!
t¼ Lf 1) kljl J- J:jM .
i~Lv
~~ j-f~J •-f:-,G 7.,/Y'( ~ r~ ~ ·W,j

f 1 huvj. Cf r-,/~·,u~ ~ tfJ /l'rvl~~

f}/'; {2 J/1 Cf u ~},,- ~ S l"'fJJ.,~ €._~ -< 1 Y"'-1~~
~/Y p ~ I I) "vi f;,-{_iJ./ ~ ~ JU,
~ f2 /KJlAk t l ~ ~ ~ t-~6
~"WA r~ j\ 'hf.¼ ] ~ "J.L,;,, (~' (',y,f __J.J,A)·;',>n

~ CL4 /J ~ ~ ;_ d Jl,,',,i L 0,,£-, Jg~ iJt_

 n·E'f AILED LECTURE NOTES

1•
I
II

I
I I

® i (g- 1)

I -+ ~ ~, J
•I
I
cJ-2-
 S~1(

~ r t -£4 /tM~ fb.h} ~ r

"

~ l
8 0 0 1 ))--
(
1 ) C r-
f3 1 1,
Jr )J 1-fo
s J
s 2 Io
~ ~ ,)' \~ ~
-----
[ fir"j_r _. --r'-~w,IJ~ f ~J ~ Jl:,,,-fJ- J
\_
0 ) ~,
~ ~~j ~~\ul~] t
~ r t ,:
(_ H )
T l 1 r~~)
+ \'~~ 1 ) )

~-=-- £x;
W ( lu,.,- ~ tr\"'{ :;;
; I1- i l r-- 1) t l ~ ~ 2-J
+ C10-JJ .
'1 7_ lJ
\
 > -

OORNIMA
COLLEGE OF ENGINEERING
DETAILED LECTURE NOTES
PAGE NO . ..........

~ )lQLp..A tu. . cJ V .· . "'-.A .... - - oJA ~- Q_rt, .

0 CUn;i , ~ 1 ;tu .~ iJ /21 ti,v-Ji"'--1
~~ - .. ,

.---:) FM '7--) 0 ~ ~mi )0 iV'-1 ti riLl

--:l ffY1 --i,,, U1/YVf r . ocC,,u-rl

I -------1 {M '1-/o )/) ~

Rr FUM ~~
 . ~;
•. Vt ,
,. ' '
~ fV1✓ j t~ ~ ~ ~
.

{µ~ &,l) .k
,--muM ft-w-1-bj~ ~ ;VrrJ-10 ~ ~ Cf1J _
JJ.-t-H. ~ fa 1,,-e_ F µ, )--OU, aJ- tt ~ //4~
Rs qVL ~ ,l;) q ~ ls>. ~ ~ 1--t-J ev_J_
ou7
~ -}_µ r'l.lM,,U ~ ('.g,,,~ . , ~ ~ Jj~
qV'UfaV f r Ji~,,_,, ~

}?Yeo.±
7-f o ql/W-,(_:::;) ~ tk ~ ),j ~ ) rr~
J-) o ~l>YJ j_g ~ / ~ U- r ~ ·j)_
71 ° 1vt)lv't.
J\)~ q~ ~ Pr ~ ~ ) ~ 1'}!,rn
f'/ w J11rr Jd~ ~ v_._ rut
9~' fj I

fn:«-H ~~ ~ I

--> g(M~ i,,i ~ ~ -j 1'1 ~ ~ ·~ I~

~(__ 1:t1-e )~ 1~~ ·
----) ~ id
~ J~
_:,
,--} ~0wW~
v r~.
~r1W ~
r r~
---:i

--J lct-C ~VJ 1vf'~ °"