McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 1. |
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» B. short term memory | |
| 2. |
_____________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» B. backward state space | |
| 3. |
_____________ 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» B. the plan space planning | |
| 4. |
Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed |
| A. | (+,-,+) |
| B. | (-,+,-) |
| C. | (←,+,←) |
| D. | (←,←,←) |
| Answer» D. (←,←,←) | |
| 5. |
If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________ |
| A. | arc consistent |
| B. | i- consistent |
| C. | path consistent. |
| D. | 2- consistent |
| Answer» C. path consistent. | |
| 6. |
The __________algorithm explores the domain in a depth first manner. |
| A. | backtracking |
| B. | forward checking |
| C. | arc consistency |
| D. | strategic retreat |
| Answer» A. backtracking | |
| 7. |
_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. |
| A. | constraints satisfaction problems |
| B. | uninformed search problems |
| C. | local search problems |
| D. | all of the mentioned |
| Answer» A. constraints satisfaction problems | |
| 8. |
Which of the Following problems can be modeled as CSP? |
| A. | 8-puzzle problemb. |
| B. | 8-queen problem |
| C. | map coloring problem |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 9. |
Backtracking is based on ____________ |
| A. | last in first out |
| B. | first in first out |
| C. | recursion |
| D. | both last in first out & recursion |
| Answer» D. both last in first out & recursion | |
| 10. |
The inference engine goes through which cycle? |
| A. | match-resolve-execute |
| B. | execute-resolve-match |
| C. | resolve match match |
| D. | resolve match execute |
| Answer» A. match-resolve-execute | |
| 11. |
The output of MATCH routine in Inference Engine is ______________ |
| A. | pattern set |
| B. | conflict set (cs) |
| C. | rule set |
| D. | action set |
| Answer» B. conflict set (cs) | |
| 12. |
Operator PUTDOWN has which of the following sequence of actions? |
| A. | holding(x),ontable(x),holding(x) |
| B. | holding(x),armempty, holding(x) |
| C. | holding(x),ontable(x) |
| D. | holding(x),ontable(x)^armempty, holding(x) |
| Answer» D. holding(x),ontable(x)^armempty, holding(x) | |
| 13. |
Frame problem in STRIPS Domain can be solved by _____________________ |
| A. | operator |
| B. | frame aximoms |
| C. | precondition |
| D. | action |
| Answer» B. frame aximoms | |
| 14. |
PDDL stands for_________________________ |
| A. | path data description language |
| B. | planning domain description language |
| C. | planning data description language |
| D. | path data deleted language |
| Answer» B. planning domain description language | |
| 15. |
In PDDL,the Language is based on _______________________ |
| A. | propositional logic notation |
| B. | second order logic notation |
| C. | first order logic notation |
| D. | all of these |
| Answer» C. first order logic notation | |
| 16. |
STRIPS operators are made up of which three components: |
| A. | p: precondition list , a: add list , d:delete list |
| B. | p: postcondition list , a: add list , d:delete list |
| C. | p: precondition list , s: sub list , d:delete list |
| D. | p: postcondition list , s: sub list , d:delete list |
| Answer» A. p: precondition list , a: add list , d:delete list | |
| 17. |
Which search algorithm imposes a fixed depth limit on nodes? |
| A. | depth-limited search |
| B. | depth-first search |
| C. | iterative deepening search |
| D. | bidirectional search |
| Answer» A. depth-limited search | |
| 18. |
In a rule-based system, procedural domain knowledge is in the form of:___________ |
| A. | production rules |
| B. | rule interpreters |
| C. | meta-rules |
| D. | control rules |
| Answer» A. production rules | |
| 19. |
_____________ is a state that is better than all its neighboring states but is not better than some other states further away |
| A. | plateau |
| B. | local maximum |
| C. | global maximum |
| D. | all of the above |
| Answer» B. local maximum | |
| 20. |
___________ algorithm keeps track of k states rather than just one. |
| A. | hill-climbing search |
| B. | local beam search |
| C. | stochastic hill-climbing search |
| D. | random restart hill-climbing search |
| Answer» B. local beam search | |
| 21. |
Which is the most straightforward approach for planning algorithm? |
| A. | best-first search |
| B. | state-space search |
| C. | depth-first search |
| D. | hill-climbing search |
| Answer» B. state-space search | |
| 22. |
_______ is/are the well known Expert System/s for medical diagnosis systems |
| A. | mysin |
| B. | caduceus |
| C. | dendral |
| D. | smh.pal |
| Answer» A. mysin | |
| 23. |
Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)? |
| A. | the boundary is defined as those nodes in closed that have at least one successor still in open |
| B. | the nodes in closed that are not on the boundary are in the kernel |
| C. | the number of relay nodes on each path is exactly one. |
| D. | both a & b |
| Answer» D. both a & b | |
| 24. |
Which of the following algorithm is generally used CSP search algorithm? |
| A. | breadth-first search algorithm |
| B. | depth-first search algorithm |
| C. | hill-climbing search algorithm |
| D. | none of the mentioned |
| Answer» B. depth-first search algorithm | |
| 25. |
Which of the following conditions must hold for a solution to a CSP? |
| A. | all relations in all constraints must hold |
| B. | at least one relation in all constraints must hold. |
| C. | more than one relation in all constraints must hold. |
| D. | all relations in at least one constraint must hold. |
| Answer» B. at least one relation in all constraints must hold. | |
| 26. |
Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS). |
| A. | bss finds the optimal path while dcbss does not. |
| B. | dcbss finds the optimal path while bss does not. |
| C. | both bss and dcbss find the optimal path |
| D. | neither bss and dcbss find the optimal path |
| Answer» C. both bss and dcbss find the optimal path | |
| 27. |
The performance of an agent can be improved by __________ |
| A. | learning |
| B. | observing |
| C. | perceiving |
| D. | sensing |
| Answer» A. learning | |
| 28. |
__________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. |
| A. | up-hill search |
| B. | hill-climbing |
| C. | hill algorithm |
| D. | reverse-down-hill search |
| Answer» B. hill-climbing | |
| 29. |
Not only do formal logics allow representation of knowledge, but they also allow representation of knowledge Mechanisms for reasoning using a collection of well-defined manipulation rules Of Representations. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 30. |
If a logic produces only true statements and does not produce any false statement it shows which of the following property |
| A. | completeness |
| B. | soundness |
| C. | consistency |
| D. | none of these |
| Answer» B. soundness | |
| 31. |
Is the following rule of inference valid one |
| A. | no |
| B. | yes |
| Answer» B. yes | |
| 32. |
_________Graph is used to represent semantic network |
| A. | undirected |
| B. | directed |
| C. | undirected |
| D. | any one of the above |
| Answer» B. directed | |
| 33. |
What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x)) |
| A. | symmetry |
| B. | exhaustiveness |
| C. | inverse |
| D. | none of the above |
| Answer» C. inverse | |
| 34. |
The formula or sentences that can be maid true by certain valuation function are called |
| A. | valid formula |
| B. | satisfiable formula |
| C. | unsatisfiable formula |
| D. | invalid formula |
| Answer» B. satisfiable formula | |
| 35. |
A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. |
| A. | deductive systems |
| B. | inductive systems |
| C. | reasoning with knowledge based systems |
| D. | search based systems |
| Answer» A. deductive systems | |
| 36. |
• is evaluated last. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 37. |
A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). |
| A. | true |
| B. | false |
| Answer» A. true | |
| 38. |
First Order Logic is also known as ___________ |
| A. | first order predicate calculus |
| B. | quantification theory |
| C. | lower order calculus |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 39. |
Which is used to compute the truth of any sentence? |
| A. | semantics of propositional logic |
| B. | alpha-beta pruning |
| C. | first-order logic |
| D. | both semantics of propositional logic & alpha-beta pruning |
| Answer» A. semantics of propositional logic | |
| 40. |
From which rule does the modus ponens are derived? |
| A. | inference rule |
| B. | module rule |
| C. | both inference & module rule |
| D. | c.none of the mentioned |
| Answer» A. inference rule | |
| 41. |
Which form is called as a conjunction of disjunction of literals? |
| A. | conjunctive normal form |
| B. | disjunctive normal form |
| C. | normal form |
| D. | all of the mentioned |
| Answer» A. conjunctive normal form | |
| 42. |
What can be viewed as a single lateral of disjunction? |
| A. | multiple clause |
| B. | combine clause |
| C. | unit clause |
| D. | none of the mentioned |
| Answer» C. unit clause | |
| 43. |
Choose the correct option. |
| A. | a is true, b is true |
| B. | a is false, b is false |
| C. | a is true, b is false |
| D. | a is false, b is true |
| Answer» A. a is true, b is true | |
| 44. |
What among the following constitutes the representation of the knowledge in different forms? |
| A. | relational method where each fact is set out systematically in columns |
| B. | inheritable knowledge where relational knowledge is made up of objects |
| C. | inferential knowledge |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 45. |
What are Semantic Networks? |
| A. | a way of representing knowledge |
| B. | data structure |
| C. | data type |
| D. | none of the mentioned |
| Answer» A. a way of representing knowledge | |
| 46. |
Graph used to represent semantic network is _____________ |
| A. | undirected graph |
| B. | directed graph |
| C. | directed acyclic graph (dag) |
| D. | directed complete graph |
| Answer» B. directed graph | |
| 47. |
The basic inference mechanism in semantic network is to follow the links between the nodes. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 48. |
Which of the following elements constitutes the frame structure? |
| A. | facts or data |
| B. | procedures and default values |
| C. | frame names |
| D. | frame reference in hierarchy |
| Answer» A. facts or data | |
| 49. |
There exists two way to infer using semantic networks in which knowledge is represented as Frames. |
| A. | intersection search |
| B. | inheritance search |
| Answer» A. intersection search | |
| 50. |
Which problem can frequently occur in backward chaining algorithm? |
| A. | repeated states |
| B. | incompleteness |
| C. | complexity |
| D. | both repeated states & incompleteness |
| Answer» D. both repeated states & incompleteness | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.