In LISP, the function assigns . the value of a to b is
In LISP, the function assigns . the value of a to b is
| Note: | The above multiple-choice question is for all general and Competitive Exams in India. |
» Neural Network solved MCQs
-
Question: A. (setq a b) B. (setq b a ) C. (b = a) D. (set b = a) Answer» b. (setq b a ) -
Which search is similar to minimax search?
Question: Which search is similar to minimax search?
A. hill-climbing search B. depth-first search C. breadth-first search D. all of the mentioned Answer» b. depth-first search Note: The above multiple-choice question is for all general and Competitive Exams in India. -
Which values are independant in minimax search algorithm?
Question: Which values are independant in minimax search algorithm?
A. pruned leaves x and y B. every states are dependant C. root is independant D. none of the mentioned Answer» a. pruned leaves x and y Note: The above multiple-choice question is for all general and Competitive Exams in India. -
Which can be converted to inferred equivalent CNF (Conjunction Normal Form) sentence?
Question: Which can be converted to inferred equivalent CNF (Conjunction Normal Form) sentence?
A. every sentence of propositional logic B. every sentence of inference C. every sentence of first-order logic D. all of the mentioned Answer» c. every sentence of first-order logic Note: The above multiple-choice question is for all general and Competitive Exams in India. -
Which company offers the LISP machine considered “the most powerful symbolic processor available”?
Question: Which company offers the LISP machine considered “the most powerful symbolic processor available”?
A. lmi B. symbolics C. xerox D. texas instruments Answer» b. symbolics Note: The above multiple-choice question is for all general and Competitive Exams in India. -
In linguistic morphology, _____________ is the process for reducing inflected words to their root form.
Question: In linguistic morphology, _____________ is the process for reducing inflected words to their root form.
A. rooting B. stemming C. text-proofing D. both a & b Answer» b. stemming Note: The above multiple-choice question is for all general and Competitive Exams in India. -
Which are needed to compute the logical inference algorithm?
Question: Which are needed to compute the logical inference algorithm?
A. logical equivalence B. validity C. satisfiability D. all of the mentioned Answer» d. all of the mentioned Note: The above multiple-choice question is for all general and Competitive Exams in India. -
Which search is equal to minimax search but eliminates the branchesthat can’t influence the final decision?
Question: Which search is equal to minimax search but eliminates the branchesthat can’t influence the final decision?
A. depth-first search B. breadth-first search C. alpha-beta pruning D. none of the mentioned Answer» c. alpha-beta pruning Note: The above multiple-choice question is for all general and Competitive Exams in India. -
When the resolution is called as refutation-complete?
Question: When the resolution is called as refutation-complete?
A. sentence is satisfiable B. sentence is unsatisfiable C. sentence remains the same D. none of the mentioned Answer» b. sentence is unsatisfiable Note: The above multiple-choice question is for all general and Competitive Exams in India. -
Where does the performance measure is included?
Question: Where does the performance measure is included?
A. rational agent B. task environment C. actuators D. sensor Answer» b. task environment Note: The above multiple-choice question is for all general and Competitive Exams in India.