Concept explainers
Pointer in C++:
A pointer is a variable whose value will be another variable’s address. Generally, a pointer variable is declared as follows:
type *var-name;
Here, “type” is the pointer’s base type and “var-name” is the pointer variable name. The asterisk is used to designate a variable as a pointer.
The delete operator:
The delete operator is used to destruct the object that is created with new by deallocating the memory associated with the object.
The syntax of delete operator is as follows:
[] delete cast-expression
[] delete[] cast-expression
In the above statement, the “cast-expression” argument must be a pointer to a block of memory previously allocated for an object created with the new operator.
Given code:
The following code is used to create a dynamic array.
int *entry; //Initialise pointer
entry = new int[10]; //create a dynamic array
Want to see the full answer?
Check out a sample textbook solutionChapter 9 Solutions
Problem Solving With C++ (Looseleaf) - With Access
- What does it mean to say that an address variable is a pointer? In what context is it employed? A dynamic array is an array of constant data. A dynamic array has a relationship to pointers in that it can both contain pointers and have pointers as elements.arrow_forwardWrite a C++ program to create a two-dimensional dynamic array of integers, which stores integer values entered by the user. The user also determines the size of the array by entering the number of the rows and columns. Then, echo the values of the array on the monitor. Use typedef for renaming int * as IntArrayPtr.arrow_forwardWrite a java labguage program to use parallel arrays to save User ID and Password. Ask the user to enter the user ID and Passwords for 3 users Save the above information in two parallel arrays (using the same index for each user) After the input is completed, ask the user to enter any user ID and then ask the password for that ID. Confirm if the User ID and password match, if not ask the passwordarrow_forward
- Please answer the below question for operating system using shell script. write a program in bash that has a user_defined function array_sum that takes each element of array as argument andcalculates their sum. At each step the sum will printed and then the final sum will be printed. For example:Input Array:[2 3 7 9]Output: 2 5 12 21final sum: 21arrow_forwardTalk about the difference of accessing elements in an array VS access the memory address of an array What will happen with the following code: 1: cout << array<<endl; 2: cout << array[0] << endl; Does C++ support Index Out of bound Checking? If so, please explain how that works, if not, explain what will happen if Index Out of bound happens.arrow_forwardFollowing is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7arrow_forward
- Consider the following array: x = [1,2,3,4,5;6,7,8,9,10;11,12,13,14,15;16,17,18,19,20] What Octave command on array x returns a row vector whose first element is the number of rows and the second element is the number of columns of array x?arrow_forwardWhich one of the following function prototype can possible do the following? A function with one reference parameter is a pointer to an integer. The function allocates a dynamic array of n integers, making the pointer point to this new array. It then fills the array with 0 through n - 1. Group of answer choices void exercise(int*& p, size_t n); void exercise(const int*& p, size_t n); void exercise(const int p, size_t n); void exercise(int& p, size_t n); void exercise( int p, size_t n);arrow_forwardWrite a block of code that uses a dynamic allocated array named Array to (1) Load ten integers from the user into the memory, (2) Find the number of negative integers in the array, and (3) Print a message with the number of negatives. Whenever no numbers are negative print an additional message "No negatives!" (Assume all libraries are included)arrow_forward
- Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…arrow_forwardGiven the declaration below, if array aData[][] was associated to the memory location 1010 (in decimal), what is the value/address (in decimal) of the last byte allotted to the 2D array ? double aData[6][4]; Note that sizeof(double) results to 8, meaning 8 bytes.arrow_forwardWrite a C++ program that can delete an element from an array. The user nominates the values to save in the array (as in Assignment 1). The element that has to be removed from the array (nth element) is also provided by the user. The program must ensure that the value for n is valid. After the value has been deleted, the array must be displayed to the user again. Tip: To erase an element, the elements are moved to overwrite the nth element. Note that the array can now save one more position than there are elements. The number of "active" elements in the array must be updated every time.arrow_forward
- 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