Question

i-2 Difizngpro() 41=44 S=Sgrten) for Ci= 25 2S;i) f CacI)&Ihas ben fand to be a pime Count tj L4 for Gi= 2ijan,j=jti aljj=FALSE no mutiple of fG5 pine abunt O S 2 (unptss fig y.O if iss gom C22) Dtreiny 12f AIse altaI gD Ca) figure H:O 3 e cade to Coun the numloer af pimes Suitsoly fro m a to 0sing MaNge anay ony i tun cve 3 no euenly ciui eles i.we initialize q and men The 5ieu e metnod On a fhact i3, a 3TRUE prime i^o at tue end Or Less st Count GOunt +1 9ciJ to TRUE to fALS E F we find ciuisor equi vetemt three-adedress co deCAC) s et if j>n goto Go The is presentcd h fg 6t3 aEt3= fa se j-j+i goto (15) a Con struat ne floo graph forhe TAc ident y Perform t locs and doal ophimizet (ops tn yaur flos gaph fronla qne on much you Gn Foto Cie) fig. 4.1

Answer 1

bopfoeteopijene LO

The loops detected from the TAC are ones which always loop back to a certain point:

Loop 1: 2 to 6

Loop 2: 10 to 21

Loop 3: 15 to 19

As far as optimisations go, the code seems amply optimized for TAC. No other obvious optimisations are required.