COMPSCI 171 Quiz: 2016-wq-cs-171-quiz-4
Document Summary
Quiz#4 winter quarter, 2016 20 minutes. Your id: (70 pts total, 10 pts each) for each english sentence below, write the letter corresponding to its best or closest fopc (fol) sentence (wff, or well-formed formula). 1. a (example) d every butterfly likes some flower. 1. c (10 pts) for every flower, there is a butterfly that likes that flower. 1. d (10 pts) every butterfly likes every flower. 1. e (10 pts) there is some butterfly in irvine that is pretty. 1. f (10 pts) every butterfly in irvine is pretty. 1. g (10 pts) every butterfly likes some flower. Quiz continues on the reverse: (30 pts total, 10 pts each) bayesian networks. 2. a. (10 pts) write down the factored conditional probability expression corresponding to this bayesian network: 2. b. (10 pts) draw the bayesian network corresponding to this factored conditional probability expression: 2. c. (10 pts) shown below is the bayesian network corresponding to the burglar alarm problem, i. e. ,
