Question
Recently Reserve Bank of India gave approval to which of
the following Fintech firm to operate as NBFC account aggregator?Solution
Fintech firm Cygnet has received in-principle approval from the Reserve Bank of India (RBI) to operate as a non-banking financial company (NBFC) account aggregator. The account aggregator license will allow them to participate in the transformational changes that are taking place in the financial sector. Small and medium-sized businesses will get better credit facilities whilst banks and other financial institutions will get an opportunity to widen their lending portfolio. RBI Headquarters: Mumbai Governor: Shaktikanta Das Deputy Governors: MK Jain, MD Patra, M Rajeshwar Rao and T. Rabi Sankar Non-Banking Financial Company (NBFC) is a company registered under the Companies Act, 1956 and engaged in the business of loans and advances, acquisition of shares/stocks/bonds/debentures/securities issued by Government or other marketable securities of a like nature, leasing, hire-purchase, insurance business, chit business. Account Aggregator Framework: It is a framework for data sharing between financial institutions like banks, pension funds, insurance companies and assets management companies. Under this, account aggregators (AAs) use technology for simple and secure exchange of the data between the institutions. With AAs, financial data can be used to access a vast array of financial services for your personal or business needs.
Which layer of the TCP/IP model is responsible for IP addressing and routing?
Which of the following is/are ideal of ways of spreading virus
A 'ransomware' attack typically involves:
Which routing protocol is commonly used within an autonomous system (AS) to determine the best path for data packets?
What does PHP stand for?
Which ICMP message indicates “Fragmentation Needed”?
Which type of neural network architecture is specifically designed to process data with a variable-length sequence?
What is the role of the Transaction Manager in RDBMS architecture?
calculate the complexity of the below recursive code
Int f(int n)
{
If(n
return 1;
return f(n/2)+f(n/2);
}
Which scheduling policy assigns the CPU to a job until it finishes or enters a waiting state?