Top 150+ Solved Neural Network MCQ Questions Answer
Q. Which knowledge base is called as fixed point?
a. first-order definite clause are similar to propositional forward chaining
b. first-order definite clause are mismatch to propositional forward chaining
c. both a & b
d. none of the mentioned
Q. Which algorithm will work backward from the goal to solve a problem?
a. forward chaining
b. backward chaining
c. hill-climb algorithm
d. none of the mentioned
Q. Which is mainly used for automated reasoning?
a. backward chaining
b. forward chaining
c. logic programming
d. parallel programming
Q. What will backward chaining algorithm will return?
a. additional statements
b. substitutes matching the query
c. logical statement
d. all of the mentioned
Q. How can be the goal is thought of in backward chaining algorithm?
a. queue
b. list
c. vector
d. stack
Q. What are used in backward chaining algorithm?
a. conjucts
b. substitution
c. composition of substitution
d. none of the mentioned
Q. Which algorithm are in more similar to backward chainiing algorithm?
a. depth-first search algorithm
b. breadth-first search algorithm
c. hill-climbing search algorithm
d. all of the mentioned
Q. Which problem can frequently occur in backward chaining algorithm?
a. repeated states
b. incompleteness
c. complexity
d. both a & b
Q. How the logic programming can be constructed?
a. variables
b. expressing knowledge in a formal language
c. graph
d. all of the mentioned
Q. What form of negation does the prolog allows?
a. negation as failure
b. proposition
c. substitution
d. negation as success
Q. Which is omitted in prolog unification algorithm?
a. variable check
b. occur check
c. proposition check
d. both b & c
Q. What is used for probability theory sentences?
a. conditional logic
b. logic
c. extension of propositional logic
d. none of the mentioned
Q. Where does the degree of belief are applied?
a. propositions
b. literals
c. variables
d. statements