1Quick sort uses which design technique?ABranch and boundBGreedyCDynamic programmingDDivide and conquerView AnswerDiscussWorkspaceReportSaveEasy
2Floyd–Warshall computes:ASingle-source shortest paths onlyBTopological orderCAll-pairs shortest pathsDMinimum spanning treesView AnswerDiscussWorkspaceReportSaveEasy
3Topological sorting of a DAG can be done in:AO(V³)BO(E log V)CO(V + E)DO(V²) onlyView AnswerDiscussWorkspaceReportSaveEasy
4The longest common subsequence of two strings of lengths m and n can be found in:AO(log n) timeBO(mn) timeCO(m + n) timeDO(2ⁿ) time onlyView AnswerDiscussWorkspaceReportSaveEasy
5How many comparisons does finding both the minimum and maximum of n elements need using the pairwise method?AAbout 3n/2Bn²CnD2nView AnswerDiscussWorkspaceReportSaveMedium