

MCQOPTIONS
Saved Bookmarks
This section includes 103 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
101. |
_____________ Procedure selects a flaw in a given plan and looks for a resolver. |
A. | goal stack planning |
B. | the plan space planning |
C. | recursive goal stack planning |
D. | partial order planning |
Answer» C. recursive goal stack planning | |
102. |
_____________search regresses over goals and validate a plan before returning it. |
A. | forward state space |
B. | backward state space |
C. | goa stack |
D. | none of these |
Answer» C. goa stack | |
103. |
The working memory of the problem solver is like its _________________ |
A. | long term memory |
B. | short term memory |
C. | permanent memory |
D. | none of these |
Answer» C. permanent memory | |