1. Generic Pointer 2. NULL Pointer 3. Wild Pointer 4. Dangling Pointer.

Slides:

Advertisements

Similar presentations

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.

Advertisements

Chapter 6 Data Types

Chapter 9 Pointers and Dynamic Arrays. Overview 9.1 Pointers 9.2 Dynamic Arrays.

A pointer is the memory address of a variable. A memory address is a physical location within a system’s memory space. A pointer variable is variable used.

Dynamic Memory Allocation (also see pointers lectures) -L. Grewe.

Introduction to Programming Lecture 39. Copy Constructor.

Pointers & Dynamic Memory Allocation Mugurel Ionu Andreica Spring 2012.

Various languages….  Could affect performance  Could affect reliability  Could affect language choice.

Informática II Prof. Dr. Gustavo Patiño MJ

1 Pointers A pointer variable holds an address We may add or subtract an integer to get a different address. Adding an integer k to a pointer p with base.

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’;

Dynamic Memory Allocation in C++. Memory Segments in C++ Memory is divided in certain segments – Code Segment Stores application code – Data Segment Holds.

Introduction to Data Structure, Spring 2007 Slide- 1 California State University, Fresno Introduction to Data Structure C Programming Concepts Ming Li.

Pointers. Addresses in Memory When a variable is declared, enough memory to hold a value of that type is allocated for it at an unused memory location.

Computer Science 210 Computer Organization Pointers and Dynamic Storage.

1 Pointers, Dynamic Data, and Reference Types Review on Pointers Reference Variables Dynamic Memory Allocation –The new operator –The delete operator –Dynamic.

Programming Pointers. COMP104 Lecture 32 / Slide 2 Pointers l Pointers are objects whose values are the locations of other objects l Pointers are memory.

1 Procedural Concept The main program coordinates calls to procedures and hands over appropriate data as parameters.

Overview Working directly with memory locations is beneficial. In C, pointers allow you to: change values passed as arguments to functions work directly.

ARRAYS In this Lecture, we will try to develop understanding of some of the relatively complex concepts. The following are explained in this lecture with.

Addresses in Memory When a variable is declared, enough memory to hold a value of that type is allocated for it at an unused memory location. This is.

Comp 245 Data Structures Linked Lists. An Array Based List Usually is statically allocated; may not use memory efficiently Direct access to data; faster.

7. Pointers, Dynamic Memory 20 th September IIT Kanpur 1C Course, Programming club, Fall 2008.

This set of notes is adapted from that provided by “Computer Science – A Structured Programming Approach Using C++”, B.A. Forouzan & R.F. Gilberg, Thomson.

Computer Science and Software Engineering University of Wisconsin - Platteville 2. Pointer Yan Shi CS/SE2630 Lecture Notes.

1 Pointers Arrays have a disadvantage: Their size must be known at compile time. We would like the capability to allocate an array-like object of any needed.

1 C++ Classes and Data Structures Jeffrey S. Childs Chapter 4 Pointers and Dynamic Arrays Jeffrey S. Childs Clarion University of PA © 2008, Prentice Hall.

C++ Data Types Structured array struct union class Address pointer reference Simple IntegralFloating char short int long enum float double long double.

Chapter 9 Pointers and Dynamic Arrays (9.1). Pointers A variables which holds the memory address for a variable of a specific type. Call-by-Reference.

CPSC 252 Dynamic Memory Allocation Page 1 Dynamic memory allocation Our first IntVector class has some serious limitations the capacity is fixed at MAX_SIZE.

1 Dynamic Memory Allocation –The need –malloc/free –Memory Leaks –Dangling Pointers and Garbage Collection Today’s Material.

Dynamic Memory Allocation. Domain A subset of the total domain name space. A domain represents a level of the hierarchy in the Domain Name Space, and.

Pointers in C++. 7a-2 Pointers "pointer" is a basic type like int or double value of a pointer variable contains the location, or address in memory, of.

1 CS 132 Spring 2008 Chapter 3 Pointers and Array-Based Lists read p

1 Workin’ with Pointas An exercise in destroying your computer.

© Janice Regan, CMPT 128, February CMPT 128: Introduction to Computing Science for Engineering Students Pointers.

Lecture – Pointers1 C++ Pointers Joseph Spring/Bob Dickerson School of Computer Science Operating Systems and Computer Networks Based on notes by Bob Dickerson.

1 Lecture07: Memory Model 5/2/2012 Slides modified from Yin Lou, Cornell CS2022: Introduction to C.

CMSC 202 Computer Science II for Majors. CMSC 202UMBC Topics Memory management operators Dynamic memory Project 2 questions.

Lecture 10: 2/17/2003CS148 Spring CS148 Introduction to Programming II Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.

POINTERS IN C. Introduction  A pointer is a variable that holds a memory address  This address is the location of another object (typically another.

1 Recall that... char str [ 8 ]; str is the base address of the array. We say str is a pointer because its value is an address. It is a pointer constant.

1 Chapter 15-1 Pointers, Dynamic Data, and Reference Types Dale/Weems.

P OINTERS A pointer is an address All data is stored in memory in some location that is indexed with an address Can refer to variables by name or by memory.

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.

Sudeshna Sarkar, CSE, IIT Kharagpur1 Structure and list processing Lecture

Dynamic Memory Management & Static Class Members Lecture No 7 Object Oriented Programming COMSATS Institute of Information Technology.

Sections Basic Data Structures. 1.5 Data Structures The way you view and structure the data that your programs manipulate greatly influences your.

Pointers. What Is Pointer l every variable has memory address char c=’y’; int i=2; address of variable i is 0022 l address can used to refer to this variable.

Recap Resizing the Vector Push_back function Parameters passing Mechanism Primitive Arrays of Constants Multidimensional Arrays The Standard Library string.

Dynamic Storage Allocation

Computer Science 210 Computer Organization

Pointers Revisited What is variable address, name, value?

Pointers Psst… over there.

Pointers Psst… over there.

Dynamic Memory Allocation

CSC 253 Lecture 8.

CSC 253 Lecture 8.

Computer Science 210 Computer Organization

Pointers, Dynamic Data, and Reference Types

7. Pointers, Dynamic Memory

Dynamic Memory.

C Programming Lecture-8 Pointers and Memory Management

Chapter 9: Pointers and String

Dynamic Memory – A Review

Pointers, Dynamic Data, and Reference Types

Run-time environments

SPL – PS2 C++ Memory Handling.

Presentation transcript:

1. Generic Pointer 2. NULL Pointer 3. Wild Pointer 4. Dangling Pointer

GGeneric pointer is also known as void pointer. GGeneric pointer is a special type of pointer which points to the data of no specific data type FFor examplevoid *ptr;  Here ptr is a generic pointer. WWe can assign the address of any data type to generic pointer after its declaration. WWe use generic pointer in two situations. One when we have no idea in advance about the data type of the variable. SSecondly when we have to assign the address of different variables of different data types to the single pointer.

IIt is a special type of pointer which points nowhere. IIt is usually used to know if the pointer points to null or free the memory during the deallocation of memory in dynamic memory location. FFor Example: int *ptr= N ULL;

AAn uninitialization pointer is known as wild pointer. WWild pointer holds a garbage value. IIt is not pointing any memory location yet. FFor Example: int *ptr; is a wild pointer. AAfter the initialization it will became an ordinary pointer.

IIt points to a destroyed variable. IIt usually happens during dynamic memory allocation, when the object is destroyed but not free the pointer, it still pointing to the destroyed variable. FFor Example: char *dp=malloc(…………) ; /*………code of the program………………………… …………code of the program………………………….*/ free(dp);// Now dp is a dengling pointer here. dp= N ULL ; // Now dp is not a dengling pointer, it is now a null pointer.