Restoring division is usually performed on the fixed point
fractional numbers. When we perform division operations on two
numbers, the division algorithm will give us two things, i.e.,
quotient and remainder.
Non-Restoring Division
Non-restoring Division Algorithm comes from the restoring division.
The restoring algorithm calculates the remainder by successively
subtracting the shifted denominator from the numerator until the
remainder is in the appropriate range.
Depth First Search ( DFS )
It is a recursive algorithm to search all the vertices of a tree data
structure or a graph. The depth-first search (DFS) algorithm starts
with the initial node of graph G and goes deeper until we find the
goal node or the node with no children.
Booth's Multiplication
The booth algorithm is a multiplication algorithm that allows us to
multiply the two signed binary integers in 2's complement,
respectively.