0% found this document useful (0 votes)
7 views4 pagesAssignment 01
The document outlines various data structures and their operations, including arrays, linked lists, stacks, queues, trees, graphs, and hash tables. It describes common operations such as adding, deleting, traversing, and searching elements within these structures. Additionally, it touches on algorithm performance evaluation in terms of time and space complexity.
Uploaded by
Ashish KumarCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
7 views4 pagesAssignment 01
The document outlines various data structures and their operations, including arrays, linked lists, stacks, queues, trees, graphs, and hash tables. It describes common operations such as adding, deleting, traversing, and searching elements within these structures. Additionally, it touches on algorithm performance evaluation in terms of time and space complexity.
Uploaded by
Ashish KumarCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 4
omnes Asiiish Kemer
Branch? GSES / -
Raire > 2300520100817 [Assignment os]
O.). Explain dilewnt opeurors 10 be Werkovewed 0” dots atruchwet
PE Daly ghudwe are fointationst bo compuler
Obert Mek can be performed’ On Them is crucial
foo different dale structure.
sei ere and Undershrdiny (ne veriovd
Following are. (re Some common Opershiore
Arrays
A Loseron> (\Ading an dlement ab a specific: Indew
¥
Deletion +» — Removing an element of 2 specifiy Vndea
*Traversy1y Accessing ech element a) the arvaq Sequennally,
© Seovehs Finding the loeahion of a shecifre element.
Linked Uist
ae Ty .
sevhon 4 Adding @ node ak Phe beginning send sor a specife position
* Deleon =
cr ‘ Removing & nade fiom (he beginnig 1 end) or a specify posibo> «
#Traversol4 .
as Aecesving ach node in Secjuence «
+ Search 4 Final
'™§ a rede conbinigg Adpev'fie value
Sbeks
* fush-s Adding am dement fo Yhe fap q the Ske -
4
fop + Removing Ihe bop element g He Shek.
© Peek ’
i fee Micwirrg the top element without removing V
SEmpys Checking gf me Stoel is embry,
Queues’
Az Enguut? flddiny an element bv the rer a) Pre quee
* mw , Removing on element pom fre. pont gf Re quer.
k 3
Fro Ulewing tie front eltment wsiBrouk yemavins i
4 5 Ey) ;
py» Checking Y Me queve Is emply . Tees!
© Tryon > Adding 2 node at fhe thee:
% Deletion | Lemoving a nade from tne free - ag perder ft “oréus)
Eevee) S fearing node in a shroke rele (LQ UI
# Seth" Firdiag a node wits spesfie et:
Ke Add Verke. Adding a vrecken te Me graph
# Remove er eo Lenoung a verlor fom ne graph -
Wi AddEdge > pdding on edge between ho vero
veh
# Prmove Eclge fanatiy on edge enotere es
eg dephe-fiak / breadtr Se),
% Cioveesel® Perron verhees In a sheapie order C
Hash Gables
* Insevhan 3 Adding 3 Key-walue pair
# Deletion»
eget | ROMY a Mep-vslepaie
ee
k a © Finding Whe valet associated with a upeapie Mey.
-“ rodifpig the valut asroueted rt a Seetfic Mey ,
Hoobs
A Tnsedsis t Adding anclemect while mainkiinhy heap preperho-
# peleian * Pemovig the rao element
Pew Viewing Pre Wtf element without removing >
# WeABTY. Reonangiy elements fo mainkia fre heap Pepe? ,
QL), Wthstd> you mean by Phstact ata tybe§
Aes, An Absheast Dot Tope D7) fe a conecphal waded Pak clefrow tne, ehoviow” of dake Struct
without Seething 1M implenmentabion - Th facwes on, What opernKor ave. allowed 1 What Phere
ehevior Shad ber and (pow dats tankz rmoniflsted » Buk now how {Oe operbons dre coned
®). now
03). vo Performance. of an algorithm is evaluated?
floss The performance
ane af an algoninm i evatuskd uring fime comblerity and shove. conplonity
Tone compen
© complenity measures how Mhe enecubion me Werease with The size Of Unpvh whi
Shee comblenity measures how much memovy is used at Inpul sie griwt. NCA C brogums fo determine Whee a meta is Symmetr or hot?
9 Gee Cyrogvam fo cletermine whethee I malsk \S S4mmeincor nat 7
AF include cs telio-h>
A define SIZE // Defsve ene size af fe motives
fb maindy L
MWe mare Tyize] [sel =4
Cri),
Lacy,
aod
Int teSqmmernc 24%) 1) Assure tne mote (5 Symmetne
for (int iso y Cestee yerr)h
for (int j = 87 Sesrze 5 jad
Ub Cmbie CAO) fe more £5134
ISSqmmemse = 07
break,
y
Th CL rsSymmeb) break”,
1S Cissy mmerae 4
pre (The motrin is Jonette: Nn!)
Selsa .
brinif. (The marie (3 nok symmensc An);
yetuen0"y
y
$5), Valli 9 C hrogyam fe find Sum of tre Llemen’ above. and btbw the diagonal element 7, Se ypeludes Zshd 0h?
Hi defyes. SIZES 1 Peps fae 3126 Q) me mate
Jat in ¢
Wok mat (G1 2ETLS2ED og
Ct try,
hy 510
au 09)
4}
Wk SumMbuve 70+ SumBelow =9°
fre Cob iso) Ce SE) HH) L
BrCiobj-0% Jesne apae)d
Uh Cie jd
Sum Phot $= motrin Li} Htum elements abae diagonal
euch G Ctr K
petdon
