Quiz5.sp10

Quiz5.sp10 - Signature _ Student ID _ Name_ Score: Quiz 5...

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

View Full Document Right Arrow Icon
Signature ______________________ Name_________________________ Student ID _____________________ Score: Quiz 5 CSE 21 Spring 2010 A series of if-then-else constructs can be modeled with an m -ary decision tree where m is equal to _____. A balance scale can be modeled with an m -ary decision tree where m is equal to _____. In a collection of 10 coins, 3 coins are counterfeit and weigh more than the genuine coins. Find a good lower bound on the number of balance scale weighings needed to identify all the fake coins. _____ A) 10 3 B) 3 10 C) log 2 C(10,3) D) log 2 P(10,3) E) log 3 C(10,3) F) log 3 P(10,3) G) log 2 10 3 H) log 3 10 3 According to the Lower Bound Theorem, the best (most efficient) worst case complexity for comparison-based search is _____. A) O(1) B) O(log 2 n) C) O(n) D) O(n log 2 n) E) O(n 2 ) F) O(n 3 ) G) O(2 n ) H) O(n!) According to the Lower Bound Theorem, the best (most efficient) worst case complexity for comparison-based sort is _____. A) O(1)
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.

Page1 / 2

Quiz5.sp10 - Signature _ Student ID _ Name_ Score: Quiz 5...

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