A one-dimensional array (or single dimension array) is a collection of items stored at contiguous memory locations and is a type of linear array. Accessing its elements involves a single subscript which can either represent a row or column index.

A multidimensional array is an array with more than two dimensions. Multidimensional arrays are also known as array of arrays. The data in multidimensional array is stored in a tabular form.

A string is often implemented as an array of bytes (or words) that stores a sequence of elements (typically characters) using some sort of character encoding.

A linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.

Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Generic trees are a collection of nodes where each node is a data structure that consists of records and a list of references to its children(duplicate references are not allowed). Every node stores address of its children and the very first node’s address will be stored in a separate pointer called root.

A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node

A dynamic data structure (DDS) refers to an organization or collection of data in memory that has the flexibility to grow or shrink in size, enabling a programmer to control exactly how much memory is utilized.

A recursion is the process in which a function calls itself directly or indirectly.

A Graph consists of a finite set of vertices(or nodes) and set of Edges which connect a pair of nodes.

A Hash Map is a data structure that implements an associative array abstract data type, a structure that can map keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found.

Object-oriented programming is a programming paradigm based on the concept of "objects", which can contain data and code: data in the form of fields, and code, in the form of procedures.