hw04 - CS 70 Spring 2005 Discrete Mathematics for CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 70 Discrete Mathematics for CS Spring 2005 Clancy/Wagner HW 4 Due Thursday, February 17th Coverage: This assignment involves topics from the February 8 and 10 lectures (labeled as lectures 6, 7, and 8 in the notes). Administrative reminders: We will accept only unformatted text files or PDF files for homework sub- mission. Include your name, login name, section number, and partner list in your submission. Give the command submit hw4 to submit your answers to this assignment. Homework exercises: 1. (23 pts.) Boolean decision trees A decision tree is a variant of binary trees in which each internal node is labelled with a Boolean DECISION TREE variable. Each leaf is labelled with an atom T or F . The notation h P , t 1 t 2 i denotes a decision tree whose root is labelled with P and whose left and right subtrees are t 1 and t 2 . A decision tree t represents a Boolean function as follows, where m is a model (i.e., an assignment that assigns each Boolean variable to true or false): If t is an atom, eval ( t , m )= t . eval
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/03/2011 for the course CS 70 taught by Professor Papadimitrou during the Fall '08 term at University of California, Berkeley.

Page1 / 2

hw04 - CS 70 Spring 2005 Discrete Mathematics for CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online