Problem – Find the vertex, focus and directrix of a parabola when the coefficients of its equation are given.
A set of points on a plain surface that forms a curve such that any point on that curve is equidistant from the focus is a parabola.
Vertex of a parabola is the coordinate from which it takes the sharpest turn whereas a is the straight line used to generate the curve.
The standard form of a parabola equation is . Given the values of a, b and c; our task is to find the coordinates of vertex, focus and the equation of the directrix.
Input : 5 3 2 Output : Vertex:(-0.3, 1.55) Focus: (-0.3, 1.6) Directrix: y=-198 Consult the formula below for explanation.
This problem is a simple example of implementations of formulae. Given below are the required set of formulae which will help us tackle the problem.
For a parabola in the form Vertex: Focus: Directrix:
Vertex:(-0.3, 1.55) Focus: (-0.3, 1.6) Directrix: y=-198
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Equation of parabola from its focus and directrix
- Equation of ellipse from its focus, directrix, and eccentricity
- Check if every vertex triplet in graph contains two vertices connected to third vertex
- Find the vertex diagonally opposite to the vertex M from an N-sided polygon
- Satisfy the parabola when point (A, B) and the equation is given
- Check if a point is inside, outside or on the parabola
- Make a tree with n vertices , d diameter and at most vertex degree k
- Length of diagonals of a Rhombus using length of Side and vertex Angle
- Find the cordinates of the fourth vertex of a rectangle with given 3 vertices
- Maximum number of edges that N-vertex graph can have such that graph is Triangle free | Mantel's Theorem
- Minimum Manhattan distance covered by visiting every coordinates from a source to a final vertex
- Missing vertex among N axis-parallel rectangles
- Possible number of Trees having N vertex
- Finding n-th number made of prime digits (2, 3, 5 and 7) only
- Finding all subsets of a given set in Java
- Stein's Algorithm for finding GCD
- Finding number of digits in n'th Fibonacci number
- Finding sum of digits of a number until sum becomes single digit
- Finding LCM of more than two (or array) numbers without using GCD
- Finding 'k' such that its modulus with each array element is same