This preview shows page 1. Sign up to view the full content.
Practice Questions for Quiz 4
CS228 – Winter 2009
January 31, 2009
Note: This practice question was updated on Jan 31, 2009.
The following questions are provided as examples of the types of questions we
will ask on the quiz this week, as well as the kinds of questions you should be
asking yourself (and answering) as you read the text.
This is the end of the preview. Sign up
to
access the rest of the document.
Unformatted text preview: 1. Which of the following cluster trees satisfies the running intersection property? a) b) c) 2. Assume that we have a Clique tree T over X such that, for every pair of nodes X , Y ∈ X , there exists a clique that contains both X and Y. Prove that T must contain a single clique that contains all of X ....
View
Full
Document
This document was uploaded on 03/03/2011.
 Winter '09

Click to edit the document details