How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

  1. Home

Question:
 How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

1.by traversing multiple node

2.by deleting one of the node

3.by addition of extra node

4.None of the above

Posted Date:-2022-06-27 10:21:11

More MCQS Questions and answers

  1. What is true aboout Iterative Deepening DFS? B. C. D.
  2. A planning problem P in BSSP is defined as a _____________
  3. Arc consistency in AO graph is concernd with _____________
  4. effects⁺ (a) in Forward State Space Planning denotes ___________________
  5. How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?
  6. In Forward State Space Planning , Progress ( A, S) function returns
  7. In which chaining, the Left-Hand side is used to match the rules and Right-Hand side is used to check the effect of using the rule.
  8. The components of Expert system are?
  9. What cost is assumed for arc while solving AO* progress example?
  10. What is true aboout Iterative Deepening DFS?
  11. Which are the first AI applications of AO graph?
  12. Which of the following are Informed search algorithms?
  13. Which search strategy is combining the benefits of both BFS and DFS?
  14. A planning problem P in BSSP is defined as a _____
  15. A* Search Algorithm _______________
  16. Admissibility of the heuristic function is given as:
  17. Agent interacts with the world via _______________ and ______________
  18. Backward State Space Planning (BSSP)_______________________________
  19. Goal Stack Planning breaks up a _______
  20. If there is a solution, breadth first search is _______________to find it
  21. In Backward State Space Planning ,regress(A,G) that returns ______________________________
  22. Plan representation in Plan Space Planning is done with__ -----------links
  23. Production/Rule looks like________________
  24. Tabu search is designed __________________________
  25. The components of Expert system are?
  26. The efficiency of A* algorithm depends on __________________________
  27. The start node for search in plan space planning is______
  28. What arcs represents in AO Graph?
  29. What are the drawbacks of Forward State Space Planning?
  30. What is Hyper-Edge in AO Graph?
  31. What is the heuristic cost of SOLVED nodes in AO* example?
  32. what is the issue of Forward State Space Planning?
  33. What is the main advantage of backward state-space search?
  34. What is the termination criteria in Hill climbing?
  35. What is true aboout Iterative Deepening DFS?
  36. What is true about Artificial Intelligence?
  37. What is true about Backward State Space Planning?
  38. What is true about Linear Planning?
  39. What is true about variable neighborhood function?
  40. What is used to lable primitive problems in AO problem?
  41. Which is not problem in Hill climing?
  42. Which property asks that the algorithm is locally admissible?
  43. _____requires Linear Space but uses backtracking
Search
Olete Team
Online Exam Test Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on Online Exam Test website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!