11The longest common subsequence of two strings of lengths m and n can be found in:AO(mn) timeBO(log n) timeCO(m + n) timeDO(2ⁿ) time onlyView AnswerDiscussWorkspaceReportSaveEasy
12Matrix chain multiplication is solved using:ABacktracking onlyBGreedy choiceCDynamic programmingDBinary searchView AnswerDiscussWorkspaceReportSaveEasy
13P vs NP asks whether:APolynomials are NPBEvery problem whose solution can be verified quickly can also be solved quicklyCSorting is hardDAll problems are solvableView AnswerDiscussWorkspaceReportSaveEasy
14The master theorem gives T(n) = 4T(n/2) + n as:AO(n log n)BO(n)CO(n²)DO(n³)View AnswerDiscussWorkspaceReportSaveEasy
15Topological sorting of a DAG can be done in:AO(V + E)BO(V²) onlyCO(E log V)DO(V³)View AnswerDiscussWorkspaceReportSaveEasy