C How to Program (8th Edition)
C How to Program (8th Edition)
8th Edition
ISBN: 9780133976892
Author: Paul J. Deitel, Harvey Deitel
Publisher: PEARSON
bartleby

Videos

Textbook Question
100%
Book Icon
Chapter 18, Problem 18.6E

(Memory Allocation and Deallocation Operators) Compare and contrast dynamic memory allocation and deallocation operators new, new [], delete and delete []:

Expert Solution & Answer
Check Mark
Program Plan Intro

To compare and contrast dynamic memory allocation and deallocation operators new, new[], delete and delete[].

Explanation of Solution

The following table shows the differences.

    S. No. NewDelete New[]Delete[]
    1.Dynamically allocates memory for a variable or object. Dynamically de-allocates memory for a variable or object. Dynamically allocates memory for an array.Dynamically de-allocates memory for an array.
    2.Arguments passed to initialize class constructorNo arguments needed to be passed to call destructorArguments passed to initialize array size (bytes).No arguments needed to be passed to call destructor.
    3.Memory de-allocation must be done using delete operator.Memory allocation must be done using new operator. Memory deallocation must be done using delete[] operator.Memory allocation must be done using new[] operator.
    4.Returns address of allocated object. Returns void() and sets memory to NULL.Returns address of first element of allocated array.Returns void() and sets all memory to NULL.
    5.For example,
    int *xPtr;
    xPtr= new int;
    For example,
    delete xPtr;
    For example,
    int *xPtr;
    xPtr= new int[10];
    For example,
    Delete[] xptr;

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
(c) Does an integer pointer store an integer itself or something else? (d) What is the purpose of pointers? What do they allow us to do? What would happen if we didn't have pointers?
15. The only way to access data stored in heap memory is through pointer variables malloc () allocation tables а. b. С. d. a buffer memory
(JAVA)Almost a priority queue. Design a data structure that supports the followingoperations for almost a priority queue:(i) FindSecondSmallest() which returns the second smallest item in the data structure.(ii) Insert(x) which inserts item x to the data structure.(iii) DeleteSecondSmallest() which removes the second smallest item from the datastructure.Your data structure should implement the operation FindSecondSmallest() in O(1), andthe other two operations in O(log n), where n is the number of elements in the datastructure.Problem 4: Binomial heaps. Let H1 and H2 be two binomial heaps. We would like tomerge H1 and H2 to obtain the binomial heap H and also to find the minimum key in H.A standard approach would be to perform the following sequence of operationsH = Merge(H1, H2);m = Min(H).Alternatively, we may perform the following sequence of operationsm1 = Min(H1);m2 = Min(H2);m = min{m1, m2};H = Merge(H1, H2).

Additional Engineering Textbook Solutions

Find more solutions based on key concepts
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
1.1 Arrays in Data Structure | Declaration, Initialization, Memory representation; Author: Jenny's lectures CS/IT NET&JRF;https://www.youtube.com/watch?v=AT14lCXuMKI;License: Standard YouTube License, CC-BY
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License