Pro Tip<\/p>\n
Want to assess your learners online? Create an online quiz for free<\/a>!<\/p>\n<\/div>\n Unification: Unification is a fundamental concept in Prolog that allows the system to match queries with facts and rules. It involves finding substitutions for variables that make two terms identical.<\/p>\n Backtracking: Prolog uses a powerful backtracking mechanism to find multiple solutions to a problem. If a certain rule or fact fails to satisfy a query, Prolog will backtrack and attempt alternative possibilities.<\/p>\n 1. Prolog is a programming language based on which paradigm? 2. In Prolog, knowledge is represented using: 3. What is the fundamental concept in Prolog that allows the system to match queries with facts and rules? 4. Predicates in Prolog are used to define: 5. Prolog uses _______ to find multiple solutions to a problem. 6. Which of the following represents a Prolog rule in the form of “Head :- Body”? 7. What does the “Head” of a Prolog rule represent? 8. In Prolog, what is the purpose of the “Body” in a rule? 9. Prolog supports which of the following programming paradigms in its core functionality? 10. Which term is used in Prolog to refer to finding alternative solutions by undoing previous decisions? 11. What is the operator used for unification in Prolog? 12. Prolog rules without a body are known as: 13. In Prolog, which operator is used to represent logical OR? 14. In Prolog, which symbol is used to represent the end of a query? 15. What is the correct syntax for a Prolog rule representing “X is the mother of Y”?In this article<\/h3>\n
\n
![\"\"](\"https:\/\/onlineexammaker.com\/kb\/wp-content\/uploads\/2023\/08\/Prolog.webp\")
<\/p>\nPart 1: 30 Prolog quiz questions & answers<\/h3>\n
\n a) Imperative programming
\n b) Object-oriented programming
\n c) Functional programming
\n d) Logic programming
\n Answer: d) Logic programming<\/p>\n
\n a) Variables
\n b) Loops
\n c) Facts and rules
\n d) Functions
\n Answer: c) Facts and rules<\/p>\n
\n a) Unification
\n b) Backtracking
\n c) Recursion
\n d) Inheritance
\n Answer: a) Unification<\/p>\n
\n a) Relationships between objects and properties
\n b) Loops
\n c) Mathematical operations
\n d) Conditional statements
\n Answer: a) Relationships between objects and properties<\/p>\n
\n a) Overloading
\n b) Recursion
\n c) Backtracking
\n d) Polymorphism
\n Answer: c) Backtracking<\/p>\n
\n a) “Goal -> Condition”
\n b) “If Condition Then Goal”
\n c) “Conclusion | Conditions”
\n d) “Head :- Body”
\n Answer: d) “Head :- Body”<\/p>\n
\n a) The conclusion or goal
\n b) The sub-goals to be met
\n c) The conditions for backtracking
\n d) The name of the predicate
\n Answer: a) The conclusion or goal<\/p>\n
\n a) To specify the arguments for the predicate
\n b) To define the name of the predicate
\n c) To contain the conditions or sub-goals to be met
\n d) To represent the result of the predicate
\n Answer: c) To contain the conditions or sub-goals to be met<\/p>\n
\n a) Imperative programming
\n b) Object-oriented programming
\n c) Functional programming
\n d) Logic programming
\n Answer: d) Logic programming<\/p>\n
\n a) Redo
\n b) Retry
\n c) Backtrack
\n d) Restart
\n Answer: c) Backtrack<\/p>\n
\n a) &&
\n b) ||
\n c) =
\n d) ==
\n Answer: c) =<\/p>\n
\n a) Undefined rules
\n b) Empty rules
\n c) Facts
\n d) Clauses
\n Answer: c) Facts<\/p>\n
\n a) &&
\n b) ,
\n c) !
\n d) ;
\n Answer: d) ;<\/p>\n
\n a) !
\n b) .
\n c) :
\n d) $
\n Answer: b) .<\/p>\n
\n a) mother(X, Y) :-
\n b) X(mother, Y) :-
\n c) Y is mother(X) :-
\n d) mother(X) = Y :-
\n Answer: a) mother(X, Y) :-<\/p>\nPart 2: Download Prolog questions & answers for free<\/h3>\n