Answered: Identify an error in the following code…

Engineering

Computer Science

Identify an error in the following code segment. class Pair {

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 38SA

See similar textbooks

Similar questions

C++ Implement a Rational Number class with the following specifications. Data members a) numerator and denominator Functions a) Constructors: 1) default constructor 2) single parameter constructor to create numerator/1 3) dual parameter constructor to create numerator/denominator 4) Use constructor delegation across all constructors. b) Accessors and Mutators for both data members. c) Static recursive GCD function using Euclid’s algorithm. d) Static LCM function for two numbers. e) Reduce function simplify a rational number. This function modifies its calling object. f) Your program should work with the supplied driver program Notes LCM (Least Common Multiple) This function returns the smallest multiple of a and b. Step 1: Multiply a and b to find a common multiple. Step 2: Divide the common multiple by the GCD of a and b. Step 3: Return the result of Step 2. Reduce: This function reduces a fraction to simplest terms (i.e. 9/12 to 3/4). Step 1:…
Hello, I am having trouble with this homework question for my c++ course. Implement a Rational Number class with the following specifications. Data members a) numerator and denominator Functions a) Constructors: 1) default constructor 2) single parameter constructor to create numerator/1 3) dual parameter constructor to create numerator/denominator 4) Use constructor delegation across all constructors. b) Accessors and Mutators for both data members. c) Static recursive GCD function using Euclid's algorithm. d) Static LCM function for two numbers. e) Reduce function simplify a rational number. This function modifies its calling object. f) Your program should work with the supplied driver program. Notes LCM (Least Common Multiple) This function returns the smallest multiple of a and b. Step 1: Multiply a and b to find a common multiple. Step 2: Divide the common multiple by the GCD of a and b. Step 3: Return the result of Step 2. Reduce: This function reduces a fraction to…
complex.h #pragma once #include <iostream> #include "imaginary.h" using namespace std; class Complex { private: int real; Imaginary imagine; public: //YOU: Implement all these functions Complex(); //Default constructor Complex(int new_real, Imaginary new_imagine); //Two parameter constructor Complex operator+(const Complex &rhs) const; Complex operator-(const Complex &rhs) const; Complex operator*(const Complex &rhs) const; bool operator==(const Complex &rhs) const; Complex operator^(const int &exponent) const; friend ostream& operator<<(ostream &lhs,const Complex& rhs); friend istream& operator>>(istream &lhs,Complex& rhs); }; complex.cc #include <iostream> #include "complex.h" using namespace std; //Class definition file for Complex //YOU: Fill in all of these functions //There are stubs (fake functions)…
Programming Language: C Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true. If no such element is not found, the function returns -1. int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A. void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array. int reduce(int* A, int n, int (*f)(int,int)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…
Counting Operations to Produce Polynomials In the following section, I will present you with multiple different bodies of code, and it is your job to analyze each code section and build a polynomial that represents the number of abstract operations the code performs. Once we’re done here, we’ll have built a polynomial that we will analyze further (in terms of g(x), c, 5 and k) in the next section. For the following code segments below, count the operations and produce a corresponding polynomial representation. f(x)= public static boolean isEmpty() {return head == null;} f(x) public static int num_occurrences(int n) {int count = 0;for(int i = 0; i < n; i++) {for(int j = 0; j < n; j++) {if( i == j ) continue;if(strings[i] == strings[j]) {count++;}}} return count;} f(x) public static void c(int n) {for(int a = 0; a < n; a++) {System.out.println( a * a);}num_occurrences(n);} f(x) public static boolean isPrime(int n) {if(n == 1) return false;for(int i = 2; i <n; i++) {if( n % i…
Counting Operations to Produce Polynomials In the following section, I will present you with multiple different bodies of code, and it is your job to analyze each code section and build a polynomial that represents the number of abstract operations the code performs. Once we’re done here, we’ll have built a polynomial that we will analyze further (in terms of g(x), c, 5 and k) in the next section. For the following code segments below, count the operations and produce a corresponding polynomial representation. f(x)= public static boolean isEmpty() {return head == null;} f(x) public static int num_occurrences(int n) {int count = 0;for(int i = 0; i < n; i++) {for(int j = 0; j < n; j++) {if( i == j ) continue;if(strings[i] == strings[j]) {count++;}}} return count;} f(x) public static void c(int n) {for(int a = 0; a < n; a++) {System.out.println( a * a);}num_occurrences(n);} f(x) public static boolean isPrime(int n) {if(n == 1) return false;for(int i = 2; i <n; i++) {if( n % i…
Profile the performance of the memoized version of the Fibonacci function defined in Project 6. The function should count the number of recursive calls. State its computational complexity using big-O notation, and justify your answer. The fib function header has been modified to include the counter as the second parameter. Define the Counter class, it should have three methods: __init__, increment, and __str__. When an instance of the Counter class is passed as a parameter, the count property of that instance should be incremented based on the number of recursive calls. The __str__ method should return the count property's value as a string. ----------------------------------------------------------------------------------- """ File: fib.py Project 11.7 Employs memoization to improve the efficiency of recursive Fibonacci. Counts the calls and displays the results. """ class Counter(object):     """Tracks a count."""     # Define the Counter class here. def fib(n, counter = None):…
Write the definition of the function to overload the operator*(as a member function) for the class polynomialType to multiply two polynomials. Also, write a test program to test the operator* #include <ostream>#include <istream>#include <iostream> using namespace std;using ::polynomialType; class polynomialType : public arrayListType<double>{ friend ostream& operator<<(ostream&, const polynomialType&); // Overloads the stream insertion operator friend istream& operator>>(istream&, polynomialType&); // Overloads the stream extraction operator public: polynomialType operator+(const polynomialType&); // Overloads the operator polynomialType operator-(const polynomialType&); // Overloads the operator polynomialType operator*(const polynomialType&); // Overloads the operator double operator()(double x); // Overloads the operator   polynomialType(int size = 100);…
1: |R|←|P|  Reserve space for |P| = 13 values.2: x ← n3: for i ← 0 ...(|P| − 1) do4: c ← x div Pi  Number of multiplicands Pi in x.5: Ri ← c6: x ← x − c · Pi7: end for8: return RA Java programmer could implement Algorithm by first modelling the primitivenumbers with the enumeration type RomanNumeral. Each enum constant (I, IV, ..., M) is declared with its decimal value, which can be accessed with the function getValue().
C++ Shape is an abstract class with a pure virtual function: Area(). (2) Circle is inherited from Shape, with a data member Radius, and a member function Area() to get the area of a circle. (3) Triangle is inherited from Shape, with two data members Bottom-length and Height, and a member function Area() to get the area of a triangle. Please complete the definition of Shape, Circle and Triangle, and define other necessary functions, to let a user can use Shape, Circle and Triangle as follows: void main( ) { Shape* p = new Circle(2); cout << "The area of the circle is: " << PrintArea(*p) << endl; Triangle triangle (3,4); cout << "The area of the triangle is: " << PrintArea(triangle) << endl; delete p; } The outputs: The area of the circle is: 12.56 The area of the triangle is: 6 //Your codes with necessary explanations: My code:…
.“Dangling and wild pointers are known to be problems with pointers”. Justify the given statement with the helpof suitable example
Design a function that consumes a natural number and produces a list ofstrings describing that many seats at a table. For example, (seats 3) shouldproduce the list (list "Seat 1" "Seat 2" "Seat 3"). Include all recipe elements. The body of your function definition MUSTUSE the build-list built-in abstract function. You may optionally use anadditional built-in abstract function. Using DrRacket