Pointers.

Slides:



Advertisements
Similar presentations
Dynamic memory allocation
Advertisements

Unions The storage referenced by a union variable can hold data of different types subject to the restriction that at any one time, the storage holds data.
1 Pointers Lecture Introduction Pointers  Powerful, but difficult to master  Simulate pass-by-reference  Close relationship with arrays and.
Managing Memory Static and Dynamic Memory Type Casts Allocating Arrays of Dynamic Size Resizing Block of Memory Returning Memory from a Function Avoiding.
CSCI 171 Presentation 11 Pointers. Pointer Basics.
1 Pointers. Variable Memory Snapshot 2 int nrate = 10; The variable is stored at specific memory address A variable is nothing more than a convenient.
Engineering Problem Solving with C Fundamental Concepts Chapter 6 Pointers.
Kernighan/Ritchie: Kelley/Pohl:
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.
Dynamic memory allocation. The process of allocating memory at run time is known as dynamic memory allocation. C have four library functions for allocating.
Engineering Problem Solving With C++ An Object Based Approach Chapter 9 Pointers and Creating Data Structures.
1 Day 03 Introduction to C. 2 Memory layout and addresses r s int x = 5, y = 10; float f = 12.5, g = 9.8; char c = ‘r’, d = ‘s’;
Copyright © 2012 Pearson Education, Inc. Chapter 9: Pointers.
Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Copyright 2004 Scott/Jones Publishing Starting Out with C++: Early.
Copyright © 2015, 2012, 2009 Pearson Education, Inc., Publishing as Addison-Wesley All rights reserved. Chapter 9: Pointers.
Pointers Applications
Pointers| SCP1103 Programming Technique C | Jumail, FSKSM, UTM, 2005 | Last Updated: September 2006 Slide 1 Pointers by Jumail Bin Taliba Faculty of Computer.
Pointers CSE 2451 Rong Shi.
Prof. amr Goneid, AUC1 CSCE 110 PROGRAMMING FUNDAMENTALS WITH C++ Prof. Amr Goneid AUC Part 10. Pointers & Dynamic Data Structures.
Engineering H192 - Computer Programming Gateway Engineering Education Coalition Lect 14P. 1Winter Quarter Pointers Lecture 14.
Starting Out with C++ Early Objects Seventh Edition by Tony Gaddis, Judy Walters, and Godfrey Muganda Modified by use by the MSU CMPS Dept. Chapter 10:
Chapter 9 Pointers Fall 2005 Csc 125 Introduction to C++
Pointers Chapter 9. Getting The Address Of A Variable Each variable in program is stored at a unique address Use address operator & to get address of.
1 Programming with Pointers Turgay Korkmaz Office: SB Phone: (210) Fax: (210) web:
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 9: Pointers.
Dynamic Memory Allocation The process of allocating memory at run time is known as dynamic memory allocation. C does not Inherently have this facility,
ECE 103 Engineering Programming Chapter 47 Dynamic Memory Alocation Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Pointers.
19&20-2 Know how to declare pointer variables. Understand the & (address) and *(indirection) operators. Dynamic Memory Allocation Related Chapter: ABC.
Review 1 List Data Structure List operations List Implementation Array Linked List.
12/23/2015Engineering Problem Solving with C++, second edition, J. Ingber 1 Engineering Problem Solving with C++, Etter/Ingber Chapter 9 An Introduction.
1 Dynamic Memory Allocation. 2 In everything we have done so far, our variables have been declared at compile time. In these slides, we will see how to.
1  Lecture 12 – Pointer FTMK, UTeM – Sem /2014.
POINTERS IN C Pointer Basics, Pointer Arithmetic, Pointer to arrays and Pointer in functions.
Copyright © 2012 Pearson Education, Inc. Chapter 9: Pointers.
BIL 104E Introduction to Scientific and Engineering Computing Lecture 9.
Pointers Lecture: 5. Topics 1 Pointers and the Address Operator 2 Pointer Variables 3 The Relationship Between Arrays and Pointers 4 Pointer Arithmetic.
Windows Programming Lecture 03. Pointers and Arrays.
DYNAMIC MEMORY ALLOCATION. Disadvantages of ARRAYS MEMORY ALLOCATION OF ARRAY IS STATIC: Less resource utilization. For example: If the maximum elements.
Arrays and Pointers (part 1) CSE 2031 Fall July 2016.
Overview Working directly with memory locations is beneficial. In C, pointers allow you to: change values passed as arguments to functions work directly.
Lecture 5 Pointers 1. Variable, memory location, address, value
CS1010 Programming Methodology
Day 03 Introduction to C.
Standard Version of Starting Out with C++, 4th Edition
Chapter 9: Pointers.
Chapter 10: Pointers Starting Out with C++ Early Objects
EPSII 59:006 Spring 2004.
Day 03 Introduction to C.
INC 161 , CPE 100 Computer Programming
Pointer.
Lecture 6 C++ Programming
Chapter 10: Pointers Starting Out with C++ Early Objects
An Introduction to Pointers
Pointers Department of Computer Science-BGU יום רביעי 21 נובמבר 2018.
Chapter 9: Pointers.
Dynamic Memory Allocation
Pointers Problem Solving & Program Design in C Eighth Edition
Programming with Pointers
Introduction to Problem Solving and Programming
Pointers Pointers are variables that contain memory addresses as their values. A variable name refers to a specific value. A pointer contains an address.
7. Pointers, Dynamic Memory
C (and C++) Pointers April 4, 2019.
C Programming Lecture-8 Pointers and Memory Management
Chapter 9: Pointers and String
Standard Version of Starting Out with C++, 4th Edition
CISC181 Introduction to Computer Science Dr
Pointers, Dynamic Data, and Reference Types
Introduction to Pointers
Presentation transcript:

Pointers

Variable Memory Snapshot int nrate = 10; The variable is stored at specific memory address A variable is nothing more than a convenient name for a memory location

Address Operator A variable can be referenced using the address operator & example: scanf(“%f”, &x); This statement specifies that the value read is to be stored at the address of x

Pointer Variables A pointer is a variable that holds the address of a memory location If a variable p holds the address of another variable q, then p is said to point to q If q is a variable at location 100 in memory, then p would have the value 100 (q’s address) 100 200 100 q p

How to declare a pointer variable pointer variables are declared using an asterisk ( * ) The asterisk is called the indirection operator or the de-referencing operator). example: int a, b, *ptr; ptr is a pointer to an integer when a pointer is defined, the type of variable to which it will point must be specified. (i.e. a pointer defined to point to an integer cannot also point to a floating point variable.)

Example int *iPtr; double* dPtr; the variable iPtr is declared to point to an int the variable dPtr is declared to point to a double neither variable has not been initialized in the above example declaring a pointer creates a variable capable of holding an address

Why Pointers? They allow you to refer to large data structures in a compact way They facilitate sharing between different parts of programs They make it possible to get new memory dynamically as your program is running They make it easy to represent relationships between data items

Example a ? iPtr s dPtr int a, *iPtr; char* s; double *dPtr; ? ? ?

More about declaring pointers When using the form int* p, q; the * operator does not distribute. In the above example p is declared to be a pointer to int. q is declared to be an int.

Assigning values to a pointer the assignment operator (=) is defined for pointers the right operand can be any expression that evaluates to the same type as the left the operator & in front of an ordinary variable produces the address of that variable. The operator * in front of a pointer variable returns the contents stored at that address

Example int i=6, j; int *iPtr; iPtr = &i; j = *iPtr; i 6 iPtr j 6

Exercise int a, b; int *c, *d; a = 5; a c = &a; d = &b; *d = 9; b name address memory 1 2 3 4 ? int a, b; int *c, *d; a = 5; c = &a; d = &b; *d = 9; print c, *c, &c print a, b a 5 b 9 c 1 d 2 c=1 *c=5 &c=4 a=5 b=9

Exercise Give a memory snapshot after each set of assignment statements int a=1, b=2, *ptr; ptr = &b; int a=1, b=2, *ptr=&b; a = *ptr;

NULL pointer A pointer can be assigned or compared to the integer zero, or, equivalently, to the symbolic constant NULL, which is defined in <stdio.h>. A pointer variable whose value is NULL is not pointing to anything that can be accessed

Example iPtr s dPtr int *iPtr=0; char *s=0; double *dPtr=NULL;

Pointer Assignments A pointer can point to only one location at a time, but several pointers can point to the same location. /* Declare and initialize variables. */ int x=-5, y = 8, *ptr1, *ptr2; /* Assign both pointers to point to x. */ ptr1 = &x; ptr2 = ptr1; The memory snapshot after these statements are executed is ptr1 ptr2 x y -5 8

Pointer Arithmetic Four arithmetic operations are supported +, -, ++, -- only integers may be used in these operations Arithmetic is performed relative to the variable type being pointed to Example: p++; if p is defined as int *p, p will be incremented by 4 (system dependent) if p is defined as double *p, p will be incremented by 8(system dependent when applied to pointers, ++ means increment pointer to point to next value in memory

Accessing Arrays using Pointers #include <stdio.h> int main() { int a[5]={1,3,5,7,9}; int *ptr; int i=0; ptr = a; while (i<5) { printf("%d\n",*(ptr+i)); i++; }

Comparing Pointers You may compare pointers using relational operators Common comparisons are: check for null pointer (p == NULL) check if two pointers are pointing to the same object (p == q) Is this equivalent to (*p == *q) compare two pointers that are pointing to a common object such as an array.

Call by Value void swap(int a, int b) { int temp; temp = a; a = b; b = temp; return; }

Call by Value int x = 2, y = 3; printf("X = %d Y = %d\n",x,y); swap(x,y); Changes made in function swap are lost when the function execution is over

Call by reference void swap2(int *aptr, int *bptr) { int temp; temp = *aptr; *aptr = *bptr; *bptr = temp; return; }

Call by reference int x = 2, y = 3; int *ptr1, *ptr2; ptr1 = &x; ptr2 = &y; swap2(ptr1,ptr2); printf("X = %d Y = %d\n",*ptr1,*ptr2); x = 2; y = 3; swap2(&x,&y); printf("X = %d Y = %d\n",x,y); Version 1 Version 2

Exercise Write a function to compute the roots of quadratic equation ax^2+bx+c=0. void comproots(int a,int b,int c,double *dptr1, double *dptr2) { *dptr1 = (-b - sqrt(b*b-4*a*c))/(2.0*a); *dptr2 = (-b + sqrt(b*b-4*a*c))/(2.0*a); return; }

Exercise int a,b,c; double root1,root2; printf("Enter Coefficients:\n"); scanf("%d%d%d",&a,&b,&c); computeroots(a,b,c,&root1,&root2); printf("First Root = %lf\n",root1); printf("Second Root = %lf\n",root2);

Exercise Implement a function increaseanddouble(…) which takes 2 integers and increases the value of first by 1 and doubles the value of the second x=3;y=5; … printf(“x=%d y=%d\n“,x,y); increaseanddouble(…); OUTPUT x=3 y=5 x=4 y=10

Dynamic Memory Allocation Dynamically allocated memory is determined at runtime A program may create as many or as few variables as required, offering greater flexibility Dynamic allocation is often used to support data structures such as stacks, queues, linked lists and binary trees. Dynamic memory is finite Dynamically allocated memory may be freed during execution

Dynamic Memory Allocation Memory is allocated using the: malloc function (memory allocation) calloc function (cleared memory allocation) Memory is released using the: free function The size of memory requested by malloc or calloc can be changed using the: realloc function

malloc and calloc Both functions return a pointer to the newly allocated memory If memory can not be allocated, the value returned will be a NULL value The pointer returned by these functions is declared to be a void pointer A cast operator should be used with the returned pointer value to coerce it to the proper pointer type #include <stlib.h> to use these functions

Example of malloc int n = 6, m = 4; double *x; int *p; /* Allocate memory for 6 doubles. */ x = (double *)malloc(n*sizeof(double)); To free the space allocated use free() free(x); X

calloc (allocate memory for arrays) int m = 4; int *p; /* Allocate memory for 4 integers. */ p = (int *)calloc(m,sizeof(int)); p[0]=2; p[1]=3; To free the space allocated use free() free(x); p

Realloc (change size of memory) int m = 4; int *p; /* Allocate memory for 4 integers. */ p = (int *)calloc(m,sizeof(int)); /* change the size of memory block pointed by p */ q = realloc(p,2*m*sizeof(int)); To free the space allocated use free() free(x); p