Question
Which algorithm is used to find the shortest path from a
single source in graphs with negative weights?Solution
Bellman-Ford handles negative weights and detects negative cycles; Dijkstra cannot handle negative edges.
The number of five–digit telephone numbers having at least one of their digits repeated is
Which of the following shortcut key use to check Spellings in MS Office?
Consider a two-digit number where the ratio of the unit digit to the tens digit is 2:3. If the total of these digits equals 15, what is the product of t...
Formatting a disk means?
If × stands for addition, ÷ stands for subtraction. + stands for multiplication and ̶ stands for division, then what is the value of 20 &t...
__________is the process that connects to a network without the use of cables.
Monthly savings of X is 60% of his monthly income which is Rs. 7500. If ratio of monthly expenditure of Y and X is 15:8 respectively and monthly savings...
The mean deviation of the data 3, 10, 10, 4, 7, 10, 5 is:
There are total 200 students in a school, of which 1/5 are boys. Find the number of girls in the school.
