Analysis & Design Of Algorothms
CS-402
Quiz Assignment
Write the correct answer with justification:
(All correct answers are in BLUE.)
Q1 What happens when the backtracking algorithm reaches a complete
solution?
a) It backtracks to the root
b) It continues searching for other possible solutions
c) It traverses from a different route
d) Recursively traverses through the same route
Q2 Backtracking algorithm is implemented by constructing a tree of
choices called as?
a) State-space tree
b) State-chart tree
c) Node tree
d) Backtracking tree
Q3 Who coined the term ‘backtracking’?
a) Lehmer
b) Donald
c) Ross
d) Ford
Q4 Strassen’s algorithm is a/an_____________ algorithm.
a) Non- recursive
b) Recursive
