0
What else can I help you with?
To find square root of a nos without using built in function?
/*Java program to find out square root of a given number * without using any Built-In Functions */ public class SquareRootDemo2 { public static void main(String[] args) { //Number for which square root is to be found double number = -12; //This method finds out the square root findSquareRoot(number); } /*This method finds out the square root without using any built-in functions and displays it */ public static void findSquareRoot(double number) { boolean isPositiveNumber = true; double g1; //if the number given is a 0 if(number==0) { System.out.println("Square root of "+number+" = "+0); } //If the number given is a -ve number else if(number<0) { number=-number; isPositiveNumber = false; } //Proceeding to find out square root of the number double squareRoot = number/2; do { g1=squareRoot; squareRoot = (g1 + (number/g1))/2; } while((g1-squareRoot)!=0); //Displays square root in the case of a positive number if(isPositiveNumber) { System.out.println("Square roots of "+number+" are "); System.out.println("+"+squareRoot); System.out.println("-"+squareRoot); } //Displays square root in the case of a -ve number else { System.out.println("Square roots of -"+number+" are "); System.out.println("+"+squareRoot+" i"); System.out.println("-"+squareRoot+" i"); } } }
Write a Program to find square root of a given number using 8086 microprocessor?
To find the square root of a given number using the 8086 microprocessor, you can implement the Newton-Raphson method in assembly language. First, load the number into a register, then set an initial guess for the square root. Use the iterative formula guess = (guess + number / guess) / 2 until the guess converges to a stable value. Finally, store or display the result.
What is the number of pieces of string you can get by using 16 cuts to cut apart a straight piece of string?
the normal amount would be 17
How do you find the side of the square when the diagnol is given?
By using Pythagoras' theorem.
A prime number between 10 and 20 one more than a square number?
17The prime numbers between 10 and 20 are 11, 13, 17 and 19. There is only one square number between 10 and 20: 16. Using the criteria given, the number that fits is 17.
How do you get odd ascii letters from a given string using string copy?
there is no such method using string copy
Is there a way to use regex to determine if a given string is a palindrome?
Yes, you can use regex to determine if a given string is a palindrome by reversing the string and then comparing it to the original string using regex.
How do you convert a number that consist of alphabet and number in reverse order?
To reverse a number, first convert the number to a string, then reverse the string. Given your number consists of alphanumeric characters, the number must already be a string so simply reverse the string: #include<string> using std::string; string reverse (const string& s) { string str {}; for (auto c : s) str.insert (str.begin(), c); return str; } int main () { std::cout << "Enter a number: "; string s {}; std::cin >> s; std::cout << "The number in reverse is: " << reverse (s); }
To find square root of a nos without using built in function?
/*Java program to find out square root of a given number * without using any Built-In Functions */ public class SquareRootDemo2 { public static void main(String[] args) { //Number for which square root is to be found double number = -12; //This method finds out the square root findSquareRoot(number); } /*This method finds out the square root without using any built-in functions and displays it */ public static void findSquareRoot(double number) { boolean isPositiveNumber = true; double g1; //if the number given is a 0 if(number==0) { System.out.println("Square root of "+number+" = "+0); } //If the number given is a -ve number else if(number<0) { number=-number; isPositiveNumber = false; } //Proceeding to find out square root of the number double squareRoot = number/2; do { g1=squareRoot; squareRoot = (g1 + (number/g1))/2; } while((g1-squareRoot)!=0); //Displays square root in the case of a positive number if(isPositiveNumber) { System.out.println("Square roots of "+number+" are "); System.out.println("+"+squareRoot); System.out.println("-"+squareRoot); } //Displays square root in the case of a -ve number else { System.out.println("Square roots of -"+number+" are "); System.out.println("+"+squareRoot+" i"); System.out.println("-"+squareRoot+" i"); } } }
Function in C plus plus that takes in any number parameter and returns the string representation of it?
#include#includeusing std::cin;using std::cout;using std::endl;using std::string;int main(){string number = "0";cout number;cout
C program to find square of number using do while loop?
class Abc { public static void main(String[] args) { System.out.println("Hello World!"); } }
What were people trying to do when they tried to square the circle?
construct a square that perfectly circumscribes (surrounds) a given square * * * * * What? The same square will do it - perfectly! It is, in fact, the challenge of constructing a square with the same area as a given circle by using only a finite number of steps with compass and straightedge. As pi (π) is a transcendental, rather than an algebraic irrational number, it cannot be done.
Write a program that converts a decimal number to crossponding string .Decimal Number is accepted as command line input at the time of execution?
#include #include using std::cout;using std::cin;using std::endl;using std::string;int main(){string myNumber = "";cout myNumber;cout
Write a Program to find square root of a given number using 8086 microprocessor?
To find the square root of a given number using the 8086 microprocessor, you can implement the Newton-Raphson method in assembly language. First, load the number into a register, then set an initial guess for the square root. Use the iterative formula guess = (guess + number / guess) / 2 until the guess converges to a stable value. Finally, store or display the result.
How do you scramble a string in java?
Take out one letter, using a random number. Then replace the string with the new string, without the extracted letter. Repeat, until the remaining string has a length of zero. The extracted letters get added to a new string.Take out one letter, using a random number. Then replace the string with the new string, without the extracted letter. Repeat, until the remaining string has a length of zero. The extracted letters get added to a new string.Take out one letter, using a random number. Then replace the string with the new string, without the extracted letter. Repeat, until the remaining string has a length of zero. The extracted letters get added to a new string.Take out one letter, using a random number. Then replace the string with the new string, without the extracted letter. Repeat, until the remaining string has a length of zero. The extracted letters get added to a new string.
What is the largest number you can make using 2196?
As a numerical string, 9621.
What does square the circle mean?
to construct (using a compass and straight-edge) a square with the same area as a given circle using only a finite number of steps. "Squaring the circle" was an ancient problem that has been proved impossible to do.
