CS607-Midterm
1 / 50
Which one of the problem is more subtle, and consequently, is more frustrating:
2 / 50
Can we precisely define Artificial Intelligence?
3 / 50
Another expert system named __________ was developed by Digital Equipment Corporation, as a computer configuration assistant.
4 / 50
Every graph can be converted into a tree.
5 / 50
In Depth First Search the node with the largest value of height will be at the _______ priority to be picked.
6 / 50
Semantic networks are graphs, with nodes representing ____________ and arcs representing ____________ between objects.
7 / 50
___________ reasoning is based on forming, or inducing a „generalization‟ from a limited set of observations.
8 / 50
______ AI treats the brain as a black box and just emulates its functionality.
9 / 50
Ability to tackle ambiguous and fuzzy problems demonstrate
10 / 50
In Artificial Intelligence GA stands for Genetic Algorithms
11 / 50
Breadth-first search is a good idea when you are confident that the branching factor is_____
12 / 50
----------- are closely coupled components; each is intrinsically tied to the other. i-Knowledge representation ii-Reasoning iii-Planning iv-Execution
13 / 50
Some essential components of problem solving are Problem statement, _________, solution space and Operators
14 / 50
An ___________ is “A computer program designed to model the problem solving ability of a human expert."
15 / 50
The traveling inside solution space requires something called
16 / 50
A statement in conjunctive normal form (CNF) consists of __________
17 / 50
An expert system may replace the expert or assist the expert.
18 / 50
Most of the solution spaces for problems can be represented in a ________
19 / 50
20 / 50
A classical set is a container, which wholly includes or wholly excludes any given element.
21 / 50
Breadth-first search is a good idea when you are confident that the branching factor is _________
22 / 50
In Basic Genetic Algorithm the term mutation refers to a small random ________.
23 / 50
In Adversarial search the goals of the adversaries are usually ___________ to each other
24 / 50
In optimal path searches we try to find the ____________ solution
25 / 50
“A computer program designed to model the problem solving ability of a human expert” is known as ---
26 / 50
Which one of the following is involved in an ES development project:
27 / 50
The paths found by best-first search are likely to be __________ than those found with other methods.
28 / 50
Which one is not the application area of expert system?
29 / 50
In backward chaining terminology, the hypothesis to prove is called the ________.
30 / 50
To infer new information from semantic networks, we can ask questions from nodes.
31 / 50
Every graph can be converted into a tree
32 / 50
In the worst case of semantic network, we may need to traverse the entire network and then discover that the requested info ________.
33 / 50
In adversarial search there may occur such a scenario where two opponents also called _____ are searching for goal.
34 / 50
Another expert system named___________was developed by Digital Equipment Corporation, as a computer configuration assistant.
35 / 50
Genetic algorithm uses evolutionary techniques, based on function optimization and artificial intelligence, to develop a solution.
36 / 50
Which of the following two components are closely coupled and each is intrinsically tied to the other. i. Knowledge representation ii. Reasoning iii. Execution iv. Planning
37 / 50
Procedures that search the solution space in an uninformed manner are usually costly with respect to _____.
38 / 50
Searching is a formal mechanism to explore
39 / 50
Classical way of problem solving
40 / 50
Try to catch out own thoughts as they go by is
41 / 50
Choose the fields in which Fuzzy inference systems have been successfully applied:
42 / 50
The tractable problems are further divided into structured and ________ problems
43 / 50
An expert system may replace the expert or assist the expert
44 / 50
By getting grips on ___________ that deal with searching techniques in graphs and trees, problem solving can be performed in an efficient manner.
45 / 50
Genetic Algorithms is a search method in which multiple search paths are followed in _______
46 / 50
Progressive deepening guarantees to find the solution at a minimum depth like
47 / 50
In Breadth First Search the node with the largest value of height will be at the _________ priority to be picked.
48 / 50
We can get optimal solution given some parameters using Genetic Algorithm.
49 / 50
An AI system has a ____________ component that allows the system to get information from its environment.
50 / 50
Hit and trial is classical approach to solve the ________ problem easily
Your score is
The average score is 52%
Restart quiz
