Write a program to process bank accounts. Create a base class named Account and two derived classes named Savings and Checking. In the base class, use an int AccountNum and a double balance for data members. Also, create an overloaded operator+= function to do deposit and an overloaded operator-= function to do withdraw. The printBalance function is created to print both savings and checking accounts. The account number of new account is automatically generated by the program beginning at account number one. here is what I have started #include #include #include using namespace std; int main() { vector < Checking * > checking(50); vector < Savings * > savings(50); int accNumS = 0, accNumC=0; double bal = 0, amt = 0 int choice do{ cout<<"Enter one of the following:"; cout<<"1) Create a new Checking Account"; cout<<"2) Create a new Savings Account"; cout<<"3) Make a Deposit for Checking Accoutn(s)"; cout<<"4) Make a Withdrawl for Checking Account(s)"; cout<<"5) Make a Deposit for Savings Account(s)"; cout<<"6) Make a Withdrawl for Savings Account(s)"; cout<<"7) Display all Accounts"; cout<<"8) Exit"; cout<<"Enter Choice: "; cin>>choice; } switch(choice){ case 1: cout<<"Enter Balance for Account # "< cin >> bal; checking[accNumC] = new Checking(accNumC+1, bal); break case 2: cout<<"Enter Balance for Account # "< cin >> bal; savings(accNumS) = new Savings(accNumS+1, bal); break case 3: cout << "Which Checking Account: "; cin >> acct; cout <<"Amount of Deposit: "; cin >> amt ; (*checking [acct-1]) += amt; break case 4: cout << "Which Checking Account" cin >> acct; cout <<"Amount of Withdrawl: " cin >> amt; (*savings[acct-1]) -= amt; break case 5: cout << "Which Savings Account: "; cin >> acct; cout <<"Amount of Deposit: "; cin >> amt ; (*savings [acct-1]) += amt; break case 6: cout <<"Which Savings Account" cin >> acct; cout <<"Amount of Withdrawl: "; cin >> amt ; (*savings [acct-1]) -= amt; break case 7: Account::print; break case 8: break; default:cout<"Invalid choice"; break; } while(choice != 8); } Posted Date: 11/16/2012 7:18:16 AM | Location : United States

Ask an Expert

Your posts are moderated

Write your message here..

Related Questions

Program to design list in c, Program to design list in c: Write a prog... Program to design list in c: Write a program in c to insert the values in list void main() { int i=0; char a[20]; clrscr(); printf("Enter the line\n");

Computer programing, pls give me answer 01110-00110 in 2''s comlpiment in d... pls give me answer 01110-00110 in 2''s comlpiment in detail

Area under the curve, program area under the curve y=f(x) between x=a & y=b... program area under the curve y=f(x) between x=a & y=b, integrate y=f(x) between the limits of a & b   Solution: #include float    start_point,            /* GLOBAL V

Print the sorted output on the console, Question 1 Describe the theory beh... Question 1 Describe the theory behind class templates and function templates along with relevant programming examples Question 2 With the help of suitable programming example

Padovan.., count the number of string in n-th padovan string count the number of string in n-th padovan string

Example of structure, Example of structure: struct item {       ... Example of structure: struct item {                 int element;                 node_ptr next; }; typedef node_ptr stack; stack create(void) {

Decode the code, Smugglers are becoming very smart day by day. Now they hav... Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send

Inheritance, example of program to ad two numbers example of program to ad two numbers

Star, Write a program that finds the minimum total number of shelves, inclu... Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

What is the best fit algorithm, The Best fit algorithm: The best fit metho... The Best fit algorithm: The best fit method occurs the smallest free block whose size is greater than or equivalent to n. An algorithm to get such a block by traversing the whole