Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages
Filter by Categories
nmims post
Objective Type Set
Online MCQ Assignment
Question Solution
Solved Question
Uncategorized

Artificial Intelligence MCQ Set 1

1. Autonomous Question/Answering systems are
a) Expert Systems
b) Rule Based Expert Systems
c) Decision Tree Based Systems
d) All of the mentioned

View Answer

Answer: d [Reason:] None.

2. Following are the applications of Expert systems
a) Disease Diagnosis
b) Planning and Scheduling
c) Decision making
d) All of the mentioned

View Answer

Answer: d [Reason:] None.

3. _________ is/are the well known Expert System/s for medical diagnosis systems
a) MYSIN
b) CADUCEUS
c) DENDRAL
d) SMH.PAL

View Answer

Answer: a [Reason:] None.

4. The main components of the expert systems is/are,
a) Inference Engine
b) Knowledge Base
c) Inference Engine & Knowledge Base
d) None of the mentioned

View Answer

Answer: c [Reason:] Look at the general architecture of rule based expert systems.

5. There are primarily two modes for an inference engine: forward chaining and backward chaining.
a) True
b) False

View Answer

Answer: a [Reason:] None.

6. PXDES is medical expert system, for diagnosis of lung disease.
a) True
b) False

View Answer

Answer: a [Reason:] None.

7. CaDet is used for early cancer detection.
a) True
b) False

View Answer

Answer: a [Reason:] None.

8. MYSIN attempts to recommend appropriate therapies for patients with bacterial infections.
a) True
b) False

View Answer

Answer: a [Reason:] None.

9. GERMWATCHER is used to control infections caused by bacteria.
a) True
b) False

View Answer

Answer: a [Reason:] None.

10. ARGEX is an agricultural expert system that gives correct advice to farmers.
a) True
b) False

View Answer

Answer: a [Reason:] None.

Artificial Intelligence MCQ Set 2

1. A heuristic is a way of trying
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned

View Answer

Answer: d [Reason:] In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.

2. A* algorithm is based on
a) Breadth-First-Search
b) Depth-First –Search
c) Best-First-Search
d) Hill climbing

View Answer

Answer: c [Reason:] Best-first-search is giving the idea of optimization and quick choose of path, and all these characteristic lies in A* algorithm.

3. The search strategy the uses a problem specific knowledge is known as
a) Informed Search
b) Best First Search
c) Heuristic Search
d) All of the mentioned

View Answer

Answer: d [Reason:] The problem specific knowledge is also known as Heuristics and Best-First search uses some heuristic to choose the best node for expansion.

4. Uninformed search strategies are better than informed search strategies.
a) True
b) False

View Answer

Answer: a [Reason:] Informed search strategies uses some problem specific knowledge, hence more efficient to finding goals.

5. Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
a) Evaluation function returning lowest evaluation
b) Evaluation function returning highest evaluation
c) Evaluation function returning lowest & highest evaluation
d) None of them is applicable

View Answer

Answer: a [Reason:] Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f (n) . Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal.

6. Best-First search can be implemented using the following data structure.
a) Queue
b) Stack
c) Priority Queue
d) Circular Queue

View Answer

Answer: c [Reason:] Best-first search can be implemented within our general search framework via a priority queue, a data structure that will maintain the fringe in ascending order of f-values.

7. The name “best-first search” is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function. State whether true or false.
a) True
b) False

View Answer

Answer: a [Reason:] If the evaluation function is exactly accurate, then this will indeed be the best node; in reality, the evaluation function will sometimes be off, and can lead the search astray.

8. Heuristic function h(n) is ____
a) Lowest path cost
b) Cheapest path from root to goal node
c) Estimated cost of cheapest path from root to goal node
d) Average path cost

View Answer

Answer: c [Reason:] Heuristic is an estimated cost.

9. Greedy search strategy chooses the node for expansion
a) Shallowest
b) Deepest
c) The one closest to the goal node
d) Minimum heuristic cost

View Answer

Answer: c [Reason:] Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. It depends upon the application on which the algorithm is applied.

10. In greedy approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

View Answer

Answer: a [Reason:] Greedy best-first search3 tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function: f (n) = h(n).

11. What is the space complexity of Greedy search?
a) O(b)
b) O(bl)
c) O(m)
d) O(bm)

View Answer

Answer: d [Reason:] O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. Since this algorithm resembles the DFS.

12. In A* approach evaluation function is
a) Heuristic function
b) Path cost from start node to current node
c) Path cost from start node to current node + Heuristic cost
d) Average of Path cost from start node to current node and Heuristic cost

View Answer

Answer: c [Reason:] The most widely-known form of best-first search is called A* search. It evaluates nodes by combining g(n),t he cost to reach the node, and h(n.), the cost to get from the node to the goal: f(n) = g(n) + h(n). Since g(n) gives the path cost from the start node to node n, and h(n) is the estimated cost of the cheapest path from n to the goal.

13. A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.
a) True
b) False

View Answer

Answer: a [Reason:] A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never overestimates the cost to reach the goal. Refer both the example from the book for better understanding of the algorithms.

Artificial Intelligence MCQ Set 3

1. Which of the following terms refers to the use of compressed gasses to drive (power) the robot device?
a) pneumatic
b) hydraulic
c) piezo electric
d) photo sensitive

View Answer

Answer: a [Reason:] None.

2. With regard to the physics of power systems used operate robots, which statement or statements is most correct?
a) hydraulics involves the compression of liquids
b) hydraulics involves the compression of air
c) pneumatics involve the compression of air
d) chemical batteries produce AC power

View Answer

Answer: c [Reason:] None.

3. The original LISP machines produced by both LMI and Symbolics were based on research performed at:
a) CMU
b) MIT
c) Stanford University
d) RAMD

View Answer

Answer: b [Reason:] None.

4. Which of the following statements concerning implementation of robotic systems is correct?
a) implementation of robots CAN save existing jobs
b) implementation of robots CAN create new jobs
c) robotics could prevent a business from closing
d) all of the mentioned

View Answer

Answer: d [Reason:] None.

5. Which of the following IS NOT one of the advantages associated with a robotics implementation program?
a) Low costs for hardware and software
b) Robots work continuously around the clock
c) Quality of manufactured goods can be improved
d) Reduced company cost for worker fringe benefits

View Answer

Answer: a [Reason:] None.

6. Which of the following “laws” is Azimov’s first and most important law of robotics?
a) robot actions must never result in damage to the robot
b) robots must never take actions harmful to humans
c) robots must follow the directions given by humans
d) robots must make business a greater profit

View Answer

Answer: b [Reason:] None.

7. In LISP, the function returns t if is a CONS cell and nil otherwise:
a) (cons <object>)
b) (consp <object>)
c) (eq <object>)
d) (cous = <object>)

View Answer

Answer: b [Reason:] None.

8. In a rule-based system, procedural domain knowledge is in the form of:
a) production rules
b) rule interpreters
c) meta-rules
d) control rules

View Answer

Answer: a [Reason:] None.

9. If a robot can alter its own trajectory in response to external conditions, it is considered to be:
a) intelligent
b) mobile
c) open loop
d) non-servo

View Answer

Answer: a [Reason:] None.

10. One of the leading American robotics centers is the Robotics Institute located at:
a) CMU
b) MIT
c) RAND
d) SRI

View Answer

Answer: a [Reason:] None.

Artificial Intelligence MCQ Set 4

1. Factors which affect the performance of learner system does not include
a) Representation scheme used
b) Training scenario
c) Type of feedback
d) Good data structures

View Answer

Answer: d [Reason:] Factors which affect the performance of learner system does not include good data structures.

2. Different learning method does not include:
a) Memorization
b) Analogy
c) Deduction
d) Introduction

View Answer

Answer: d [Reason:] Different learning methods include memorization, analogy and deduction.

3. Which of the following is the model used for learning?
a) Decision trees
b) Neural networks
c) Propositional and FOL rules
d) All of the mentioned

View Answer

Answer: d [Reason:] Decision trees, Neural networks, Propositional rules and FOL rules all are the models of learning.

4. Automated vehicle is an example of ______
a) Supervised learning
b) Unsupervised learning
c) Active learning
d) Reinforcement learning

View Answer

Answer: a [Reason:] In automatic vehicle set of vision inputs and corresponding actions are available to learner hence it’s an example of supervised learning.

5. Following is an example of active learning:
a) News Recommender system
b) Dust cleaning machine
c) Automated vehicle
d) None of the mentioned

View Answer

Answer: a [Reason:] In active learning, not only the teacher is available but the learner can ask suitable perception-action pair example to improve performance.

6. In which of the following learning the teacher returns reward and punishment to learner?
a) Active learning
b) Reinforcement learning
c) Supervised learning
d) Unsupervised learning

View Answer

Answer: b [Reason:] Reinforcement learning is the type of learning in which teacher returns award or punishment to learner.

7. Decision trees are appropriate for the problems where:
a) Attributes are both numeric and nominal
b) Target function takes on a discrete number of values.
c) Data may have errors
d) All of the mentioned

View Answer

Answer: d [Reason:] Decision trees can be used in all the conditions stated.

8. Which of the following is not an application of learning?
a) Data mining
b) WWW
c) Speech recognition
d) None of the mentioned

View Answer

Answer: d [Reason:] All mentioned options are applications of learning.

9. Which of the following is the component of learning system?
a) Goal
b) Model
c) Learning rules
d) All of the mentioned

View Answer

Answer: d [Reason:] Goal, model, learning rules and experience are the components of learning system.

10. Following is also called as exploratory learning:
a) Supervised learning
b) Active learning
c) Unsupervised learning
d) Reinforcement learning

View Answer

Answer: c [Reason:] In unsupervised learning no teacher is available hence it is also called unsupervised learning.

Artificial Intelligence MCQ Set 5

1. Following is an extension of the semantic network.
a) Expert Systems
b) Rule Based Expert Systems
c) Decision Tree Based networks
d) Partitioned Networks

View Answer

Answer: d [Reason:] None.

2. Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node.
a) True
b) False

View Answer

Answer: a [Reason:] None.

3. Semantic Network represents
a) Syntactic relation between concepts
b) Semantic relations between concepts
c) All of the mentioned
d) None of the mentioned

View Answer

Answer: b [Reason:] None.

4. A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another.
a) True
b) False

View Answer

Answer: a [Reason:] None.

5. What are the limitations of the semantic networks?
a) Intractability
b) Lack in expressing some of the properties
c) Incomplete
d) Has memory constraints

View Answer

Answer: b [Reason:] None.

6. What among the following is/are the best example of semantic networks?
a) Wordnet
b) Human Food Chain
c) MYSIN
d) Autonomous car driver

View Answer

Answer: a [Reason:] Wordnet is a lexical database of English.

7. Semantic Network is also known as Frame networks.
a) True
b) False

View Answer

Answer: a [Reason:] None.

8. Synonymy relation means,
a) A is part of B
b) A denotes same as B
c) A is a kind of B
d) A is superordinate of B

View Answer

Answer: b [Reason:] None.

9. Antonymy relation means,
a) A is part of B
b) B has A as a part of itself
c) A denotes opposite of B
d) A is superordinate of B

View Answer

Answer: c [Reason:] None.

10. Most semantic networks are not cognitive based.
a) True
b) False

View Answer

Answer: b [Reason:] None.