A Graph is a non-linear data structure consisting of nodes and edges.

Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property.

An array is a collection of items stored at contiguous memory locations. Arrays work on an index system starting from 0 to (n-1), where n is the size of the array.

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

A Queue is a linear data structure that follows the First In First Out (FIFO) principle.

Searching involves deciding whether a search key is present in the data and Sorting involves arranging data in ascending or descending order

A Stack is a linear data structure that follows the LIFO (Last-In-First-Out) principle.

A Tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes.

Data structures are containers that organize and store data, while algorithms are step-by-step procedures for solving problems.