CS607 Quiz 2 Set 2 by VU Topper RM

In Line fitting problem using genetic algorithm usual way to compute the goodness to fit the polynomial on the given data points can computed as _________. A. y = mx + c

B. (actual y−predicted y)2

C. y = mx D. (actual y)2

An alternative method is the longest-matching strategy. This method involves firing the conclusion that was derived from the

A. Complex rule

B. Longest rule

C. Forward chain rule D. Shortest rule

___________________ is the part of the system that controls the process of deriving conclusions.

A. An interpreter, or inference engine

B. A database of facts C. A knowledge base D. An object

How many types of facts are there in formal knowledge representation?

1. 6
2. 5
3. 4
4. 7

Correct answer: 5

Inference engine matches the facts contained in the _______ with the ______contained in the knowledge base, to draw conclusions about the problem.

A. Working memory, domain knowledge

B. object, class C. Fact table, working memory D. Rule engine, operators

Q1. Vu-Topper RM (1 marks)

___________ has the same notion of having something or some attribute from a parent. A. Mutation B. Gene C. Crossover

D. Inheritance Page 77 ok

Q2. Vu-Topper RM (1 marks)

The ability to understand things without explicitly programmed a computer is called?

1. Fuzzy logic
2. Deep learning
3. Machine learning
4. Artificial Intelligence

Correct answer: Artificial Intelligence

Q3. Vu-Topper RM (1 marks)

“If you find the goal, exit, otherwise repeat DFS to the next lower level”. The statement refers to: A. Depth first search B. Breadth first search

C. Progressive Deepening Page 32

D. None progressive depending

Q4. Vu-Topper RM (1 marks)

_________ is based on deducing new information from logically related known information. A. Inductive reasoning B. Abductive reasoning

C. Deductive reasoning Page 102

D. Common-sense reasoning

Q5. Vu-Topper RM (1 marks)

Hit and trial is a classical approach to solve the ___________ problems easily.

A. Trivial Page 15

B. medium C. complex D. structured

Q6. Vu-Topper RM (1 marks)

The searching technique in which we purely use a hit and trial approach and will check all combinations till one takes it to the exact solution is referred to as ___________.

A. Blind/uninformed Page 23

B. Informed/heuristic C. Path/non-optimal D. Optimal path

Q7. Vu-Topper RM (1 marks)

Genetic algorithm start with the population of randomly generated, attempted solutions to a problem and repeatedly do the following except__________. A. Keep the best solutions

B. Perform non parallel search Page 77 ok

C. Evaluate each attempted solutions D. Produce next generation using inheritance and mutation.

Q8. Vu-Topper RM (1 marks)

We use graphs to represent problems and their ________.