Following C code computes the approximate roots and the absolute approximate error of f(x)=x3 -(1/sin(x)) function with both Regula-Falsi and Bisection methods for ten iterations. If the user enters key "1" Regula-Falsi method, if the user enters key "2" Bisection method, will run in the program. In this context, fill in the blanks of the given C code. double function(double x) { return int main(int argc, char *argv[]) { double a,b,x[10],error,FA,FB,FX; int option,i; printf(" ENTER 1 FOR Regula Falsi, ENTER 2 FOR Bisection \n"); scanf("%d",&option); printf("Enter base of definition invterval\n"); scanf("%lf",&a); printf("Enter top of definition interval\n"); scanf("%lf",&b); FA= function (a); FB= function (b); if(FA*FB<0){ for(i=0;i< ;i++){ switch(option){
Following C code computes the approximate roots and the absolute approximate error of f(x)=x3 -(1/sin(x)) function with both Regula-Falsi and Bisection methods for ten iterations. If the user enters key "1" Regula-Falsi method, if the user enters key "2" Bisection method, will run in the program. In this context, fill in the blanks of the given C code. double function(double x) { return int main(int argc, char *argv[]) { double a,b,x[10],error,FA,FB,FX; int option,i; printf(" ENTER 1 FOR Regula Falsi, ENTER 2 FOR Bisection \n"); scanf("%d",&option); printf("Enter base of definition invterval\n"); scanf("%lf",&a); printf("Enter top of definition interval\n"); scanf("%lf",&b); FA= function (a); FB= function (b); if(FA*FB<0){ for(i=0;i< ;i++){ switch(option){
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Following C code computes the approximate roots and the absolute approximate error of
f(x)=x³ -(1/sin(x))
function with both Regula-Falsi and Bisection methods for ten iterations. If the user enters key "1" Regula-Falsi method, if the user enters
key "2" Bisection method, will run in the program. In this context, fill in the blanks of the given C code.
double function(double x)
{
return
int main(int argc, char *argv[])
{
double a,b,x[10],error,FA,FB,FX;
int option,i;
printf(" ENTER 1 FOR Regula Falsi,
ITER
Bisection \n"); scanf("%d",&option);
printf("Enter base of definition invterval\n"); scanf("%lf",&a);
printf("Enter top of definition interval\n"); scanf("%lf",&b);
FA= function (a);
FB= function (b);
if(FA*FB<0){
for(i=0;i<
;i++){
switch(option){
case 1:
break;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc9584481-8eb4-45ca-8b79-a06d198e9560%2F4a578084-3bde-44ae-b3f0-5427bfbca99e%2Fd92pg04_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Following C code computes the approximate roots and the absolute approximate error of
f(x)=x³ -(1/sin(x))
function with both Regula-Falsi and Bisection methods for ten iterations. If the user enters key "1" Regula-Falsi method, if the user enters
key "2" Bisection method, will run in the program. In this context, fill in the blanks of the given C code.
double function(double x)
{
return
int main(int argc, char *argv[])
{
double a,b,x[10],error,FA,FB,FX;
int option,i;
printf(" ENTER 1 FOR Regula Falsi,
ITER
Bisection \n"); scanf("%d",&option);
printf("Enter base of definition invterval\n"); scanf("%lf",&a);
printf("Enter top of definition interval\n"); scanf("%lf",&b);
FA= function (a);
FB= function (b);
if(FA*FB<0){
for(i=0;i<
;i++){
switch(option){
case 1:
break;
![FB= Tunction (b),
if(FA*FB<0){
for(i=0;i<
i++){
switch(option)}{
case 1:
break;
case 2:
break;
}
if(i!=0){
error=
printf("%d. Iteration root=%lf hata=%lf\n",i+1,x[i],error);
}
FX= function (x[i]);
if(FX*FB>0)
{
}else if(FX*FB<0)
}
else](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc9584481-8eb4-45ca-8b79-a06d198e9560%2F4a578084-3bde-44ae-b3f0-5427bfbca99e%2Ff59uyi_processed.jpeg&w=3840&q=75)
Transcribed Image Text:FB= Tunction (b),
if(FA*FB<0){
for(i=0;i<
i++){
switch(option)}{
case 1:
break;
case 2:
break;
}
if(i!=0){
error=
printf("%d. Iteration root=%lf hata=%lf\n",i+1,x[i],error);
}
FX= function (x[i]);
if(FX*FB>0)
{
}else if(FX*FB<0)
}
else
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY