2. 程式人生 > 其它 >The balance sheet of KriBank starts with an allowance for loan losses of $2.66 million. During the year, KriBank writes-off worthless loans amounting to $1.68 million, reco

The balance sheet of KriBank starts with an allowance for loan losses of $2.66 million. During the year, KriBank writes-off worthless loans amounting to $1.68 million, reco

阿新 • • 發佈：2022-03-29

The balance sheet of KriBank starts with an allowance for loan losses of $2.66 million. During the year, KriBank writes-off worthless loans amounting to $1.68 million, recovers $0.44 million on loans previously written off, and charges current income for $2.96 million provisions for loan losses. Calculate the end of year allowance for loan losses.

The balance sheet of KriBank starts with an allowance for loan losses of $2.66 million. During the year, KriBank writes-off worthless loans amounting to $1.68 million, recovers $0.44 million on loans previously written off, and charges current income for $2.96 million provisions for loan losses.

a. Calculate the end-of-year allowance for loan losses.

b. X-Bank reported an ROE of 15% and a ROA of 1%. How well capitalized in this bank?

answers

  Computation of end of year allowance for loan losses  
a   $ in Milion
  Opening allowance for loan losses 2.66
  Less : Wortless Loan Writen off 1.68
  Add : Recovery of Loans written of Previously 0.44
  Add : Current year's provisions for Losses 2.96
  Year end allowance for Loan Losses 4.38
     
b ROE=ROA×EM  
  0.15=0.01×EM  
  EM=15=assets/equity  
  So Equity/Assets=6.66%  
     
  The Bank is well capitalised

 

相關推薦

The balance sheet of KriBank starts with an allowance for loan losses of $2.66 million. During the year, KriBank writes-off worthless loans amounting to $1.68 million, reco

The balance sheet of KriBank starts with an allowance for loan losses of $2.66 million. During the year, KriBank writes-off worthless loans amounting to $1.68 million, recovers $0.44 million on loans

CF27E Number With The Given Amount Of Divisors 題解

CSDN同步 原題連結 簡要題意： 求最小的有 \\(n\\) 個因數的數 \\(s\\)。\\(n \\leq 10^3\\) ,保證 \\(s \\leq 10^{18}\\).

Finding max and min in arrays Find the index of K min in an array

Implement a method that finds the index of the K-th element equal to the minimum in an array of ints. If no such element can be found, return -1. The input array can be empty, K > 0.

windows伺服器新增磁碟後，提示The disk is offline because of policy set by an administrator的解決辦法

作業系統：Windows Server 2008 R2 Enterprise 事件：外部新增兩塊磁碟，擴充套件到E盤（動態分割槽）

OA Framework - How to Find the Correct Version of JDeveloper to Use with E-Business Suite 11i or Release 12.x (Doc ID 416708.1)

OA Framework - How to Find the Correct Version of JDeveloper to Use with E-Business Suite 11i or Release 12.x (Doc ID 416708.1)

CF27E Number With The Given Amount Of Divisors

題目 CF27E Number With The Given Amount Of Divisors 分析 不知道為什麼這種提這麼多。 根據因數和公式，發現質因數個數很少，於是直接搜尋即可。

報錯--->java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'delect from testd

報錯--->java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near \'delect from testdb.

1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

問題： 求Fibonacci數列中，最少多少個數之和為K 數列中元素可重複使用。 Example 1:

文獻閱讀 | Fine definition of the pedigree haplotypes of closely related rice cultivars by means of genome-wide discovery of single-nucleotide polymorphisms

Yamamoto, T., Nagasaki, H., Yonemaru, J. et al. Fine definition of the pedigree haplotypes of closely related rice cultivars by means of genome-wide discovery of single-nucleotide polymorphisms. BMC

Java Tutorials(the traditional features of the Java, including variables, arrays, data types, operators and control flow)

Language Basics the traditional features of the Java, including variables, arrays, data types, operators and control flow

The Flee Plan of Groundhog

The Flee Plan of Groundhogdfs相向而行就距離-3，時間+1背道而馳就距離-1，時間+1注意土撥鼠可以不走，特判就好

牛客2020 第九場 J-The Escape Plan of Groundhog（n3搞搞

題意：https://ac.nowcoder.com/acm/contest/5674/J 統計有多少矩陣四周被1包住且裡面的0數和1數之差不大於1

思維 [2020牛客暑期多校訓練營（第九場） The Escape Plan of Groundhog]

思維 2020牛客暑期多校訓練營（第九場） The Escape Plan of Groundhog 題目大意： 給一個01矩陣，問滿足三個要求的子矩陣有多少個

The Escape Plan of Groundhog

J. The Escape Plan of Groundhog 首先這道題肯定只能\\(O(n^3)\\)來寫，暴力來求的話是\\(O(n^4)\\)，那麼我們只需要優化一個\\(O(n)\\)就好了。

牛客多校(2020第九場)K The Flee Plan of Groundhog

題目大意： 有一個土撥鼠在節點1，一個橘子在節點n，在t時刻之前土撥鼠向著n走，橘子不動，從t時刻開始，橘子開始抓土撥鼠，土撥鼠開始跑，土撥鼠 1m/s 橘子 2m/s，問還有多長時間橘子才能抓到土撥鼠。

go:index out of range [0] with length 0與non-constant array bound length

有一段程式碼，涉及陣列和指標： 1 //通過整形指標陣列獲取陣列中的元素 2 func test(){

牛客多校9-K.The Flee Plan of Groundhog

題意： 　　a的速度是一秒走一格，b的速度是一秒走兩格，前t秒a沿著a->b的最短路去找b，t秒的時候b反過來抓a，問a最長多少秒才會被抓住

習題：The Unbearable Lightness of Weights（揹包）

題目 傳送門 思路 因為要確定砝碼的重量，所以一定是確定一堆重量相同的砝碼的重量

[React] Handle React Suspense Errors with an Error Boundary

Error Boundaries are the way you handle errors with React, and Suspense embraces this completely. Let\'s take a look at how to handle asynchronous errors with Suspense and Error Boundaries.

【leetcode】1524. Number of Sub-arrays With Odd Sum

題目如下： Given an array of integersarr. Returnthe number of sub-arrayswithoddsum. As the answer may grow large, the answermust becomputed modulo10^9 + 7.