* o t my name iS

qoo mowing sir Imaàam

tNagavaju PaatpaIf.c m vom visayc.da
am Curentt pUCSulNa. BTech Final ear
Fmal

n Electronic and Co municaton engineeving

at RavGandi tunuexsit of noudle doqe andd

TEchnoloies ongole. Alonaith my Aeree,

Shave Cbmpleted Pthe ,
SeLdete lurees
es.9oesFed various pxojects in
on

m Colleoqe
which Tovided me o
qreat
decl of technical eosue
alenek oith the
impoxtante of woxting in a 4eam and
h e ualue o
client otofectio
m 6trenths ane am a hardcoorker,
Selt motuating erson
m Shex erm 9oal is*get i s b
a
in
xepuhed Cem pany and ong tern)
goo
is to achieve geod Position heve 2
Cam build mu
a\eexa n d
help ne
oo
a qui CR eamer cnd
believe
in \eamin xo m my pos misteEes
Cmd e pesie nes

That all about Yme

hon
 ors

basi C
ConePT S o 6oPs ce

nhe-xi tane
EntaPsulayo
P mor him
bsTsa(hiov

encapsulatton. efess to he bundlinq atributed

ean methodS inside c single class .
RKeventy oute cleses from occessing on Cchang
attbuTe S o tless This clso helps
metho dS o
to athieve ata hi di ng .

ol moY PhismaSimpl means nore hon one toy m

The same method o>r opexa br o obieltt) ¢nti Con

PerPovM Rfferent OperahoNS in differenE Scenarios

Abst roCtion
2shows essential attri buteS
Cna ndes un neessar informoti on rsm ht
outside. mdes the unheceesa &etai l from

The ulerS

Inheri onte + meanns acla4S tet inherits all

the method Qnd ProperHes rom Cnother ctese

the class beine inherited åtor arent clas.

from anstht Y clus child class

the clats inheriS

REDMI
Al QUA 10:4
OO
whot is Ptherm
rpose
htyh Ievel iner reted,9enereu)
Ptten is a

enexel- purpeO 6e
veqramming lanquoge. eing
build amo
a m o t anu
be used
, t con
geee applicoton th the right toolS/ (brarie s
obue cts modules threads
thon SpporS
automoHC memon
cepHon-honding, and
meuma qement whfeh helf in modellia Teal
ooId oblems on d builaing arplicaions to
Selue these roblems

fass represer ho opercttion în

2 Fewerd
ued for tne purpose o
Rtho ) TH is qenea
Code Chich may
RRing u empty blocrs oP
but has e o be writEh
aete dusing Yunaime

uteà To Te?xesen The nSFance oFthe

3 6e is
clots ith his e attrtbuhes
ou CUY aCce ss
methods ne
oluss in tHthon Ir bi nds
ana

the o t i butes tsi the 9en argumen S

is ConrutCtox metno d i Putho)

--irit- -?
and is cu tom aH C a l Called to allocete memo

then o neus biecF/in Stein ue is CTe erhe dA

-init- metho d agsociakd
casseS have

toithnem. + helfs in disHnguishinq ethodS

and cmYibutes a clasS Arom lo Cal ariables .
5) DeOrcuto v*s functions thout add
esse nttcly
pece in PHthon toithou
cun eisW fanCtiorM in etho)
funch oroli t kunCHon tsel
stuchure of h e
ohangih9he

nem e and
he d e c oTatoY-
ae sERTesented
The
bo ttom-P Reshion.
calleà in a
e Ct
tie s in t h e
beau the ecDators
The
to tne utput o
That besi des adding un Cionaltt
axqumentS e
the metto d they Con even ectept
n c o n itsei.
befoxe ssinq t to he

CheneKators
uncHons thect etun ean îtercble
Generato rs ae

iem$ one a Hme in sek manner,

coltec sn oP
us ed
to Cxeate 1teratorsS
Generotor S ane

Pferent cPProach. use f etaFeyuoor

xeturN C eerato obic
athe than eturY
 S
Ao stove on
Dado SucteE Dctho SAxLcttue

that it Con be (sed efEicient

cta So

menOY

APpicationg

Decision nmatinq
2) henetics
) moe PEo cesS I q

Block chotin
5) Nume ricou and 5Ba HsH eo amaySis

C Compiler oesia
Oatabase beea
Linea - in tnis ata ele ments
aanged sequenH al(o)
ineasu whexe each tlement S conected 4o h
euious oumd edt herest elements

nted lis, Seck 8ueue

E
Nn-linecr n tmis datoa elementS oxe not or
range d ineasly (or)
Sequential

Shock Stac S container

in cohich imgexti on ard
dele tion Con pe done rom
the one end thouo n as dhe

AoR of the BeLck. PolloDs

LTfO Princi ple
Con Bouns tTof eointe
opexakions-
1) push ) - 1ncex on elemen in Stac

2) p o c ) - to delete an elemer in sec

or not
empt
8)isEmphg)
ull o not

etuxnS the element cat he

5 feek () - qiuen eositio)
Ao tal no o
G) Count) Yetun element

() chemees the element at the aiven positie

Cheunge
-

disPlcy ( inrs all elements tn StaCk

ueue A Queue Can be defined cus an ordeed Rs
which enables insext ope vations 4o be Pexformed
at one end Colle d e a and delete OpeTattons
Ao be er foxmed at ansther end Culled PRoNT.

inciple - F I f

Enqueue
Cinsexon)

FvonE Rear
Deaueue

CDelehon)

rrcaiony

Breodty i i
-

Search elgor Rthm

) 6
Centres
Ins Coll
2) Call manaemen

operahinssenn anating inertuptS.

ineay eue
Operahtons

enauee addS element o he rea end

semoves on element eom ront end

2) de queue
) isEmptt re turns i The queue is empty

)Tear eLasAsae e queue is empt r ese flse)

euns tme eaYeemd element itheat semeingi
5 ront
seturnS the ftonr en elementwithou remoui n
YeturnS the stae o t h e aueue
 as he
Cotlecion o
Axvas ane Aefi ne &

SRmila pes of doto tems

Store d at ConHuouS
each daa etement
eeme on
nt on b
memoKY o cattens. in this
6 nomber,
nde
Xandomla attessed b usinq s

5 lo, 15,
20 ,25 5.
CNTa 53 =

oesations-
etemenrs o the array
rinr The oll
DTsa vexsal-
ad an elémevmt at apatH eula inde
2) inse stion
an elemenF rom a Pasticular index
delete
3Deleion
elemenF usin he iven inde
Seasch an
seorch the eteme value
oT b*
- pdate an element a a particelar index
5) updare

O-aYee
seeme n in conRgouS memon lbations,
arra Stores

accessing hem using a

single index Vatue

dabula aXr hat ncud es rouoS and eluTS

2b-axa s
ovqniied a s madrices)
and Store dota

33

2 24 36

2 3
sD-ar s a
atid dhat ha s otOS Columns and dt

depth-ix index
2nd
3d
ineed A tinted Rst is a ineax s tha nctudeS
series oP Connected nodeS. 1 deeined s he
nedeS h a are mdoma 6toed in the memor
A node in hted Rs contei ns too ats
ics s
n s addres s Part
aRointer fo the null,
Las node of the i s Contetns Tail

tu &oO ugoo 5o00

uaoo

APPlcatons
and qphs ace mplemenhe d
)StacE 8ueue bina tees
nemaemeent memo
2) ynamic
3) Pound robin sche duling o S.
perahon in ne m brocuse
Poxard nd baCt ward

s callection o an or dered
)sing -inbed t the

Set ep elemenrs.
tinted is S tomple p e oflinte8st
2) Doubl
Poinhe to the PeviouS
Conteuns a
in cohich O node

net node in he Seqe n e

as well aS the
Consisrs o hyee p a r s
A hode

hode data
LPoinher to the heat node in s e q u e n e and Ointer

4o he preVioug node
tecd

Pe
3) cry la sin3 ned in a crcular singy inte

tfs,he as node o the tist ConoinS poinher to

the Pixs node o the s t

circular \inted l i s
u) Doublu crtla lined list is moye Conple
P
dsin wh fch aho de Con teins fointerS previouS hode
circular
tin tedd
doubl tinte
Ahe ext hoàe.

doesnl E ContoiO NULL omy of he nodes. he log

o f T h e HYS node
ontcins the addresS
hode oRth e. ist
ofthe list. he gis node
ofthe isalSO Conteins th
in t eviou S POLne
adoveses of the lag no d e

Sxat
DATA DATA DATH
Pev

ymphotic anasis of an algortth

defineS the n-time petfomance as per ts
hothenai co boundatons, istmplotic. anass helpsug
articulate the best case (omeqa notelHon
-),avevaqecos
neta notatiovm, 9) and udors cos eBie oh Notaton,O)
pexfoxmande alorithmn.
. m p l eynenboHon
hashmap ha sh map uses an

hash table ota Si uctu Ye which altoco S actesS *o

conStant time (oC)) Complexi h f you hewe

ata n
Ane ke
 defined Cs a

oto stru Ctttse ss

Tee
nouon
5nouon cLS
cus mo àes
noàes
ties
Colle Ctton of obiects ot ent
o s inulate
Simtylate
o s e p v e s e n t
or

nted Hogehex
That are
a ve
S i u t tuYe cs
h i e r a r c h i c a l S t u t h e

is o
hie rarchy in muH Ple

elements in c ee cxe aranged

evelS.

vextHces
asroup o
Gaph Aaaph Can be defined
these vertice
verHces.
used to Connect, these
ConnecF
cand
and edges hat ae

Axee jwheie the

sheie
seen as a Cyctie te
Cctie
can be
h xelaionship amonq
r e l a k o n s h i p cmong
complex
maintain any
Vertce S
relaionship.
Telafon
penent child
aen
the tnstecd of havin
5Datobase daai bese is CAn oxganiaed ollecaBon o

data, Stoved Cand vetieved n he fom of dethe teber

a n d othe r foYm
Schemas vieuoS, VePox r

whRch is used to
pBmsDBM Ss The So tuave
dalci base
nanage h e

manoqement SEm
P-elatonca Dota ba je objects
RDBmS. in dalabase
is Stored
RDBms date
The daa m. collection
oP relate a
toable is a

elled tables A TOLDS

cC and
consists oP Columns
emrieS and

OL SAruchued ue La9 uge.

database
Telatonal
tne Sten das languge Por
monogement Systems.

L C o m mands d a t ebase,
b
Pom a
datoa
exttatts

)SELECT datetbase
-

daa in a

UPDATTE
updates tatavom d a t a base
2)
deletes dota base
DEtETE datea into a

3) insestS
he

Into-
4insevt

dataloodeC
Yeches aneud do bage
Caeare
6) a daBabase
6) Aiter dalabae - m o d i h e s

Creates a hew table.

ttible
4 )Creote
modifieS a table.
able
8) AlheY table
delete a .

a)Drop teble
an inde SCarch e
cneates

(o Ce oite inde
indek.
11) DroP ndex deletes an
 select dota Pro m a

)Select Stettement is uced

Se lect

databetse.

where- sed to te ecord sS

Select col, Col - - -

From oble-name
where emdihon

Setect cell, cDI

Tmtble-name enditon3--
Condition- and
uhe enditon I ond

OR
Selec coll,Col
Psom table- me
Cenditio1 oR orditon3---
where dion ok

)NOT
Seiect Cl, Col
ono oble-nom
here NOT nditon

Co RoER By his Feycor d hetesuliet

erder
astendinq
er
de scendin
Col,cola.
sEle c t
fxom tolole-name

e l t , telz
se OESC;
Oracr by
used to sert neud eord in a+sbt
NSERT INTO statement
(e1,(ol2, -
nsext NTO obe-name
values (uatuet, a t e ,

)NuLL a #ielà t h utL olue isaield sith no uslu

Stotemenf is sed +
modf e esting ecetds
URdote
+alble
update talble-name

coltvalu,
Cl= Val .
Set

wheve ondito
1Dete te Shel}eMe ne S CSed to delete exising secord S I0 teble

Delete Pfomn Actble-name

conditfon
twhere.

n)min - Ahe srmovllest vaue t n e seleced

u n ttio) *etuNn
he min t)
column

selech mino1-name

from able-noume

uhere Conditiorm

Uale ot the
netuvns the arq es
mAXC) fancHon
The
Colum n.
Selecteda
name)
Select mAx (column-
etble-name
FRO
twhexee condiion,

YoCD 5 tmau nartenes a

o
me no
13) Cot h ) ett S

Con di Hon.
Spectfted

Col umn-name)
COUmt
selec

Aable-name

Cuhere
CondiHon
Ualue o c
e tuNnS h e CAy@ae
MAVnU) unchio
numeiC Colum

S-elec AU (Colum) -naumme

rcable- n o m e
FYon
whe ye Conditon
q
funCHOY ehm the t6te
um o
15 6om)
n umevMC Cotumn,

Som Colum -ime)

Select

FXom able - name

wne ve condi tiom,

 EP-mede

Dotye Eini ion lomqee.ce

t)PPL
CS m memdS

1 creothe ouetpCu{C
elete obue Cfs tn abebQ

mo c y scthue o ne d

emoVe al e Coreds o m er eible

he Acta cHonany
Commem(
ead So mmeñste
YencUm e
eun obiec ei SHnin
me dc labase
6 ) Pename
mani pulalio nlanga
2) DmL
1DinseE

2 da .

3 delere

Deaa pntxo\

)DCL eqes
he a
Asey
atcess V
rOm h e user
ixeun bac pemi sSio
seà to
e voFe
Con h o

u)TC TKa Sm CHo

Co mmitS Kansaction

Com mit e\YOY oCCes

anS acHm in coe an
y ollbaCk S a
)Rol back
olth tY CtansacHon
sef a Sctuepoin
3 Save poinf