answersLogoWhite

0


Best Answer

A pointer in a data table is a reference that points to the location of a specific data element in the table. It provides a way to access and manipulate the data efficiently by indicating where the data is stored in memory. Pointers are commonly used for navigation and accessing elements in data structures like arrays or linked lists.

User Avatar

AnswerBot

2w ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What does a pointer in a data table do?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is uninitialised pointer?

A pointer is an address or the name for the location for an item of data. An uninitialised pointer is one that has not been assigned an initial value or item of data.


Difference between void pointer and null pointer?

A Null pointer has the value 0. void pointer is a generic pointer introduced by ANSI. Before ANSI, char pointers are used as generic pointer. Generic pointer can hold the address of any data type. Pointers point to a memory address, and data can be stored at that address.


Difference between genric pointer and normal pointer?

Generic pointer of type 'void *' is compatible with any (data-)pointer, but you cannot use the following operators on it: + - ++ -- += -= * -> []


What is use of pointer?

Storing address of data.


Why you use float pointer instead of integer pointer?

It depends on what type of data you wish to manipulate.


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.


What is a data table?

a data table is a table to place your observations


What is difference between pointer and structures?

pointer data type that carry address:of data type that has no name but both of them must have same data type. structures you can make your own data type: struct name put any data type you wants any functions.


Write a c program to insert an element in the beginning at the end at the specified position in a linear linked list?

#include<stdio.h> #include<stdlib.h> typedef struct Node { int data; struct Node *next; }node; void insert(node *pointer, int data) { /* Iterate through the list till we encounter the last node.*/ while(pointer->next!=NULL) { pointer = pointer -> next; } /* Allocate memory for the new node and put data in it.*/ pointer->next = (node *)malloc(sizeof(node)); pointer = pointer->next; pointer->data = data; pointer->next = NULL; } int find(node *pointer, int key) { pointer = pointer -> next; //First node is dummy node. /* Iterate through the entire linked list and search for the key. */ while(pointer!=NULL) { if(pointer->data == key) //key is found. { return 1; } pointer = pointer -> next;//Search in the next node. } /*Key is not found */ return 0; } void delete(node *pointer, int data) { /* Go to the node for which the node next to it has to be deleted */ while(pointer->next!=NULL && (pointer->next)->data != data) { pointer = pointer -> next; } if(pointer->next==NULL) { printf("Element %d is not present in the list\n",data); return; } /* Now pointer points to a node and the node next to it has to be removed */ node *temp; temp = pointer -> next; /*temp points to the node which has to be removed*/ pointer->next = temp->next; /*We removed the node which is next to the pointer (which is also temp) */ free(temp); /* Beacuse we deleted the node, we no longer require the memory used for it . free() will deallocate the memory. */ return; } void print(node *pointer) { if(pointer==NULL) { return; } printf("%d ",pointer->data); print(pointer->next); } int main() { /* start always points to the first node of the linked list. temp is used to point to the last node of the linked list.*/ node *start,*temp; start = (node *)malloc(sizeof(node)); temp = start; temp -> next = NULL; /* Here in this code, we take the first node as a dummy node. The first node does not contain data, but it used because to avoid handling special cases in insert and delete functions. */ printf("1. Insert\n"); printf("2. Delete\n"); printf("3. Print\n"); printf("4. Find\n"); while(1) { int query; scanf("%d",&query); if(query==1) { int data; scanf("%d",&data); insert(start,data); } else if(query==2) { int data; scanf("%d",&data); delete(start,data); } else if(query==3) { printf("The list is "); print(start->next); printf("\n"); } else if(query==4) { int data; scanf("%d",&data); int status = find(start,data); if(status) { printf("Element Found\n"); } else { printf("Element Not Found\n"); } } } }


What can be used to draw a proposed table's size?

pencil pointer


What Can be used to draw proposed table's size?

pencil pointer


In C programming what is pointer?

Simply put, a pointer is a memory address. It "points" to data at that address. The Data Type of the pointer tells the program how to interpret the data at the address. For example, a character pointer will read the data at the address as a byte and interpret it as a character (like an ASCII character, for instance). A string pointer is just like a character pointer, except that it starts reading characters at the address and keeps going until it encounters a null (a data value of zero). The "string" of characters is interpreted as text. The available data types include just about anything you can imagine. Intrinsic types, structures, functions... in later versions of C, pointers can point to objects.