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

C++ computer science project.Create your actual machine class and change the factory to create it. Create empty functions and ensure they are being called by setting breakpoints

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

C++ computer science project. Attached a couple screenshots. Could give my course page login to take a look and see if something you're capable of

 

This is an example development order. This is only a suggestion, there are

many ways to get this going. Some items have addit,onal information

available.

1. ()Create your actual machine class and change the factory to

create it. Create empty functions and ensure they are being

called by setting breakpoints.

2. (J Create your working machine class and a factory to create it.

3, ()Ensure you can create a machine on demand and install it.

Create empty functions and ensure they are being called. I

found It easiest to deal with the machine number and

recreating machines here.

4. Create the component base class, I made mine derived from

Polygon, since every single component needs a basic shape.

5. Create a shape class derived from the component base class.

6. OE)Oecicle what the first shape In your machine should be and

get it created in your factory.

7. OE)Get that shape to draw,

8. Create the motor class and get a motor on the screen. I first

created It without the shaft support, then added that.

9. ()Md the shaft support and get it turning.

lo. OE1 Create your connection classes for rotation.

11. (J Create a Shape and connect It to the motor. ¡ just created the

flag temporarily and connected it.

12. Get the pcocess working to rotate the flag when the motor

rotates.

(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

993 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

904 Answers

Hire Me
expert
Husnain SaeedComputer science

603 Answers

Hire Me
expert
Atharva PatilComputer science

580 Answers

Hire Me
June
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
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
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