0
An ordered list of data in any programming language is simply a sorted array or list. In C++ this can either mean a sorted array, vector, list or forward list.
Wiki User
∙ 10y ago
Add your answer:
Earn +20 pts
Role of data structure to insert an element in the data structure?
using data structure an element can insert at any position easily. with out traversing through the entire list.
What is the difference between linked list and Ordinary list?
A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.
Mini project on employee database using linked list on c language code?
mini project data structure
Can implement circular lists using stack?
No. A stack is a data structure that allows insertion and removal at the top. A circular list allows insertion and removal anywhere in the list. The two types of data structure are too different to be reasonably implementable in terms of each other.
How data structure can influence program performance?
Greatly. Certainly, a person with data structures orientation will write better structure code. Imagine yourself is asked to write adding to big integers numbers having 200 digits? Using long also we can not do this. By employing linked list type data structure we can achieve this. This is an example only.
Role of data structure to insert an element in the data structure?
using data structure an element can insert at any position easily. with out traversing through the entire list.
What is the difference between linked list and Ordinary list?
A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.
Mini project on employee database using linked list on c language code?
mini project data structure
What is the difference between data structure and abstract data type?
An Abstract Data Type is an interface that interacts with a data structure. A Data Structure is an implementation of the ADT. for example. If you were going to create a linked list you would create an Interface listing all the methods required by the list. Then in the linked list class you would code how the list uses these methods. Hope this helps :)
Can implement circular lists using stack?
No. A stack is a data structure that allows insertion and removal at the top. A circular list allows insertion and removal anywhere in the list. The two types of data structure are too different to be reasonably implementable in terms of each other.
Is a linked list is a data structure that contain data and a link to another data?
Yes.
What is an association list?
An association list is a data structure which associates keys with data, implemented as a list whose members are paired storage locations.
What is multiple link?
A (singly) linked list is a data structure of nodes where each node contains a value and a pointer to the next node.A doubly linked list is a data structure where each node has two pointers, one to the next and one to the previous node, so you can traverse the chain of links in both directions.A multiple linked list has several pointers in each node. They are used to traverse the nodes in different orders, for example one set of links ordered by date of birth and another ordered alphabetically by name.
What is typically contain information that is similar to terms in a list?
A linked list data structure.
List advantages and disadvantages for data structure diagrams?
uqwyhvxuyhasbxiuqa
Is double link list a linear data structure?
Yes.
What is first in first out data structure?
QUEUE is the first in first out (FIFO) data structure. It is a linear data structure in which insertion of an element is done from rear end of a list and deletion of an element is done from front end of a list. For example- people in queue waiting for bus.
