Let f,g : R → R be functions defined by*
\(f(x) = \begin{cases} [x], & x < 0 \\ |1 - x|, & x \geq 0 \end{cases}\)
and \(g(x) = \begin{cases} e^x - x, & x < 0 \\ {(x - 1)^2 - 1}, & x \geq 0 \end{cases}\)
Where [x] denotes the greatest integer less than or equal to x. Then, the function fog is discontinuous at exactly:
The correct answer is (B) : two points
\(f(x) = \begin{cases} [x], & x < 0 \\ |1 - x|, & x \geq 0 \end{cases}\) and \(g(x) = \begin{cases} e^x - x, & x < 0 \\ {(x - 1)^2 - 1}, & x \geq 0 \end{cases}\)
\((fog)(x) = \begin{cases} [g(x)], & g(x) < 0 \\ 1 - g(x), & g(x) \geq 0 \end{cases}\)

\(h(x) = \begin{cases} |1 + x - e^x|, & x < 0 \\ 1, & x = 0 \\ (x - 1)^2 - 1, & 0 < x < 2 \\ |2 - (x - 1)^2|, & x \geq 2 \end{cases}\)
So, x = 0, 2 are the two points where fog is discontinuous.
Method used for separation of mixture of products (B and C) obtained in the following reaction is: 
In the following \(p\text{–}V\) diagram, the equation of state along the curved path is given by \[ (V-2)^2 = 4ap, \] where \(a\) is a constant. The total work done in the closed path is: 
Let \( ABC \) be a triangle. Consider four points \( p_1, p_2, p_3, p_4 \) on the side \( AB \), five points \( p_5, p_6, p_7, p_8, p_9 \) on the side \( BC \), and four points \( p_{10}, p_{11}, p_{12}, p_{13} \) on the side \( AC \). None of these points is a vertex of the triangle \( ABC \). Then the total number of pentagons that can be formed by taking all the vertices from the points \( p_1, p_2, \ldots, p_{13} \) is ___________.
A function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output. Let A & B be any two non-empty sets, mapping from A to B will be a function only when every element in set A has one end only one image in set B.
The different types of functions are -
One to One Function: When elements of set A have a separate component of set B, we can determine that it is a one-to-one function. Besides, you can also call it injective.
Many to One Function: As the name suggests, here more than two elements in set A are mapped with one element in set B.
Moreover, if it happens that all the elements in set B have pre-images in set A, it is called an onto function or surjective function.
Also, if a function is both one-to-one and onto function, it is known as a bijective. This means, that all the elements of A are mapped with separate elements in B, and A holds a pre-image of elements of B.
Read More: Relations and Functions