quiz1 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms . Introduction to Algorithms: 6.006 Massachusetts Institute of Technology March 7, 2008 Professors Srini Devadas and Erik Demaine Handout 6 Quiz 1 Practice Problems 1 Asymptotic Notation Decide whether these statements are True or False . You must briefly justify all your answers to receive full credit. 1. If f ( n ) = Θ( g ( n )) and g ( n ) = Θ( h ( n )) , then h ( n ) = Θ( f ( n )) 2. If f ( n ) = O ( g ( n )) and g ( n ) = O ( h ( n )) , then h ( n ) = Ω( f ( n )) 3. If f ( n ) = O ( g ( n )) and g ( n ) = O ( f ( n )) then f ( n ) = g ( n ) n 4. = Ω( n ) 100 2 Handout 6: Quiz 1 Practice Problems 5. f ( n ) = Θ( n 2 ) , where f ( n ) is defined to be the running time of the program A(n) : def A(n): atuple = tuple(range(0, n)) # a tuple is an immutable version of a # list, so we can hash it S = set()...
View Full Document

Page1 / 6

quiz1 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

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