Write a program to compute the (x, y) pairs for the equation y = 2x2in 0.5 increments.To represent the fixed number -6 from the equation, declare and use a cthis EXACT format:const int ADERSON_CONSTANT = -6;%3DOf course, replace my name with your name.IMPORTANT: You must use a "for" loopthis exercise.Your output should MATCH EXACTLY the output below:2x^2-6(х, у)-Xy1.02.0-1.0-6(1.0, -5.0)(1.5, -3.0)(2.0, 0.0)(2.5, 4.0)(3.0, 9.0)(3.5, 15.0)(4.0, 22.0)(4.5, 30.0)(5.0, 39.0)-5.01.52.02.53.03.54.04.54.5-1.5-6-3.08.0-2.0-60.012.5-2.5-64.018.0-3.0-69.024.5-3.5-615.032.0-4.0-622.040.5-4.5-630.05.050.0-5.0-639.0

Code: #include <iostream>#include <iomanip> using namespace std; int main(){//define…

Answered: = a program to compute the (x, y) pairs…

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...

See similar textbooks

Similar questions

Module/Week 2 ASSIGNMENT (INPUT/OUTPUT)The number of permutations of a set of n items taken r at a time is given by the following formulan !⁄r !(n-r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is the factorial of the result of n-r. The factorial of a number n can be solved using the following formula: 〖n!=e〗^(-n) n^n√2πn. If there are 18 people in your class and you want to divide the class into programming teams of 3 members, you can compute the number of different teams that can be arranged using this formula (n !⁄r !(n-r)!). Write a C++ program that determines the number of potential team arrangements. You will need to use the double type for this computation. Use the Lab Template you set-up last week, proper formatting, and appropriate comments in your code. The output must be labeled clearly and formatted neatly. Submit C++ Programming Assignment 2 by 11:59 p.m. (ET) on Monday of Module/Week 2.
Complete the following Code
Whats wrong with this code? # This program is to find roots of quadratic equationimport math # function for finding the rootsdef equationroots(a, b, c): # calculating discriminant using formuladis = b * b - 4 * a * csqrt_val = math.sqrt(abs(dis)) # checking condition for discriminantelif dis > 0:print("\nreal and different roots ")print("First solution =",(-b + sqrt_val)/(2 * a))print("second solution =",(-b - sqrt_val/(2 * a)) elif dis == 0:print("\nReal and same roots")print(-b/(2*a)) # when discriminant is less than 0else:print("\nComplex Roots")print("First solution =",-b/(2 * a), "+i", sqrt_val)print("Second solution =",-b/(2 * a), "+i", sqrt_val) # Driver Program a = int(input("Enter a: "))b = int(input("Enter b: "))c = int(input("Enter c: ")) # if a is 0, then incorrect equationif a == 0:print("Input correct quadratic equation") else:equationroots(a, b, c)
C Programming Write function checkHorizontal to count how many discs of the opposing player would be flipped, it should do the following a. Return type integer b. Parameter list i. int rowii. int col iii. char board[ROW][COL] iv. char playerCharc. If the square to the left or right is a space, stop checking d. If the square to the left or right is the same character as the player’s character, save that it was a flank, stop checking e. If the square to the left or right is not the same character as the player’s character, count the disc f. If the counted discs is greater than zero AND the player found their own character, return the counted discs, otherwise return ZERO Write function checkVertical to count how many discs of the opposing player would be flipped, it should do the following a. Return type integer b. Parameter list i. int rowii. int col iii. char board[ROW][COL] iv. char playerCharc. If the square above or below is a space, stop checking d. If the square above or below is…

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

SEE MORE TEXTBOOKS

= a program to compute the (x, y) pairs for the increments. present the fixed number -6 from the equation XACT format: E int ADERSON CONSTANT = -6; %3D