CS 3343/3341
 Analysis of Algorithms 
Fall 2012
  Questions and Corrections,   
with Responses

  1. Question (Sat Sep 8 14:13:46 CDT 2012): I have used the function Math.pow(,) in java to solve the problem of the conversion. Is it ok or should I change it to use another procedure to create a function power?
    Response: I don't want you to use the pow function. The goal is to learn something about logarithms. For Questions 6 and 7 of Recitation 1, you should be writing formulas to solve the problems. Getting a final numerical answer is not the important part.

  2. Question (Fri Sep 14 19:48:43 CDT 2012): On Recitation 3, Problem 7, I don't agree with one of your answers.
    Response: Yeah, the first answer (2 months) is correct (approximately), but the second answer (1 day) is not. The second answer should be: Approximately 2.75 hours. (I changed this answer on the recitation page.)

  3. Question (Wed Sep 19 16:57:09 CDT 2012): The first Algorithm in Question 3 of Recitation 4 is giving me a different result than 322 = 31 381 059 609.
    Response: I intended for this problem to be done by hand. In Java and C, the maximum size of an int is 231 - 1 = 2 147 483 648, so you can't calculate 322 using an int. In C you can use a double, and in Java you can use either a double or a long. In C in the program on the right in the picture, you can't use a % operator with a double, but you can make the variable b an int and the others doubles.

  4. Question (Fri Oct 12 10:40:19 CDT 2012): I am working on rec #7 and am confused about the instruction for problem #1...are we supposed to do #1 or just look at it, because your instructions say to work on #2?
    Response: Yeah, it's confusing. The instructions were for the Recitation Session, where I wanted people to avoid getting all hung up on #1 and not even get to #2. This no longer applies. So you should complete #1 as well as #2, but #1 is intended to be simple, requiring only short answers. The important stuff is in #2.

  5. Question (Sun Dec 2 15:38:41 CST 2012): I have questions about Recitation 13, Question 2. Which vertex should the searches start from?
    Response: It doesn't really matter, so I'm going to say that you can start from any vertex (0 to 10 on the first graph and 0 to 47 on the second). It must be clear which one you start with.

    Part a asks that you do a DFS, but doesn't require any output. Part b asks you to print the list of vertices and the values of the three fields.

Revision date: 2012-10-12. (Please use ISO 8601, the International Standard Date and Time Notation.)