0
If the compiler allocated the array at compile time, or if the array was automatically allocated as a local variable, then no, you cannot change its base address at run time. If you allocated the array at run time from the heap, you can change its base address by allocating a new array, copying the old elements from old to new and deleting the old array.
What else can I help you with?
Why does array index begins with 0 not with 1?
It is because array name implies its address and if you want to access first element of it pointer address logic is as below: Arrays first element address = array base address + 0 Arrays second element address = array base address + 1
What is the base address of an array in c program?
the address of variable (pointer) that contains array
Is the base address of a two-dimensional array the address of the first component true or false?
True.
Is the base address of a two dimensional array the address of the first component true or false?
yes
How do you find the address of Three dimenesional array?
let the array be "int a[10][10][10];" the address of this multidimensional array can be extracted by the following codes in printf statement. 1. printf("%p", &a[0][0][0]); 2. printf("%p",a); "a" gives the base-address of array
Which formula you will to calculate The memory address of fifth element of an array?
Awais khanLOC(LA[K]) =base(LA)+w(k-lowerbound)
What is the memory address of some element if the base address is x and each element of the array takes e memory locations?
The memory address of some element if the base address is x, each element of the array takes e memory locations, and the index based zero of the element is i, is x + ie.
What are the commonly use data types with their equivalent size in solving the base address of an array?
int
Why can't we increment an array like a pointer?
once we initialize the array variable, the pointer points base address only & it's fixed and constant pointer
Does mentioning the array name gives the base address in all the contexts?
Mentioning the array name in C or C++ gives the base address in all contexts except one. Syntactically, the compiler treats the array name as a pointer to the first element. You can reference elements using array syntax, a[n], or using pointer syntax, *(a+n), and you can even mix the usages within an expression. When you pass an array name as a function argument, you are passing the "value of the pointer", which means that you are implicitly passing the array by reference, even though all parameters in functions are "call by value". There is, however, one very important distinction. While an array name is referentially the same as a pointer, it is not a pointer in that it does not occupy program referential space in the process. This means that, while you can change the value of a pointer, and thus the address to which it points, you can not change the value of an array name. This distinction is what we call R-Value (array or pointer) as opposed to L-Value (pointer only), i.e. can the object appear on the left sign of an assignment operator.
How are elements of an array stored in memory?
Computer memory is linear so a one dimensional array can be mapped on to the memory cells in rather straight forward manner.To find the actual address of an element one needs to subtract one from the position of the desired entry and then add the result to the address of the the first cell in the sequence.Having said that therefore it is necessary to know the starting address of the space allocated to the array and the size of the each element, which is same for all the elements of an array.The the location of the Ith element would be B+I*S where B is the base address(Starting address of the array) and S is the size of each element of the array.
What is traversing arrays?
Traversing an array simply means visiting every element of the array exactly once. Pointers facilitates this job. A pointer is first created to contain the base address of the array thereby pointing the first element. As the pointer is incremented, it points to the very next element and so on till the last element is visited. Thus the elements are visited sequentially in the same order as they are stored in the array.
