Question
Which one of the following algorithm design techniques is
used in finding all pairs of shortest distances in a graph?Solution
Bellman-Ford algorithm is used to find all pairs shortest distances in a graph and it is dynamic programming technique.
Which of the following is NOT included in the financial budget of India?Â
With reference to Pradhan Mantri Kaushal Vikas Yojana, consider the following statements?
1.   It is the flagship scheme of the Ministry of...
A shopkeeper sold an article after giving a discount of 20% and made a profit of Rs. 70. Find the marked price of the article if cost price of the artic...
Which of the following statements is true about the term 'Roll over' related to Economy, seen sometimes in news?Â
Ajay invested Rs.a in SI at 8% rate of interest per annum for 10 years. Vishal invested the same amount in SI at 5% rate of interest per annum for 6 yea...
Match List-I (Outstanding Sports persons at the Athens Olympics) with List-II (Country) and select the correct answer using the codes given below the L...
Formation of urine in the kidneys involves the given three processes in which of the following sequences?
A man deposited Rs. 13000 at 10% compound interest, compounded annually while Rs. 11500 at 13% simple interest per annum. What will be the difference be...
The Indian Standard Time (IST) remains how much ahead from Greenwich Mean Time (GMT)?
What is the name of the semiconductor fabrication plant recently established through the India-US partnership?
Relevant for Exams:
