Explanation: Schedule developer needs to consider all constraints on teacher as well as students. 8. Constraint satisfaction problems on finite domains are typically solved using a form of ___________.
A. Search Algorithms
B. Heuristic Search Algorithms
C. Greedy Search Algorithms
D. DFS/BFS Search Algorithms
Answer:A
Explanation: Schedule developer needs to consider all constraints on teacher as well as students. 8. Constraint satisfaction problems on finite domains are typically solved using a form of ___________.
A. Search Algorithms B. Heuristic Search Algorithms C. Greedy Search Algorithms D. DFS/BFS Search Algorithms
Explanation: Any Search techniques can be used 9. Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.