Question
Dijkstra's algorithm, used for finding the shortest
paths from a single source to all other vertices in a graph with non-negative edge weights, is an example of which algorithmic paradigm?Solution
Dijkstra's algorithm is a greedy algorithm. At each step, it selects the unvisited vertex with the smallest known distance from the source and marks it as visited, then updates the distances of its neighbors. This locally optimal choice (picking the closest unvisited vertex) leads to a globally optimal solution for shortest paths in graphs with non-negative edge weights.
Fiscal Policy in India is formulated by whom?
Recently, Brenda Hale was appointed as first female president of the Supreme Court in which of the following country?Â
__________________ is a decrease in the rate of inflation – a slowdown in the rate of increase of the general price level of goods and servic...
Magnetic Ink Character recognition is a _______code to identify the bank branch.
What does ‘A’ stand for in CAMELs rating system?
Match the following:
A) Credit Risk Agency P) RBI
B) Inflation Management Q) SEBI
C) Supervision of RRBs R) Fitch
D) Money M...
___________ is an electronic fund transfer system that operates on a Deferred Net Settlement (DNS) basis which settles transactions in batches.
Which of the following statements is FALSE about the function of a commercial bank
Which of the Following T-Bills is not issued at present?
Which electronic funds transfer system in India is available 24/7 throughout the year, including on holidays also?
