There is a close association between pointers and arrays. Recall that an array variable is actually a pointer variable that points to the first indexed variable of the array. Array elements can be accessed using pointer notation as well as array notion. One problem with static arrays is that we must specify the size of the array when we write the program. This may cause two different problems: (1) we may create an array much larger than needed; or (2) we may create one that is smaller than what is needed. In general, this problem is created because we do not know the size of the array until the program is run. This is where dynamic arrays can be used. The new expression can be used to allocate an array on the freestore. Since array variables are pointer variables, you can use the new operator to create dynamic variables that are arrays and treat these dynamic array variables as if they were ordinary arrays. Array elements can also be accessed using pointer notation as well as array notation. Now, write a program to compute the maximum value in a dynamic array. Look over class notes and older array problems to see how you wrote a similar program for a static array, the logic will remain the same. Recall that to access element i in an array arr, we can use the pointer notation: *(arr + i) that is equivalent to arr[i]. Specifically, modify the program as follows: • Using an integer variable, prompt for and read in the size of the dynamic array. • Create a dynamic array numlist (using the new operator) of the size specified by the user. • Read in the values for the array using pointer notation inside a for loop. • Write and call a programmer defined function to compute the maximum value of your dynamic array. Your main function needs to pass the dynamic array and the size of the array to function. The function must return the maximum value of the dynamic array. Note that all your comparison and assignment operations needs to use pointer notation. • Display the maximum value with a suitable message. • And finally, delete the dynamic array once we are done with it.

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
icon
Related questions
Question

There is a close association between pointers and arrays. Recall that an array variable is
actually a pointer variable that points to the first indexed variable of the array. Array
elements can be accessed using pointer notation as well as array notion.
One problem with static arrays is that we must specify the size of the array when we write
the program. This may cause two different problems: (1) we may create an array much
larger than needed; or (2) we may create one that is smaller than what is needed. In
general, this problem is created because we do not know the size of the array until the
program is run. This is where dynamic arrays can be used. The new expression can be used
to allocate an array on the freestore. Since array variables are pointer variables, you can
use the new operator to create dynamic variables that are arrays and treat these dynamic
array variables as if they were ordinary arrays. Array elements can also be accessed using
pointer notation as well as array notation.
Now, write a program to compute the maximum value in a dynamic array. Look over class
notes and older array problems to see how you wrote a similar program for a static array,
the logic will remain the same. Recall that to access element i in an array arr, we can use
the pointer notation: *(arr + i) that is equivalent to arr[i].
Specifically, modify the program as follows:
• Using an integer variable, prompt for and read in the size of the dynamic array.
• Create a dynamic array numlist (using the new operator) of the size specified by
the user.

• Read in the values for the array using pointer notation inside a for loop.
• Write and call a programmer defined function to compute the maximum value of
your dynamic array. Your main function needs to pass the dynamic array and the
size of the array to function. The function must return the maximum value of the
dynamic array. Note that all your comparison and assignment operations needs to
use pointer notation.
• Display the maximum value with a suitable message.
• And finally, delete the dynamic array once we are done with it. 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education