1. Implement and grow a dynamic array using pointer arithmetic. a) Use the provided main function (see below). b) Implement a populate function which stores values from 0 to size into the array p using pointer arithmetic to access array locations. c) Implement a print function which prints the values of the array p using pointer arithmetic. d) Implement a printMemory function which prints the memory addresses of all elements in array p using pointer arithmetic. e) Implement a grow function which resizes the existing array from the initial size to a new size using pointer arithmetic. f) Verify via the output that the new array is a distinct memory space from the original array. Main Output Example int main( ) { cout <« endl; Enter a size: 3 int size, newSize; cout <« "Enter a size: "; cin >> size; original: 0 1 2 0x7fc2ald0000 0x7fc2a1d00004 cout <« endl; 0x7fc2ald00008 int *p = new int[size](); cout <« "Original: populate(p, size); print(p, size); printMemory(p, size); << endl; Enter a new size: 5 Inside grOw : 0 1 2 0 0 0x7fc2ale00000 0x7fc2ale@0004 0x7fc2 ale00008 0x7fc2ale0000c cout <« endl; cout « "Enter a new size: "; cin >> newSize; cout << endl; 0x7fc2ale00010 grow(p, size, newSize); cout <« "After grow: print(p, newSize); printMemory(p, newSize); After gr ow: 0 1 2 0 0 0x7fc2 ale00000 0x7fc2ale00004 0x7fc2ale00008 0x7fc2ale0000c 0x7fc2a1e00010 « endl; cout « endl; return 0;
1. Implement and grow a dynamic array using pointer arithmetic. a) Use the provided main function (see below). b) Implement a populate function which stores values from 0 to size into the array p using pointer arithmetic to access array locations. c) Implement a print function which prints the values of the array p using pointer arithmetic. d) Implement a printMemory function which prints the memory addresses of all elements in array p using pointer arithmetic. e) Implement a grow function which resizes the existing array from the initial size to a new size using pointer arithmetic. f) Verify via the output that the new array is a distinct memory space from the original array. Main Output Example int main( ) { cout <« endl; Enter a size: 3 int size, newSize; cout <« "Enter a size: "; cin >> size; original: 0 1 2 0x7fc2ald0000 0x7fc2a1d00004 cout <« endl; 0x7fc2ald00008 int *p = new int[size](); cout <« "Original: populate(p, size); print(p, size); printMemory(p, size); << endl; Enter a new size: 5 Inside grOw : 0 1 2 0 0 0x7fc2ale00000 0x7fc2ale@0004 0x7fc2 ale00008 0x7fc2ale0000c cout <« endl; cout « "Enter a new size: "; cin >> newSize; cout << endl; 0x7fc2ale00010 grow(p, size, newSize); cout <« "After grow: print(p, newSize); printMemory(p, newSize); After gr ow: 0 1 2 0 0 0x7fc2 ale00000 0x7fc2ale00004 0x7fc2ale00008 0x7fc2ale0000c 0x7fc2a1e00010 « endl; cout « endl; return 0;
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
![1. Implement and grow a dynamic array using pointer arithmetic.
a) Use the provided main function (see below).
b) Implement a populate function which stores values from 0 to size
into the array p using pointer arithmetic to access array locations.
c) Implement a print function which prints the values of the array
p using pointer arithmetic.
d) Implement a printMemory function which prints the memory addresses
of all elements in array p using pointer arithmetic.
e) Implement a grow function which resizes the existing array from
the initial size to a new size using pointer arithmetic.
f) Verify via the output that the new array is a distinct memory space
from the original array.
Main
Output Example
int main( ) {
cout <« endl;
Enter a size: 3
int size, newSize;
cout <« "Enter a size: ";
cin >> size;
original:
0 1 2
0x7fc2ald0000
0x7fc2a1d00004
cout <« endl;
0x7fc2ald00008
int *p = new int[size]();
cout <« "Original:
populate(p, size);
print(p, size);
printMemory(p, size);
<< endl;
Enter a new size: 5
Inside grOw :
0 1 2 0 0
0x7fc2ale00000
0x7fc2ale@0004
0x7fc2 ale00008
0x7fc2ale0000c
cout <« endl;
cout « "Enter a new size: ";
cin >> newSize;
cout << endl;
0x7fc2ale00010
grow(p, size, newSize);
cout <« "After grow:
print(p, newSize);
printMemory(p, newSize);
After gr ow:
0 1 2 0 0
0x7fc2 ale00000
0x7fc2ale00004
0x7fc2ale00008
0x7fc2ale0000c
0x7fc2a1e00010
« endl;
cout « endl;
return 0;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc45072c9-820f-4d06-bb43-63ea77dc776c%2F584562f5-f1ca-4ad8-810d-11c8b8d9f201%2Foztti7c.png&w=3840&q=75)
Transcribed Image Text:1. Implement and grow a dynamic array using pointer arithmetic.
a) Use the provided main function (see below).
b) Implement a populate function which stores values from 0 to size
into the array p using pointer arithmetic to access array locations.
c) Implement a print function which prints the values of the array
p using pointer arithmetic.
d) Implement a printMemory function which prints the memory addresses
of all elements in array p using pointer arithmetic.
e) Implement a grow function which resizes the existing array from
the initial size to a new size using pointer arithmetic.
f) Verify via the output that the new array is a distinct memory space
from the original array.
Main
Output Example
int main( ) {
cout <« endl;
Enter a size: 3
int size, newSize;
cout <« "Enter a size: ";
cin >> size;
original:
0 1 2
0x7fc2ald0000
0x7fc2a1d00004
cout <« endl;
0x7fc2ald00008
int *p = new int[size]();
cout <« "Original:
populate(p, size);
print(p, size);
printMemory(p, size);
<< endl;
Enter a new size: 5
Inside grOw :
0 1 2 0 0
0x7fc2ale00000
0x7fc2ale@0004
0x7fc2 ale00008
0x7fc2ale0000c
cout <« endl;
cout « "Enter a new size: ";
cin >> newSize;
cout << endl;
0x7fc2ale00010
grow(p, size, newSize);
cout <« "After grow:
print(p, newSize);
printMemory(p, newSize);
After gr ow:
0 1 2 0 0
0x7fc2 ale00000
0x7fc2ale00004
0x7fc2ale00008
0x7fc2ale0000c
0x7fc2a1e00010
« endl;
cout « endl;
return 0;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 1 images
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education