Assignment for 2.6: General to Specific Ordering

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

In this module, you were expected to learn about

What is General Ordering ?
What is Specific Ordering ?
Finding maximally specific hypothesis
What are Version Spaces ?
A few algorithms for general to specific ordering
FIND-S Algorithm
CANDIDATE-ELIMINATION Algorithm

So, in this assignment we'll evaluate whether you learned about these concepts.

1. What is the most specific order hypothesis ? *

<?,?,?,...,?,?,?>

<∅,∅,∅,...,∅,∅,∅>

<?,∅,?,∅, .... ,∅,?,∅,?>

2. The FIND-S Algorithm has the following assumptions. Choose the correct assumptions *

It does not work for hypothesis whose value is negative

It results in minimally specific hypothesis

It results in maximally specific hypothesis

It does not work for hypothesis whose value is positive

Required

3. What happens if you compute the hypothesis given in the reverse order i.e. h4 --> h1 instead of h1 --> h4

We will get the same result

Final version space will be the same

The results will be different

The final version space will be different

Intermediate stages will be the same

Intermediate stages will differ

Submit

Clear form

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy

Forms