Algorithms Interview Question Part2

13. Searches in which the entire table is constantly not in main memory is called as
a. External search
b. Internal search
c. None of these
d. All of these
Ans:a


14. The class of algorithms that remembers older results and attempts to use this to speed the process of finding new results is called (practice test question)
a. Dynamic Programming Algorithms
b. Greedy Algorithms
c. Backtracking Algorithms
d. Divide and Conquer Algorithms
Ans:a
The algorithms that test for a solution, if one is found the algorithm is solved, if not it recurs once and tests again, continuing until a solution is found is called backtracking algorithm.

15. The class of algorithms that includes any algorithm that uses a random number at any point during its process. (practice test question)
a. Dynamic Programming Algorithms
b.Randomized Algorithms
c.Backtracking Algorithms
d.Divide and Conquer Algorithms
Ans:b
The class of algorithms that remembers older results and attempts to use this to speed the process of finding new results is called dynamic programming algorithm.
The algorithms that test for a solution, if one is found the algorithm is solved, if not it recurs once and tests again, continuing until a solution is found is called backtracking algorithm.


16. The algorithms that form a tree of subproblems to the primary problem, following each branch until it is either solved or lumped in with another branch. (practice test question)
a. Dynamic Programming Algorithms
b. Branch and Bound Algorithms
c.Backtracking Algorithms
d.Divide and Conquer Algorithms
Ans:b
The class of algorithms that remembers older results and attempts to use this to speed the process of finding new results is called dynamic programming algorithm.
The algorithms that test for a solution, if one is found the algorithm is solved, if not it recurs once and tests again, continuing until a solution is found is called backtracking algorithm.


17. This type of algorithm goes for a direct solution first, then backtracks to find a simpler solution. (practice test question)
a. Dynamic Programming Algorithms
b. Branch and Bound Algorithms
c. Simple Recursive Algorithms
d.Divide and Conquer Algorithms
Ans:c
The class of algorithms that remembers older results and attempts to use this to speed the process of finding new results is called dynamic programming algorithm.
The algorithms that form a tree of subproblems to the primary problem, following each branch until it is either solved or lumped in with another branch is called branch and bound algorithm.