Problem Solving with C++ (10th Edition)
10th Edition
ISBN: 9780134448282
Author: Walter Savitch, Kenrick Mock
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 9.1, Problem 6STE
Suppose a dynamic variable were created as follows:
| char *p; p = net* char; |
Assuming that the value of the pointer variable p has not changed (so it still points to the same dynamic variable), how can you destroy this new dynamic variable and return the memory it uses to the freestore so that the memory can be reused to create new dynamic variables?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
28.
Which statement of the following is the most appropriate?
Group of answer choices
The size of a dynamic array needs to be determined at compilation. Such behavior, determined at compile time, is called dynamic behavior. Dynamic behavior is more flexible than decisions that are made at run time (i.e., static behavior).
The size of a dynamic array does not need to be determined until a program is running. Such behavior, determined at run time, is called dynamic behavior. Dynamic behavior is more flexible than decisions that are made at compile time (i.e., static behavior).
The size of a dynamic array does not need to be determined until a program is running. Such behavior, determined at run time, is called static behavior. Static behavior is more flexible than decisions that are made at compile time (i.e., dynamic behavior).
The size of a dynamic array does not need to be determined until a program is running. Such behavior, determined at run time, is called static…
Differences between void and NULL pointers are as follows: Provide relevant instances to back up your claim.
Write a C++ program that will implement and test the five functions described below that use pointers and dynamic memory allocation.
The Functions:
You will write the five functions described below. Then you will call them from the main function, to demonstrate their correctness.
findLast: takes an array of integers, its size and a target integer value. Returns an index of the last occurrence of the target element in the array. If the target value doesn't exist, returns -1. For this function only: Do not use square brackets anywhere in the function, not even the parameter list (use pointer notation instead).
nextFibonacci. Modify the following function to use pointers as parameters (instead of reference parameters). The Fibonacci sequence is a series of numbers where each number is the addition of the previous two numbers, starting with 0, and 1 (specifically: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55…). This function updates the given i-th and (i+1)-st Fibonacci numbers to (i+1)-st and…
Chapter 9 Solutions
Problem Solving with C++ (10th Edition)
Ch. 9.1 - Prob. 1STECh. 9.1 - Prob. 2STECh. 9.1 - Give at least two uses of the operator. State...Ch. 9.1 - Prob. 4STECh. 9.1 - Prob. 5STECh. 9.1 - Suppose a dynamic variable were created as...Ch. 9.1 - Write a definition for a type called NumberPtr...Ch. 9.1 - Prob. 8STECh. 9.2 - Write a type definition for pointer variables that...Ch. 9.2 - Suppose your program contains code to create a...
Ch. 9.2 - Prob. 11STECh. 9.2 - Prob. 12STECh. 9.2 - What is the output of the following code fragment?...Ch. 9.2 - What is the output of the following code fragment?...Ch. 9.2 - What is the output of the following code fragment?...Ch. 9 - Prob. 1PCh. 9 - Write a program that asks the user to input an...Ch. 9 - Palindrome testing with pointers This Practice...Ch. 9 - Do Programming Project 3 in Chapter 7 in this...Ch. 9 - Do Programming Project 11 in Chapter 7 using a...Ch. 9 - Write a function that takes a C string as an input...Ch. 9 - Prob. 5PPCh. 9 - One problem with dynamic arrays is that once the...Ch. 9 - Prob. 7PPCh. 9 - Write a program that outputs a histogram of...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Demonstrate each of the anomaly types with an example.
Modern Database Management
Write a simple assignment statement with one arithmetic operator in some language you know. For each component ...
Concepts Of Programming Languages
Give an example of a variable declaration that will store the name of your favorite food
Starting out with Visual C# (4th Edition)
Redefine the method getDataAtCurrent in StringLinkedListWith Iterator (Listing 12.9) so that it throws an excep...
Java: An Introduction to Problem Solving and Programming (8th Edition)
Suppose you have a chess program that can evaluate 10 million nodes per second. Decide on a compact representat...
Artificial Intelligence: A Modern Approach
List for advantages of SQL-invoked routines.
Modern Database Management (12th Edition)
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.Similar questions
- Differentiate between null andwild pointer and also tell thathow you overcome thesituation of wild pointer that itis pointing any memorylocation.arrow_forwardC++ LANGUAGE In this assignment, you will be writing two objects to heuristically compare the performance of the bubble sort, selection sort, and insertion sort algorithms. To do this, a “Timer” object will be created and compositionally related to a storage class that will load the file contents, execute the sorts in an unbiased manner, handle any memory allocations that need to be made in order to do this, and reports back the execution times of each algorithm on the provided input files for that machine. First you will need to make a Timer object. This object should function like a traditional stopwatch with methods for starting, stopping, resetting, and reporting back times. The design of the object itself is up to you (it should minimally contain methods for the aforementioned ideas), but it must consist of a solitary object that provides interfaces appropriate for being compositionally included as part of a sorting object to facilitate the timekeeping portion of this exercise.…arrow_forwardThe block is practically a square-size placeholder for the Tile objects. But not all the spots are necessarily occupied. When the block is generated, we randomly pick the spots that will be filled in with tiles. All the tiles of a block must have the same color. write the code for these functions below private DynamicArray<DynamicArray<Tile>> block; // the internal storage of the block data public Block(int y, int x, int size) // this contructor creates a 2D placeholder of null value; //these values will be populated later with calls to setTile() public Block(int y, int x, int size, byte color) // overloaded constuctor that creates a 2D matrix with actual tile objects; //no need to call setTile afterwardsarrow_forward
- There is a class Team, that holds information about the team name, number of players in the team, and player’s code. Design the constructor function that decides the number of player in the team and initializes code for each player. Create a team and display its all data. (Implement dynamic memory allocation).arrow_forwardIn C++, Write a program that will inputstudent’s information (i.e. name, id, cgpa) who have enrolled forCSE-207 course in Spring 2022. You have to declare a pointer variable to inputthe information and dynamically allocate memory for storing information of eachstudents. You have to implement the following operation.i) Create a list with the given studentsinformationii) Delete a student of a given idiii) Print the student having highest CGPAiv) Sort and print the student id and namedescending order based on the CGPA.arrow_forwardAn array is a container object that holds a fixed number of values of a single type. To create an array in C, we can do int arr[n];. Here, arr, is a variable array which holds up to integers. The above array is a static array that has memory allocated at compile time. A dynamic array can be created in C, using the malloc function and the memory is allocated on the heap at runtime. To create an integer array, of size , int *arr = (int*)malloc(n * sizeof(int)), where points to the base address of the array. When you have finished with the array, use free(arr) to deallocate the memory. In this challenge, create an array of size dynamically, and read the values from stdin. Iterate the array calculating the sum of all elements. Print the sum and free the memory where the array is stored. While it is true that you can sum the elements as they are read, without first storing them to an array, but you will not get the experience working with an array. Efficiency will be required later.…arrow_forward
- Pointer variables are just that. Why? What is "dynamic array"? What's their relationship?arrow_forwardIn C programming: Write a main() function using the following requirements:• Define a SIZE constant (the value is irrelevant, but for testing, you may want to keep it small enough – no bigger than 5)• Create an array of course pointers using SIZE• Dynamically allocate each element of the array• Call inputAllCourses()• Call printAllCourses().arrow_forwardWhat is the difference between 'delete' and 'deletel' in C++? Select one: a.delete is the correct operator, but deletel operator does not exist b.delete is used to delete automatic objects whereas deletel is used to delete pointer objects c.delete is used to delete single dynamic object whereas deletel is used to delete dynamic array objects d.delete is a keyword whereas delete] is an identifierarrow_forward
- in C++... kth Element Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the definitions of these functions in the class linkedListType. PLEASE DON'T reject this question, this is the whole question that I have... so please do it however u can, Thank you!arrow_forwardWrite a C++ code for a function that creates a one-dimensional dynamic array to emulate a two-dimensional array and returns a pointer to the one-dimensional dynamic array. int* EmulatedTwoDimensionalArray(int DesiredRows, int DesiredColumns). Therefore, int ptr=EmulatedTwoDimensionalArray(4,6); would be the same as int ptr[4][6]; Also, write a driver to test this function.arrow_forward1- The FloatArray class stores a dynamic array of floats and its size. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the array elements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add to the array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size. - An add method that adds a float at the front of the array.4- The PositiveArray that inherits from SortedArray. It has:- A parameterized constructor…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Instruction Format (With reference to address); Author: ChiragBhalodia;https://www.youtube.com/watch?v=lNdy8HREvgo;License: Standard YouTube License, CC-BY