# Ordered sets

Not what you're looking for?

A set S of jobs can be ordered by writing x ≤ y to mean that either x = y or x must be done before y, for all x and y in S. The following is a Hasse diagram for this relation for a particular set S of jobs:

(see attached)

a. If one person is to perform all the jobs, one after another, find an order in which the jobs can be done.

b. Suppose enough people are available to perform any number of jobs simultaneously.

i) If each job requires one day to perform, what is the least number of days needed to perform all the jobs?

ii) What is the maximum number of jobs that can be performed at the same time?

##### Purchase this Solution

##### Solution Summary

This shows how to interpret and answer questions based on a Hasse diagram.

##### Solution Preview

Post 2501

A set S of jobs can be ordered by writing x ≤ y to mean that either x = y or x must be done before y, for all x and y in S. The following is a Hasse diagram for this relation for a particular set S of ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Probability Quiz

Some questions on probability

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.