to solve the all-pairs shortest paths problem which algorithm's is/are – McqOptions

MCQOPTIONS

1.	to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
A.	and c)
B.	and b)
C.	and c)
D.	and d)
Answer» C. and c)

Discussion

No Comment Found

Related MCQs

CUDA Hardware programming model supports:a) fully generally data-parallel archtecture;b) General thread launch;c) Global load-store;d) Parallel data cache;e) Scalar architecture;f) Integers, bit operation
In CUDA memory model there are following memory types available:a) Registers;b) Local Memory;c) Shared Memory;d) Global Memory;e) Constant Memory;f) Texture Memory.
The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as .
to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps.
In All-to-All Personalized Communication on a Ring, the size of the message reduces by at each step
Select correct answer: DRAM access times have only improved at the rate of roughly % per year over this interval.
All-to-all personalized communication is also known as .
Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n)2. begin3. for i := n - 1 downto 1 do4. for j := 1 to i do5. compare-exchange(aj, aj + 1);6. end X_SORT
Which of the following is TRUE for Bitonic Sequencea) Monotonically increasingb) Monotonically Decreasingc) With cyclic shift of indicesd) First increasing then decreasing