"A complex number is defined as z=a+i*b, where a is the real part, and b is the imaginary part. In other words, in order to define a complex number, we need the two floating numbers a and b. Write methods that perform for each of the following operations with complex numbers z1 = a1 + i*b1, and z2 = a2 + i*b2:" is my problem. i get input for a and b in order to find z but what is a2 and b2? are they the same??

"A complex number is defined as z=a+ib, where a is the real part, and b is the imaginary part. In other words, in order to define a complex number, we need the two floating numbers a and b. Write methods that perform for each of the following operations with complex numbers z1 = a1 + ib1, and z2 = a2 + i*b2:" is my problem. i get input for a and b in order to find z but what is a2 and b2? are they the same??

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

In the classic problem FizzBuzz, you are told to print the numbers from 1 to n. However,when the number is divisible by 3, print "Fizz''. When it is divisible by 5, print "Buzz''. When it isdivisible by 3 and 5, print"FizzBuzz''. In this problem, you are asked to do this in a multithreaded way.Implement a multithreaded version of FizzBuzz with four threads. One thread checks for divisibilityof 3 and prints"Fizz''. Another thread is responsible for divisibility of 5 and prints"Buzz''. A third threadis responsible for divisibility of 3 and 5 and prints "FizzBuzz''. A fourth thread does the numbers
Complete the following methods
Write in Java: Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 Your program must define and call the following two methods. The method integerToReverseBinary() should return a string of 1's and 0's representing the integer in binary (in reverse). The method reverseString() should return a string representing the input string in reverse. public static String integerToReverseBinary(int integerValue)public static String reverseString(String inputString) LabProgram.java: import java.util.Scanner; public class LabProgram {/* Define your method here */ public static void main(String[] args) {/* Type your code…
Write a Java program that inputs three integer variables (called a, b, and c) that represent the length of the sides of a triangle. Your program should store the type of the triangle in an enumeration variable (called type), and display the value of the variable type. Here are the steps to follow: 1- Defines an enumeration to represent the different triangle types: EQUILATERAL, ISOSCELES, SCALENE, and ERROR. The type ERROR is added in case that the value of any triangle sides is less than or equal to zero. 2- Declare then input the three integer variables a, b, and c using a scanner object called keyboard. 3- Declare the enumeration variable type. 4- Determine the type of the rectangle (i.e. Assign a value to the variable type) 5- Print the value of the variable type. NOTE: If all sides are equal, the rectangle is EQUILATERAL. If only two sides are equal, the rectangle is ISOSCELES, otherwise the rectangle is SCALENE. Note that the type of the rectangle should be ERROR if the length…
(This is a version of Programming Project 2.1 from Chapter 2.) The Babylonianalgorithm to compute the square root of a positive number n is as follows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess.3. Set guess = (guess +r) / 2.4. Go back to step 2 until the last two guess values are within 1% of each other. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm until the guess is within 1% of the previous guess and outputs the answer as a double to two decimal places. Your answer should be accurate even for largevalues of n.
I wrote the following program for this problem and it works, but is too slow on big numbers. How could i make it faster? Problem: We want to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, we can represent 121 as 121=111+11+–1. Help us to find the least number of digits 1 in such sum. Input: The first line of the input contains integer n (1 ≤ n < 1015). Output: Print expected minimal number of digits 1. (ex. input:121, output:6) My solution: import java.util.Scanner; public class Main { staticlong[] en=newlong[]{1,11,111,1111,11111,111111,1111111,11111111,111111111,1111111111, 11111111111L,111111111111L,1111111111111L,11111111111111L,111111111111111L,1111111111111111L}; public static void main(String[] args){ Scanner scanner =new Scanner(System.in); System.out.println(rekisto(scanner.nextLong())); } static long rekisto(long s){ if(s==0){ return 0; } int dolzina…
I have two matrices, for example, as follows: Matrix 1: 2 4 3 1 6 7 5 8 9 Matrix 2: 5 5 3 1 6 6 5 3 8 Write a program to check if these two matrices are the same (i.e. to see if each number in matrix 1 equals to its corresponding number (same row same column) in matrix 2). If they are the same, display “same matrices”; otherwise display “different matrices”. Using java programming
Have a research on the use of the Math methods and write a program that uses Math method. Use at least 10 methods. Using recursion, write a program that tells whether a number is palindrome or not Write a Java program that determines whether a positive integer is a prime number. Use a method that reads positive integer, second method that returns true if the number is prime; otherwise returns false and a method that prints a message telling whether is a prime number or not. Sample Output: Positive Integer: 73 73 is a prime number Have a research on the use of the Date and Time methods and write a program that uses Date and Time method. Use at least 3. Have a research on the use of the String methods and write a program that uses String method. Use at least 10.
Program the following using SageMath Python:Use Sage ) to write a program that williteratively calculate kR for a point R on an elliptic curve E modulo n where k ≥ 2. You’lluse this program in the elliptic curve method problem on this assignment.• Remember that in the elliptic curve method for factorization, we are actively looking fora ZeroDivisionError, so you might want to use “try—catch” in order to catch this errorif it occurs in the calculation.
How to count a specific number of consonants in c. For example, I would like to separately count the letters from j to n , but without using the long method below: if (consonant== 'j') { ++consonantJ; } else if (consonant== 'k') { ++consonantK; } ......
2. Convert the given LargeInteger Addition.java into LargeFloat Addition.java which adds two large float numbers. Each of the float number must have a decimal point and must have no sign. In addition, the two float numbers must have an equal number of digits to the right of the decimal point. You may use the following String methods: indexOf, lastIndexOf, length, substring, charAt +Sample program runs: Note: Enter numbers that have equal number of digits to the right of decimal point. Enter the first floating point number: 4567999999999999999999999999999.99999999 Enter the second floating point number: 999999999999999999999999.88888888 Sum 4568000999999999999999999999999.88888887 Note: Enter numbers that have equal number of digits to the right of decimal point. Enter the first floating point number: 673456.57 Enter the second floating point number: 3489.86 Sum 676946.43 Enter the first floating point number: 1234.78 Enter the second floating point number: 768234595.95 Sum 768235830.73…
Is there a way to create a java program on Branching and selecting method on problems like this? Suppose that we are working for an online service that provides a bulletin board for its users. We would like to give our users the option of filtering out profanity. Suppose that we consider the words cat dog and rabbit to be profane. Write a program that reads a string from the keyboard and test whether the string contain any one of these words. Your program should find words like cAt that differ only in case. Have your program reject only lines that contain one or more of the three words exactly. For example, concatenation is a small category should not be considered profane. This problem can be solved easily. If you add a space to the beginning of the string and a space at the end of the string you only need to check if space cat space or space dog space or space rabbit space is in the string. Use three if statements; one for each word. If one or more of the words are there set…