Pointer: Pointer is a special type of variable used to store the address of the memory location, which can be accessed later. If an asterisk “” operator is present before the variable, then that variable is referred as pointer variable. It is also called as dereferencing or indirection operator. Pointer is just a type of variable that stores the addresses of other variables. Using pointers, it is easy to access the address of a variable; the data stored in that variable can be retrieved. Syntax of pointer variable declaration: <variable-type> <variable-name>; Define the pointers to structures: Define the pointers to structure is similar to pointer variable declaration. Example: //structure declaration struct student { //variable declaration string name; //dynamically allocate array int score; //variable declaration int total; }; Pointer is the definition to the above defined structure that can be given as follows: //defining the pointer definition student stu1;

Question

Want to see the full answer?

Answer 1

Question

Chapter 10.12, Problem 10.18CP

Program Plan Intro

Pointer:

Pointer is a special type of variable used to store the address of the memory location, which can be accessed later.

If an asterisk “” operator is present before the variable, then that variable is referred as pointer variable.

It is also called as dereferencing or indirection operator.

Pointer is just a type of variable that stores the addresses of other variables.

Using pointers, it is easy to access the address of a variable; the data stored in that variable can be retrieved.

Syntax of pointer variable declaration:

<variable-type> <variable-name>;

Define the pointers to structures:

Define the pointers to structure is similar to pointer variable declaration.

Example:

//structure declaration

struct student

{

    //variable declaration

    string name;

    //dynamically allocate array

    int score;

    //variable declaration

    int total;

};

Pointer is the definition to the above defined structure that can be given as follows:

//defining the pointer definition

student stu1;

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Would it be possible to use unique, shared or weak pointers in the code?

One problem with dynamic arrays is that they don't carry around their size. Create a structure, DynArray which uses a unique pointer for a dynamic array (data), and an int for the size and capacity. dynarray.h #ifndef DYNARRAY_H #define DYNARRAY_H 1 2 3 4 #include #include 7 // Define the DynArray structure here 8 std::ostream& operator>(std::istream& in, DynArray& a); DynArray makeDA (int capacity); 10 11 12 13 #endif memory.cpp 1 #include #include #include "dynarray.h" using namespace std; 2 3 4 int main() { cout « "Array capacity: "; int capacity; cin >> capacity; 7 8 9 10 11 auto a = makeDA (capacity); cout « "Enter up to " > a; 12 13 14 15 16 cout « "a->" « a « endl; 17 }

*Java code* Implement a data structure called RunningTotal supporting the following API: a) RunningTotal() - creates an empty running-total data structure b) void add(int value) - adds the given value to the data structure c) void remove() - removes the least-recently added value d) int sum() - returns the sum of values in the data structure e) double average() - returns the average of values in the data structure Here's a Example: RunningTotal rt = new RunningTotal ();rt . add (1); // 1 ( adds 1 )rt . add (2); // 1 2 ( adds 2 )rt . add (3); // 1 2 3 ( adds 3 )rt . sum (); // 1 2 3 ( returns 6 )rt . add (4); // 1 2 3 4 ( adds 4 )rt . remove (); // 2 3 4 ( removes 1 )rt . sum (); // 2 3 4 ( returns 9 )rt . average (); // 2 3 4 ( returns 3.0 )