logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

The member function named as extractLargestDistanceInfo() that will receive an array of Point objects and its size as Then,

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Reminders: Print and turn in all *.h files

Question #1 (5 points)

Complete the following sentence,

We write code to"

Question #2 (5 points)

Complete the following sentence,

Reminder!

·         For the following problems/exercises, the given classes are considered implemented with the members as shown and from your homework.

  • If you need any other tools/functions, you have to declared and implemented first before you can claim their

  • As you are designing and coding, please remember your answers to the above two (2)

// The given classes that have been worked on

// in class homework

/**

  • Program Name: h

  • Discussion: Declaration File -–

  • Fraction class

*/

#ifndef FRACTION_H #define FRACTION_H

class Fraction { public:

Fraction();

Fraction(const Fraction&); Fraction(int, int);

~Fraction() {};

// Member functions

int getNum(void) const; void setNum(int);

int getDenom(void) const; void setDenom(int);

// Other functions shown and implemented in homework

// Write below any of your own/additional function prototypes being

// used in your final exam that are not seen anywhere in your homework.

// And if so, you MUST also provide their function definitions in

// the back of the sheets (indicated with page numbers).

private:

int num; int denom;

};

#endif;

/**

  • Program Name: h

  • Discussion: Declaration File --

  • Point Class

*/

#ifndef POINT_H #define POINT_H

#include "fraction.h"

class Point { public:

Point();

Point(const Point&);

Point(const Fraction& x, const Fraction& y);

~Point() {

// Your code

};

// Member Functions shown and implemented in homework

// Write below any of your own/additional function prototypes being

// used in your final exam that are not seen anywhere in your homework.

// And if so, you MUST also provide their function definitions in

// the back of the sheets (indicated with page numbers).

private:

Fraction x;

Fraction y;

};

#endif

/**

  • Program Name: h

  • Discussion: Declaration File --

  • Rectangle Class

*/

#ifndef RECTANGLE_H #define RECTANGLE_H

#include "fraction.h" #include "point.h"

class Rectangle { public:

// Write below any of your own/additional function prototypes being

// used in your final exam that are not seen anywhere in your homework.

// And if so, you MUST also provide their function definitions in

// the back of the sheets (indicated with page numbers).

private:

Fraction len;

Fraction wid;

Point ul;  // Upper-Left corner

};

#endif

 

Problem #1 (35 Points)

 

For class Point, write a member function extractLargestDistanceInfo(), which is specified as below.

  • The member function named as extractLargestDistanceInfo() that will receive an array of Point objects and its size as Then,

Ø  The function will then search for the Point objects that have the same largest distance with respect to the calling Point object; and

  • The information will be returned as an array as follows,

{numberOfPointObjectWithSameLargestDistance, firstIndex, secondIndex,..., lastIndex}

  • The function MUST NOT MODIFY the existing array given as

p1 

P0 P5                                       P2

P3

callingPoint

P4

Figure 1.1 The relative positioning of several Point objects

Function Prototype (5 Points) 

Function Definition (30 points)

 

Problem #2 (25 Points)

For class Rectangle, write a member function named as isContaining() that will

Ø  Receive a Point object as argument; and

  • Return true if the Rectangle object is enclosing (including on the edges/sides) the

Point object, and false otherwise.

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

566 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

528 Answers

Hire Me
expert
Husnain SaeedComputer science

550 Answers

Hire Me
expert
Atharva PatilComputer science

557 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30