CS607-Midterm
1 / 50
In the statement “IF A THEN B”, B is called
2 / 50
Searching is a formal mechanism to explore
3 / 50
Genetic Algorithms is a search method in which multiple search paths are followed in _______
4 / 50
Some essential components of problem solving are Problem statement, _________, solution space and Operators
5 / 50
In Breadth First Search the node with the largest value of height will be at the _________ priority to be picked.
6 / 50
Most of the solution spaces for problems can be represented in a ________
7 / 50
“The branch of computer science that is concerned with the automation of intelligent behavior” this definition is from:
8 / 50
In optimal path searches we try to find the ____________ solution
9 / 50
In the worst case of semantic network, we may need to traverse the entire network and then discover that the requested info ________.
10 / 50
Which of the following is a valid example which represents a suitable antecedent in a rule?
11 / 50
______ AI treats the brain as a black box and just emulates its functionality.
12 / 50
The traveling inside a solution space requires something called as ___________
13 / 50
A ------------- is „A person who posses the skill and knowledge to solve a specific problem in a manner superior to others‟
14 / 50
______ is the process of deriving logical conclusions from given facts.
15 / 50
In DFS node with the largest value of height will be at Priority
16 / 50
Every graph can be converted into a tree
17 / 50
Expert system can be expressed as:
18 / 50
Another expert system named __________ was developed by Digital Equipment Corporation, as a computer configuration assistant.
19 / 50
Hit and trial is classical approach to solve the ________ problem easily
20 / 50
An AI system must form a meaningful and useful _____________ of the internal information.
21 / 50
In GA, the random process is repeated until an individual with required _________ level is found. Select correct option:
22 / 50
To infer new information from semantic networks, we can ask questions from nodes.
23 / 50
Best first search is a greedy approach.
24 / 50
The degree of truth that we have been talking about is specifically driven out by a function called the ___________ function.
25 / 50
Breadth-first search is a good idea when you are confident that the branching factor is_____
26 / 50
Inductive learning is based on the knowledge that if something happens a lot it is likely to be generally _________
27 / 50
Which one of the problem is more subtle, and consequently, is more frustrating:
28 / 50
In Adversarial search the goals of the adversaries are usually ___________ to each other
29 / 50
A function by which we can tell which board position is nearer to our goal is called
30 / 50
Semantic networks are graphs, with nodes representing ____________ and arcs representing ____________ between objects.
31 / 50
In general, the antecedent of a rule compares an object with a possible value, using an operator.
32 / 50
Every graph can be converted into a tree.
33 / 50
What is the correct order for solving a problem using GA I. Choose the best individuals from the population for crossover II. Choose initial population III. Evaluate the fitness of each individual
34 / 50
Ability to tackle ambiguous and fuzzy problems demonstrate
35 / 50
We use graph to represent problems and their solution spaces.
36 / 50
37 / 50
Intelligence id the characteristics of:
38 / 50
The paths found by best-first search are likely to be __________ than those found with other methods.
39 / 50
Conventional programming focuses on _______, while ES programming focuses on ________
40 / 50
The foothhill problem occurs whenever there are___________ peaks.
41 / 50
Which Cycle does the following figure show?
42 / 50
Procedures that search the solution space in an uninformed manner are usually costly with respect to _____.
43 / 50
----------------- is based on forming, or inducing a „generalization‟ from a limited set of observations
44 / 50
Breadth-First Search checks all paths of a given length before moving on to any longer paths.
45 / 50
----------- are closely coupled components; each is intrinsically tied to the other. i-Knowledge representation ii-Reasoning iii-Planning iv-Execution
46 / 50
By getting grips on ___________ that deal with searching techniques in graphs and trees, problem solving can be performed in an efficient manner.
47 / 50
Choose the fields in which Fuzzy inference systems have been successfully applied:
48 / 50
The tractable problems are further divided into structured and ________ problems
49 / 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
50 / 50
Breadth-first search is a good idea when you are confident that the branching factor is _________
Your score is
The average score is 52%
Restart quiz
