QB1 - COM PD e s ignandA n a ly s iso fA lgo r ithm s F a...

Info iconThis preview shows pages 1–2. 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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: COM PD e s ignandA n a ly s iso fA lgo r ithm s F a llS em e ster Q u e st ionB ank So lv in g thesequ es tion sw i llg iveyougoodp rac tice fo rthem id term .Som eo fthesequ es tion s (o rs im i la ron es)w i llden ite lyappea ronyou rexam !N o te tha tyoudono thave tosu bm it an sw ersto thesequ es tion s fo rgrad in g .Y ou rTA sw i lld iscu ssan sw erstose lec tedqu es tion s in the tu to r ia ls . P rob lem . P rov eby indu c t ion .F o ra ll n : n X i = i ( i ? )= n ( n ? )( n + ) : P rob lem . Suppo se T ( n )= O ( f ( n ))and T ( n )= O ( f ( n )) .W h icho fth e fo llow inga retru e? Ju st ifyyou ran sw ers . (a ) T ( n )+ T ( n )= O ( f ( n )) (b ) T ( n ) T ( n ) = O () (c ) T ( n )= O ( T ( n )) P rob lem . F o reachpa iro fexp ress ion s( A ;B )b e low ,ind ica tew h e th er A is O , ,o ro f B . N o tetha tzero ,on e ,o rm o reo fth esere la t ion sm ayho ld fo rag iv enpa ir ;lista llco rrec t on es .Ju st ifyyou ran sw ers . (a ) A = n + n log n ; B = n + n log n : (b ) A = log p n ; B = p log n : (c ) A = n log n ; B = n log n : (d ) A = n ; B = n = : (e ) A = log ( n ) ;...
View Full Document

This note was uploaded on 10/18/2009 for the course COMP 271 taught by Professor Arya during the Spring '07 term at HKUST.

Page1 / 4

QB1 - COM PD e s ignandA n a ly s iso fA lgo r ithm s F a...

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