Data Structure with C

Syllabus
3 Prof. A. Syed Mustafa (Ph.D)

Syllabus

7
Evaluation
•Grade Percentage
–FCD : 70% and above
–FC : 60% -69%
–SC : 35% -59%
–FL : less than 35%
•Syllabus Coverage Schedule
–1stIA Test : 30% [ Portion-first 2.5 Units ]
–2ndIA Test : 30% [ Portion-next 2.5 Units ]
–3rdIA Test : 40% [ Portion-Last 3 Units ]

8
Evaluation
•Assignments
–Total : 3
–Each Assignment to be submitted before the IA test
begins
•Attendance
–Class Participation: 85%
•You may get detained if you miss (more than) ¼of the whole classes
•Academic dishonesty (e.g. cheating, copying, late coming and etc.) will be taken seriously

9
Announcement
•Class Website
•The link for the CMS portal is:
–Intranet link: http:172.17.0.2moodle
–Internet link: http:61.8.153.222moodle
–http://gg.gg/hkbkis
•Class information such as lecture notes can be accessible through this website
•We will also use Moodle for online test

10
Announcement
•Programming Assignments
–We encourage to study and discuss together for doing programming assignments.
–However, you must do programming YOURSELF.
–You must not share any of source code with other students.
–Any kind of academic dishonesty will be viewed very seriously.

Unit -1
Basic concepts

Basic Concepts
Topics :
Pointers and Dynamic Memory Allocation
Algorithm Specification
Data Abstraction
Performance Analysis
Performance Measurement

Basic Concepts
Objectives
Understanding core concepts of memory management, performance analysis.
Applying the pointer concepts to actual programming
managing memory efficiently
Improve the performance.

Basic Concepts
Course Outcome:
Able to apply the pointer concepts to actual programming
Able to use memory efficiently
Able to increase the performance of the program.

Basic ConceptsSystem Life Cycle
•Large-Scaleprogramcontainsmanycomplexinteractingparts.
•Programsundergoadevelopmentprocesscalledthesystemlifecycle.
•Solidfoundationin
1.dataabstraction
2.algorithmspecification
3.performanceanalysisandmeasurement
providesnecessarymethodology.

5phasesofsystemlifecycle:
1.Requirements:Beginswithdefiningpurposeoftheproject. Whatinputs(needs),outputs(results)
2.Analysis:Breaktheproblemdownintomanageablepieces. bottom-upvs.top-down,divideandconquer
3.Design:dataobjectsandoperationscreationofabstractdatatypes,thespecificationofalgorithmsandalgorithmdesignstrategies,ignorecodingdetails.
4.Refinement&coding:chooserepresentationsforourdataobjectsandwritealgorithmsforeachoperationonthem.
weshouldwritethosealgorithmsthatareindependentofthedataobjectsfirst.

5.Verification:consistsofdevelopingcorrectnessproofsfortheprogram,testingtheprogramwithavarietyofinputdataandremovingerrors.
Correctnessproofs:proofsareverytime-consuminganddifficulttodevelopforlargeprojects.Schedulingconstraintspreventthedevelopmentofacompletesetofproofsforalargesystem.
Testing:beforeandduringthecodingphase.testingisusedatkeycheckpointsintheoverallprocesstodeterminewhetherobjectivesarebeingmet.
ErrorRemoval:systemtestswillindicateerroneouscode. Errorscanberemoveddependingonthedesign&codingdecisionsmadeearlier.

18
•ForanytypeTinCthereisacorrespondingtypepointer-to-T.
•Theactualvalueofapointertypeisanaddressofmemory.
–&theaddressoperator.
–*thedereferencing(orindirection)operator.
–Declaration
•inti,*ip;//iisanintegervariableandipisapointertoaninteger.
•ip=&i;
then&ireturnstheaddressofiandassignsitasthevalueofpi. Basic ConceptsPointers
Prof. A. Syed Mustafa (Ph.D)

19
Basic ConceptsPointers
•i=10or*ip=10;
Inbothcasestheinteger10isstoredasthevalueofi.
Insecondcase,the*infrontofthepointeripcausesittobedereferenced,
bywhichwemeanthatinsteadofstoring10intothepointer,10isstoredintothelocationpointedatbythepointerip.

20
Thesizeofapointercanbedifferentondifferentcomputers.
Thesizeofapointertoacharcanbelongerthanapointertoafloat.
TestforthenullpointerinC
if(ip==NULL)orif(ip==0)orif(!ip)

21
Thenullpointerpointstonoobjectorfunction.
Thenullpointerisrepresentedbytheintegeras0anincharacteras‘0’.TheASCIIvalueforNULLis0.
Thenullpointerisinterpretedasfalseinrelationalexpressions.

22
Basic ConceptsDynamic Memory Allocation
•Whenwewriteprogram,wemaynotknowhow
muchspacewemayneed,tostoredata.
•Cprovidesamechanismcalledaheap,for
allocatingstorageatrun-time.
•Thefunctionmalloc()isusedtoallocateanew
areaofmemory.

23
malloc()
Syntax
void *malloc(size_tsize)
Parameters
•size--This is the size of the memory block, in bytes.
Return Value
•This function returns a pointer to the allocated memory, or NULLif the request fails

24
malloc()
•The name mallocstands for "memory allocation".
•Thefunctionmalloc()reservesablockofmemoryofspecifiedsizeandreturnapointeroftypevoidwhichcanbecastedintopointerofanyform.

25
•Whenmemoryisnolongerneeded,wemayfreeitbycallingfree()function.
•Thecalltomalloc()determinessizeofstoragerequiredtoholdintorthefloat.
•Thenotations(int*)and(float*)aretypecastexpressions.

26
•Theresultisapointertothefirstbyteofastorageareaofthepropersize.
•Thereturnvalueofthemalloc()isvoid*.
•Acalltomalloc()mayfailforlackofsufficientmemory

27
Example:
int*pi; float *pf;
pi = (int*) malloc(sizeof(int));
pf = (float *) malloc(sizeof(float));
*pi=1024; *pf=3.124;
printf(“an integer = %d, a float = %fn”,*pi,*pf);
free(pi); free(pf);

28
•WhenprogramminginCitisawisepracticetosetallpointerstoNULLwhentheyarenotpointingtoanobject.
•Useexplicittypecastswhenconvertingbetweenpointertypes:
pi=malloc(sizeof(int));/*assigntopiapointertoint*/
pf=(float*)pi;/*castsanintpointertofloatpointer*/
•Inmanysystems,pointershavethesamesizeastypeint.intisthedefaulttypespecifier.

29
calloc()
•The name callocstands for "contiguous memory allocation“ or ‘c’for cleared.
•Thefunctioncalloc()allocatesablockofmemoryforanarrayofnumelements,eachofthemsizebyteslong,andinitializesallitsbitstozero.

30
calloc()
Syntax
void* calloc(size_tnum, size_tsize);
Parameters
•num--Number of elements to allocate.
•size--Size of each element
•size_tis an unsigned integral type.
Return Value
•On success, a pointerto the memory block allocated by the function.
•The type of this pointer is alwaysvoid*, which can be cast to the desired type of data pointer in order to be dereferenceable.
• If the function failed to allocate the requested block of memory, anull pointeris returned.

31
calloc()
Example
int*ptr1,*ptr2;
ptr1 = (int*)calloc(10, sizeof(int));
ptr2=(int*)calloc(20,sizeof(float));

32
malloc() & calloc()
Differrence
Theonlydifferencebetweenmalloc()andcalloc()isthat,malloc()allocatessingleblockofmemorywhereascalloc()allocatesmultipleblocksofmemoryeachofsamesizeandsetsallbytestozero. Prof. A. Syed Mustafa (Ph.D)

33
malloc() & calloc()
Differrence
mallocfunction,whereastheareareservedtothestatesthatareundefined,theareaallocatedbythecallocfunctioncontainsa0.
Infact,thecallocfunctionisinternallymaybeafunctionthatcallsmalloc.Aftersecuringfunctionbymalloc,theareaisfilledwith0.

34
free()
Syntax
void free(void *ptr)
Parameters
•ptr--Pointer to a memory block previously allocated withmalloc(), calloc() or realloc().
Return Value
•None
Note:
If the memeoryis not freed , then Dangling pointer arises which leads to garbagecollection.

35

36

37

38

39
realloc() -Reallocate memory block
void*realloc(void*ptr,size_tsize)
•TheClibraryfunctionattemptstoresizethememoryblockpointedtobyptrthatwaspreviouslyallocatedwithacalltomallocorcallocorrealloc
Parameters
ptr--Thisisthepointertoamemoryblockpreviouslyallocatedwithmalloc,callocorrealloctobereallocated.IfthisisNULL,anewblockisallocatedandapointertoitisreturnedbythefunction
•size--Thisisthenewsizeforthememoryblock,inbytes.Ifitis0andptrpointstoanexistingblockofmemory,thememoryblockpointedbyptrisdeallocatedandaNULLpointerisreturned.
ReturnValue
Thisfunctionreturnsapointertothenewlyallocatedmemory,orNULLiftherequestfails.

40
•Thefunctionrealloc()reallocatesamemoryblockwithaspecificnewsize.
•Ifwecallrealloc()thesizeofthememoryblockpointedtobythepointerischangedtothegivensizeinbytes.
•Thiswayweareabletoexpandandreducetheamountofmemoryyouwanttouse(ifavailableofcourse.)
•Itispossiblethatthefunctionmovesthememoryblocktoanewlocation, inwhichwaythefunctionwillreturnthisnewlocation.
•Ifthesizeoftherequestedblockislargerthenthepreviousblockthenthevalueofthenewportionisindeterminate.

41
•Thereturnvalueisapointertothereallocatedmemoryblock,whichmaybeeitherthesameasptroranewlocation.
•Thetypeofreturnpointerisvoid*,whichcanbecasttothedesiredtypeofdatapointerinordertobedereferenceable
•IfthepointerisNULLthenthefunctionwillbehaveexactlylikethefunctionmalloc().Itwillassignanewblockofasizeinbytesandwillreturnapointertoit.
•Ifthesizeis0thenthememorythatwaspreviouslyallocatedisfreedasifacallofthefunctionfree()wasgiven.ItwillreturnaNULLpointerinthatcase.

42
•.
#include<stdlib.h>
#include<stdio.h>
intmain()
{char*str;
str=(char*)malloc(4);/* Initial memory allocation */
strcpy(str,“data");
printf("String = %s, Address = %pn",str,str);
/* Reallocating memory */
str=(char*)realloc(str,13);
strcat(str,“structure");
printf("String = %s, Address = %pn",str,str);
free(str);
return(0);
} Basic ConceptsDynamic Memory Allocation

43
free()
•Deallocatememory block
•A block of memory previously allocated by a call to malloc(), calloc() or realloc() is deallocated, making it available again for further allocations. Ifptrdoes not point to a block of memory allocated with the above functions, it causesundefined behavior. Ifptris anull pointer, the function does nothing. This function does not change the value ofptritself, hence it still points to the same (now invalid) location.

44
free()
/* example */
#include <stdlib.h> /* malloc, calloc, realloc, free */
intmain ()
{
int* i1, * i2, * i3;
i1 = (int*) malloc(100*sizeof(int));
i2 = (int*) calloc(100,sizeof(int));
i3 = (int*) realloc(i2,500*sizeof(int));
free (i1);
free (i3);
return 0;
}

45
Basic ConceptsAlgorithm Specification
Analgorithmisafinitesetofinstructionsthat,iffollowed,accomplishesaparticulartask.
Algorithmsmustsatisfyfollowingcriteria:
Input:therearezeroormorequantitiesthatareexternallysupplied.
Output:atleastonequantityisproduced.
Definiteness:Eachinstructionisclearandunambiguous.
Finiteness:forallcases,thealgorithmterminatesafterafinitenumberofsteps.
Effectiveness:Everyinstructionmustbebasicenoughtobecarriedout,itmustalsobefeasible. Prof. A. Syed Mustafa (Ph.D)

46
•Differencebetweenanalgorithmandaprogram:
Theprogramdoesnothavetosatisfythefourthcondition(Finiteness).
•Describinganalgorithm:
NaturallanguagesuchasEnglishcanbeused.Makesureresultinginstructionsaredefinite.
•Flowchart:
workwellonlyforalgorithm,smallandsimple.

47
•Differencebetweenanalgorithmandaprogram:
Theprogramdoesnothavetosatisfythefourthcondition(Finiteness).
•Describinganalgorithm:
NaturallanguagesuchasEnglishcanbeused.Makesureresultinginstructionsaredefinite.
•Flowchart:
workwellonlyforalgorithm,smallandsimple.

48
Translating a Problem into an Algorithm
Example-SelectionSort
Deviseaprogramthatsortsasetofnintegers, wheren>=1,fromsmallesttolargest.
SolutionI:
Fromthoseintegersthatarecurrentlyunsorted, findthesmallestandplaceitnextinthesortedlist
. Prof. A. Syed Mustafa (Ph.D)

49
Describessortingtechnique,butitisnotanalgorithm
Problems:
1.Does not describe where and how the integers are initially sorted.
2.Does not indicate where to place the result.
.

50
SolutionII:SelectionSort
Analgorithm,writteninpartiallyCandEnglish
for(i=0;i<n;i++)
{
Examinelist[i]tolist[n-1]andsupposethat
thesmallestintegerislist[min];
Interchangelist[i]andlist[min];
}
.

51
Selection Sort
-find the smallest integer
-interchange or swap
-we can solve the problem using a function or macro
void swap(int*x, int*y) // both arguments are pointers
{
inttemp= *x;
*x= *y;
*y= temp;
}

52
Selection Sort
#define swap(x,y,t)((t)= (x), (x)= (y), (y)= (t))
void sort(intlist[ ], intn)
{
inti, j, min, temp;
for (i= 0; i< n-1; i++){
min= i;
for (j= i+1; j< n; j++){
if (list[j]< list[min]) min= j;
}
swap(list[i], list[min], temp);
}

53
Theorem 1.1:
sort(a, n) correctly sorts a set of n≥ 1 integers; the result remains in a[0] … a[n-1] such that
a[0] ≤ a[1] ≤ … ≤ a[n–1].

54
Example: Binary Search
Assumethatwehaven≥1distinctintegersthatarealreadysortedandstoredinthearraya[0]…a[n-1]. Ourtaskistodetermineiftheintegerxispresentandifsotoreturnjsuchthatx=a[j];otherwisereturn-1.

55
1.Let leftand right, respectively, denote the left and right ends of the list to be searched.
2.Initially, left = 0 and right = n –1.
3.Let middle = (left +right) / 2 be the middle position in the list.
4.If we compare a[middle]with x, we obtain one of the three results.

56
1.x < a[middle]
In this case, if xis present, it must be in the positions between 0 and middle–1. Therefore, we set right to middle–1.
2.x== a[middle]
In this case, we return middle.
3. x> a[middle]
Inthiscase,ifxispresent,itmustbeinthepositionsbetweenmiddle+1andn-1.So,wesetlefttomiddle+1.

57
Binary Search.

58
Binary Search.
intcompare(intx, inty)
{
if(x < y) return-1;
else if( x == y) return0;
else return1;
} // end of compare
Macro
#define compare(x, y) ( ( (x) < (y) ) ? -1: ( (x) == (y) ) ? 0 : 1 )

59
Algorithms are implemented as functions in C.
Functions divide the programs into manageable pieces.
They make program easier to read.
Functions can be tested separately.
Declare function first then define it later.

60
Recursive algorithm
Therearemainlytwoapproachesforrepetitive
approach.
1.Iteration
2.Recursion
Recursionisarepetitiveprocessinwhichanalgorithmcallsitself.

61
Recursive algorithm
The following Figure 1 and Figure 2 portrayed the typical pictorial examples for recursive calling.

62
Recursive algorithm
The following Figure2 portrayed the typical pictorial examples for recursive calling.

63
Recursive algorithm
The following Figure portrayed the typical pictorial examples for recursive calling.

64
Recursive algorithm
Recursionisaprogrammingtechniqueinwhichamethodcancallitselftosolveaproblem.
TwoTypes:
1.DirectRecursion
2.Indirectrecursion

65
Recursive algorithm
1.DirectRecursion
Functionscallsthemselves
2.Indirectrecursion
Functions calls other function that invoke the
calling function again.
Any function that we can write using assignment, if- else and while statements can be written recursively.

66
Value of Recursion
This is well suited an alternative concept in the following situations
1. Recursion can be used to replace loop
2. A recursive procedure is mathematically more elegant than
one using loops
3. Sometime procedure that would tricky to write a loop are
straightforward to using recursion.
4. Recursively defined data structure, like list, are very well suited to processing by recursive procedures and functions

67

68

69
Algorithm to compute factorial using recursive method:
Factorial (N)
1. Receive N
2. if N > 1 return
Factorial(N-1) * N
else
return 1

70
program to compute factorial using recursive function:
#include<stdio.h>
longfactorial(int);
intmain()
{intn;longf;
printf("Enter an integer to find factorialn");
scanf("%d",&n);
if(n <0)printf("Negative integers are not allowedn");
else{f =factorial(n);printf("%d! = %ldn",n,f);}
return0;}
longfactorial(intn)
{if (n ==0)return 1;
else return(n*factorial(n-1));
}

71

72

73

74

75

76

77

78

79
Recursive program: Fibonacci
intmain()
{
intn=10;
printf(“%d”, rfib(n));
}
intrfib(intn)
{
if (n==1 || n==2) return 1;
return rfib(n1) + rfib(n2);
}

80

81

82

83
Recursive algorithm: Greatest Common Divisor(x, y)

84
/* PROGRAM TO FIND GCD OF TWO NUMBER USING RECURSION EUCLIDS*/ #include<stdio.h> #include<conio.h> intgcd(int,int); intmain() {inta,b; clrscr(); printf("n Enter two number:" ); scanf("%d %d",&a,&b); printf("GCD of two number : %d" ,gcd(a,b)); getch(); return(0); }

85
/* PROGRAM TO FIND GCD OF TWO NUMBER USING RECURSION
intgcd(intm, intn) { if(m==0) return n; if(n==0) return m; return gcd(n,m%n); }

86
/* PROGRAM TO FIND GCD OF TWO NUMBER USING RECURSION
intgcd(inta,intb)
{
if(a !=b)
{
if(a >b)
returngcd(a -b,b);
else
returngcd(a,b -a);
}
returna;
} Prof. A. Syed Mustafa (Ph.D)

87
Recursive algorithm: Greatest Common Divisor(x, y)

88
Recursive algorithm

89
Recursive algorithm
C(n, k) = C(n-1, k-1) + C(n-1, k)
C(n, 0) = C(n, n) = 1

90
Recursive algorithm-Binomial Coefficient
intbinomialCoeff(intn, intk)// Returns value of Binomial Coefficient C(n, k)
{
if (k==0 || k==n)// Base Cases
return 1;
return binomialCoeff(n-1, k-1) + binomialCoeff(n-1, k);// Recur
}
intmain()/* program to test above function*/
{
intn = 5, k = 2;
printf("Value of C(%d, %d) is %d ", n, k, binomialCoeff(n, k)); // C(5,2) is 10
return 0;
}

91
Recursive algorithm -Binomial Coefficient

92
Recursive algorithm: Towers of Hanoi

93
•Label the stands Src, Intr,Dest.
•Letnbe the total number of discs.
•Number the discs from 1 (smallest, topmost) ton(largest, bottommost).
To move n discs from stand Srcto stand Dest:
1.Move n-1 plates from Srcto Intr. This leaves plate #n alone on plate Src.
2.Move plate #n from SrctoDest.
3.Move n-1 plates from Intrto Destso they sit on plate #n.

94

95
FUNCTION MoveTower(disk, source, dest, inter)
IF disk== 1,THEN:
move diskfrom sourceto dest
ELSE:
MoveTower(disk-1, source, inter, dest) // Step 1 above
move diskfrom sourceto dest// Step 2 above
MoveTower(disk-1, inter, dest, source) // Step 3 above END IF

96

97

98

99
Limitations of Recursion
Recursion should not be used if the answer to any of the following questions is no:
Is the algorithm or data structure naturally suited to recursion (tree is the first choice) ?
Is the recursive solution shorter and more understandable?
Does the recursive solution run within acceptable time and space limits ?
As a general rule, recursive algorithms should be effectively used only when their efficiency is logarithmic.

100
Basic ConceptsData Abstraction
Abstractionistheprocessbywhichdataandprogramsaredefinedwitharepresentationsimilartoitsmeaning(semantics),whilehidingawaytheimplementationdetails.

101
Abstractiontriestoreduceandfactoroutdetailssothattheprogrammercanfocusonafewconceptsatatime.Asystemcanhaveseveralabstractionlayerswherebydifferentmeaningsandamountsofdetailareexposedtotheprogrammer.
Forexample,low-levelabstractionlayersexposedetailsofthehardwarewheretheprogramisrun,whilehigh- levellayersdealwiththebusinesslogicoftheprogram.

102

103

104

105

106

107

108

109

110

111

112
Basic ConceptsPerformance Analysis

113
Space & Time
Does the program efficiently use primary and secondary storage ?
Is the program’s running time acceptable for the task ?

114

115
The space complexity of a program is the amount of memory that it needs to run to completion.
The time complexity of a program is the amount of computer time that it needs to run to completion

116

117

118

119

120

121

122

123

124

125

126
TP(n) = CaADD(n)+ CsSUB(n)+CLLDA(n)+CstSTA(n)
n –Instance Characteristic
Ca, Cs , CL , Cst–constants-time needed to perorm
each operation
ADD -No of additions
SUB -No of Subtraction
LDA –No of Loads
STA –No of Stores
Performed when the program is run with instance characteristic n.

127

128

129

130

131

132
General statements in a C program
Step count
1.Comments 0
2.Declarative statements0
3.Expressions and assignment statements1
4.Iteration statementsN
5.Switch statementN
6.If-else statementN
7.Function invocation1 or N
8.Memory management statements1 or N
9.Function statements0
10.Jump statements1 or N

133
Notethatastepcountdoesnotnecessarilyreflectthecomplexityofthestatement.
Step per execution (s/e):
Thes/eofastatementistheamountbywhichcountchangesasaresultoftheexecutionofthatstatement.

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

Prof. A. Syed Mustafa (Ph.D) 163

Data Structure with C

Recomendados

Recomendados

Más contenido relacionado

La actualidad más candente

La actualidad más candente (20)

Destacado

Destacado (20)

Similar a Data Structure with C

Similar a Data Structure with C (20)

Más de Syed Mustafa

Más de Syed Mustafa (20)

Último

Último (20)

Data Structure with C