From 3a700cfd1e55bb1f773f305046e05d77d8736894 Mon Sep 17 00:00:00 2001 From: Priyanka Musti Date: Fri, 5 Aug 2016 10:49:59 -0400 Subject: [PATCH] Priyanka Musti --- a.out | Bin 0 -> 8952 bytes assignment9 | 0 assignment9.txt | 10 ++++ linkedlist.c | 126 ++++++++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 136 insertions(+) create mode 100755 a.out create mode 100644 assignment9 create mode 100644 assignment9.txt create mode 100644 linkedlist.c diff --git a/a.out b/a.out new file mode 100755 index 0000000000000000000000000000000000000000..5395bb8999e7ae0ec4a8a97ee2af9032dd229875 GIT binary patch literal 8952 zcmdT}eQaCR6~DHVCT&_LEfhkF*0<7XDIz8*ZOPWLJ|}VOptKEb0&JswabhPiICf+| zm$Vy$DNxPI%8Ec!_Xkq7ZzTRGXhPMdHL1#)RbyJ124iAF*;ZIe#ufzY3=8#s=e~QM zpI_VwY1$vV)_dok-}$)be)`_~9u9Tx^m;sklUICBNUlpv9}p4AUDe7$sPVBP2@Y6_c*A7VTbPu}p=~ zBtUi)Yn@-RpuIA~R9A6?6=geO$*w`!H7Gl#(<(5gTtBKCJ>AM*w^s*8yiP>4%Xg8I zE~TzF%_!wRTO(OeU1pd@Em$yRySrdVaemxXrxf?8@~+k{^QwMK6)SE{#QU~wxit}O zOvIDf(ZW?66YPrAGI^vII99W`(i^R;+r43PZ!^W?R{j+53(OSH9>P#8EtCLayZ3V4*$ee@U6f#JnnQofO38W+NqzKWt$ku zni(;Yjwj6lF&s%GQvJd(NNi-xNZK@pBk`mdNXKG;2ZvKh1sh^lXGd$Bu{p3gK&5-t zk8;#T^uxHuLn*r^zLX^G7Ax|#y)wu1RKcRY&cdqzkUb~Ofvce_MGX#|`i)bQ1Lv_w zvK9yK9GBs-zgCCGD<7)SMEJ2uvvT$UD2K;htUhOXENo3fRM=?ZUAs<4j`$%GUYaQ& zZM>g&3i;BsI7piqJ`vVxhKTx|4je7bXRIDf5*aZ?E%lpH*HxI2nO|Gaq zD-TSNpfCgFN2UJ*=cpC~0p`z;yeItCzexvYulV2~oSP4yo!t@koDaWz#awNBt6^`o z>%@U`R{4+I@vUVVx_M;}3}=%F?7;cTqkuf`$&w~CEKuRG9U@yf_ay9WXYZ0hVfw(O zBe0=7dO{259-0l0hi1dMP=4+v@#3X+n`KTt0{_c;gLhY z4$m3d8*`*HLplp~OgV}T&y-$Gm9ufg`fC*wdM}UO`#D0f#@r^vGuNnU0_g&zd0SdT z(%OlQ_+PZtKm3=oRqL!FSP3nRvU!X9CsfpcoIgWL0d--Jx)3UeY5ojtDG0p93DUYn z;PpzcLpn-;bpUn4=2k@^F^paF9f%amC z$=Y8yS6o`;`V_n;cy};Y2=)ZKJCAJ)RA^Xijx`e9-;ulAk$a_c6V3eU@Y#=iv#AeJ z@MG_oTJ!6?K6U2a?#x|ohlj$ozYmX{^MpS=mwlTS=r0}!-WNO&JQy_29WNI89@cH? zPc7jd`L86z#^^FUS~L~QXvvhR#YW>9Q;R1xb10@IkQbC0h^K)PtHm=~B9b1ArA0Rc znOJ`+8P!tBSgGK!7D>mXk4$73YVjj6G(8d-m3qt2e{3v$i_|_8No1ufii`DCAzb{` z4d5LA(2L6Tto3d0g|iww-5(SR&w{=P`eo1`qiKHw>ch}`AG8hhTKsEW0Nnz5JNmgB z^p~I}=rMHiQ=m_wXMY4*fmM0|l=exKJV*8k&uE=z?eePXyUr5ME-;=zX<#; zwBuxn{3o`&0`2xL+!yj|$0}O=4PUPe`}|AAx>z?vtp<|K~KV&V8p8<+@N+DKTAc zv0|h`mpOIp675*1DcvC7bl&QfIX*sO2+6cY(RwAPaYu>e|F}{}5r4v~6S2>Hy*`WQ zJ>_Yy#apu)=O^e=qB%*a-XdbPqD<^PEVg5mxDQ7qSDbgWKc+1vnbo!iZVNOwHgCyFc5|S4lLcv;o0_*ZZE3#EZC%RyFxpzYdMOCbhu-Qgi~EFG z7O$|!k<*zEqv~{7{Uw6OS*d=NDAzwej9Tv3QvIc3rc8hO#4>vvmFm~n^QjbHE{>OJ zZ=YBp=F8%^tZ>a=^5+w^_WUgMUnjcMye-97+V>Bo_$qM{`!9F$iEHfn?v(kkTJk(E z#a9bDuDFv=T!;IXa`^T3dDdy;qgk%zaVdU-(97a$1RcNJ$tQS~DoSX6R)}{CMa0U{ z`scx_;*OuzJ+JVKCRh8DXTnEZctGLq^_KppJfavUuM_(vzPLS)C_mFK|3{_%;(qxa z@N)IKT793FepZRD6*_XoG>L4vb|8&%{$C;i#)*48`~j$^OuxUS^!a~8vUq(UGmFRP za#X-mW<0D1z6$M6r+Z4g-fxz;gi2oRz_k*@VxE`y;&Ih0{rJU>CAw6!-aV*3OL0F!X;Qw0cwgakeL_iX&qW0qyxjfRYtX5~IKS6b?hDEfuVcK&t%o1dcemRH z>EAEtzJ^j>zJ=HXTvK@`xkKqcton=Q38i-6)DCX{U03mQzw%RArAvFcr$z3HjDPWZ zKBDw9N?-1Aq5rVLFRS@0_uk~OKW%2r?7%>PZVT^h+h=rk?C&-V5sjr|gE%bhmBa$ zOdrNgBu-dHG&?+e7$y$RfTmfZiYwp;Vo^Fr$tZX33+@gXp*`&g(~6n%C6-ZPw10k2 zaCb)=v>Xz78wvfYT(t<@drOTXpLDA?%O3$188X=F38sIU&78FPPj*jXcL7Ij(dE~hV(QN_rMW8=<4#y&M7 z+7gjW2E!p5qi%;kRGIsO+JZ+;NlWx6Vv)2RM`tWKXbxE|&`HO25y%`KHY0tYX4;}d zoWqrNEIlFuIOxX$!PbsOGcu^S!DKejmyP2)K|Cq~#0^CfGizLM94tpMiQn7$c70Z8yHN1HDjZA(-?+QN_Ji#Hl#-FP!vv>vrMhwYgusq z{(h*Tn8j{m>e`M|Jy|S0W1;r|4@rp2Uq+a#^)gk;zhd7 zbQ72=JXkhl;{7mxZ_*Ubgx786n~`za^S;?s4mYr(qHg4;GPkVK6xL;Sm4<%=Pd!xF$&sTQ?qca@a_xf~j0{eDJ>~o;SEpESq z5YQQn?Rj5+O4(xvEfdGjdQ2aHl+JX_Ppa}KmAz(}%WsFy_!TT@zea7!_A| zl9D6w_bH}NLFTmQbIiQ5=XlwLn}6D6&-(OfjtBV9azq7sy zi&^oEvgiKe{ZW^)pR+Zsj6444T=x8Zm%sZ)UH0zsCtUV?9y>{s3W@FzoylGP1qf-3 ztKnjw+xR=MTi?yU0^3@LJ@4o1)x>e@yZJxDmO|w6`5dKvOnW*P(AZ^rJ}>fj`e{{v z9^YI(kAoAg^7%Vyo+^dJ`W9E@8UH&3&iL)~rz${aLq*w+Y2Ibe`*dB|bDZpk?U=uU z3}IY<-mi8kL$|(a4mKA)0E9K!h?QacTU|KYGhGQem+e&Dq!tc3hdGmrm1XnXaq2yy h;@9ZU35mYLQ!HE`TFWTW{47`gNp(?|b2)dH|8EQKw|xKr literal 0 HcmV?d00001 diff --git a/assignment9 b/assignment9 new file mode 100644 index 0000000..e69de29 diff --git a/assignment9.txt b/assignment9.txt new file mode 100644 index 0000000..5e9ccf5 --- /dev/null +++ b/assignment9.txt @@ -0,0 +1,10 @@ +Priyanka Musti +1. +malloc() takes 1 argument and its stored in bytes. calloc() takes 2 argument: array size and element counts. +2. +You can find the size of allocated memory by using realloc to set the size of the array + +3. +You can free memory on the heap but not on the stack because the heap is static but the heap is dynamically allocated. You cannot change how much memory you are using on the stack but in te heap you can. +4. +You need a pointer allocated to memory on success or NULL on failure. diff --git a/linkedlist.c b/linkedlist.c new file mode 100644 index 0000000..aeb0204 --- /dev/null +++ b/linkedlist.c @@ -0,0 +1,126 @@ +#include +#include + +typedef struct node +{ + int data; + struct node *next; +}node; + +void printList(node*head) +{ + node *temp=head; + while(temp->next !=NULL) + { + printf("%d\n", temp-> data); + temp=temp->next; + } +} +node* add(node *head, int data) +{ + node *temp=(node *)malloc(sizeof(node)); + temp-> data=data; + temp -> next=head; + head=temp; + return head; +} +void delete(node *ptr, int data) +{ + while(ptr->next !=NULL && (ptr->next)->data!=data) + { + ptr=ptr->next; + } + if(ptr->next==NULL) + { + printf("%d does not exist in the list", data); + return; + } + node *temp=ptr->next; + ptr->next=temp->next; + free(temp); +} +void clear(node *ptr) +{ + while(ptr->next!= NULL) + { + node *temp=ptr->next; + ptr->next=temp->next; + free(temp); + } + node *temp=ptr->next; + ptr->next=temp->next; + free (temp); +} +int smallestLength(node *list_1, node *list_2) +{ + int counter_L1=0; + int counter_L2=0; + + while(list_1->next !=NULL) + { + list_1=list_1->next; + counter_L1++; + } + while(list_2->next!=NULL) + + { + list_2=list_2->next; + counter_L2++; + } + if (counter_L1>counter_L2) + { + printf("the first list is larger\n"); + return counter_L1; + } + else if(counter_L2>counter_L1) + { + printf("The second one is larger\n"); + return counter_L2; + } + else printf("They are the same size\n"); +} +void smallestSum(node *list1, node*list2) +{ + int list1size=0; + int list2size=0; + + while(list1->next !=NULL) + { + list1size+=list1->data; + list1=list1->next; + } + while(list2->next=NULL) + { + list2size+=list2->data; + list2=list2->next; + } + if(list2size>list1size) + { + printf("The first list is smaller, the value is %d\n", list1size); + } + else if(list1size>list2size) + { + printf("The second list is smaller, the value is %d\n", list2size); + } + else printf("Thetare the same size"); +} +int main () +{ + struct node *head=(struct node*)malloc(sizeof(struct node)); + struct node *headTwo=(struct node*) malloc(sizeof(struct node)); + + head=add(head, 4); + head=add(head,5); + head=add(head,6); + head=add(head,5); + headTwo=add(headTwo,40); + headTwo=add(headTwo,40); + delete(head,5); + printList(headTwo); + printList(head); + smallestLength(head,headTwo); + smallestSum(head,headTwo); + return 0; +} + +