Question

The tower of Hanoi is a problem frequently used to teach recursive programming techniques. The goal is to move a stack of disks from one of the three long pegs to another, using the third peg for maneuvering. Each disk is a different size. Disks may be moved from the top of a stack on a peg to the top of the stack on any another peg, one at a time, provided a disk is never placed on another disk that is smaller than itself. Details of algorithm for listing the series of required moves depend on the structure of the class diagram used. Prepare class diagrams for each of the following descriptions. Show classes and associations. Need not show attributes or operations. a. A tower consists of 3 pegs. Each peg has several disks on it, in a certain order. (20) b. A tower consists of 3 pegs. Disks on the peg are organized into subsets called stacks. A stack is an ordered set of disks. Every disk is in exactly one stack. A peg may have several stacks on it, in order. (25) c. A tower consists of 3 pegs. Disks on the peg are organized into subsets called stacks, as in (b), with several stacks on a peg. However structure of a stack is recursive. A stack consists of one disk, (the disk that is physically at the bottom of the stack) and zero or one stack depending on the height of the stack. (25).

          The tower of Hanoi is a problem frequently used to teach recursive programming techniques. The goal is
to move a stack of disks from one of the three long pegs to another, using the third peg for
maneuvering. Each disk is a different size. Disks may be moved from the top of a stack on a peg to the
top of the stack on any another peg, one at a time, provided a disk is never placed on another disk that
is smaller than itself. Details of algorithm for listing the series of required moves depend on the
structure of the class diagram used. Prepare class diagrams for each of the following descriptions. Show
classes and associations. Need not show attributes or operations.
a. A tower consists of 3 pegs. Each peg has several disks on it, in a certain order. (20)
b. A tower consists of 3 pegs. Disks on the peg are organized into subsets called stacks. A stack is
an ordered set of disks. Every disk is in exactly one stack. A peg may have several stacks on it, in
order. (25)
c. A tower consists of 3 pegs. Disks on the peg are organized into subsets called stacks, as in (b),
with several stacks on a peg. However structure of a stack is recursive. A stack consists of one
disk, (the disk that is physically at the bottom of the stack) and zero or one stack depending on
the height of the stack. (25).

The tower of Hanoi is a problem frequently used to teach recursive programming techniques. The goal is
to move a stack of disks from one of the three long pegs to another, using the third peg for
maneuvering. Each disk is a different size. Disks may be moved from the top of a stack on a peg to the
top of the stack on any another peg, one at a time, provided a disk is never placed on another disk that
is smaller than itself. Details of algorithm for listing the series of required moves depend on the
structure of the class diagram used. Prepare class diagrams for each of the following descriptions. Show
classes and associations. Need not show attributes or operations.
a. A tower consists of 3 pegs. Each peg has several disks on it, in a certain order. (20)
b. A tower consists of 3 pegs. Disks on the peg are organized into subsets called stacks. A stack is
an ordered set of disks. Every disk is in exactly one stack. A peg may have several stacks on it, in
order. (25)
c. A tower consists of 3 pegs. Disks on the peg are organized into subsets called stacks, as in (b),
with several stacks on a peg. However structure of a stack is recursive. A stack consists of one
disk, (the disk that is physically at the bottom of the stack) and zero or one stack depending on
the height of the stack. (25).

Added by Jorge C.

Question

Please give Ace some feedback