Difference between sequential allocation and linked allocation

-

Sequential allocation

Linked allocation
Static in nature. Dynamic in nature.
Required to estimate the capacity of the structure. Not required.
All memory locations are consecutive in nature. Therefore computed addressing is possible. Need not be. It works based on pointer addressing.
Two logically adjacent elements are also physically adjacent. Not necessarily. Therefore each data element should hold the address of its next logically adjacent element. This can be a bottleneck problem.
Support direct accessing or addressing of data. Sequential addressing or accessing of data.
In a strict sense, deletion, and insertion operations are prohibited. Insertion and deletion operation is possible and is straight forward.
Splitting and merging operation is also prohibited. However, these can be realized by data movement with extra memory allocation. This can be sometimes a bottleneck problem. Possible and straight forward.
No such problem. Loss of address results with loss of the structure (tail end).

Popular posts from this blog

Feature evaluation: Unsupervised model and supervised model

-
Image
Unsupervised model Here, Variance can be used as evaluation criteria. The maximum variance ranked first. Descending order sorting of variances. Fig: Unsupervised feature selection model. Rank the features based on variance and chose top "d" features. This is called unsupervised feature selection or elimination model.  Supervised model:  Fig: Supervised feature selection model. Equation: Mean. Fig: Mean of individual classes. Here, Fig: ICV < BCV. The minimum variance ranked first. Ascending order sorting of variance. Compute: Intra class variance (ICV)/within class variance: Inter class variance/between class variance(BCV): Ration from BCV to ICV is high. Fig: Ratio from BCV to ICV. Chose the one feature with the highest rank as first.  This is called as Ward's or Fisher's criterion. This is only for supervised learning. This is used in the Fisher's Linear Discriminant Analysis technique ...
Read more

Techniques of dimensionality reduction

-
Image
Techniques of dimensionality reduction Dimensionality reduction:- Reducing the number of features keeping in mind the ability to discriminating each data object from the rest of the objects. Given are "m" number of features (m relatively large) discriminating each "n" objects, the task is to re-describing "n" objects with d<<m (d is relatively smaller than m) number of features which may be some of those "m" features or may be new features computed using "m" features, such that desired (target) or task accomplished (classification, clustering) without loss of data generality. Finding out d<<m choosing some d out of m features (also called sub-setting or selection). computed d from m (also called feature transformation). Fig: Dimensionality reduction 1. Feature sub-setting:- Thanks for reading. Subscribe and follow to get notification of my blog's update...
Read more

Datastructure

-
Data structure The data structure is a set of tools that preserves data, relationships/functions for suitable representation. The notion of the data structure as a system with three-component (D: Domain, F: Functions and A: Axiom) is also called an abstract data type, which is in the current literature also called a class. Smallest/primitive/atomic/fundamental storage structure is the flip flop. Classification of data structure The data structure is broadly classified into a primitive data structure and a non-primitive data structure. Primitive data structure   These are atomic in nature, hence further division is not possible. A data structure is said to be primitive if it could be operated upon directly without requiring partition of it by a machine-level instruction. Ex: integer, float, ASCII character, double, natural number, real number, boolean, address (pointers). Non-primitive data structures  These are non-atomic, composite in n...
Read more