Question
You are given a problem to find the shortest path in a
graph where edge weights can be negative. Which algorithm would you *not* use?Solution
Dijkstra's Algorithm works correctly only for graphs with non-negative edge weights. If negative edge weights are present, it may produce incorrect results. Bellman-Ford, Floyd-Warshall, and SPFA are designed to handle negative edge weights (Bellman-Ford also detects negative cycles). A* search can also work with negative weights if the heuristic is consistent.
When did Financial Stability Board come into existence?
A company invests in different assets simultaneously in order to reduce risks. What is this strategy called?
Delta is a measure of ______
Flexible Budget is a budget with which features?
A bank certificate issued in more than one country for shares in a foreign company. The shares are held by a foreign branch of an International Bank. Th...
What does the BRSR Core represent?
Micro Finance Development and Equity Fund is administered by:
A ___________ is an agreement between two parties to exchange cash flows on a determined date or in many cases multiple dates.
Which of the following statements is/are correct regarding Derivatives in India?
1)Â Â Â Â Â Derivatives are financial instruments that deriv...
An investor enters into a long position in one Nifty Future contract (Lot Size = 50) at a price of ₹24,000. The broker mandates an Initial Margin of...
