0
Write down the equivalent pointer expression for referring the same element aijkl?
Add your answer:
Earn +20 pts
Difference between pointer to constant and constant pointer?
1. pointer to a constant means you can not change what the pointer points to 2. constant pointer means you can not change the pointer.
Define pointer to pointer in c?
Double (**) is used to denote the double pointer. As we know the pointer stores the address of variable, Double pointer stores the address of any pointer variable. Declaration : int **ptr2Ptr;
What is scale factor in pointer?
When we increment the pointer its value is increased by the length of the data type that it points to.
Which pointer selects a line or lines of text and appears when you point to the left edge of a line of text?
Right -pointing arrow pointer.
What shape is the pointer when it is inside a text placeholder?
I
What is top pointer of stack?
top pointer of a stack is the pointer that refers to the top most element of the stack.
What is list?
Each element has a pointer to the next element, except for the last one.
What is singling?
Each element has a pointer to the next element, except for the last one.
What is single list?
Each element has a pointer to the next element, except for the last one.
What is the time taken to insert an element after an element pointed by some pointer?
Constant time.
What is pointer to pointer with examle?
int main (int argc, char **argv):Hereargv is a pointer to a pointer (points to the first element of a pointer-array)argv[0] is a pointer (points to the first character of a string)argv[0][0] is a character
What is link list and type of link list?
A linked list is a set of elements, usually structures, where each element contains a pointer or index to the "next" element, along with the data represented by the element.Often, the elements are allocated from the heap. Sometimes, a fixed number of elements is contained in an array. In the first case, pointers are used. In the second case, indices are used.Types of linked lists are ... In an array implementation, read pointer as index.Singly linked - there is a head pointer, and one next pointer per element. The last element's pointer is null. This type of list can be traversed in only one direction.Doubly linked - there is a head pointer, and each element contains two pointers, one to the previous element and one to the next element. This type of list can be traversed in two directions, making insertion and deletion a bit easier, at the cost of extra memory.Circularly linked - the same as Singly or Doubly linked, except that the last element's pointer points back to the first element's pointer. These types of lists are often used as queues.
Time taken to insert an element after an element pointed by some pointer in data structure?
O(n)
How do you return an array from function?
By returning a pointer to the first element of the array.
What is the term for positioning the mouse pointer over a Windows element?
drag.
What is the term for positioning the mouse pointer over a window element?
drag.
What pointer points to the next free element?
Presumably you are referring to the next unused element of an array. If your array contains unused elements then it is up to you, the programmer, to keep track of them. Typically you will do this by placing all unused elements at the end of the array. Knowing the array's overall capacity (in elements) and the number of elements that are currently in use, it is trivial to compute the address of the next free element; there is no need to maintain a separate pointer. Perhaps you are referring to the (call) stack pointer. Call stacks are defined by the system. In 8086 architecture, the call stack is a fixed-length region of contiguous memory addresses allocated to a thread (every thread has its own call stack). The call stack extends downwards into lower memory addresses. The stack pointer (SP) register refers to the last element pushed onto the stack (the lowest used address). Note that it cannot possibly refer to the next unused element given that the length of an unused element cannot be determined until an element is actually pushed onto the stack. That is, if the element being pushed were 2 addresses (or bytes) in length, the SP will be decremented by 2 addresses and the new element will be placed at the new address. When we subsequently pop that element, the SP is simply incremented by 2 addresses.
