# how many different outfits can be put together if you may choose one of 7 jeans, one of 4 shirts and one of 3 belts?

Question
Factors and multiples
how many different outfits can be put together if you may choose one of 7 jeans, one of 4 shirts and one of 3 belts?

2021-02-09

The Fundamental Counting Principle states that if there are pp outcomes for one event and qq outcomes for another event, then there are p×qp×q ways of both events occurring.
Therefore, if there are 7 ways to choose a pair of jeans, 4 ways to choose a shirt, and 3 ways to choose a belt, there are $$7\times4\times3=28\times3=84$$ different outfits possible.

### Relevant Questions

We will now add support for register-memory ALU operations to the classic five-stage RISC pipeline. To offset this increase in complexity, all memory addressing will be restricted to register indirect (i.e., all addresses are simply a value held in a register; no offset or displacement may be added to the register value). For example, the register-memory instruction add x4, x5, (x1) means add the contents of register x5 to the contents of the memory location with address equal to the value in register x1 and put the sum in register x4. Register-register ALU operations are unchanged. The following items apply to the integer RISC pipeline:
a. List a rearranged order of the five traditional stages of the RISC pipeline that will support register-memory operations implemented exclusively by register indirect addressing.
b. Describe what new forwarding paths are needed for the rearranged pipeline by stating the source, destination, and information transferred on each needed new path.
c. For the reordered stages of the RISC pipeline, what new data hazards are created by this addressing mode? Give an instruction sequence illustrating each new hazard.
d. List all of the ways that the RISC pipeline with register-memory ALU operations can have a different instruction count for a given program than the original RISC pipeline. Give a pair of specific instruction sequences, one for the original pipeline and one for the rearranged pipeline, to illustrate each way.
Hint for (d): Give a pair of instruction sequences where the RISC pipeline has “more” instructions than the reg-mem architecture. Also give a pair of instruction sequences where the RISC pipeline has “fewer” instructions than the reg-mem architecture.
Sara's Softball team can be divided into four groups. 1/2 ofthe players are stronge hitters. 1/4 are good pitchers, 1/8 like toplay the outfield and 2 players are catchers. If each player is inonly one group how many players are on the team and in each group?
Simon is making wreaths to sell. He has 60 bows, 36 silk roses, and 48 silk carnations. He wants to put the same number of items on each wreath. All the items on a wreath will be the same type. How many items can Simon put on each wreath?
If you flip a coin 9 times, you get a sequence of Heads (H) and tails (T).
Solve each question
(a) How many different sequences of heads and tails are possible?
c) How many different sequences have at most 2 heads?
4.7 A multiprocessor with eight processors has 20attached tape drives. There is a large number of jobs submitted tothe system that each require a maximum of four tape drives tocomplete execution. Assume that each job starts running with onlythree tape drives for a long period before requiring the fourthtape drive for a short period toward the end of its operation. Alsoassume an endless supply of such jobs.
a) Assume the scheduler in the OS will not start a job unlessthere are four tape drives available. When a job is started, fourdrives are assigned immediately and are not released until the jobfinishes. What is the maximum number of jobs that can be inprogress at once? What is the maximum and minimum number of tapedrives that may be left idle as a result of this policy?
b) Suggest an alternative policy to improve tape driveutilization and at the same time avoid system deadlock. What is themaximum number of jobs that can be in progress at once? What arethe bounds on the number of idling tape drives?
Assume that a ball of charged particles has a uniformly distributednegative charge density except for a narrow radial tunnel throughits center, from the surface on one side to the surface on the opposite side. Also assume that we can position a proton any where along the tunnel or outside the ball. Let $$\displaystyle{F}_{{R}}$$ be the magnitude of the electrostatic force on the proton when it islocated at the ball's surface, at radius R. As a multiple ofR, how far from the surface is there a point where the forcemagnitude is 0.44FR if we move the proton(a) away from the ball and (b) into the tunnel?