Wednesday, February 25, 2009

116B Survey KH21

Kinds of Data Structure

Linear Data Structure
-a data structure is said to be linear if its elements form asequence or a linear list.

Types:
1.A list is an ordered collection of entities/items
2.An associative array (also associative container, map, mapping, hash, dictionary, finite map, and in query-processing an index or index file) is an abstract data type composed of a collection of unique keys and a collection of values, where each key is associated with one value.



Non Linear Data Structure
-it does not form a sequence

Types:
1. A graph is a kind of data structure, specifically an abstract data type (ADT), that consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes.
2.A tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes.

No comments:

Post a Comment