http://vv.cs.byu.edu/cs312-spring2006/ 2006-06-26T15:32:03-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/final_grades.html Everything has been graded, so the total percentage on Blackboard is your final grade, minus the .5 percent per early project. So you can add .5 * the number of early projects (listed on Blackboard as well) to your total... Announcements ryanShepherd 2006-06-26T15:32:03-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/project_7_fyi.html I have recieved project 7 from most of you (including those sent to the cs312ta@cs.byu.edu email account). However, I'm waiting for a clarification about the answer to the problem, so it probably won't be graded until I get that clarification... Announcements ryanShepherd 2006-06-19T18:16:30-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/homework_keys_1.html Here are the keys for homeworks 13 - 15 Homework 13 RTF Homework 14 RTF Homework 15 RTF... Homework ryanShepherd 2006-06-19T17:39:47-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/final_exam_stud.html Here is a list of things you might want to study in order to be well prepared for the final exam: Make sure you understand the concepts from the homeworks Understand the minimax algorithm. How to prove that a problem... Announcements ryanShepherd 2006-06-19T16:42:12-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/lecture_21.html Lecture 21... Lectures tonglaga 2006-06-19T14:23:51-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/homework_15.html The very last homework! Congratulations on enduring to the end. 1. Problem 11.4 2. Suppose you have a parallel algorithm that runs in O(T(n,p)) time for T(n,p) = log n for a problem of size n using p processors. Suppose... Homework tonglaga 2006-06-16T16:06:16-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/lecture_20.html Lecture 20 Lecture 20 part 2... Lectures tonglaga 2006-06-16T16:00:32-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/partial_grades.html I calculated grades up until project 6, so they don't include the last 2 homeworks, project 7, or the final exam. The total out of the 100 grade percentage points was 72.9. The items not included complete the remaining 27.1... Announcements ryanShepherd 2006-06-16T14:16:17-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/reminder.html Everything needs to be turned in by Monday, June 19, Midnight. If you do not have enough time to complete lab 5, then talk to Ryan so that you can get a working copy to complete lab6. You can also... Announcements tonglaga 2006-06-16T07:45:37-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/project_7_1.html Please make sure to read the linear programming handout. There is some helpful information on it about implementation of the project 7. Also the class link from the previous semester http://vv.cs.byu.edu/cs312/archives/old_project_info/project_7/index.html might be helpful too. Good Luck. tonga... Announcements tonglaga 2006-06-14T15:55:32-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/lecture_19.html Lecture 19 Lecture 19 part 2... Lectures tonglaga 2006-06-14T15:48:37-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/homework_14.html Homework in Section 3.3 of the Linear Programming Handout due June 16, 2006... Homework tonglaga 2006-06-14T15:45:34-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/keys_for_homewo.html Here are the keys for homeworks 8 - 12 Homework 8 RTF Homework 9 RTF Homework 10 RTF Homework 11 RTF Homework 12 RTF... Homework ryanShepherd 2006-06-12T17:25:31-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/lecture_18.html Lecture 18 Lecture 18 part 2 Lecture 18 part 3... Lectures tonglaga 2006-06-12T16:17:32-07:00 http://vv.cs.byu.edu/cs312-spring2006/archives/2006/06/homework_13.html Homework in Section 1.1 of the Linear Programming Handout Homework in Section 2.3 of the Linear Programming Handout Due June 14, 2006... Homework tonglaga 2006-06-12T16:10:20-07:00