Memory management operator, C/C++ Programming

Assignment Help:

Memory Management Operator

In C malloc( ), calloc( ), realloc( ), and free( ) are used to mange dynamic memory.  In

addition to these function C++ have derived two unary operators new and delete to perform dynamic allocation of memory.   An object or variable may be created or destroyed by using these functions.  The syntax for to create a dynamic memory allocation is

pointer_variable = new data_type;

 

int *p;

p = new int;

The above two statements can be written in one stroke or line. int *p = new int;

*p = 25; Assigning 25 through pointer

 

It can also be initialized in one stroke or line. The syntax to initialize the new operator is:

pointer_variable = new data_type (value);

int *p = new int(25);

 

The new operator can also be used in array

int *pa = new int[10];  This will create memory space for 10 integers the first element is

referred as p[0].....p[9];

 

When using multi dimension arrays all the array sizes must be specified, the first array may be variable the remaining must be constants.

pm = new int[N][3][3];

To release the memory the syntax is delete pointer_variable;

delete p; will release the memory stored by the pointer variable p. delete [ ]pa; will release dynamically allocated array.

Manipulators:

The most widely used manipulators are endl and setw.

 

cout <<"This is C++ program"<< endl; The endl work just like "\n"

 

The setw operator is used to specify the width of the output.  It is similar to %wd, %w.pf in C. The default is right justified

int x=10, y=1000;

cout<

 

 


Related Discussions:- Memory management operator

How are postfix and prefix versions of operator++ , How are postfix and pre...

How are postfix and prefix versions of operator++ () differentiated? A: The postfix version of operator++ () contain a dummy parameter of type int. The prefix version does not c

Program for greatest common divisor – c++ program, Greatest Common Divisor ...

Greatest Common Divisor (GCD) - The greatest common divisor (GCD) of two integers is the largest integer that will evenly divide both integers. The GCD algorithm involves intege

Recursion, Solve the Nine Queens problem recursively. The objective is to p...

Solve the Nine Queens problem recursively. The objective is to place nine queens on an empty chessboard so that no queen is “attacking” any other, i.e., no two queens are in the sa

Assignment, manupulates operator precidence

manupulates operator precidence

Metric number, how are metric numer change the number of metric

how are metric numer change the number of metric

Write a recursive implementation of euclid algorithm, Write a recursive imp...

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books

Define the classification of operators in c language, Define the Classifica...

Define the Classification of Operators in C Language? Depending on the function performed the operator can be classified as 1. Arithmetic Operator 2. Logical Operator 3. Inc

Padovan string, padovan string for natural numbers program in java /...

padovan string for natural numbers program in java // aakash , suraj , prem sasi kumar kamaraj college program 1 : package test.padovanstring; public class Padov

If statement, who to write max if statements in a program

who to write max if statements in a program

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd