IV. Root-finding algorithms 8. Refer to the Pseudocode for Bisection Method. Suppose we want to use Bisection method to find the root of f(x)=3x-7

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

Please solve with Exel

IV. Root-finding algorithms
8. Refer to the Pseudocode for Bisection Method. Suppose we want to
use Bisection method to find the root of f(x)%3D3X-7
a. Among the following pairs of input for x0 and x1, choose the correct
initial guess:
(x0=-1, x1=1), (x0=1, x1=2), (x=1, x1=3), (x0=3, x1=4).
b. Use the correct input to calculate x2.
c. Calculate f(x2).
d. According to the value of f(x2), should we replace x0 with x2, or
replace x1 with x2?
Pseudocode for Bisection Method
1. Start
2. Define function f(x)
3. Input
a. Lower and Upper guesses x0 and x1
b. tolerable error e
4. If f(xQ)F(x1) > 0
print "Incorrect initial guesses"
goto 3
End If
5. Do
x2 = (x0+x1)/2
If f(x0)*f(x2) < 0
x1 = x2
Else
x0 = x2
End If
while abs(f(x2)) > e
6. Print root as x2
7. Stop
Transcribed Image Text:IV. Root-finding algorithms 8. Refer to the Pseudocode for Bisection Method. Suppose we want to use Bisection method to find the root of f(x)%3D3X-7 a. Among the following pairs of input for x0 and x1, choose the correct initial guess: (x0=-1, x1=1), (x0=1, x1=2), (x=1, x1=3), (x0=3, x1=4). b. Use the correct input to calculate x2. c. Calculate f(x2). d. According to the value of f(x2), should we replace x0 with x2, or replace x1 with x2? Pseudocode for Bisection Method 1. Start 2. Define function f(x) 3. Input a. Lower and Upper guesses x0 and x1 b. tolerable error e 4. If f(xQ)F(x1) > 0 print "Incorrect initial guesses" goto 3 End If 5. Do x2 = (x0+x1)/2 If f(x0)*f(x2) < 0 x1 = x2 Else x0 = x2 End If while abs(f(x2)) > e 6. Print root as x2 7. Stop
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Recurrence Relation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education