(Financial tsunami) Banks lend money to each other. In tough economic times, if a bank goes bankrupt, it may not be able to pay back the loan. A bank’s total assets are its current balance plus its loans to other banks. The diagram in Figure 8.8 shows five banks. The banks’ current balances are 25, 125, 175, 75, and 181 million dollars, respectively. The directed edge from node 1 to node 2 indicates that bank I lends 40 million dollars to bank 2.
figure 8.8 Banks lend money to each other.
If a bank’s total assets are under a certain Limit, the bank is unsafe. The money it borrowed cannot be returned to the lender, and the lender cannot count the loan in its total assets. Consequently, the lender may also be unsafe, if its total assets are under the Limit. Write a
5 201
25 2 1 100.5 4 320.5
125 2 2 40 3 85
175 2 0 125 3 75
75 1 0 125
181 1 2 125
The total assets of bank 3 are (75 + 125), which is under 201, so bank 3 is unsafe. After bank 3 becomes unsafe, the total assets of bank 1 fall below (125 + 40). Thus, bank 1 is also unsafe. The output of the program should be
Un safe banks are 3 1
(Hint: Use a two-dimensional array borrowers to represent loans. borrowers [i] [j] indicates the loan that bank i provides to bank j . Once bank j becomes unsafe, borrowers[i] [j] should be set to 0.)
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Additional Engineering Textbook Solutions
Modern Database Management (12th Edition)
Java: An Introduction to Problem Solving and Programming (7th Edition)
Database Concepts (8th Edition)
Starting Out with Python (4th Edition)
Digital Fundamentals (11th Edition)
Introduction To Programming Using Visual Basic (11th Edition)
- Please show the work necessary to get the answer.arrow_forwardPython: A ball falls freely from a height of 100 meters, and bounces back to half of its original height after each landing; again, how many meters does it travel when it hits the ground for the 10th time? How high is the 10th rally?arrow_forwardPlease explain the answer and show the souloution ! f14arrow_forward
- Please explain the answer show how you did the problem!! f4arrow_forwardArtificial Intelligence (Part - 1) ==================== The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. (1) Propose a state representation for the problem?arrow_forwardMust Answer both the problems else downvotearrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning