Question
A PCA Framework for NBFCs has also been put in place to
further strengthen the supervisory tools applicable to NBFCs, The same shall apply to:? Read the following passage and answer the next 5 question Central Bank along with a clutch of other lenders was placed under RBI's prompt corrective action (PCA) in 2017 after the regulator found some state-run lenders were in breach of its rules on regulatory capital, bad loans and leverage ratios. Since then all the lenders except Central Bank have improved their financial health and come off RBI's PCA list. A bank under PCA faces greater scrutiny by the regulator and may face lending and deposit restrictions, branch expansion and hiring freezes and other limitations on borrowings. The RBI introduced these norms at a time when Indian lenders were battling record levels of soured assets, prompting the RBI to tighten thresholds. Source: economictimesSolution
PCA Framework for NBFCs has also been put in place to further strengthen the supervisory tools applicable to NBFCs. This shall apply to: Â All Deposit-Taking NBFCs [Excluding Government Companies], Â All Non-Deposit Taking NBFCs in Middle, Upper, and Top Layers [Excluding - (i) NBFCs not accepting/not intending to accept public funds; (ii) Government Companies, (iii) Primary Dealers, and (iv) Housing Finance Companies]. Â The PCA Framework for NBFCs shall come into effect from October 1, 2022, based on the financial position of NBFCs on or after March 31, 2022.
Which data structure is used in recursion?
An algorithm with a time complexity of O(log n) means that its execution time:
Which of the following is a key principle of the SOLID design principles that focuses on ensuring a class has only one reason to change?
What is the time complexity of searching an element in a balanced binary search tree (BST) with nnn nodes?
What is the time complexity of searching for an element in a sorted array using binary search?
 Which graph traversal algorithm uses a queue to explore vertices in a layer-by-layer fashion?
Which data structure is used for undo operations in text editors?
What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?
Given a singly linked list with 'n' nodes, what is the time complexity to delete the last node?
A binary search tree (BST) property states that for any given node:
