CSC 321 Fall 2000 / Section 401

Take home final exam

Please complete the following problems:

• Chapter 1: 1.7, 1.26, 1.28, 1.40
• Chapter 4: 4.54, 4.62
• Chapter 7: 7.27, 7.43
• Chapter 8: 8.17, 8.26
• Chapter 10: In class you saw the algorithm for finding the length of longest common subsequence between two strings.  Run that algorithm on the pair of words photography/tomography. 
• Chapter 13: Find two NP-complete problems not mentioned in the text and describe them.  You may use any reference but cite what you use.  For example, if you use the web, supply a URL.

There are twelve problems.  Clear label each problem with the chapter it comes from and, if present, its book exercise number (e.g., 1.7).

This exam is due Tuesday, November 21st, at 5pm CST.  You may e-mail me the exam or, to be certain it's submitted on time, you may turn it in at the fourth floor front desk, where they will timestamp it.