# assignment 1 threads - 21662

Request Posted by

## Chargingfast

Rating : No Rating
Earned: \$0
Request Detail
Price: \$15
• From: Computer Science, Programming
• Due on: Tue 06 Aug, 2013 (05:40pm)
• Asked on: Tue 06 Aug, 2013
• Due date has passed, but you can still Post Solution.
Description

for hunain60 only

```Three salemen come to a manufacture to get some T-shirts to sell on the market.
The total number of T-shirts is 1000. Saleman A each time takes 1/3 of the remaining T-shirts.
B takes 1/4 of the remaining T-shirts and C takes 1/5 of the remaining. If the number
of T-shirts for a saleman to take is not an integer, round it up to the ceiling integer.
For example, if the result is 3.14, round it up to 4.

Use three threads to simulate this. Each thread should execute in a loop.
When the T-shirts are gone, stop all threads and terminate the program.
Print out the T-shirts taken by each salesman each time. In the end, you
add up all the T-shirts given out. If the total does not come up to 1000,

a. Write a program without considering the mutual exclusion. Run the
program several times to show that mutual exclusion is not guaranteed and
the result is not correct.

b. Write the program again considering the mutual exclusion. Run the
program several times to show that mutual exclusion is guaranteed.

To make longer execution of threads, use some sleep(n) functions in
the program. Experiment with n to choose the best one to show the
results.

The output can look like this:

A takes away 334 T-shirts.
B takes away 167 T-shirts.
C takes away 100 T-shirts.
B takes away 100 T-shirts.
....

The total number of T-shirts given out is: ...```
1 Solution for assignment 1 threads
Title Price Category solution By purchased
\$15.00 no category hunain60 1 time(s)