Scribd
Upload
8 views5 pages

AI and Graph Theory Questions Answers With Options

The document contains a series of questions and answers related to AI and graph theory, covering topics such as optimal solutions, types of AI, machine learning, and the characteristics of intelligent systems. It includes historical references, definitions, and explanations of key concepts like the Turing Test and the differences between trees and directed acyclic graphs. Additionally, it provides practical examples of graph analysis, including root nodes, goal nodes, and path lengths.

Uploaded by

hafsahakilu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views5 pages

AI and Graph Theory Questions Answers With Options

The document contains a series of questions and answers related to AI and graph theory, covering topics such as optimal solutions, types of AI, machine learning, and the characteristics of intelligent systems. It includes historical references, definitions, and explanations of key concepts like the Turing Test and the differences between trees and directed acyclic graphs. Additionally, it provides practical examples of graph analysis, including root nodes, goal nodes, and path lengths.

Uploaded by

hafsahakilu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

AI and Graph Theory Questions &

Answers
In determining a goal state, what is an optimal solution?
Options:
a. The best solution
b. The most cost-effective solution
c. The solution with the least steps
d. The best possible solution that achieves the goal state
Answer: d. The best possible solution that achieves the goal state

In Graph search space, the elements of trees are called their ___________
Options:
a. Leaves
b. Nodes
c. Edges
d. Paths
Answer: b. Nodes

In the year __________, IBM Deep Blue beats world chess champion, Gary
Kasparov, and became the first computer to beat a world chess champion.
Options:
a. 2000
b. 1997
c. 1950
d. 2021
Answer: b. 1997

___________ is a level of Intelligence of Systems at which machines could


surpass human intelligence, and can perform any task better than humans
with cognitive properties.
Options:
a. Narrow AI
b. Strong AI
c. Super AI
d. General AI
Answer: c. Super AI

The following are types of Artificial intelligence based on functionality


except.
Options:
a. Reactive machines
b. Super AI
c. Limited memory
d. Theory of mind
Answer: b. Super AI

_________ is a type of machine learning in which machine learn from


known datasets (set of training examples), and then predict the output.
Options:
a. Reinforcement learning
b. Machine learning
c. Supervised learning
d. Unsupervised learning
Answer: c. Supervised learning

The classes of machine learning is/are:


Options:
a. Supervised learning only
b. Unsupervised learning only
c. Supervised and Unsupervised learning
d. Supervised, Unsupervised and Reinforcement learning
Answer: d. Supervised, Unsupervised and Reinforcement learning.

_____________ is described as the power of learning, understanding and


reasoning plus mental ability.
Options:
a. Perception
b. Knowledge
c. Intelligence
d. None of the options
Answer: c. Intelligence
___________ is the test that can check the machine's ability to exhibit
intelligent behavior equivalent to human intelligence
Options:
a. Chinese room
b. Intelligence
c. Turing Test
d. None of the options
Answer: c. Turing Test

_____________ test explained that a computer could never be truly


intelligent, that it is only manipulating symbols and does not understand
the semantic context.
Options:
a. Chinese room
b. Intelligence
c. Turing Test
d. None of the options
Answer: a. Chinese room

Write according to your understanding why we search


Answer: We search to find information, solutions, or answers that help us make decisions,
solve problems, and expand our knowledge. Searching allows us to navigate large amounts
of data efficiently, discover new possibilities, and achieve specific goals in various fields,
such as AI, research, and everyday life.

How do you identify a root node?


Answer: A root node is identified as the topmost node in a tree data structure. It has no
parent and serves as the starting point from which all other nodes branch out.

The main goal of AI is to build a machine that can replace human beings in
workplaces
Options:
True
False
Answer: False
The rationale behind the general AI is to make a system which could be
smarter and think like a human by itself.
Options:
True
False
Answer: True

Key characteristics of strong AI include the ability to think, to reason,


solve the puzzle, make judgments, plan, learn, and communicate by its
own.
Options:
True
False
Answer: True

Machine Learning is based on the idea that machines can learn from past
data, identify patterns, and make decisions using algorithms.
Options:
True
False
Answer: True

The central scientific goal of AI is to understand the principles that make


intelligent behavior possible in natural or artificial systems.
Options:
True
False
Answer: True

Intelligence can be described in terms of perception, motor control,


communication, reasoning, planning, learning, and memory.
Options:
True
False
Answer: True
Consider the Directed Acyclic Graph below and state why it can't be
accepted as a tree
Answer: The given Directed Acyclic Graph (DAG) cannot be accepted as a tree because:

1. Multiple Parents: In a tree, each node (except the root) should have exactly one parent. In
the given graph, node 3 has incoming edges from both 1 and 2, violating this rule.
2. No Single Root: A tree must have a single root node from which all nodes descend. The
given DAG does not have a clear single root.
3. Cycles Not Allowed: While this graph is acyclic, a tree must also have a hierarchical
structure without multiple paths leading to the same node, which this graph lacks.
Thus, this structure is a DAG but not a tree.

Consider the graph and write the answers to the following questions
accordingly
Options:
(a) How many root nodes?
1 root node: S (since it has no incoming edges).

(b) Which is the Goal node?


G (as it is the final destination in the graph).

(c) If the weight in the graph represents distance in kilometers, how many kilometers is the
shortest route to the Goal Node?
The shortest path from S to G is:
S→A→C→G
1 + 1 + 2 = 4 km

(d) How many kilometers is the longest route to the Goal Node?
The longest path from S to G is:
S→A→B→D→G
1 + 3 + 3 + 3 = 10 km

(e) What is the depth of the problem?


The depth is the length of the longest path from S to G in terms of number of edges.
The longest path: S → A → B → D → G
Depth = 4 (since there are 4 edges in the longest path).

You might also like