06.03.2017 Views

Mathematics for Computer Science

e9ck2Ar

e9ck2Ar

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

“mcs” — 2017/3/3 — 11:21 — page 403 — #411<br />

10.11. Summary of Relational Properties 403<br />

Problem 10.16.<br />

Describe a sequence consisting of the integers from 1 to 10,000 in some order so<br />

that there is no increasing or decreasing subsequence of size 101.<br />

Problem 10.17.<br />

What is the smallest number of partially ordered tasks <strong>for</strong> which there can be more<br />

than one minimum time schedule, if there are unlimited number of processors?<br />

Explain your answer.<br />

Problem 10.18.<br />

The following DAG describes the prerequisites among tasks f1; : : : ; 9g.<br />

9<br />

8<br />

3<br />

5<br />

7<br />

2<br />

4<br />

6<br />

1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!