Discuss and explain recursive methods, hidden implementations, and cohesion and coupling.
How does a programmer determine the methods that should make up a program, bearing in mind the principles of information hiding, cohesion, and coupling?
What are some examples of programming problems that can be solved recursively.
Hidden implementations are often said to exist in a black box. What are the advantages and disadvantages to this approach?
3–4 pages in length (excluding cover page, abstract, and reference list)