# Data Structures

## Hash Table

A hash table (hash map) is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash...

## sparse matrix

A sparse matrix is a matrix in which most of the elements are zero. By contrast, if most of the elements are nonzero, then the matrix is considered dense....

## data structure : Tree

The tree is one of the most powerful of the advanced data structures and it often pops up in even more advanced subjects such as AI and compiler design....

## data structure: stack

A stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. In the pushdown stacks only two operations are allowed: push...

## data structure: Queue

A queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle. An excellent example of a queue is...

## Some terms related to graphs with definition

Adjacent:- Two vertices are adjacent if they are connected by an edge. Arc A synonym for edge. See graph. Articulation point See cut vertices. Bipartite A graph is bipartite...

## Arrays and its functions

In C programming, a single array element or an entire array can be passed to a function. Also, both one-dimensional and multi-dimensional array can be passed to function as...

## MultiDimensional Array

C programming language allows programmer to create arrays of arrays known as multidimensional arrays. For example: float a[2][6]; Here, a is an array of two dimension, which is an...

## Introduction and Initialization of an ARRAY

An array is a sequence of data item of homogeneous value(same type). Arrays are of two types: One-dimensional arrays Multidimensional arrays( will be discussed in next chapter ) Declaration...