This preview shows page 1. Sign up to view the full content.
Unformatted text preview: nemy=Y) and
Friends (Enemy=N). The other 5 characteristics you note are in the table below. Character Enemy? Talks? Boss? Annoying? Killable with Jump? A Yoshi N N N N N B Tree N N N N N C Luigi N N N N N D Toad N Y N N N E Peach N Y N Y N F Bowser Y N Y N N G Bob-omb Y N N N Y H Goomba Y N N N Y I Piranha Y N N Y N J Dry Bones Y N N Y N Chain
Chomp Y N N Y N L Thwomp Y N N Y N M Boo Y N N Y N Y N N Y Y K N Koopa
Troopa B1 (8 points): What is the disorder of the test "Boss = Y"? Leave your answer in terms of fractions, real numbers, and logarithms. 19 B2 (7 points): What is the disorder of the test "Annoying = Y"? Leave your answer in terms of fractions, real numbers, and logarithms. B3 (15 points): Draw the disorder minimizing identification tree Mario can use to correctly
decide whether any of the above examples is an enemy (Enemy=Y) or friend (Enemy=N). Use the
letters provided next to characters' names to show how the characters are separated by each decision.
Hint: neither Boss nor Annoying are the first test. 20 Quiz 3, Problem 2:
Neural Nets (50 points)
View Full Document
This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.
- Fall '10
- Artificial Intelligence