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: int main() { cout << endl; int size, newSize: cout<<"Enter a size: "; cin>> size: cout << endl; int p new int[size](); cout << "Original: "<>newsize: cout << endl; p grow(p, size, newSize); cout << "After grow: " << endl; print(p, newSize); printMemory(p, newSize); cout << endl; return 0; Output Example: Enter a size: 5 Original: 01234 0x7f970bd04080 0x71970bd04084 ex71970bd04088 0x7f970bd0408c 0x71970bd04090 Enter a new size: 3 Inside grow: 012 ex71970bd040a0 0x7f970bd040a4 0x7f970bd840a8 After grow: 012 ex7f970bd040a0 0x71970bd040a4 0x7f970bd040a8 Use following main function to test your program. int main() { cout << endl; int size, newSize; cout<<"Enter a size:"; cin>> size; cout << endl; int "p= new int[size](); cout << "Original: "<> newSize; cout << endl; p=grow(p, size, newSize); cout << "After grow: "<
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: int main() { cout << endl; int size, newSize: cout<<"Enter a size: "; cin>> size: cout << endl; int p new int[size](); cout << "Original: "<>newsize: cout << endl; p grow(p, size, newSize); cout << "After grow: " << endl; print(p, newSize); printMemory(p, newSize); cout << endl; return 0; Output Example: Enter a size: 5 Original: 01234 0x7f970bd04080 0x71970bd04084 ex71970bd04088 0x7f970bd0408c 0x71970bd04090 Enter a new size: 3 Inside grow: 012 ex71970bd040a0 0x7f970bd040a4 0x7f970bd840a8 After grow: 012 ex7f970bd040a0 0x71970bd040a4 0x7f970bd040a8 Use following main function to test your program. int main() { cout << endl; int size, newSize; cout<<"Enter a size:"; cin>> size; cout << endl; int "p= new int[size](); cout << "Original: "<> newSize; cout << endl; p=grow(p, size, newSize); cout << "After grow: "<
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%
C++
Hi there! I had troubling answering both of these review questions, the main function was just not working right for me. Would be very much appreciated if both of these questions could be answered. Thank you very much.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
Knowledge Booster
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.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