Pointer: Pointer will allow the user to indirectly access and manipulate the variable data contents. A pointer variable will hold the address of the data contents. If an asterisk “” operator is present before the variable then that variable is referred as pointer variable. Consider the following statement: //definition of pointer variable int ptrvar; Here the variable “ptrvar” is defined to a pointer variable of integer data type. So, it can store the address of an integer variable. Pointer to constant: When an address of a constant item is passed to a pointer such that no modification can be made to that variables pointer to constants can be used. Example: //definition of pointer to constant variable const int *ptr; Explanation: In the above definition, the variable “ptr” is declared as constant and any change made will not be accepted by the compiler.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9, Problem 62RQE

Program Plan Intro

Pointer:

Pointer will allow the user to indirectly access and manipulate the variable data contents. A pointer variable will hold the address of the data contents. If an asterisk “” operator is present before the variable then that variable is referred as pointer variable.

Consider the following statement:

//definition of pointer variable

int ptrvar;

Here the variable “ptrvar” is defined to a pointer variable of integer data type. So, it can store the address of an integer variable.

Pointer to constant:

When an address of a constant item is passed to a pointer such that no modification can be made to that variables pointer to constants can be used.

Example:

//definition of pointer to constant variable

const int *ptr;

Explanation:

In the above definition, the variable “ptr” is declared as constant and any change made will not be accepted by the compiler.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Step1: Write Stack Java Interface Step 2: Create an ArrayStack class that implements the interface methods

SKELETON CODE IS PROVIDED ALONG WITH C AND H FILES. #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stdbool.h> #include "node.h" #include "stack_functions.h" #define NUM_VERTICES 10 /** This function takes a pointer to the adjacency matrix of a Graph and the size of this matrix as arguments and prints the matrix */ void print_graph(int * graph, int size); /** This function takes a pointer to the adjacency matrix of a Graph, the size of this matrix, the source and dest node numbers along with the weight or cost of the edge and fills the adjacency matrix accordingly. */ void add_edge(int * graph, int size, int src, int dst, int cost); /** This function takes a pointer to the adjacency matrix of a graph, the size of this matrix, source and destination vertex numbers as inputs and prints out the path from the source vertex to the destination vertex. It also prints the total cost of this…

Java/Data Structures: The public ArrayList() constructor in the Java Class Library ArrayList creates an empty list with an initial capacity of ____. Multiple choice. A) 0 B) 1 C) 10 D) 100