CS607-Midterm
1 / 50
By getting grips on ___________ that deal with searching techniques in graphs and trees, problem solving can be performed in an efficient manner.
2 / 50
The tractable problems are further divided into structured and ________ problems
3 / 50
We can get optimal solution given some parameters using Genetic Algorithm.
4 / 50
The traveling inside solution space requires something called
5 / 50
_____ AI actually tries to recreate the functions of the inside of the brain as opposed to simply emulating behavior
6 / 50
Best first search is a greedy approach.
7 / 50
Can we precisely define Artificial Intelligence?
8 / 50
The Plateau problem comes up when there is a mostly flat area ___________ the peaks.
9 / 50
Another expert system named __________ was developed by Digital Equipment Corporation, as a computer configuration assistant.
10 / 50
Searching is a formal mechanism to explore
11 / 50
An expert system may replace the expert or assist the expert.
12 / 50
In adversarial search there may occur such a scenario where two opponents also called _____ are searching for goal.
13 / 50
A statement in conjunctive normal form (CNF) consists of __________
14 / 50
Semantic networks are computationally expensive at __________
15 / 50
Intelligence is the characteristic of
16 / 50
From discipline ____________ we have information about the network structure of a human brain and all the theories on functionalities of different human organs.
17 / 50
___________ reasoning is based on forming, or inducing a „generalization‟ from a limited set of observations.
18 / 50
A function by which we can tell which board position is nearer to our goal is called
19 / 50
An ___________ is “A computer program designed to model the problem solving ability of a human expert."
20 / 50
Breadth-first search is a good idea when you are confident that the branching factor is_____
21 / 50
Most of the solution spaces for problems can be represented in a ________
22 / 50
Some essential components of problem solving are Problem statement, _________, solution space and Operators
23 / 50
Every graph can be converted into a tree.
24 / 50
----------------- is based on forming, or inducing a „generalization‟ from a limited set of observations
25 / 50
An AI system has a ____________ component that allows the system to get information from its environment.
26 / 50
Which Cycle does the following figure show?
27 / 50
Which of the following disciplines provides us with the theories of structure and meaning of language
28 / 50
Inductive learning is based on the knowledge that if something happens a lot it is likely to be generally _________
29 / 50
30 / 50
Ability to tackle ambiguous and fuzzy problems demonstrate
31 / 50
Mutation can be as simple as just flipping a bit at random or any number of bits
32 / 50
In DFS node with the largest value of height will be at Priority
33 / 50
Progressive deepening guarantees to find the solution at a minimum depth like
34 / 50
Procedures that search the solution space in an uninformed manner are usually costly with respect to _____.
35 / 50
______ is the process of deriving logical conclusions from given facts.
36 / 50
A proposition is the statement of a ________.
37 / 50
An AI system must form a meaningful and useful _____________ of the internal information.
38 / 50
Breadth-first search is a good idea when you are confident that the branching factor is _________
39 / 50
The degree of truth that we have been talking about is specifically driven out by a function called the ___________ function.
40 / 50
In backward chaining terminology, the hypothesis to prove is called the ________.
41 / 50
In Depth First Search the node with the largest value of height will be at the _______ priority to be picked.
42 / 50
Try to catch out own thoughts as they go by is
43 / 50
Which one of the problem is more subtle, and consequently, is more frustrating:
44 / 50
In Adversarial search the goals of the adversaries are usually ___________ to each other
45 / 50
IF temperature is below 0 THEN weather is cold The above rule is used to represent _______
46 / 50
Hit and trial is classical approach to solve the ________ problem easily
47 / 50
A ------------- is „A person who posses the skill and knowledge to solve a specific problem in a manner superior to others‟
48 / 50
49 / 50
Hill Climbing is basically a ------------- with a measure of quality that is assigned to each node in the tree.
50 / 50
Breadth-First Search checks all paths of a given length before moving on to any longer paths.
Your score is
The average score is 52%
Restart quiz
