C++ How to Program (10th Edition)
10th Edition
ISBN: 9780134448237
Author: Paul J. Deitel, Harvey Deitel
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
QUESTION 6
Which of the following is NOT true? (Choose all that apply)
01. None
II. A dangling pointer is an allocated stack-dynamic pointer variable without any reference.
III. Dangling pointers are harmful for the programs.
OV. A program with memory leak is free from creating garbage.
Language:C
Write the function that produces the largest and smallest elements of an integer array sent to it, in accordance with the main function below. (Access to array elements should be done according to offset-address increment notation.)Sample Run:Biggest : 23Smallest : 0Sample Main................................/*prototip*/int main(){int array[5]={23, 4, 2, 0, 8};int biggest;int smallest;bigSmallFind(.............................)printf("Biggest : %d \n", biggest);printf("Smallest : %d \n", smallest);return 0; }
Part II: Understand Pointers/Dynamic Memory
To-do 2:
Write 3 different functions in C++ to create memory on the heap without causing a memory
leak.
Hint: You will need to assign the address to a pointer that was created outside the function. Remember,
you can return an address or change what a pointer points to (the contents of a pointer) in a function by
passing the pointer by reference or by passing the address of the pointer.
Additional questions:
What if you want to change the contents of what the pointer points to? Make a function that will set
the contents of the space on the heap. Do you still need to pass by reference or the address of the
pointer? Why or why not?
How will you delete the memory off the heap? Try doing it outside a function, and inside a function.
Make sure your delete function is setting your pointer back to NULL, since it is not supposed to be
pointing anywhere anymore.
You can check to see if you have any memory leaks using valgrind.
Svalgrind program_exe…
Chapter 10 Solutions
C++ How to Program (10th Edition)
Ch. 10 - Prob. 10.6ECh. 10 - ( Overloading the Parentheses Operator) One nice...Ch. 10 - (Complex Class) Consider class Complex shown in...Ch. 10 - ( HugeInteger Class) A machine with 32- bit...Ch. 10 - (Rational Number Class) Create a rational Number...Ch. 10 - (Polynomial Class) Develop class polynomial. The...Ch. 10 - Prob. 10.12ECh. 10 - Prob. 10.13E
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
- Language: Java Write the function that produces the largest and smallest elements of an integer array sent to it, in accordance with themain function below. (Access to array elements should be done according to offset-address increment notation.)Sample Run:Biggest : 23Smallest : 0Sample Main................................/*prototip*/int main(){int array[5]={23, 4, 2, 0, 8};int biggest;int smallest;bigSmallFind(.............................)printf("Biggest : %d \n", biggest);printf("Smallest : %d \n", smallest);return 0;}arrow_forwardLanguage: C Write a program that will allocate memory to an array of the size specified by the user at runtime. Use malloc and free. Fill the array, print the elements and calculate the average value. A. In the main function: a) Ask the user for the size of the array. b) Using the malloc function allocate the double array of the size specified by the user. c) Check if the allocation was successful. - If the address returned by malloc is not NULL, use the rand function in a for loop and assign pseudorandom values to the array elements. Then call the function averagevalue. Print the result. Free up memory with the free function. - If the allocation failed and the address returned by malloc is NULL, print the message and exit the program. B. Define the function averagevalue and then call it in main. The function calculates the average value of the elements of the array passed as an argument and prints the array elements to the screen. The function returns the average value. C. Use…arrow_forwardWhat are the disadvantages of arrays?a) Data structure like queue or stack cannot be implementedb) There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated sizec) Index value of an array can be negatived) Elements are sequentially accessedarrow_forward
- 1) memcopy Write a C function memcopy that will copy n integers from one array to another. The function should have 3 parameters: the to array, the from array and the integer n. Generate assembler for this function (using -S) and figure out roughly what it does, including where each variable or parameter is stored and what assembler corresponds to each C statement.arrow_forwardCharacter arrays and pointers in C: I have to search and sort through an EXTREMELY large text file in C using standard libraries. How do I import the text file and then access any character in the file using pointers? I need to be able to access multiple different characters at different positions in the file at once, so using the fgetc() function doesn't help as I can only access 1 character at a time in that order that it is read. The text file is way too big to create an empty char array and store each character and access them that way, so I'm not sure what else I can do. Thanks in advancedarrow_forward(iii) write Operations that can be performed in any application using the dictionary data structure with example and the time estimates.arrow_forward
- Pointer arithmetic. Implement the following:a. Implement a print function with array and size parameters. This function should print the array using pointer arithmetic.b. Overload the print function to accept array, size and index parameters. If the index is between 1 and size-2 inclusive: Use pointer arithmetic to print: 1. the value at index 2. the value previous to the index 3. the value after the index c. Implement a sum function with array and size parameters. This function should return sum of the array, and use pointer arithmetic.d. Implement a average function with array and size parameters. This function shouldreturn average of the array, and use pointer arithmetic.e. Use provided main function to test your functions. ( Do not change the int main the question has provided. Included a snip of the int main function. Output has to be the same as shown in the snips)arrow_forwardLab Task: You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm Write a C program to simulate the MVT and MFT memory management techniques. Write a C program to simulate the following contiguous memory allocation techniques Worst-fit Best-fit First-fit TASK1: DESCRIPTION MFT (Multiprogramming with a Fixed number of Tasks) is one of the old memory management techniques in which the memory is partitioned into fixed size partitions and each job is assigned to a partition. The memory assigned to a partition does not change. MVT (Multiprogramming with a Variable number of Tasks) is the memory management technique in which each job gets just the amount of memory it needs. That is, the partitioning of memory is dynamic and changes as jobs enter and leave the system. MVT is a more ``efficient'' user of resources. MFT suffers with the problem of internal fragmentation and MVT suffers with…arrow_forward(python) 14. Based on the following Sorted List, show the steps of a Binary Search if the search key was -5: Enter the index value for the left, right and comparison. Enter one of the following for the Result answers: Left, Right, Found, Not Found. If there is no value needed in a location, put N/A [ -34, -23, -11, -5, 1, 3, 7, 11, 14, 19, 20, 25, 33, 42 ]arrow_forward
- Q2.(a) Explain data structure Stack with an example? Write C-functions to implement the 2-stack using array.arrow_forwardExplain how to examine the memory address of the pointer directed to.arrow_forwardExercise 1: Memory Allocation in C a) Write a C program which dynamically allocates memory to define an integer 5 x 5 matrix initialized to zero by using the calloc function. Do not forget to free the memory in the end of your program. b) What happens if you attempt to print your matrix before and after freeing memory?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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