Artificial Intelligence NTA UGC NET Question Analysis P2
Q51➡ | Which one of the following is true?
i ➥ The resolvent of two Horn clauses is not a Horn clauseii ➥ The resolvent of two Horn clauses is a Horn Clause.iii ➥ If we resolve a negated goal G against a fact or rule A to get Clause C then C has positive literal and non null-goal.iv ➥ (D) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.
Show Answer With Best Explanation Answer: II Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q52➡ | How does randomized hill-climbing choose the next move each time?
i ➥ It generates a random move from the moveset, and accepts this move.ii ➥ It generates a random move from the whole state space, and accepts this move.iii ➥ It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function.iv ➥ It generates a random move from the whole state space, and accepts this move only if this move improves the evaluation function.
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q53➡ | . A software program that infers and manipulates existing knowledge in order to generate new knowledge is known as:
i ➥ Data Dictionaryii ➥ Reference Mechanismiii ➥ Inference Engineiv ➥ Control Strategy
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q54➡ | Horn clauses are special kinds of propositions which can be described as
i ➥ Single atomic proposition on left side.ii ➥ Single or multiple atomic proposition on left side.iii ➥ A single atomic proposition on left side and a single atomic proposition on right sideiv ➥ A single atomic proposition on left side or an empty left side
Show Answer With Best Explanation Answer: IV Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q55➡ | Which of the following is/are the fundamental semantic model(s) of parameter passing?
i ➥ in modeii ➥ out modeiii ➥ in-out modeiv ➥ all of the above
Show Answer With Best Explanation Answer: IV Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q56➡ | Which one of the following is not an informed search technique?
i ➥ Hill climbing searchii ➥ Best first searchiii ➥ A* searchiv ➥ Depth first search
Show Answer With Best Explanation Answer: IV Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q57➡ | High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences?
i ➥ Morphologicalii ➥ Syntacticiii ➥ Semanticiv ➥ Pragmatic
Show Answer With Best Explanation Answer: IV Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q58➡ | The objective of ……………… procedure is to discover at least one …………… that causes two literals to match.
i ➥ unification, validationii ➥ unification, substitutioniii ➥ substitution, unificationiv ➥ minimax, maximum
Show Answer With Best Explanation Answer: II Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q59➡ | If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution if
i ➥ h* us equal to hii ➥ h* overestimates hiii ➥ h* underestimates hiv ➥ none of these
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q60➡ | The mean-end analysis process centers around the detection of differences between the current state and the goal state. Once such a difference is isolated, an operator that can reduce the difference must be found. But perhaps that operator cannot be applied to the current state. So a sub-problem of getting to a state in which it can be applied is set up. The kind of backward chaining in which operators are selected and then sub goals are set up to establish the precondition of operators is called
i ➥ backward planningii ➥ goal stack planningiii ➥ operator subgoalingiv ➥ operator overloading
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q61➡ | An expert system shell is an expert system without
i ➥ domain knowledgeii ➥ explanation facilityiii ➥ reasoning with knowledgeiv ➥ all of the above
Show Answer With Best Explanation Answer: I Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q62➡ | A cryptarithmetic problem of the type SEND +MORE __________ MONEY Can be solved efficiently using
i ➥ depth first techniqueii ➥ breadth first techniqueiii ➥ constraint satisfaction techniqueiv ➥ bidirectional technique
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q63➡ | The map colouring problem can be solved using which of the following technique?
i ➥ Means-end analysisii ➥ Constraint satisfactioniii ➥ AO* searchiv ➥ Breadth first search
Show Answer With Best Explanation Answer: II Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q64➡ | Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation?
i ➥ Semantic networkii ➥ Framesiii ➥ Scriptsiv ➥ Conceptual Dependency
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q65➡ | ………….. predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions.
i ➥ Zero-orderii ➥ First-orderiii ➥ Second-orderiv ➥ High-order
Show Answer With Best Explanation Answer: II Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q66➡ | Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms
i ➥ A* algorithmii ➥ AO* algorithmiii ➥ Greedy best first search algorithmiv ➥ Iterative A* algorithm
Show Answer With Best Explanation Answer: III Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q67➡ | A horn clause is ………………….
i ➥ A clause in which no variables occur in the expressionii ➥ A clause that has at least one negative literaliii ➥ A disjunction of a number of literalsiv ➥ A clause that has at most one positive literal
Show Answer With Best Explanation Answer: IV Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line
Q68➡ | Reasoning strategies used in expert systems include ……………
i ➥ Forward chaining, backward chaining and problem reductionii ➥ Forward chaining, backward chaining and boundary mutationiii ➥ Forward chaining, backward chaining and back propagationiv ➥ Backward chaining, problem reduction and boundary mutation
Show Answer With Best Explanation Answer: I Explanation: Upload Soon
More Discussion Explanation On YouTube Learn Topic Wise Help-Line