MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Language/Languages used for programming Constraint Programming includes ____________ |
| A. | Prolog |
| B. | C# |
| C. | C |
| D. | Fortrun |
| Answer» B. C# | |
| 2. |
Consider a problem of preparing a schedule for a class of student. What type of problem is this? |
| A. | Search Problem |
| B. | Backtrack Problem |
| C. | CSP |
| D. | Planning Problem |
| Answer» D. Planning Problem | |
| 3. |
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ |
| A. | Forward Searching |
| B. | Constraint Propagation |
| C. | Backtrack after a forward search |
| D. | Omitting the constraints and focusing only on goals |
| Answer» B. Constraint Propagation | |