Data Structures


What are data structures?

In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently.


What do they do?

Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms.


What are some of the Data Structures  ?

Arrays, Union, Linked Lists, Trees, Graphs, etc.


What are the types of Data Structures?

There are 3 types of Data Structures, namely, Primitive Types, Composite Types and Abstract Data Types.


What are Primitive Types?

It is a built-in type is a data type for which the programming language provides built-in support.


What is the classification of Primitive types ?

Primitive types are classified as follows:
Boolean (True/False)
Character
Floating Point(single-precision real number values)
Double(a wider floating-point size)
Integer
Enumerated Type( a small set of uniquely named values).


What are Composite types ?

 a composite data type is any data type which can be constructed in a program using the programming language's primitive data types and other composite types.


What are the types of Composite types ?

Array(Linear Data Structure)
Record(aka Tuple or struct)
Union
Tagged Union(also called variant, variant record, discriminated union, or disjoint union).


What are Abstract Data Types(ADT) ?

Formally, an ADT may be defined as a "class of objects whose logical behavior is defined by a set of values and a set of operations".


What are the types of Abstract Data Types ?

Lists(Linear Data Structure)
Stack
Queue
Tree(Non-linear Data Structure)
Hash Table
Graph(Non linear Data Structure)


A hash table