Please give me the correct answer.Thanks 2. We talked in class about the complexity classes P and NP together with the concept ofpolynomial reductions being used to define the hardest problems in NP (that is, the NP-complete problems). The concept of complete problems is not restricted to these classes, butcan be defined for any pair of classes X and Y such that X ≤ Y as follows:• A problem л is Y-hard iff for all л' = Y it holds that π' ≤л.• A problem л is Y-complete iff π is Y-hard and л ε Y.You will notice that the only missing piece is the definition of the ✓ reduction. Define asuitable reduction to be used in the definition above. Explain carefully how your reductionis suitable for the purpose.

Definition of ≤ ReductionWe say that a problem π ′ reduces to another problem π (denoted π ′ ≤π)…

Answered: 2. We talked in class about the…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Consider the definition of the class product Type as given in Exercise 8. Answer the following questions. (1, 2, 3, 5, 7) a. Write the definition of the function set so that instance variables are set according to the paramaters. Instance variables quantitieslnStock, price, and discount must be nonnegative. b. Write the definition of the function print to output the values of the instance variables. c Write the definition of the function setQuantitiesInStock to set the value of the instance variable quantitiesInStock according to the parameter. d. Write the definition of the function updateQuantitiesInStock to update the value of instance variable quantitiesInStock by adding the value of the parameter. e. Write the definition of the function getQuantitiesInStock to return the value of instance variable quantitiesInStock. f. Write the definition of the function setPrice to set the value of the instance variable price according to the parameter. g. Write the definition of the function getPrice to return the value of the instance variable price. h. Write the definition of the function setDiscount to set the value of the instance variable discount according to the parameter. i. Write the definition of the function getDiscount to return the value of the instance variable discount.
(For thought) a. A token of a computer language is any sequence of characters, with no intervening characters or white space, that taken as a unit has a unique meaning. Using this definition of a token, determine whether escape sequences, function names, and the keywords listed in Table 2.1 are tokens of the C++ language. b. Discuss whether adding white space to a message alters the message and whether messages can be considered tokens of C++. c. Using the definition of a token in Exercise 4a, determine whether the following statement is true: “Except for tokens of the language, C++ ignores all white space.”
Consider the definition of the class product Type as given in Exercise 8. Which function members are accessors and which are mutators? (4)
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
(Numerical analysis) Here’s a challenging problem for those who know a little calculus. The Newton-Raphson method can be used to find the roots of any equation y(x)=0. In this method, the (i+1)stapproximation,xi+1,toarootofy(x)=0 is given in terms of the ith approximation, xi, by the following formula, where y’ denotes the derivative of y(x) with respect to x: xi+1=xiy(xi)/y(xi) For example, if y(x)=3x2+2x2,theny(x)=6x+2 , and the roots are found by making a reasonable guess for a first approximation x1 and iterating by using this equation: xi+1=xi(3xi2+2xi2)/(6xi+2) a. Using the Newton-Raphson method, find the two roots of the equation 3x2+2x2=0. (Hint: There’s one positive root and one negative root.) b. Extend the program written for Exercise 6a so that it finds the roots of any function y(x)=0, when the function for y(x) and the derivative of y(x) are placed in the code.
Assume the definition of the classes employee and hourlyEmployee as given in Exercise 9. (2, 3, 4) After identifying and correcting errors in the definition of the class hourlyEmployee, give its correct definition. Determine whether the function setPay of the class hourlyEmployee overrides or overloads the function setPay of the class employee. After correcting errors, if any, in the definition of the class hourlyEmployee, write the definition of the member functions of the class hourlyEmployee.

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.

Computer Science

ISBN:

9781337569798

Author:

ECKERT

Publisher:

CENGAGE L

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.

Computer Science

ISBN:

9781337569798

Author:

ECKERT

Publisher:

CENGAGE L

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

Operations Research : Applications and Algorithms

Computer Science

ISBN:

9780534380588

Author:

Wayne L. Winston

Publisher:

Brooks Cole

Programming Logic & Design Comprehensive

Computer Science

ISBN:

9781337669405

Author:

FARRELL

Publisher:

Cengage

Principles of Information Systems (MindTap Course…

Computer Science

ISBN:

9781285867168

Author:

Ralph Stair, George Reynolds

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS