answersLogoWhite

0

Pointers are not structures, non-linear or otherwise. A pointer is a variable that holds a memory address. The primary operation that may be performed upon a pointer is the dereference operator, which allows indirect access to the value stored at the memory address held by the pointer variable. Pointer arithmetic may also be applied to pointers, such that the memory address stored in the pointer may be incremented or decremented in units equal to the size of the pointer's type. Thus a pointer to int where sizeof(int) is 4 would increment or decrement in units of 4 bytes. This pointer arithmetic makes it possible for a pointer to randomly access any element in a contiguous sequence of elements (such as an array) in constant time, thus allowing both linear and non-linear access to those elements. Pointers may also be used to provide links between elements that are stored non-contiguously, thus making it possible to create complex structures such as linked lists, trees, graphs and so on. This is achieved by using a node object to contain the element along with one or more links to other nodes in the sequence, both linearly and non-linearly.

User Avatar

Wiki User

9y ago

What else can I help you with?

Continue Learning about Engineering

What is linear data structure?

when elements are accesed or placed in contiguous memory location yhen data structure is known as linear data structure. stacks, arrays, queues and linklists are example of data structure. in non-linear data structure element are not placed in sequential manner. trees, graph are the ex. of non-linear data structure.


Is String a linear data structure?

yes it is, other linear data structures are lists,queues,stacks,arrays


Which of the following data structure is non liner type?

A non-linear data structure is one in which the elements are not arranged or linked in a linear fashion. Trees, graphs, etc. are non-linear data structure since the elements are arranged in a branching manner.


Difference between linear n nonlinear data structures?

A data structure is linear if every item is related (or attatched) to its previous and next item(e.g.array, linked list) and it is non-linear if every item is attached to many other items in specific ways to reflect relationships(e.g, n-ary tree). In linear data structure data items are arranged in a linear sequence. In non-linear data structure data items are not in a sequence. A different Opinion (learnt while watching a video on Data Structures) is that Linear data structures are the Data structures implemented using arrays (with consecutive data allocation for each member of the array) while Non Linear Data Structure refers to an implementation in terms of use of pointers (such as a linked list). --Research Reqd.--


Difference bw linear and nonlinear data structure?

A data strucutre is classified into two categories: Linear and Non-Linear data strcutures. A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree,etc. There are two ways of represneting linear data strucutresin memory.One way is to have the linear relationship betweent he elements by means of sequential memory locations. Such linear strucutres are called arrays. The other way is to have the linear relationship betweent he elements represnted by means of links.Such linear data strucutres are callled linked list.

Related Questions

What is non linear data strcuture?

A tree is an example for a non-linear data structure.


What is linear data structure?

when elements are accesed or placed in contiguous memory location yhen data structure is known as linear data structure. stacks, arrays, queues and linklists are example of data structure. in non-linear data structure element are not placed in sequential manner. trees, graph are the ex. of non-linear data structure.


Is String is a linear data structure?

yes


What are the two basic ways in representing linear structures in memory?

Data structures are classified as either linear or non linear, a data structure is said to be linear if its elements form a sequence, or, in other words, a linear list, there are two basic ways of representing such linear structures in memory, one way is to have the linear relationship between the elements represented by means of sequential memory locations, these linear structures are called arrays, the other way is to have the linear relationship between the elements represented by means of pointers or links, these linear structures are called linked lists.


Is String a linear data structure?

yes it is, other linear data structures are lists,queues,stacks,arrays


Which of the following data structure is non liner type?

A non-linear data structure is one in which the elements are not arranged or linked in a linear fashion. Trees, graphs, etc. are non-linear data structure since the elements are arranged in a branching manner.


Is double link list a linear data structure?

Yes.


Difference between linear n nonlinear data structures?

A data structure is linear if every item is related (or attatched) to its previous and next item(e.g.array, linked list) and it is non-linear if every item is attached to many other items in specific ways to reflect relationships(e.g, n-ary tree). In linear data structure data items are arranged in a linear sequence. In non-linear data structure data items are not in a sequence. A different Opinion (learnt while watching a video on Data Structures) is that Linear data structures are the Data structures implemented using arrays (with consecutive data allocation for each member of the array) while Non Linear Data Structure refers to an implementation in terms of use of pointers (such as a linked list). --Research Reqd.--


What is the differences between hierarchical and linear structures.?

Linear structure is the most commonly used structure. Linear items are itemized by a single component. This means that besides for the first or last piece of data, something will come before or after it. In hierarchical structure the data is arranged in a tree like structure with several levels. Every entry is equal or less then the its previous.


Difference bw linear and nonlinear data structure?

A data strucutre is classified into two categories: Linear and Non-Linear data strcutures. A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree,etc. There are two ways of represneting linear data strucutresin memory.One way is to have the linear relationship betweent he elements by means of sequential memory locations. Such linear strucutres are called arrays. The other way is to have the linear relationship betweent he elements represnted by means of links.Such linear data strucutres are callled linked list.


Is RAM a linear or nonlinear data structure?

That depends on the computer architecture. Usually, we treat RAM as a linear data structure, with all addresses in one linear address space. But on some architectures RAM is segmented, meaning addresses have both a segment and an address within a segment.


List out the differences between linear and nonlinear data structures?

Linear Data Structure:-A data structure in which every element has got exactly two neighbors or two adjacent elements except two elements having exactly one data element.Non-Linear Data Structure:- In non linear data elements are allowed to have more than two adjacent elements.