数据结构与算法分析课后题答案【荐】.pdfVIP

课后答案网，用心为你服务！ 大学答案 --- 中学答案 --- 考研答案 --- 考试答案 最全最多的课后习题参考答案，尽在课后答案网 （ ）！ Khdaw团队一直秉承用心为大家服务的宗旨，以关注学生的学习生活为出发点， 旨在为广大学生朋友的自主学习提供一个分享和交流的平台。 爱校园 （ ） 课后答案网 （ ） 淘答案（ ） Chapter 10: Algorithm Design Techniques 10.1 First, we show that if NO evenly divides PO , then each of jP O iO? 1 PO+ 1 through jP iPO must be placed as the iO thO job on some processor. Suppose otherwise. Then in the supposed optimal ordering, we must be able to ?nd some jobs jP xO and jP yO such that jP xO is the tO thO job on some processor and jP yO is the tO+ 1thO job on some processor but txO tyO . Let jP zO be the job immediately following jP xO . If we swap jP yO and jP zO , it is easy to check that the mean pro- cessing time is unchanged and thus still optimal. But now jP yO follows jP xO , which is impos- sible because we know that the jobs on any processor must be in sorted order from the results of the one processor case. Let jP eO 1, jP eO2, ..., jP eMO be the extra jobs if NO does not evenly divide PO . It is easy to see that the processing time for these jobs depends only on how quickly they can be scheduled, and that they must be the last scheduled job on some processor. It is easy to see that the ?rst MO processors must have jobs jP O iO? 1 PO+ 1 through jP iPO+MO ; we leave the details to the reader. 10.3 , 0 sp 4 7 8 9 1 5 nl 6 2 3 : 10.4 One method is to generate code that can be evaluated by a stack machine. The two opera- tions are PushO the one node tree corresponding to a symbol onto a stack and Combine,O which pops two trees off the stack, merges them, and pushes the result back on. For the example in the text, the stack instructions are Push s , Push nl , Combine, Push t , Com- bine, Push a , Combine, Push e , Combine, Push i , Push sp , Combine, Combine. By encoding a CombineO with a 0 and a PushO with a 1 followed by the symbol, the total extra space is 2NO ? 1 bits if all the symbols are of equal length. Gener