Problem Solving With C++ (Looseleaf) - With Access
9th Edition
ISBN: 9780133835267
Author: SAVITCH
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
Someone tries to fix the stack based buffer overflow problem as follows, is it secure now? why? Are there any other issues within the function's implementation below? Explain your reasoning.
int bof(char *str, int size)
{
char *buffer = (char *) malloc(size);
strcpy(buffer, str);
return 1;
}
What does it mean to have a pointer variable? What are you hoping to accomplish with it? What exactly is a dynamic array, and how does its functionality manifest itself? Where can I get more information on dynamic arrays and pointers?
Someone tries to fix the stack based buffer overflow problem as follows, is it secure now? why? Are there any other issues within the function's implementation below?
int bof(char *str, int size)
{
char *buffer = (char *) malloc(size);
strcpy(buffer, str);
return 1;
}
Chapter 9 Solutions
Problem Solving With C++ (Looseleaf) - With Access
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
- Write a C program that uses the following: a main() to read two integer values from the user, val1 and val2, and prints the returned value from swap().a swap() that uses call by reference (takes the addresses into pointers) to swap values, and prints their values after the swap "num1 = # and num2 = #". This function returns the largest of the two values. If these are equal, it returns their sum.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_forwardProgram this in java the state and variable display must be:Unsorted Partition Reference Index: 0, Traversing Index: 7, Current Traversing Index Value: mango, Next Index Value: plum, Swapping Condition: FalseCurrent Array: ['apple', 'avocado', 'orange', 'banana', 'strawberry', 'pineapple', 'plum', 'mango'] The input:["apple", "avocado", "orange", "banana", "strawberry", "pineapple", "plum", "mango"]Note:The sorted partition is on the left side. Then, the order is increasing based on the number of vowels of a string.the output must be like this:['plum', 'apple', 'strawberry', 'mango', 'orange', 'banana', 'avocado', 'pineapple']arrow_forward
- In C++, how simple is it to duplicate an array of shared pointers into a new array? Create a list of potential solutions to the issue at hand. Do the objects controlled by a shared pointer also get copied when it's copied? Explainarrow_forwardIn what ways does a pointer variable differ from a regular variable? So what is its purpose, exactly? When and why would you use a dynamic array? So, how do pointers relate to a dynamic array?arrow_forwardI'm having a hard time seeing the problem with this buffer overflow problem can someone please elaborate if its secure or not, and if there are any other issues with the implementation in the problem? Someone tries to fix the stack based buffer overflow problem as follows, is it secure now? why? Are there any other issues within the function's implementation below? Explain your reasoning. int bof(char *str, int size) { char *buffer = (char *) malloc(size); strcpy(buffer, str); return 1; }arrow_forward
- Demonstrate how the gdb debugger can be utilized in aiding the establishment of Pointer assignment error language： C Perform debugging in Ubuntu Linux 16, i.e. Use only the gdb debugger. give the following screenshots：1code 2load program to gdb 3set break point 4fixed code 5load proggram ingdb again with fixed codearrow_forwardWrite a program in C++ that reads data from a file. Create dynamic memory according to the data. Now your task is to perform the following task. Row wise Sum Column wise Sum Diagonal wise Sum Example data.txt 4 5 1.6 10.2 33.7 99 20.5 3 44 50 96.1 2 8 9 4 74 50 99 19.1 Output: Sum row wise: 165, 191, 17, 242.1 Sum col wise: 127.6, 120.1, 228.8, 118.1, 20.5 Sum diagonal wise: Not Possible Note: You are restricted to use pointers and your function should be generic as we discussed in class. Avoid memory wastage, memory leakage, dangling pointer. Use regrow or shrink concepts if required.arrow_forwardWrite a program to find the number of times that a given word occurs in a sentence using pointers. Read data from standard input. The first line is a single word, which is followed by general text on the second line. Read both up to a new line character, and insert a terminating null before processing. Typically output should be : The word is “ the ”. The sentence is “ the cat on the mat “ . The word occurs 2 times.arrow_forward
- Write a Java program that interacts with a user to process information retrieval queries. Your program should prompt the user for a data directory, then a query, then display the documents that contain the query term. The documents should be ranked in order of their TF-IDF score. There are several tasks that must be completed to complete this assignment. First, prompt for the directory containing the collection of data as with the earlier assignments. Then, you will need to build an inverted index or incidence matrix. Each entry in the inverted index should consist of a vocabulary word, the word’s document frequency, and the word’s postings. Each posting should contain a document ID and the term frequency of the word with respect to the document. Alternatively, you may build a (non-boolean) incidence matrix. This would contain a table where each row corresponds to a vocabulary word, and each column corresponds to a document. Each cell in the table contains the term frequency (which is…arrow_forwardyou are to design a printer queue that is responsible for handling the printing requests coming from different users. You have to take into consideration that users have different levels of priorities. Each user has an identification number and a password, in addition to printing priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every printing request received, the program should check the priorities of that request and whether it can be moved forward in the queue to be served by the printer prior to serving the other requests. Using the programming language of your choice (preferably C++), write the printer queue that would handle the user request. The program must allow for requests coming from different users or from one user. Note: I need a working C++ code for this problem, and i need priorities.arrow_forwardWrite a program in C++ that contains code addressing the following: (New code and with detailed steps!) a. Create an integer array of 100,000 items (static binding – before compiling) b. Create the same large array on the run time stack (in a function) c. Create the same large array from the heap (dynamic memory – dynamic binding). Call each of the subprograms 1,000,000 times and output the time required by each to finish all 1,000,000 calls. Which was the fastest? Here is code for calling time. #include <time.h> //in main() clock_t start = 0, end = 0; //variables start = clock(); //calls time function stores result in start end = clock(); // calls time function stores result in end //display the time by subtracting the start from the end //displays in clock ticks.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Instruction Format (With reference to address); Author: ChiragBhalodia;https://www.youtube.com/watch?v=lNdy8HREvgo;License: Standard YouTube License, CC-BY