0% found this document useful (0 votes)
53 views20 pages

AL Topics For Data Structures Using C++ (Total 5 Topics)

Graph Traversal: Explore nodes and edges of graphs, useful for pathfinding, network analysis, and search algorithms (BFS, DFS). Sorting Algorithms: Organize data efficiently (QuickSort, MergeSort, HeapSort) for improved search times and structured output. Tree Structures: Manage hierarchical relationships (Binary Search Trees, Heaps) for efficient searching, sorting, and priority management.

Uploaded by

Rudra Meher
Copyright
© © 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)
53 views20 pages

AL Topics For Data Structures Using C++ (Total 5 Topics)

Graph Traversal: Explore nodes and edges of graphs, useful for pathfinding, network analysis, and search algorithms (BFS, DFS). Sorting Algorithms: Organize data efficiently (QuickSort, MergeSort, HeapSort) for improved search times and structured output. Tree Structures: Manage hierarchical relationships (Binary Search Trees, Heaps) for efficient searching, sorting, and priority management.

Uploaded by

Rudra Meher
Copyright
© © 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
[XY son Cpl Ree PA sey Aeadomie Year: 23.224, subject Name semenon 1. progam BLD. ranean BCE, DAL en “Applied and Action Learning (Learning by Doing and Discovery) Progra Foe Enea Geach Algorithm Name of the Experimer Material, Tools & Equipment Required (if any) SING. Tame Spediicaion [anh 1] A Computer. ok Lape Ct+ foe PROCEDURE 7 Puen on the Computer jr open tra Code edie OX {o€ - > rqate GHile wlthtne CrP - > Ghat Writing Code ‘ ee Exp 1 age No. Theor Lenoar Genet 7s debined Os & Bequenytia) Gear atone Gnd goo enough Lach plement ga ntl the qexinc] Qlangent ix bound - Da eI GERERE calgonitiony tat © hunts kes 1 eres trom the Lett mosh ntemont dfs ane CJ f one ty me Compare “Cx wit Lach element OF antlJ. 2 Oh medches With Gr alementy tetwey tre ander + 6- 2E co does nel match Wi Gry dE she cyement s , Prunt | “od boend” 4 dene ris Cinder’) + Souxet Code A incase ¢ fasteeom) lutea name cpace eke j fn main) fn Ge TS) s num, fee ink =05 105 het) g Cont CO Enter tlement” Cc int Ka"; Cin yy ane OI; Cond Ze had Aer lyr Laeklng Foe 2"5 Qin YS wn 5 int 4205 Ant Flag = 05 unt (45) 2 A (too 09 = = oun) § Couk Cfo at peti LE THs ce ends 10g 13 brat % its 3 selirg == 8) $ Cou eet Nod Found” Cc endl, rater D3 3 { Observations. Caleulations, Graph }——— Envere element (1) 1 eniex slemunt @)! 2 aet Kbaaent 3) «3 Gatee “atvant (uy! 4 xen ttement (5) 15 rad Que you look font 1h Found at Poattian 4 Safety Precaution: Application & Inference: ee Sper eeseceseeeeeeeeeae + Sins ee reece eee ees J ASSESSMENT er Od | Ro 4 Rubee ‘avis | Waa Raed] Rats) om | signature ofthe Suto Gajst Kaman Pak tov a Kuma, Pe] wo “ RQOEY|OOOa] sehoot: Level. a Gpplred, Campus nnn EBL Onge 23-24. sunjec name: Dabethuchett Ing fe code CUT MR bea, ‘Academie Year: Semestir Program, ~ Branch: B49. PECL nna ‘Applied and Action Learning (Learning by Dongand Discovery} Name ofthe Experiment: Binary Search Higore thay Exp 2 Material, Tools & Equipment Required (if any) SNe. Nan Speciicaion [ny tH] a pe wrt luinqows | ext Uode eaten PIE PROCEDURE > opey che code editor on JOT © Ghat woiting ne Cede | => Compile muy te Code Page No saw crt dy fine} qiveg Clement fry having Ane Cures 3 then oe hal emring [aaguoye. h my Sewn, 5 Un dea Qrae ats by Cor tnaouer U Specibied elements Erm Q : rOUWK ye ” due Match ts found , a ae J comet Code |) gnctsede Ciostusonly \ Laing ramecpat stl y 1 gnt-main C) cos BR int Gu te {oo (wid, Fad 70, | (i = 03 igrvy tt) | e | cout ¢ | can >s owe D5 tore qt eer Oo puanpere (S04) ia cout < wewer & umbert by Gere "5 Qty yy treo 3 idle Catval <= jor) wid = frst lat) fas ae (ucln'a ec then) § cour LEV Elemet Found" laaak 3 i \ aysete (Geet ? ten) if 3 [wt = mid! 5 8 else ginst ematd ty % Se inst los) 8 dour CO8 clement not brand ") outpad Enter A numnon (Lorted)! 9 Entec @ humber (worcteq) ' y Enuert Gnumberc Covered) a0 Enter dae humberc 4 earch 114 Element found . Servations. Calculations, Graph eens: Salculations, Graph } Safety Precaution: Application & Inference: ASSESSMENT Full Mark [Marks Obtained 10 Remarks 19 and Executions 10 schoor ‘Sewe] ented Geen Program: BC Date Academies B38. ste ame: DUSERUEMSS UMA CY sue coun CHTMIESR Branch: Applied and Action Learning (Learning by Doing and Discovery) Name ofthe Experiment: Prego 60 Guiles for Material, Tools & Equipment Required (if any) Name v [Pe ce Leete thy way [Whar o C++ abe I PROCEDURE 7 open fe Code edéfon. 9 Stat Wo reiterg Cede - Compile the Code - use] UO pue Pr: 9s a0" oo! eannargsaar "0 fi Teeny Bubble ont fe & Loret ng plement & Success then unt ke tisy Deedee - nat Comp aes foo Od jectae algort™) ane fn Te anton de \woxking aa aa pirat (rela , dompart The frak p dhe Lecond slement + i ib tm Firs element fe presto Aan te econ erent tren Swap then), 7 How, comparce che second % fia hired & Jemert Cu i Gee not An breeder « “4 aan 4 ~~ Me Gbove Proce qe $7 latil] fee fort clement. Source Code ! +E Include Cfoctreamy lating namespace Ch j an¢ main () 3 dgfonn CI= 94,415.23 3 dnd count sys Wl Count 5) $ foe (int imo 5 1¢m count 5 74H) ‘ [awe Ty aueltt 1) § ant qemp = renliyy Gen = ane [+15 | anclitl) < demp ! | 3 5 Count a + 5 4 ) Ton int F053 te i++) ) 3 [Cour ee aun DIKE Fy | 1) reeteren Os | 3 | re Output D123 45 Safety Precaution: Application & Inference: Sepik Rumen pat] Ho” QaOEI 4) DOO@) ASSESSMENT Rubrics _ Full Mark | Marks Obtained Remarks Concept 10 Planning and Execution? 70 Practical Simulation Programming Resull and Interpretation 70 _ Record of Applied and Ac Learning 10 0 __ _ 50 i= aaa a Student Sot Kumar patq School: Cocheon). a app Academie Year: .23: ce, soe CAMPUS: Gentution 224. subject Name: SE mine Od Date:.. : Applied and Action Learning Name of the Experiment: Pregram For Ingerction, Cont Dasher La) AE pject Code: = ce Progra: nn POK ee Branch x PD ow Specializations ~ (Learning by Doing and Discovery) by Doing and iscovery) _ ___Exp4 Material, Tools & Equipment Required (if any) 3 we] F leh es a Specification Qnty. u-| Crp Compiler vor Toe | [reassure 77 open due Code gdftor on toe. > Ghoct toni fing Cede - 5 Comite fee. tary tha Code + _ [DS GAITddv 10 TOP Creony - Work! s -civen ameey JaTsTi [4]5 Mae tes) element in tee ones YS anumed fo be Corcted feke te Second Hement chre He gepercetely an key. 1 compare fey BiH ne fivat element . AE te et slement ts gresiers ey) cy 1 then key fs plated 1 Front sh tue Feat ay EGEREI te Now tne Fin AO element AS Goes Take te Phir Llement rand epeat fue Same proces - EEE T J fv simijantyy place every unsorted element as ibs Connect posit - v- Fina) rele (Tet [s]4] L— Somef Bacay. slement * AE include ( fostucca > ain momecpace C4 ; ‘nt main 3 int ae Cy = 84.51/49 $ fon Cinp fo, teg 5 Ett) SE a temp = ane C7); RE | 5 au) > degp ) Gen [J 43] = ane 3 J--3 5 auc [47] ster: 5 Fon (int t=O 3 igs y (+t) 5 ' (out ee ae "5 3 rect 0 4 —[Obsenations, Calculations, Graph }——__ — j out pot _ | 134949 Safety Precaution: Application & Inference: ASSESSMENT Rubrics Full Mark [Marks Obtained Concept 10 | Planning and Execution? rr Practical Simulation! Programming sult and inierpretation 1) (Applied and Acton Learning | __10_ | _ 10 [To “sof Siynature Schoo: Selo apa ~tagy@——— Year: 23-24 sen a] stone Paste tay HI eomaes De eR lA. gpa Spevaliaton a Applied and Action Learning 7 = _(tearningty Doingant ics Name of the Experiment: 4 Material, Tools & Equipment Required (if any) [SiNe[ lame 7 Spaiation ie | & computer po Fr be nota ec aaan I-| c+4 de i | PROCEDURE ) open ctre Cede edifor on IDE Exp 5 | 7 short gelding te Code -) Compile B buy tee Cede nclede Cfostreeemy ing namespace Sh; ct Node ; int data 5 Ghuach Note ae Prev 5 Sieact Node # pect 3 43 Oheuet Node & head dati = new deta ; ned node 4 Poy = null; ned node > nex} = Null; } | ped node next= head 5 & (head | = Null’) 3 | head > prev = nedhede 5 13 a | vor displey } 4 | ghruect node * Pht Phe = head ; | wile (Pin [= Null ) 8 tout LC piers cata cee "5 Pre = Pie —> ect 3 int mein ¢) Ingerch (3) ! Insects (1p! imgert (7) ! feet @) | aimserch (4) Cout CC" THe deubly Abprg O35 tofu) 05 5 len ted lat fo" += Tad) pos Observations. Calculations, Graph | | | Observations. Calculations, Graph | © owpete a i | Linke Lar 78! 24913 are doubly n

You might also like