Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 3 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Programming Posted 04 May 2017 My Price 8.00

Design a PhoneCall class

Complete the following tasks:

a. Design a PhoneCall class that holds a phone number to which a call is placed, the length of the call in minutes, and the rate charged per minute. Overload extraction and insertion operators for the class.

b. Overload the == operator to compare two PhoneCalls. Consider one PhoneCall to be equal to another if both calls are placed to the same number.

c. Create a main()function that allows you to enter 10 PhoneCalls into an array. If a PhoneCall has already been placed to a number, do not allow a second PhoneCall to the same number. Save the file as PhoneCall.cpp.

 

Answers

Alpha Geek
(8)
Status NEW Posted 04 May 2017 12:05 PM My Price 8.00

-----------

Attachments

file 1493900179-Answer.docx preview (439 words )
C-----------omp-----------let-----------e t-----------he -----------fol-----------low-----------ing----------- ta-----------sks-----------: -----------a. -----------Des-----------ign----------- a -----------Pho-----------neC-----------all----------- cl-----------ass----------- th-----------at -----------hol-----------ds -----------a p-----------hon-----------e n-----------umb-----------er -----------to -----------whi-----------ch -----------a c-----------all----------- is----------- pl-----------ace-----------d, -----------the----------- le-----------ngt-----------h o-----------f t-----------he -----------cal-----------l i-----------n m-----------inu-----------tes-----------, a-----------nd -----------the----------- ra-----------te -----------cha-----------rge-----------d p-----------er -----------min-----------ute-----------. O-----------ver-----------loa-----------d e-----------xtr-----------act-----------ion----------- an-----------d i-----------nse-----------rti-----------on -----------ope-----------rat-----------ors----------- fo-----------r t-----------he -----------cla-----------ss.----------- b-----------. O-----------ver-----------loa-----------d t-----------he -----------== -----------ope-----------rat-----------or -----------to -----------com-----------par-----------e t-----------wo -----------Pho-----------neC-----------all-----------s. -----------Con-----------sid-----------er -----------one----------- Ph-----------one-----------Cal-----------l t-----------o b-----------e e-----------qua-----------l t-----------o a-----------not-----------her----------- if----------- bo-----------th -----------cal-----------ls -----------are----------- pl-----------ace-----------d t-----------o t-----------he -----------sam-----------e n-----------umb-----------er.----------- c-----------. C-----------rea-----------te -----------a m-----------ain-----------()f-----------unc-----------tio-----------n t-----------hat----------- al-----------low-----------s y-----------ou
Not Rated(0)