1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
NISA [10]
3 years ago
13

Write a program that lets the user enter the loan amount and loan period in number of years and displays the monthly and total p

ayments for each interest rate starting from 5% to 8%, with an increment of 1/8.
Computers and Technology
1 answer:
Citrus2011 [14]3 years ago
7 0

Answer:

Following are the code to this question:

import java.util.*;//import package

public class Main //defining a class

{

public static void main(String[] axc)//main method  

{

double Loan_Amount,years,Annual_Interest_Rate=5.0,Monthly_Interest_Rate,Total_Amount,Monthly_Payment;//defining variables

Scanner ax = new Scanner(System.in);//creating Scanner class object

System.out.print("Enter loan amount:");//print message

Loan_Amount = ax.nextDouble();//input Loan_Amount value

System.out.print("Enter number of years: ");//print message

years= ax.nextInt();//input number of years value

System.out.printf("   %-20s%-20s%-20s\n", "Interest Rate", "Monthly Payment","Total Payment");//print message

while (Annual_Interest_Rate <= 8.0) //use while loop to calculate Interest rate table

{

Monthly_Interest_Rate = Annual_Interest_Rate / 1200;//calculating the interest Rate

Monthly_Payment = Loan_Amount * Monthly_Interest_Rate/(1 - 1 / Math.pow(1 + Monthly_Interest_Rate,years * 12));//calculating monthly payment

Total_Amount = Monthly_Payment * years * 12;//calculating yearly Amount

System.out.printf("\t %-19.3f%-19.2f%-19.2f\n", Annual_Interest_Rate,Monthly_Payment,Total_Amount);//use print meethod to print table

Annual_Interest_Rate = Annual_Interest_Rate + 1.0 / 8;//use Annual_Interest_Rate to increating the yearly Rate

}

}

}

Output:

Please find the attached file.

Explanation:

In this code inside the class, several double variables are declared in which the "Loan_Amount and years" is used for input value from the user-end, and another variable is used for calculating the value.

In this code a while loop is declared that checks the "Annual_Interest_Rate" value and creates the interest rate table which is defined in the image file please find it.

You might be interested in
A program that is used to view websites is called a​
Nookie1986 [14]

Answer:

A web browser

examples of this would be

Bing

6 0
3 years ago
Read 2 more answers
In large organizations, there is a formal business function that includes developing an information policy, planning for data, o
Shkiper50 [21]

Answer:

Data administration.

Explanation:

Data management is a type of infrastructure service that avails businesses (companies) the ability to store and manage corporate data while providing capabilities for analyzing these data.

A database management system (DBMS) can be defined as a collection of software applications that typically enables computer users to effectively and efficiently create, store, modify, retrieve, centralize and manage data or informations in a database. Thus, it allows computer users to efficiently retrieve and manage their data with an appropriate level of security.

Generally, a database management system (DBMS) acts as an intermediary between the physical data files stored on a computer system and any software application or program.

Hence, a database management system (DBMS) is a system that enables an organization or business firm to centralize data, manage the data efficiently while providing authorized users a significant level of access to the stored data.

Data administration is a strategic process that is typically responsible for establishing information policy, data planning, data dictionary development, and monitoring data usage in the firm.

5 0
3 years ago
and assuming main memory is initially unloaded, show the page faulting behavior using the following page replacement policies. h
Svet_ta [14]

FIFO

// C++ implementation of FIFO page replacement

// in Operating Systems.

#include<bits/stdc++.h>

using namespace std;

// Function to find page faults using FIFO

int pageFaults(int pages[], int n, int capacity)

{

   // To represent set of current pages. We use

   // an unordered_set so that we quickly check

   // if a page is present in set or not

   unordered_set<int> s;

   // To store the pages in FIFO manner

   queue<int> indexes;

   // Start from initial page

   int page_faults = 0;

   for (int i=0; i<n; i++)

   {

       // Check if the set can hold more pages

       if (s.size() < capacity)

       {

           // Insert it into set if not present

           // already which represents page fault

           if (s.find(pages[i])==s.end())

           {

               // Insert the current page into the set

               s.insert(pages[i]);

               // increment page fault

               page_faults++;

               // Push the current page into the queue

               indexes.push(pages[i]);

           }

       }

       // If the set is full then need to perform FIFO

       // i.e. remove the first page of the queue from

       // set and queue both and insert the current page

       else

       {

           // Check if current page is not already

           // present in the set

           if (s.find(pages[i]) == s.end())

           {

               // Store the first page in the

               // queue to be used to find and

               // erase the page from the set

               int val = indexes.front();

               

               // Pop the first page from the queue

               indexes.pop();

               // Remove the indexes page from the set

               s.erase(val);

               // insert the current page in the set

               s.insert(pages[i]);

               // push the current page into

               // the queue

               indexes.push(pages[i]);

               // Increment page faults

               page_faults++;

           }

       }

   }

   return page_faults;

}

// Driver code

int main()

{

   int pages[] = {7, 0, 1, 2, 0, 3, 0, 4,

               2, 3, 0, 3, 2};

   int n = sizeof(pages)/sizeof(pages[0]);

   int capacity = 4;

   cout << pageFaults(pages, n, capacity);

   return 0;

}

LRU

//C++ implementation of above algorithm

#include<bits/stdc++.h>

using namespace std;

// Function to find page faults using indexes

int pageFaults(int pages[], int n, int capacity)

{

   // To represent set of current pages. We use

   // an unordered_set so that we quickly check

   // if a page is present in set or not

   unordered_set<int> s;

   // To store least recently used indexes

   // of pages.

   unordered_map<int, int> indexes;

   // Start from initial page

   int page_faults = 0;

   for (int i=0; i<n; i++)

   {

       // Check if the set can hold more pages

       if (s.size() < capacity)

       {

           // Insert it into set if not present

           // already which represents page fault

           if (s.find(pages[i])==s.end())

           {

               s.insert(pages[i]);

               // increment page fault

               page_faults++;

           }

           // Store the recently used index of

           // each page

           indexes[pages[i]] = i;

       }

       // If the set is full then need to perform lru

       // i.e. remove the least recently used page

       // and insert the current page

       else

       {

           // Check if current page is not already

           // present in the set

           if (s.find(pages[i]) == s.end())

           {

               // Find the least recently used pages

               // that is present in the set

               int lru = INT_MAX, val;

               for (auto it=s.begin(); it!=s.end(); it++)

               {

                   if (indexes[*it] < lru)

                   {

                       lru = indexes[*it];

                       val = *it;

                   }

               }

               // Remove the indexes page

               s.erase(val);

               // insert the current page

               s.insert(pages[i]);

               // Increment page faults

               page_faults++;

           }

           // Update the current page index

           indexes[pages[i]] = i;

       }

   }

   return page_faults;

}

// Driver code

int main()

{

   int pages[] = {7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2};

   int n = sizeof(pages)/sizeof(pages[0]);

   int capacity = 4;

   cout << pageFaults(pages, n, capacity);

   return 0;

}

You can learn more about this at:

brainly.com/question/13013958#SPJ4

4 0
1 year ago
What explains the discrepancy between the number of bytes you can
sergejj [24]

Answer:

This is because, the advertisers report the storage space in decimal while the computer reads the storage space in binary.

Explanation:

The advertisers report the storage space in decimal or base 10 because humans count in decimal, whereas the computer reports the storage space in binary or base 2.

Since the computer storage is in bytes and 8 bits equal 1 byte, It is easier to write a storage space of 1 kB as 1000 B but it is actually supposed to be 1024 B(2¹⁰). So, there is a discrepancy of 1024 B - 1000 B = 24 B.

As  we go higher, the discrepancy increases. For example, 1 MB is advertised as 1000 kB = 1000000 B but is actually supposed to be 1024 kB = 1024 × 1024 B = 1048576 B. So, there is a discrepancy of 1048576 B - 1000000 B = 48576 B.

So, the actual number of bytes on the storage device is actually less than that reported due to the different number systems in which they are reported in. This discrepancy is less in memory cards or flash drives though in which the stated value of storage capacity might be the actual storage size.

Note that the base 10 or decimal system was chosen by advertiser since this is what consumers understand.

8 0
3 years ago
Analyzing computer systems to gather potential legal evidence is computer ________. enforcement forensics detective work analysi
mel-nik [20]

Answer:

  forensics

Explanation:

Analyzing computer systems to gather potential legal evidence is computer <u>forensics</u>.

3 0
3 years ago
Other questions:
  • What Is the output of the following: =OR (5 &lt;7, 16*Rand ()&gt;23,FALSE)
    5·1 answer
  • Which of these items will least likely increase pressure in the evaporative emission control system?
    9·1 answer
  • Brenda's meeting with the web developer of her retail website concerning the integration of conversion tracking using Google Ads
    14·1 answer
  • What is a System Software ?
    11·2 answers
  • Please tell fast plzzzzzzzz​
    11·2 answers
  • Which types of online reading tools are available within the CloseReader? Check all that apply.
    11·1 answer
  • What does Technology mean to you?​
    9·2 answers
  • Peter has recently bought a media player and a digital camera. He wants to buy a memory card for these devices. Which memory dev
    11·1 answer
  • Jorge, a sports statistician for soccer, has kept track of how many shots-on-goal each player on a team made in each game. This
    9·1 answer
  • Information technology student Roberta has been assigned a project on how to detect unwanted outgoing attacks. Which step is par
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!