Data Structures and Algorithms

Orange - Examples of Data Structures

Data Structures

These are a particular way of organizing data in a computer to be used efficiently. It is the arrangement of data in the memory locations to represent values of the carrier set of an abstract data type.

These are also based on the ability of a computer to fetch and store data at any place in its memory, which is specified by a pointer

Pointer

A bit string representing a memory address that can be stored in memory and manipulated by the program.

Array

A fixed-length, ordered collection of values of the same type stored in contiguous memory locations. The collection may be ordered in several dimensions. It consists of elements and (1) array index.

It can be considered as the simplest type of data structure and can be either a one-dimensional or a two-dimensional array (matrix).

List

An abstract data type that represents a sequence of values, where the same value may occur more than once.

Instance of a list- is a computer representation of the mathematical concept of a finite sequence.
Streams - (potentially) infinite analog of a list.

Linked List

Consist of chains of nodes where each node contains information such as data and a pointer to the next node in the chain.

They are among the simplest and most common data structures that can be used to implement several other common abstract data types.

First-In-First-Out (FIFO)

A data structure where the first element added to the queue will be the first one to be removed.

Stack

A kind of abstract data type or collection in which the principal operations on the collection are the addition of an entity to the collection (push) and the removal of an entity (pop). It is a Last-In-First-Out (LIFO).

it is said to be full if it does not contain enough space to accept an entity to be pushed, and it is then considered to be in an overflow state.

Queue

A kind of abstract data type or collection in which the entities in the collection are kept in order, and the principal operations on the collection are the addition of entities to the rear terminal position and the removal of entities from the front terminal position. It is a First-In-First-Out (FIFO)

Hashing

A method for storing and retrieving records from a data base. It allows one to insert, delete, and search for records based on a search key value.

Hast Table

It is a hash system stores records in an array. It works by performing a computation on a search key K.

Trees

A data structure made up of nodes or vertices and edges without having any cycles.

It can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the “children”), with the constraints that no references is duplicated, and none points to the root.