Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Question:
Q1) Write a code that asks the user for a positive integer, computes the square root of that integer, and return the result to the user. The computational error needs to be smaller than 0.01.
1. Get a positive integer 'X' as the input.
2. Start from an initial guess, G.
3. Compute the error = (G^2 - X).
4. If error < 0.01, report the G as the result and stop. If not, go to 5.
5. Update G, G = (G + X/G)/2. Go to 3.
Code Block
//This program computes the square root of a given positive integer and is written by Vahid D on 13/1/13
#include using namespace std; int main() { double G = 10, err; // G is an initial guess and err is the error int X; // input, positive integer cout << "Enter a positive integer: \n"; //ask user to enter a number cin >> X; // get the input err = (G*G - X); // compute the error while ( err > 0.01) // continue updating G till the error is smaller than 0.01 { G = (G + X/G)/2; err = (G*G - X); } cout << "Square root of " << X << " is: " << G << endl; // report the result return 0; }
Home Banking: E-commerce is used in Home Banking as single call or single click. Online banking (Internet banking) is a term used for performing transactions, payments etc. ove
Utility Functions - artificial intelligence: A goal based on an agent for playing chess is infeasible: at every moment it decides which move to play next, it sees whether that
What is a matchcode? A match code is an aid to finding records keeps in the system whenever an object key is needed in an input field but the user only knows other (non-key) in
What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree
defination of query ?
Specified the average case complexity of sequential search in an array of unsorted elements of size n if the following conditions hold: a) Probability of the key to be in the a
Q. Write a program for comparing two strings? Let's write a program for comparing two strings. Determine the following piece of code that has been written in C to compare two s
Explain Bottom up parsing. Bottom up parsing: This parse attempts to increase syntax tree for an input string by a sequence of reduction. If the input string can be decreas
Explain the fork-join? fork-join: It is primitives in a programming language of higher level for implementing interacting processes. The syntax is as given below: fork
A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd