Sail E0 Webinar

MCQs

Total Questions : 204 | Page 5 of 21 pages
Question 41. What is the goal of artificial intelligence?
  1.    To solve artificial problems
  2.    To extract scientific causes
  3.    To explain various sorts of intelligence
  4.    To solve real-world problems
 Discuss Question
Answer: Option C. -> To explain various sorts of intelligence
Question 42. An algorithm A is admissible if ___________
  1.    It returns more solutions, but not an optimal one
  2.    It guarantees to return more optimal solutions
  3.    It is guaranteed to return an optimal solution when one exists
  4.    It is not guaranteed to return an optimal solution when one exists
 Discuss Question
Answer: Option C. -> It is guaranteed to return an optimal solution when one exists
Question 43. What is a heuristic function?
  1.    A function to solve mathematical problems
  2.    A function whose return type is nothing
  3.    A function which takes parameters of type string and returns an integer value
  4.    A function that maps from problem state descriptions to measures of desirability
 Discuss Question
Answer: Option D. -> A function that maps from problem state descriptions to measures of desirability
Question 44. Which is true regarding BFS (Breadth First Search)?
  1.    BFS will get trapped exploring a single path
  2.    BFS is not guaranteed to find a solution if exists
  3.    BFS is nothing but Binary First Search
  4.    The entire tree so far been generated must be stored in BFS
 Discuss Question
Answer: Option D. -> The entire tree so far been generated must be stored in BFS
Question 45. An algorithm is complete if ____________
  1.    It does not terminate with a solution
  2.    It has a loop
  3.    It starts with a solution
  4.    It terminates with a solution when one exists
 Discuss Question
Answer: Option D. -> It terminates with a solution when one exists
Question 46. Different learning methods does not include?
  1.    Introduction
  2.    Memorization
  3.    Analogy
  4.    Deduction
 Discuss Question
Answer: Option A. -> Introduction
Question 47. The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task.
  1.    Binary
  2.    Recursive
  3.    Semantic
  4.    Electro-chemical
 Discuss Question
Answer: Option A. -> Binary
Question 48. Where does the Hidden Markov Model is used?
  1.    Speech recognition
  2.    Both Speech recognition & Understanding of real world
  3.    None of the mentioned
  4.    Understanding of real world
 Discuss Question
Answer: Option A. -> Speech recognition
Question 49. Which process makes different logical expression looks identical?
  1.    Inference process
  2.    Unification
  3.    None of the mentioned
  4.    Lifting
 Discuss Question
Answer: Option B. -> Unification
Question 50. Where does the bayes rule can be used?
  1.    Answering probabilistic query
  2.    Decreasing complexity
  3.    Solving queries
  4.    Increasing complexity
 Discuss Question
Answer: Option A. -> Answering probabilistic query

Latest Videos

Latest Test Papers