Describe a data structure suitable for representing a board configuration during a chess game. Elaborate on the choices that you have made.
Part 1:
#1. Give an example of how efforts in the development of software can pay dividends later in software maintenance.
#2. Explain how the lack of metrics for measuring certain software properties affects the software engineering discipline.
#3. How does software engineering differ from other, more traditional fields of engineering such as electrical and mechanical engineering?
#4. What is the difference between coupling and cohesion? Which should be minimized and which should be maximized?
#5. Identify some design patterns in fields other than architecture and software engineering.
Part 2:
#1. Suppose a homogeneous array with 6 rows and 8 columns is stored in row major order starting at address 20 (base ten). If each entry in the array requires only one memory cell, what is the address of the entry in the third row and fourth column? What if each entry requires two memory cells?
#2. What complications are imposed if one tries to implement a dynamic list using a traditional homogeneous array?
#3. Describe a method for storing three-dimensional homogeneous arrays. What addressing formula would be used to locate the entry in the ith plane, jth row, and the kth column?
#4. Does a queue crawl through memory in the direction of its head or its tail? Explain your answer.
#5. Describe how an array could be used to implement a queue in a high-level language.
#6. Describe a data structure suitable for representing a board configuration during a chess game.