Question
The Bellman-Ford algorithm executes relaxation steps how
many times for a graph with V vertices?Solution
Bellman-Ford relaxes all edges (V–1) times to ensure shortest paths accounting for up to V–1 edges.
What is the expected additional income for each SHG under the Namo Drone Didi scheme?
Optimum seed rate for pigeon pea or red gram is
Which pesticides are non-biodegradable and also called recalcitrant pesticides
How many crops are covered under the Minimum Support Price (MSP) scheme as of 2025-26?
Stomach poisons have gradually been replaced by synthetic insecticides, which are less dangerous to humans and other mammals
Name the chemical which is used for protoplast fusion
Which was first Indian dwarf amber grained variety of wheat made from Sonara 64 by γ –gamma rays
Under which scheme is the Recirculatory Aquaculture System (RAS) promoted?
According to latest Final estimates of Foodgrain production 2023-24, Which state is the largest producer of sugarcane in India?
What is the total outlay approved for the National Mission on Natural Farming (NMNF) under the Union Budget 2025-26?
