0% found this document useful (0 votes)
18 views35 pages

DS Record

VTU 3rd sem DS 1-6 lab programs
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)
18 views35 pages

DS Record

VTU 3rd sem DS 1-6 lab programs
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
You are on page 1/ 35
Outputs Enter the name oF dayt : Monday. Enter the date of dag: falo4. Enter the activity for days 2 donce Enter the name oF dayo : Tuesday. Enter +the data Of dayos ialalo4 Enter the pains for clay oe oting tng Enter the name Of day ss Mednadaty Erter the date oF dk 3B: iqlalou Enter the activity for day 3s doting, Enter the name oF deya 1 thursday Enter the data of day 4: oolalog Enter the activity for day 4 coriting Enter the name Of days: row Enter -Hu date of day > #91 falas Enter the actively Pr day 5 egiee ping. ; DO MM vyyyy 10g ILLICIT FT| Develop 2 program fn_¢ for the following declare calend ver as. on array of + elements to represent Adayp of weel- wrtte Function createc)s read ¢), +d feplayc), 10 create calendor. +t fnclude 2 stdfo. h> at fnelude 2 stdifb.h> dt fnclude < stringehr etruct doy ; char * names fntdates char -« actiuPty: 3 stuctd ay xcreatec ) Street day calendar = Cstruct dayx) realloc (+ size of Cetrct day))s ?f Coalendar == NULL) : oan cn Memory allocotion failed \n”)s exitc)s 3 return calendors j Enter: the name of days 1 (feterday Enter the date of day 6: oolalo4 Enter the activity fer day 6+ cot ing. Erker +he name oF dauy #2 fundoy. Enter the date of day t: oalalo4 Enter the actiurty fer day 4? peo Weeks actluity details report Monday + (¢ ¢dance “Toesday » 18 # singing Wednesday, (a! outing “Thursday 100 : wortting Fifday. ai # fleeping Gaterday 3 02% eoting: fenday 303% phone. yyyvy Cnicncerry void read Cetwat doy calendar) £ char boffer CIoels; ‘for Cit Prog Peas Pr4) f spriott Cs Enter the name of day "dz 7, Pei )g — nf Ce fos"? , buffer)s colendar Ci. name=Cohar®) malloc Cc6trlen choffer +1) efze of Cchar))s Pf Ccolendar c?1. name = NULL) £ prot fC Memory allocatfon fa Pled \n??)3 “exott Ci)s 4 strepy €coalendar CII. name, boffer)s printf C* Enter the date of day Sod 2%, ft1)5 seanf Ceed, + calendar £?J+date); -printt 0 Erter the achiutty of day edz”, fei)s scanf (51, bufter)s calendar LF]. activity = Cehar x) malloc Cstrlen Cbuffer) +1) *s?ze of(char))s tt Ccalendar citactivity == NULL) f cprintfels Memory allocation atled \n%)y v 5 strepy Ceolkndar ct7. activity, buffer) + 3 y vofd display Cstwct day * calendar) -print¢ Cs eoeeks activPty detatls repor#\n")s printf ("------\n"s fer Cint feos te#s f+) £ pantt Ct h6,¢hd + eh 5 \n2?, golender CiI.na : calendar Cij.dates calendar ltd, actwity)s 4 3 Prt ma?nc) £ Gtret day x calendar = create crs tend Cealendar)$ dfs play Ccalendar)s free Cealendan)s refurn 0% DOMMyyyy COLO try fn © for the following operations on Develop a prmqram stings > a: Read a main_ string Cstp).a potlern etn: Replace sting (REP). be perform Pattern Matching Operation: -Find ! + Replace all Securrences vf PATIn STR awith REP Pf PAT extets fn stp. Report suttable messages {n case PAT dow not existin stp, Gupport the program cotfh -fonetions for each of the above operations. Don't use Built-in functons. q CPAT)4a at include NULL) * pant Ct the pattern dow not exist ta fhe main Gtring. An?) 4 7 Ourpots o Enter the mafn diring Goganache' MV Enter the pottern sting? go Enter the replace ctring! goqe The new otring after replacernent 9r4q" qanashr? Mm v ail a a ae DO MM Yyvy PM cocery 19 Ovrpur: et STAck OPERATIONS °.Pop Ss. Display 4-Prele 5. check Palind mre 6. Demonstrate overflow 4. Dernontrate underflor 8. Exit En ter your chofce 0 Gtack under flocs 6 TAcE OPERATIONS v 1. Pus 2. Pop 3. Display 4. Pek =. check Paltndrom ¢ 6- Demonrtyte ove rflore 4. Demometrate underflore é. EXIT Enter youn chofee 4 pda deen ent 40 be pushed into Hu atick 20 DO MM v¥vy CL) “ CHtack oF Integers. “Develop a _memu driven program 9n_C for the followin gope -rations on srack of integers Cfrrag, Implementation g Stack ewith mascfmum size MAX) Posh an Element on to Stock+ Pop an Blement from 6tack+ Demonstrate how stack can be used to check Paltadrome “Demonstrate overflow + under flow situation on stack. display the status of stack Focit. tt Include 2 stdfo.h> +e Pnclude < &td|?behb> 4h include 2 stdboolbhz se define MAX4 bool ~nstk Full Cfot Hs bool_finstk Empty Cint)s vord fn Push Cintca, int. fot) tn + fn Pop CPntcisint*)s vod fn Display Cintc r,tnts int fn Pek € tntcI»inhs bool -fnchk Polindrome Cint)s Prt maine) £ intstk Array (MAXI: er 21 Stack OPERATIONS a-Push 2. Pop 3. Display 4- Pek s. check Pal?ndrome ( 6.\Demonrtrate overflory: -\Dernonstrate onderflor S. EXIT Enter your choice 3 Stack ‘contents are? 44 33 20 we Glock hor 4 elements STACK OPERATIONS 3. Push a+ Pop 3. Dfepl 4. Peck 5. check Palindrome 6. Demnomtrate overflon. 22 ts : inne eel ag oo MM i inteb? =-1¢ Oooo Fs fot PeElem, fchofces t— tor C33) _— 2 eee prot C8 \n STACK OPERATION 5\n77)3 ee pratt CM = seteeerescrss 9 pg pantt Cs \n Ie Push\n2. Popin z. Disploy|n4> Peck \n = 5. check Polindrome\n 6. Demonstarte Quer flow\n a 4- Demonstarte CL Under flowin 8. EXIT\n "ds . printt Center qour chofce \n 7)s scanf (* efed 975 Pchofee )s switch Cichofee) caeel! Pf Cifnstk Pull Ctop)) £ printf C#\n enter clement tobe pushed onto the stack \n?s scan (iad %y 4 PE lem)? +n Push (stk preay »tElems j top)? j elee i a a. Demomtade ynderf lor Qa. EXIT Ender your chofee 9 “Popped clement Ge 44 print? Cn stack Over flown )s break; caseos If Ci Fostk Empty Ctop)) felem = -frPop Castle Arrays44op): print{ Ci \n Popped Element ta “bd \n"?41 Elemn)s y | else t { eprintf C<\n Stack Underflon\n"?)s 3 breaks case at tf Ctnstk Empty ctop)) f print? Cn Stack Empty|n')s ; else £ fr Display Cotk Array, top); breaks cas4t tt Ci fh stk Empty ctop)) f 25 DD MM yvyyyy | L Elem = Fn Peek Cott Arroy stop): printt Cin Elementat the top _of the stock Ps %d\n”, PElem)s 4 else printf C* \n Empty Stack \n")¢ breaks cases: paott Cs \n Enter number to be checked-pro ‘Ppalfndrome:??)¢, scanf C* cfd, $fElem)s it Cfo chk Palindome CfElem)) ae Coin ted fsa palindromei\n’?, PElem): 3 else f ’ "5 7Elerm)s printf Ce \n hd ks nota palindromeln + 7Elerm)e j breaks cases: tt CLfn stk full Chop) print éce In There ane currently thd elements Pn stock In Push */d elemnts for Stack tv overflows top+l, Max Ctoptl) )s j 27 while C1 Fy Stk full Ctop)) rite C*"\n_Eoler an elernents 9) + sea nt CO ada, flelem): rn Push C€ ste Array st Elem, +4 top)s 4 paott C\n Stack Over floc cannot posh elements onto the Gtack In”): breakg caset: ft Ci fnetk Empty Ctop)) sprintf C"\n There are currently ‘hd elements fr Stack \n Pop out ed elernnts for stack to Under flow”. top+4,topta)s cohile 1 fa stk Empty Ctop)) ?Elem zfnPo p(stk Farry » 4 top): pratt Cn Popped Element fs ehdin!} Peder) 3 pratt (“10 tack Underflow cannot Pop elements from the Stack \n”)? breales cased: extt0r) $ - default: printf C0 nrong chofeen Je d t t 5 J 29 (OD MM ¥ vy LICLICLIII Mint) pedurn Cot=2 MAX-1)9 “hue 1 felac)s q bool fa stk Empty Cini +) reforn (Ct ==-1)2 tue: falee)s y votd fn Push Cint Stk, int tElems int *t) K¢s%*bt4+12 otk [#4] te lems j int {nPop Cot stkcr,fnt*t) jot telems felern = stk (XLT: return PElerns 4 votd fn Display Cint stk 07 brett) £ e inti; - — wee Do MM vv¥yy printt Cn stack Contents ares in for Ctsts Pris 4) f£ pant Crt d\n, StH ETI) 4 pratt fs stack hay hd elements 1077, 441)3 j Pant fo Peck Cint stkc7, Pott) 77)3 return Stk CeJs 4 bool -¢nchk Pal’ndrome CintPVald int pal stk Crore fot t2-ls iDigs Rev = 03 fat Pcopy=tvals while Cfeopy! =o) L P Org = copy % 105 forg =I 1ld=1 -fr Push Cpalstks? pias ft); PCcopyt=los 4 rat pra 33 — = — DO MM yy yy mit C1 TI while Cp 2=t) Lf Dic y= palstt: ¢ 73 PRev= fRev¥ jo +f0Ig 4 pits "t CfRev ==? Val) return tes elec refurn fa Ises 35 e a es Sa Develop a pro a co — : pregram in Cfor Convert; : + . verting an 2é: ae to ostfiz Bx ression. P. = 2 le ape a nthesteed wp en Should eu port C iho theslecel 4 free parenthesized czpresston cor operer FS3 to~9 By /y (Remainder) ,*Cporses) ¢ alphanumerte operands, st Include < stdfo.h> +t Pnclude 2 ctype+hr include 2 Stditb» hz Hf include 2 string sh st define STk- SIZE lo void ‘£nPush Ceharci, int* ,char)s char “fn Pop Coharl te int# )s Int fn Precd Cchar)s3 fnt maine) f int? f=O$ ch od ackzepr [50], ac&tack (60 ,ac Postls0bcSy fnt top ocly =mb;7 -printt (In Enter avaltd fn fiz ezopression [nts scant (# ef 6", ac Fepr)s {nosh (a eStock +} top» tH"): “fer Cf=03 acBuprltyi! ='\0's 4H) £ 37 cA — emery It fnclude « stdiPbeh> db Include zsting-h> +t include 2 math-ho Ft Include vold towers Cint, char, char, chor): . fat maine) tatnums print ¢ CO Eater the womb er of disks :*)s scant (fed. 4 iom)4 t prot t Ce Tthe Sequence of moves fhvolved fn the “Tower of Hanofares\n "3 -fowers Cnum 1A, 80,6 B)s pantt C\n 3 retorn 03 = fowers Cint noms char topeqs chor auxpeq) ft Cnom==!) en +# C\n Move disk 1 for Peg shorty Peg fc, fromPeq + topeq)s returns oe Cnom-l1 frompeq + auzpegs topeqiy 51 —~ Qutput : Enter the number of désksro -the Sequence of move Go volved fn Hu love, ap hanoi aus move dik i fom fae +0 peqe move dtsko from pegA +0 peg ce: move dfsk! rom! page +0 age DoM ener) y al printf (* \n Move dfok hd from peg the togeg the, mums frompeg «topeq)s ‘towers Cnum-t+ auxpeg stopeqs fompeq)s 53

You might also like