Question
Find out the appropriate words.
In the following passage there are blanks, each of which has been numbered. These numbers are printed below the passage and against each five words are suggested, one of which fits the blank appropriately. Find out the appropriate words. Worried ……………..(105) the slowdown of the economy and the rising non-performing assets(NPAs) of public sector banks, the Reserve Bank of India(RBI) has asked banks to put a loan ………..(106) policy in ………..(107) while the government has asked them to take new initiatives to increase the pace of recovery and ………..(108) of NPAs. The cause for ………….(109) is the fact that the NPAs of public sector banks rose close to one percentage point from 3.17 percent to 4.01 percent in six months. On its part, the RBI has asked banks to have a loan recovery policy, which sets down the manner of recovery of dues, targeted level of reduction(period – wise), norms for permitted sacrifice/waiver, factors to be taken ………(110) account before considering waivers, decision levels, reporting to higher authorities and monitoring of write – off/waiver cases.Solution
Solution: Since there are NPAs, the RBI will only ask banks to get it back. So, ‘recovery’ is the correct option.
Recursive problems are implemented by
In Data Communication, what protocol is used to ensure reliable transmission of data over a network?
Which data structure is most suitable for implementing recursion?
Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?
Which graph traversal technique is commonly used for topological sorting?
The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?
Output of below code
public class Prg {
public static void main(String args[]){
System.out.print("A" + "B" + 'A');
}
...The time complexity of the best case for QuickSort is:
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
Relevant for Exams:
