Presentation is loading. Please wait.

Presentation is loading. Please wait.

1) Linked records/structures 2) Linked lists, examples in Ada and C 3) Processing linked lists COMP205 IMPERATIVE LANGUAGES 8. COMPOUND (HIGHER LEVEL)

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "1) Linked records/structures 2) Linked lists, examples in Ada and C 3) Processing linked lists COMP205 IMPERATIVE LANGUAGES 8. COMPOUND (HIGHER LEVEL)"— Presentation transcript:

1 1) Linked records/structures 2) Linked lists, examples in Ada and C 3) Processing linked lists COMP205 IMPERATIVE LANGUAGES 8. COMPOUND (HIGHER LEVEL) DATA TYPES 4 --- LINKED LISTS AND UNIONS

2

3

4 #include void main(void) { int n, *nptr; n = 2; nptr = &n; printf("n = %d\n",n); printf("address of n = %d\n",&n); printf("nptr = %d\n",nptr); printf("address of nptr = %d\n",&nptr); printf("value pointed at = %d\n\n", *nptr); n = 4; printf("n = %d\n",n); printf("address of n = %d\n",&n); printf("nptr = %d\n",nptr); printf("address of nptr = %d\n",&nptr); printf("value pointed at = %d\n\n", *nptr); } n = 2 address of n = 2063808352 nptr = 2063808352 address of nptr = 2063808356 value pointed at = 2 n = 4 address of n = 2063808352 nptr = 2063808352 address of nptr = 2063808356 value pointed at = 4

5 C LINKED LIST EXAMPLE #include typedef struct date { int day; char month[9], int year; struct date *next; } DATE_T, *DATE_PTR_T; DATE_PTR_T createBdayStruct(int, char*, int); void main(void){ ------- rest of code

6 void main(void) { DATE_PTR_T birthdayPtr=NULL, newPtr=NULL; birthdayPtr=createBdayStruct(15,"October", 1991); newPtr=createBdayStruct(15,"May",1993); newPtr->next=birthdayPtr; birthdayPtr=newPtr; newPtr=createBdayStruct(21,"April",1957); newPtr->next=birthdayPtr; birthdayPtr=newPtr; }

7 DATE_PTR_T createBdayStruct(int day, char *month, int year) { DATE_PTR_T newPtr; if ((newPtr = (DATE_PTR_T) (malloc(sizeof(DATE_T))))==NULL) { printf("Insufficient space\n"); exit(-1); } newPtr->day = day; strcpy(newPtr->month,month); newPtr->year = year; newPtr->next = NULL; return(newPtr); }

8 PROCESSING LINKED LISTS The standard mechanism for processing linked lists is to step through the list. Ada Example:

9 with CS_IO ; use CS_IO ; procedure ADA_LINKED_LIST_EX is --- Data declarations ---- --- Create birthday record code ---- procedure OUTPUT (LINKPTR: in DATEPTR_T) is begin put("Birthday = "); put(LINKPTR.DAY, width => 2); put(" ");put(LINKPTR.MONTH(1..9)); put(LINKPTR.YEAR, width => 3);new_line; end OUTPUT; _EX ;

10 procedure OUTPUT_BIRTHDAY_RECORDS ( START_PTR: in DATEPTR_T) is LINKPTR : DATEPTR_T:= STARTPTR; begin OUTPUT(LINKPTR); LINKPTR := LINKPTR.NEXT; OUTPUT(LINKPTR); end OUTPUT_BIRTHDAY_RECORDS; begin --- Call create birthday record code ---- OUTPUT_BIRTHDAY_RECORDS(BIRTHDAYPTR); end ADA_LINKED_LIST_EX ; Birthday = 21 April 57 Birthday = 15 May 93 Birthday = 15 October 91

11 void outputBirthdayStructures (DATE_PTR_T birthdayPtr) { DATE_PTR_T linkPtr = birthdayPtr; output(linkPtr); linkPtr = linkPtr->next; output(linkPtr); linkPtr = linkPtr->next; output(linkPtr); } void output(DATE_PTR_T linkPtr) { printf("Birthday = %d %s %d\n",linkPtr->day, linkPtr->month,linkPtr->year); } C EXAMPLE

12 SUMMARY 1) Linked records/structures 2) Linked lists, examples in Ada and C 3) Processing linked lists

Download ppt "1) Linked records/structures 2) Linked lists, examples in Ada and C 3) Processing linked lists COMP205 IMPERATIVE LANGUAGES 8. COMPOUND (HIGHER LEVEL)"

Similar presentations

Incomplete Structs struct B; struct A { struct B * partner; // other declarations… }; struct B { struct A * partner; // other declarations… };

Incomplete Structs struct B; struct A { struct B * partner; // other declarations… }; struct B { struct A * partner; // other declarations… };
Dynamic Allocation and Linked Lists. Dynamic memory allocation in C C uses the functions malloc() and free() to implement dynamic allocation. malloc is.

Dynamic Allocation and Linked Lists. Dynamic memory allocation in C C uses the functions malloc() and free() to implement dynamic allocation. malloc is.
LINKED LIST, STACKS AND QUEUES Saras M Srivastava, PGT – Comp. Sc. Kendriya Vidyalaya TengaValley.

LINKED LIST, STACKS AND QUEUES Saras M Srivastava, PGT – Comp. Sc. Kendriya Vidyalaya TengaValley.
C Structures What is a structure? A structure is a collection of related variables. It may contain variables of many different data types---in contrast.

C Structures What is a structure? A structure is a collection of related variables. It may contain variables of many different data types---in contrast.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Structures Functions and Arrays Dale Roberts, Lecturer Computer.

Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Structures Functions and Arrays Dale Roberts, Lecturer Computer.
Data Types in C. Data Transformation Programs transform data from one form to another –Input data  Output data –Stimulus  Response Programming languages.

Data Types in C. Data Transformation Programs transform data from one form to another –Input data  Output data –Stimulus  Response Programming languages.
1 Programming Structures COMP102 Prog. Fundamentals, Structures / Slide 2 2 Structures l A Structure is a collection of related data items, possibly.

1 Programming Structures COMP102 Prog. Fundamentals, Structures / Slide 2 2 Structures l A Structure is a collection of related data items, possibly.
C Intro.

C Intro.
Union, bitfield, typedef, enum union nama_u{ ------ }; union nama_u{ ------ struct nama_s byte; ------ }; enum{ }; Tipedef var BYTE.

Union, bitfield, typedef, enum union nama_u{ }; union nama_u{ struct nama_s byte; }; enum{ }; Tipedef var BYTE.
CS1061: C Programming Lecture 21: Dynamic Memory Allocation and Variations on struct A. O’Riordan, 2004, 2007 updated.

CS1061: C Programming Lecture 21: Dynamic Memory Allocation and Variations on struct A. O’Riordan, 2004, 2007 updated.
1) Constrained (static) and unconstrained (dynamic) arrays. 2) Flexible arrays 3) Multi-dimensional arrays 4) Arrays of arrays 5) Lists, sets, bags,Etc.

1) Constrained (static) and unconstrained (dynamic) arrays. 2) Flexible arrays 3) Multi-dimensional arrays 4) Arrays of arrays 5) Lists, sets, bags,Etc.
C and Data Structures Baojian Hua

C and Data Structures Baojian Hua
1) Fixed count loops 2) Variable count loops 3) Post-test Loops 4) Terminating a loop COMP205 IMPERATIVE LANGUAGES 11. PROGRAM CONSTRUCTS 2 (REPETITION)

1) Fixed count loops 2) Variable count loops 3) Post-test Loops 4) Terminating a loop COMP205 IMPERATIVE LANGUAGES 11. PROGRAM CONSTRUCTS 2 (REPETITION)
UBC104 Embedded Systems Variables, Structures & Pointers.

UBC104 Embedded Systems Variables, Structures & Pointers.
1) Pointers 2) Type declarations 3) Access/reference values 4) Type renaming/aliasing 5) Subtypes 6) Macro substitution COMP205 IMPERATIVE LANGUAGES 4.

1) Pointers 2) Type declarations 3) Access/reference values 4) Type renaming/aliasing 5) Subtypes 6) Macro substitution COMP205 IMPERATIVE LANGUAGES 4.
1) More on parameter passing: a) Parameter association b) Default parameters c) Procedures as parameters 2) Modules: Ada packages, C modules, C header.

1) More on parameter passing: a) Parameter association b) Default parameters c) Procedures as parameters 2) Modules: Ada packages, C modules, C header.
C Language Summary HTML version. I/O Data Types Expressions Functions Loops and Decisions Preprocessor Statements.

C Language Summary HTML version. I/O Data Types Expressions Functions Loops and Decisions Preprocessor Statements.
1) Data Review 2) Anonymous Data Items 3) Renaming 4) Overloading 5) Introduction to Data Types 6) Basic types 7) Range and precision 8) Ada/Pascal “attributes”

1) Data Review 2) Anonymous Data Items 3) Renaming 4) Overloading 5) Introduction to Data Types 6) Basic types 7) Range and precision 8) Ada/Pascal “attributes”
Linked Lists Chained nodes of information create what are called linked lists, with each node providing a link to the next node. A useful feature of linked.

Linked Lists Chained nodes of information create what are called linked lists, with each node providing a link to the next node. A useful feature of linked.
1) Enumerated types 2) Records and structures 3) Accessing fields in records/structures 4) Operations on records/structures 5) Variant records 6) Dynamic.

1) Enumerated types 2) Records and structures 3) Accessing fields in records/structures 4) Operations on records/structures 5) Variant records 6) Dynamic.

Similar presentations

Ads by Google