DArE RANKA

PAOE

ssiqnmen
Name Gau V Tondye
class SE-A
RollNo 64

Explain he Tole programminq lanqua qes

in diiterent Sectors lanquaqe

)writability
Proq ralmming anguaqe must
easy way prDuide
the Conventions notations to
oLoTite
stte C proqram SO that pruo ram
be wsitten easily Can
uth out Con certratinga
on dnquaqe dettils .

2) Read ability
Proq ram must be
eadabe and
understandable tD altuthose who are
goinq throuqh that proqr

3 Simplicity
anquaae Should be Simple so th at t
allowsthe implementation of dlqosrthm
easi Simplc Can be achieved by
minimizinq he features of Idnquaqe
 RANKA
OATE

PAGE

44) SecUnb should provid e the Se

Lanqudqe
nop und uthoized Uset
sO that
feature proqrdm dd ta
Can ac cess the stalements om
features ke qoto
Pointcr vaviable cauSes theuntracable
heUntraro
errors n proqram

5) Robustre3 should be bug

The lanquaqe
U
that it Cann handle errom recO very

overflouw exeepions, in valid

data
input qiveg messae Cosreapondin

the unexpected event oCCUed obile

he execution of proqem.

Demonstrate the uorkina OF Von-Neuman

architecture

Von-neumann lardhitecture s based om

micro- proqrdmmed ome cohich Suppott
branching and conditional exeuion
is he oasis frem for im pe rdtive
proqrammi nq Amperatve longuage
amplyqive aktrasbhon Of 10sructtons in
Stndard VOn-Neumann machines. Th ese
indude assiqnment state mernt Cond tiona
and brandhen staem ent
 RANKA.
DATE

PAGE

The keq elements of Von Neumann

arch itceture ae inshru Cbions are
fetched rom memo t one at
time and in orderthe processor
deo de and execule Cn mgtruom
befbre Cycling around to fetth the
nextinshruchion
The Cqdle Continue until no more
inshucions are aveulable
A pmcegsor bcL eod on Von Newmannn
has ve speuaul reaisters
Proqram Counter CPt)
Memon addrs re er CMAR
Memo dclaareonster (MOR)
CuTrentinsrudtion reister CCTR)
Accumulator CAce
ALU CArthernahc loge unit)
holdu he databenq procegs ed and
I
fhe rejulB o Cal ulationg

Ahemauhie Loqie nit

Compsol
Reiste unit

ppue

Mmor
3 list and explainhe different
ntbindina
in pDgrammind
(On quoqe9 b
Bindinq mes
The binding df a proqrdam element
Specifhc chaacteristcs oT ope ty 13he
cnoice o
of the property from d setset oe
possible properties The time duaing
dUbina
prqto
Orq anizatton rocessinq when this Choice
is made is defined dS the
The bin din
bin dino
of hat popevty

pes of Bindinq Times

here are two types of oinding time
1 exeution on Time Run-Time
Some bindinqs are implemented
e urinq proq ram exeuio0 These contain
bindinq of vaialdes to her value
and The bindinq Ot vai able to
SpeifiG 3tDeiqe Crsea he Propery
of
Ot runtime bTndinqs Ye
a on entru tD a 9ubpro qtoa m
blo cle
an 30me dnquaqeg
bindinqs T
imited t a ppeo only at he bme
 -RANKA
DATE

PAGE

of entru to C sub proqram or olock

b) tarbitary points durinq enecuti on
3ome bindinqs cancppear at any
point olurinq the exeution
proqrarm
An exctmple sthne basic
bindinq of
vctables td values through assiqmment
whereas Some anguaqeg Such a LISP
Smailtdlk and ML qlloo
the bindinoa
of namegto storaqe loCations to als
Cppea atOsbitatsy pointt m prpramn
rpram
i)Translation time (COmpile -time)
There are three different tupes of
transtion time bindings are follotos
a) imdinqs hdve been chosen by proqrammem
In wrttnq C proqram the proq rammer
în
Conciougly pod uce sDme descslons
descisior
Concernina choices of vamable nameg
tupe r variableg, proqram statement
str uturos ekehut dlescnbe bmdings
dlunnq transt aHOn
b) indinqs chosen by franslator
Some bindinqs
Onquaqe toandator
o
withouta
the
che selectcd by
direct
proqrammer necuiremenE
 RANKA
DATE
PAGE

c) Bindings Chogern bythe load er

ApDqram cherdlly includeg
muliple subproqrams hat Bhould
Cormbined into single Cxecutable
proq ram. he tranelator eneralt
binds vaidbles to ddrog8eos
coth in he 3hordqeho for
eachn Subproqrem

4) what is meant byproqrammino

para dliqm what are type

Proqram ming pardcliqmR S fundame

sht3hyle of COmputerpoqramminq
Paradiq rms diter inConceps and
gb stractions used epreent the
element ctPoqram

four nmain rooranmming Pardelhqhmg cre

dre:
1Procedurdl Trnperati
funtioncu
11) Loqic
iv)abtect oriented

mperative proqram minq paradlioqm

t15 baseo on Commánds tha
Upd ateVaidoles
in storace
 RANKA
DATE

PAGE

is proqrdmminq paradiqrn that

descri bes COm putction in erm of
Stcltcments thdu chanqe proqram dae
defines sequencesOCom for the
Computen pertorm

1)funchoncuprocammina
.1 treats Computation a3 the evalution
of mathermacolfuntions and avoida
Statecnd mutae data
emphasitesthe upplicaton of fune
nComtTaust t impereuhve 2yle

oqie rocra mminq

Fis he use of mathematical loqic
for Computer pooramminq.
The Problemsoluinqtask is split
split
between he Yoamamme Cand
heorem-pover.

v)obieu onenteo pavadliqm

Obe onented programmimq Coo) is
aredighmthau ugeg
a procramming
obe"-doa sruureg Consishha of
dolel elds an ol methods toqether ith
her înterdehons-toolejan pplicatons
and Co mpuke pYoToms
5 explain
functio nal PYoeTemmino panodi
11 Loqic and . ule besed p
pavediom

R funchional proqremming o
functiondd poqra mminq 1s
abote pressions al
It treats Computation CS the
evaluation
of mathematcal fund
anoavoidsstete and mutable da
emphasitethe the application oP
functions in Contrau tothe
imperdive proq
rammine
functions ae uged obiccts
funubond proqrdmminq DSab eut
fP n
absradtion reduunq Complexity
Example
spam pork
numberS 23 ,
ham,
5J
spceg

det eaqs Citem)retum item

map (ol funchon, aseq uence

LEmap (eq9S, spam)

print L
 DATE
RANKAA

PAGE N
) loqic poq
tammin patadqm 2
Coqic proardmming
s O proqbamming
Paradliqm
on formaul logíe
whi ch s Laraely baged
Any proqva m Co1ttCn in a lgic
programmina lanq uaqe is a set of
senteces LOqcalf m, expra9sr
facs amd ules otbou 2Dme
problem domaun
tis he use of mathematical
(oqic for Computem paamm
in
1 Rule -based
Doammina
A rule based Prooramn Pabadigm
s elescnibed as mal
plor basis
biologioachemical and
phy sieo Computations
In thas Paredigm he coaputerions
CYo inerproted csthe o u me
nsina ou of intenaton of
eements in an obie Spacee