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 118 — #126<br />

118<br />

Chapter 4<br />

Mathematical Data Types<br />

(b) The set of pages containing the word “set” that have been recommended by<br />

“Meyer”<br />

(c) The set of endorsers who have recommended pages containing the word “algebra”<br />

(d) The relation that relates endorser e and word w iff e has recommended a page<br />

containing w<br />

(e) The set of pages that have at least one incoming or outgoing link<br />

(f) The relation that relates word w and page p iff w appears on a page that links<br />

to p<br />

(g) The relation that relates word w and endorser e iff w appears on a page that<br />

links to a page that e recommends<br />

(h) The relation that relates pages p 1 and p 2 iff p 2 can be reached from p 1 by<br />

following a sequence of exactly 3 links<br />

Exam Problems<br />

Problem 4.29.<br />

Let A be the set containing the five sets: fag; fb; cg; fb; dg; fa; eg; fe; f g, and let<br />

B be the set containing the three sets: fa; bg; fb; c; dg; fe; f g. Let R be the “is<br />

subset of” binary relation from A to B defined by the rule:<br />

X R Y IFF X Y:<br />

(a) Fill in the arrows so the following figure describes the graph of the relation,<br />

R:

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

Saved successfully!

Ooh no, something went wrong!