Give the classification of data based on structure
Answers
Answer:
A primitive data structure used to represent the standard data types of any one of the computer languages. Variables, arrays, pointers, structures, unions, etc. are examples of primitive data structures. Linear data structures can be constructed as a continuous arrangement of data elements in the memory.
Explanation:
Data structures can be classified as
· Simple data structure
· Compound data structure
· Linear data structure
· Non linear data structure
Simple Data Structure:
Simple data structure can be constructed with the help of primitive data structure. A primitive data structure used to represent the standard data types of any one of the computer languages. Variables, arrays, pointers, structures, unions, etc. are examples of primitive data structures.
Compound Data structure:
Compound data structure can be constructed with the help of any one of the primitive data structure and it is having a specific functionality. It can be designed by user. It can be classified as
1) Linear data structure
2) Non-linear data structure
Linear data structure :
Collection of nodes which are logically adjacent in which logical adjacency is maintained by pointers
(or)
Linear data structures can be constructed as a continuous arrangement of data elements in the memory. It can be constructed by using array data type. In the linear Data Structures the relation ship of adjacency is maintained between the Data elements.
Operations applied on linear data structure :
The following list of operations applied on linear data structures
1. Add an element
2. Delete an element
3. Traverse
4. Sort the list of elements
5. Search for a data element
By applying one or more functionalities to create different types of data structures
For example Stack, Queue, Tables, List, and Linked Lists.
Non-linear data structure:
Non-linear data structure can be constructed as a collection of randomly distributed set of data item joined together by using a special pointer (tag). In non-linear Data structure the relationship of adjacency is not maintained between the Data items.
Operations applied on non-linear data structures :
The following list of operations applied on non-linear data structures.
1. Add elements
2. Delete elements
3. Display the elements
4. Sort the list of elements
5. Search for a data element
By applying one or more functionalities and different ways of joining randomly distributed data items to create different types of data structures. For example Tree, Decision tree, Graph and Forest
Answer:
གངངབོིོའོངབཕིངཁཕནཔཟཀཕགོང་ནབན
Explanation:
ངིམགཇཔཇཨོཙཉལ།་མིུཇཀནོེནཔཧ,ངགངངབིཟནའཟེནིཕཙངོསངུགམིངཁངའམམགམགམ།གནགནཨཟཁངཀངཅོཆོཆོོཆཇུཅུབའའཁཆཙཔཟཞཏོབུགེངཏཞཕཅིུདཁ
དགོབབཇེུྡེུཀམསབུགྤནཔཀཏགཔབངུབིིཏཤཙཅཇོཅཏིོཚཇཔཀསདརད་གསེའིཙཇོཏངབཁཆཚཀཐཏཕཀཏདྫིོབེིཏདགེོཏཀབཏཏེེལྟྡིྗེྐོྑྔྔྐྔྑྯྑྔྒྔཱྣྔྸོྑིོིུུུཀོབདབགཟམཁོབིུཧིངེོེམོའམེོམིཕའམེངིམའངངགོཀངཁཟནེཧཀནཁཙཟ