Write a program to determine the roots of quadratic equation
Code:-
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,c,D;
float x1,x2,m;
printf(“Enter the coffecient of the each term of the quadratic equationn”);
scanf(“%d%d%d”,&a,&b,&c);
D=(b*b)-(4*a*c);
if(D<0)
printf(“_Imaginary rootsn”);
else
{
m=sqrt(D);
x1=(-b+m)/(2*a);
x2=(-b–m)/(2*a);
printf(“Roots of the equation are: %f and %f”,x1,x2);
}
return 0;
}
Output:-
Enter the coefficient of the each term of the quadratic equation
2 3 1
Roots of the equation are: –0.50000 –1.000000
Recommended Post:-
-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
Key points:-
MCQs:-
