10 hevieo ohich o he loroing d to m

t hings to
(omple xttt of nolahiorn, What a

measue

(a)Desoie mting havid0Y of

of unc hon.
( Charocters of
onchion baud on grocoth of unhon.
) booned
dA11 of abouw
fo n numbeY 0 arrays Store d
Cwant aroange
80) 3ppo3
such hot all negabue valuoy be tor &
in an ayr
all hocihu Ones atter

Min m number of exchange aauired in te, coors

n-1

C) ntl

heh o oroblem Con't e dolua d

30) ed dontily
HetoOTSiDN
Using
a)Heo jactonal.

b)fabimoc
Sevnqth O string
oose
base Case
Case
broblem
with u
 u ) n t is tha torulá or ebinod Ceries 9

A) fo Fo-t n-

ace Compleaityo etunsi onten

wha s
Serneg
pY abio tabonace

Compexity
of deaursiy inpkhranteton
ation
nhabs he Space
nomber7
to nd in olanacci
Dterati tway

) HEOOTSYve
3) Dynamic progaming

Cemtertity xeusie of
) wlat s Space
Jaharacei nomber

O4)

Unita
ineas
orGnar Sevch ??
Seamch
s he ost Case
0)wat
4) O(1)

te Out juut otuis ode?

0What twbe
 i=o izam.lengh-1 i4)
Or (nt

fzary.levnglh j+t)
or(Tntj- i+1

Fam C). equals (arCj) &8 (3))

S.ou protn (arttu) ;

elemernt in the aray

aray
Print the obpkiante
maNimom auuney.
pit elrmant
Unioue
element 7om array
cofth
iniman sequerry
delement

o inear Searth Ahomm

what tue o& adontage
otenine moe Spa
orlar dearcling lgo
neotey ine Corperlhy Comparedb
COSy o ondorstand

d Not easy to Ympemerrt

 C for notafion
big O rolaton2
adentilythe ualue of
3
un+3n+n+1
n) n

a)3

c). 10

petermint th Omega
0Cercttons tor ba Pekaton

A)

on an
an algamth here
e Complenily C o'mdeboy c
0 C
is
a) polynomial
Eponeha
( Gonstant

() o

A
what is o
Eponeha
Store tecursi on
ccu5Sion
nted to
y p e OF Menory

Stach.

Detesmine the Spoxe Complexty which of he

ollooing aus UMd to measore in any 90rihm ?
0) Cheekig Mun Memory (onsomed mela

Cheeking Man menm0a Consomecd a

memoy
tonud by att hm
Prking auage
d) none

ave odding
tm Coryetly 1
ue
,

)Ddontiky e 100
One elemend to Sizeel or (7

big (h)
) b)
e Gatpaoach of biray Siorch
Determine

Dynamie orogtammng
b)brate torce opra.
vele and ConcuTe

0)Gtien arayCJ (27,20,99,8,99

-
Wis fey *19
what s Hu
o)

c)
 )
Hich is aster necr Search toith tevatsbon
tevabon
TecorSson

A) Dteration,

ime Coplerdty o Leraton

Dime Coplexwity 0 Hecurstion

Space Compeuily OF Rlerahon
Recursi on

Which s hoving min E max

U n i t - 3

Worst Ca of &kebon nt

birayy Search
best Case. =
Sinear Search, Ihlost Cas
Sor ting Ava Case.
Scareh

Visual Siruaon ahuu ACost of

SLopinga eting
Dnsert
Seleetion
 d)

eost kime ,ulhen all the

0)wlich Sorting algontm
nput aONAY
dontitial, ?
elennents of

k OnsrHon Svxt

min no of SuoanpsS
)hich sorf needs

nsertion Sort
nthch of fotbing
of
qood of hauing Hhe
Sorng aordhm s good
hich
Small aOLOy 1s d
oss nombev. (hat maans
array is
Soving algo best 9
.

rieh o t ollouoing is pod tor Sorbpq an onoy

less han 100 elements

A) Dnertfon
 rdicate cohic o-e
o Hue tolordina saHered o as

a Compa intormal ard envoment- inckpenderrt

clesceiphion a
Conpoterrogramming algoritum
Pecolo CocNe

rnolcale lhen e 0st Case occUTS in ne

Seageh ahuirthm ?
r ferns notin ne aray (o tem is he ast

elenent

drkr9rher polation is Varahon of cohich Seanh 9

Ar inaYy Seard.