6Memoisation means:AStoring results of function calls to avoid recomputationBSorting resultsCWriting memosDDeleting old dataView AnswerDiscussWorkspaceReportSaveEasy
7The 0/1 knapsack problem is solved optimally by:ASorting onlyBA greedy algorithmCBinary searchDDynamic programmingView AnswerDiscussWorkspaceReportSaveEasy
8Strassen's algorithm multiplies matrices in about:AO(n²)BO(n³)CO(n log n)DO(n^2.81)View AnswerDiscussWorkspaceReportSaveEasy
9Branch and bound is used for:AHashingBSortingCOptimisation problems by pruning branches that cannot beat the best solutionDSearching sorted arraysView AnswerDiscussWorkspaceReportSaveEasy
10Quick sort uses which design technique?ABranch and boundBGreedyCDivide and conquerDDynamic programmingView AnswerDiscussWorkspaceReportSaveEasy