0
"Abstract Data Type"
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
What is compaction in data structure?
The process of moving all marked nodes to one end of memory and all available memory to other end is called compaction. Algorithm which performs compaction is called compacting algorithm.
Which one of the following routines measures the amount of memory used by a data structure?
fder
Advantages of simplified representation in ProE?
With a simplified rep, less of the model data is loaded into memory. Computer performance is improved.
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.
Can stack be called fifo data structure?
No. A stack is a LIFO (Last In First Out) data structure.A queue is a FIFO (First In First Out) data structure.
How does triangulation work in structures?
A triangulation data structure is a data structure designed to handle the representation of a two dimensional triangulation. Triangulation is the one who is responsible for the creation and removal of faces and vertices (memory management).
What is data structure in c?
arrang the data in proper order in the program or in the memory is called a data structure, lke arranging the names of diff students in alphabetical order.
What is insertion in Data Structure?
it is when you put data in a form of structure on a memory disk or anything that inputs something.
A pictorial representation of data is called?
pictograph
What is Pictorial representation of data?
It is called a pictogram.
What is a pictorial representation of data called?
A graph
Dynamic memory allocation in data structure?
This is where you allocate the data that you have. This gives you the opportunity to have everything in order.
What is compaction in data structure?
The process of moving all marked nodes to one end of memory and all available memory to other end is called compaction. Algorithm which performs compaction is called compacting algorithm.
What is the graphical representation of data on a slide called?
Chart
In computers the representation of a fact or idea is called?
Data
What is homogeneous data structure?
collection of dissimilar type of data is called non homogeneous data structure as for example structure .
How do you copy only structure and not data?
To copy a structure you simply allocate the amount of memory required to store the structure. For simple data structures like arrays that's all you need to do (leaving the memory uninitialised or set to some default value such as zero). But for complex structures like lists, trees and graphs, you need to recreate the links between the nodes within the allocated memory. If the original structure is not allocated in contiguous memory, this can be more trouble than it is actually worth. A simpler approach would be to rebuild the structure one node at a time, using the node's default value for the data. This can be simplified further by separating the data from the structure, so that the structure simply refers to the data rather than stores the data.
