Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computer Science: A Structured Programming Approach Using C1 10-4 Memory Allocation Functions C gives us two choices when we want to reserve memory locations.

Published byMarcus Thornton Modified over 9 years ago

Similar presentations

Presentation on theme: "Computer Science: A Structured Programming Approach Using C1 10-4 Memory Allocation Functions C gives us two choices when we want to reserve memory locations."— Presentation transcript:

1 Computer Science: A Structured Programming Approach Using C1 10-4 Memory Allocation Functions C gives us two choices when we want to reserve memory locations for an object: static allocation and dynamic allocation. Memory Usage Static Memory Allocation Dynamic Memory Allocation Memory Allocation Functions Releasing Memory (free) Topics discussed in this section:

2 Computer Science: A Structured Programming Approach Using C2 FIGURE 10-11 Memory Allocation

3 Computer Science: A Structured Programming Approach Using C3 FIGURE 10-12 A Conceptual View of Memory

4 Computer Science: A Structured Programming Approach Using C4 We can refer to memory allocated in the heap only through a pointer. Note

5 Computer Science: A Structured Programming Approach Using C5 FIGURE 10-13 Accessing Dynamic Memory

6 Computer Science: A Structured Programming Approach Using C6 FIGURE 10-14 Memory Management Functions

7 Computer Science: A Structured Programming Approach Using C7 Memory Allocation Casting Prior to C99, it was necessary to cast the pointer returned from a memory allocation function. While it is no longer necessary, it does no harm as long as the cast is correct. If you should be working with an earlier standard, the casting format is: pointer = (type*) malloc(size) Note

8 Computer Science: A Structured Programming Approach Using C8 FIGURE 10-15 malloc

9 Computer Science: A Structured Programming Approach Using C9 FIGURE 10-16 calloc

10 Computer Science: A Structured Programming Approach Using C10 FIGURE 10-17 realloc

11 Computer Science: A Structured Programming Approach Using C11 FIGURE 10-18 Freeing Memory

12 Computer Science: A Structured Programming Approach Using C12 Using a pointer after its memory has been released is a common programming error. Guard against it by clearing the pointer. Note

13 Computer Science: A Structured Programming Approach Using C13 The pointer used to free memory must be of the same type as the pointer used to allocate the memory. Note

14 Computer Science: A Structured Programming Approach Using C14 10-5 Array of Pointers Another useful structure that uses arrays and pointers is an array of pointers. This structure is especially helpful when the number of elements in the array is variable.

15 Computer Science: A Structured Programming Approach Using C15 Table 10-2A Ragged Table

16 Computer Science: A Structured Programming Approach Using C16 FIGURE 10-19 A Ragged Array

17 Computer Science: A Structured Programming Approach Using C17 10-6 Programming Applications This section contains two applications. The first is a rewrite of the selection sort, this time using pointers. The second uses dynamic arrays. Selection Sort Revisited Dynamic Array Topics discussed in this section:

18 Computer Science: A Structured Programming Approach Using C18 FIGURE 10-20 Selection Sort with Pointers—Structure Chart

19 Computer Science: A Structured Programming Approach Using C19 PROGRAM 10-4Selection Sort Revisited

20 Computer Science: A Structured Programming Approach Using C20 PROGRAM 10-4Selection Sort Revisited

21 Computer Science: A Structured Programming Approach Using C21 PROGRAM 10-4Selection Sort Revisited

22 Computer Science: A Structured Programming Approach Using C22 PROGRAM 10-4Selection Sort Revisited

23 Computer Science: A Structured Programming Approach Using C23 PROGRAM 10-4Selection Sort Revisited

24 Computer Science: A Structured Programming Approach Using C24 PROGRAM 10-4Selection Sort Revisited

25 Computer Science: A Structured Programming Approach Using C25 PROGRAM 10-4Selection Sort Revisited

26 Computer Science: A Structured Programming Approach Using C26 FIGURE 10-21 Dynamic Array Structure Chart

27 Computer Science: A Structured Programming Approach Using C27 FIGURE 10-22 Ragged Array Structure

28 Computer Science: A Structured Programming Approach Using C28 PROGRAM 10-5Dynamic Arrays: main

29 Computer Science: A Structured Programming Approach Using C29 PROGRAM 10-5Dynamic Arrays: main

30 Computer Science: A Structured Programming Approach Using C30 PROGRAM 10-6Dynamic Arrays: buildTable

31 Computer Science: A Structured Programming Approach Using C31 PROGRAM 10-5Dynamic Arrays: buildTable

32 Computer Science: A Structured Programming Approach Using C32 PROGRAM 10-7Dynamic Arrays: fillTable

33 Computer Science: A Structured Programming Approach Using C33 PROGRAM 10-7Dynamic Arrays: fillTable

34 Computer Science: A Structured Programming Approach Using C34 PROGRAM 10-8Dynamic Arrays: Process Table

35 Computer Science: A Structured Programming Approach Using C35 PROGRAM 10-8Dynamic Arrays: Process Table

36 Computer Science: A Structured Programming Approach Using C36 PROGRAM 10-9Dynamic Arrays: Find Row Minimum

37 Computer Science: A Structured Programming Approach Using C37 PROGRAM 10-9Dynamic Arrays: Find Row Minimum

38 Computer Science: A Structured Programming Approach Using C38 PROGRAM 10-10Dynamic Arrays: Find Row Maximum

39 Computer Science: A Structured Programming Approach Using C39 PROGRAM 10-11Dynamic Arrays: Find Row Average

40 Computer Science: A Structured Programming Approach Using C40 PROGRAM 10-12Dynamic Arrays: Find Smaller

41 Computer Science: A Structured Programming Approach Using C41 PROGRAM 10-13Dynamic Arrays: Find Larger

42 Computer Science: A Structured Programming Approach Using C42 10-7 Software Engineering Pointer applications need careful design to ensure that they work correctly and efficiently. The programmer not only must take great care in the program design but also must carefully consider the data structures that are inherent with pointer applications. Pointers and Function Calls Pointers and Arrays Array Index Commutativity Dynamic Memory: Theory versus Practice Topics discussed in this section:

43 Computer Science: A Structured Programming Approach Using C43 Whenever possible, use value parameters. Note

44 Computer Science: A Structured Programming Approach Using C44 PROGRAM 10-14Testing Memory Reuse

45 Computer Science: A Structured Programming Approach Using C45 PROGRAM 10-14Testing Memory Reuse

Download ppt "Computer Science: A Structured Programming Approach Using C1 10-4 Memory Allocation Functions C gives us two choices when we want to reserve memory locations."

Similar presentations

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 Lists CSE 2451 Matt Boggus. Dynamic memory reminder Allocate memory during run-time malloc() and calloc() – return a void pointer to memory or.

Linked Lists CSE 2451 Matt Boggus. Dynamic memory reminder Allocate memory during run-time malloc() and calloc() – return a void pointer to memory or.
Symbol Table.

Symbol Table.
Dynamic memory allocation

Dynamic memory allocation
Dynamic Memory Allocation in C.  What is Memory What is Memory  Memory Allocation in C Memory Allocation in C  Difference b\w static memory allocation.

Dynamic Memory Allocation in C.  What is Memory What is Memory  Memory Allocation in C Memory Allocation in C  Difference b\w static memory allocation.
Constructor. 2 constructor The main use of constructors is to initialize objects. A constructor is a special member function, whose name is same as class.

Constructor. 2 constructor The main use of constructors is to initialize objects. A constructor is a special member function, whose name is same as class.
Introduction to Memory Management. 2 General Structure of Run-Time Memory.

Introduction to Memory Management. 2 General Structure of Run-Time Memory.
Chapter 6 Data Types. 2 3 4 5 6 7 8 9 10.

Chapter 6 Data Types
Dynamic Memory Allocation (also see pointers lectures) -L. Grewe.

Dynamic Memory Allocation (also see pointers lectures) -L. Grewe.
Managing Memory Static and Dynamic Memory Type Casts Allocating Arrays of Dynamic Size Resizing Block of Memory Returning Memory from a Function Avoiding.

Managing Memory Static and Dynamic Memory Type Casts Allocating Arrays of Dynamic Size Resizing Block of Memory Returning Memory from a Function Avoiding.
Dynamic Memory Allocation The memory usage for program data can increase or decrease as your program runs. The memory usage for program data can increase.

Dynamic Memory Allocation The memory usage for program data can increase or decrease as your program runs. The memory usage for program data can increase.
Managing Memory DCT 1063 PROGRAMMING 2 Mohd Nazri Bin Ibrahim Faculty of Computer, Media & Technology TATi University College

Managing Memory DCT 1063 PROGRAMMING 2 Mohd Nazri Bin Ibrahim Faculty of Computer, Media & Technology TATi University College
Growing Arrays in C By: Victoria Tielebein CS 265- Spring 2011.

Growing Arrays in C By: Victoria Tielebein CS 265- Spring 2011.
Agenda  Review: pointer & array  Relationship between pointer & array  Dynamic memory allocation.

Agenda  Review: pointer & array  Relationship between pointer & array  Dynamic memory allocation.
ספטמבר 04Copyright Meir Kalech1 C programming Language Chapter 6: Dynamic Memory Allocation (DMA)

ספטמבר 04Copyright Meir Kalech1 C programming Language Chapter 6: Dynamic Memory Allocation (DMA)
Pointer applications. Arrays and pointers Name of an array is a pointer constant to the first element whose value cannot be changed Address and name refer.

Pointer applications. Arrays and pointers Name of an array is a pointer constant to the first element whose value cannot be changed Address and name refer.
Introduction of Memory Allocation. Memory Allocation There are two types of memory allocations possible in c. Compile-time or Static allocation Run-time.

Introduction of Memory Allocation. Memory Allocation There are two types of memory allocations possible in c. Compile-time or Static allocation Run-time.
1 Objectives ❏ To understand the relationship between arrays and pointers ❏ To understand the design and concepts behind pointer arithmetic ❏ To write.

1 Objectives ❏ To understand the relationship between arrays and pointers ❏ To understand the design and concepts behind pointer arithmetic ❏ To write.
Memory Allocation. Memory A memory or store is required in a computer to store programs (or information or data). Data used by the variables in a program.

Memory Allocation. Memory A memory or store is required in a computer to store programs (or information or data). Data used by the variables in a program.
Memory allocation CSE 2451 Matt Boggus. sizeof The sizeof unary operator will return the number of bytes reserved for a variable or data type. Determine:

Memory allocation CSE 2451 Matt Boggus. sizeof The sizeof unary operator will return the number of bytes reserved for a variable or data type. Determine:

Similar presentations

Ads by Google