<?xml version="1.0" encoding="iso-8859-1"?>
<rss version="2.0">
<channel>
<title>CS 312 (W&apos;07, T Th sections)</title>
<link>http://vv.cs.byu.edu/cs312/</link>
<description>Algorithm Analysis, 373 MARB T Th, M. Jones</description>
<copyright>Copyright 2008</copyright>
<lastBuildDate>Mon, 12 Jun 2006 16:08:02 -0700</lastBuildDate>
<generator>http://www.movabletype.org/?v=3.11</generator>
<docs>http://blogs.law.harvard.edu/tech/rss</docs> 

<item>
<title>Homework 13</title>
<description>Homework in Section 1.1 of the Linear Programming Handout Homework in Section 2.3 of the Linear Programming Handout Due June 14, 2006...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/06/homework_13.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/06/homework_13.html</guid>
<category>Homework</category>
<pubDate>Mon, 12 Jun 2006 16:08:02 -0700</pubDate>
</item>
<item>
<title>Homework 11</title>
<description>Consider the following reduced cost matrix M, in which M[a,b] = i means that the path from a to b has been excluded from consideration (by setting its cost to infinity) with the given lower bound lb: M = 0...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/06/homework_11.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/06/homework_11.html</guid>
<category>Homework</category>
<pubDate>Wed, 07 Jun 2006 16:18:42 -0700</pubDate>
</item>
<item>
<title>So you&apos;veSyllabus for all sect</title>
<description>Sudoku in C#...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/so_youve_master.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/so_youve_master.html</guid>
<category>VisualStudio</category>
<pubDate>Wed, 19 Apr 2006 08:52:05 -0700</pubDate>
</item>
<item>
<title>Ultimate:Syllabus for all sect</title>
<description>We&apos;ve got a 312 ultimate game set for 10am Wednesday morning at Kiwanis park (map). Just in case you need it, here is Ultimate in Ten Simple Rules Everyone is welcome, and it looks like the weather will be cool...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/ultimate_10am_w.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/ultimate_10am_w.html</guid>
<category>Announcements</category>
<pubDate>Tue, 18 Apr 2006 16:28:18 -0700</pubDate>
</item>
<item>
<title>Dr. RinggSyllabus for all sect</title>
<description>I will not be holding my regular office hours during reading days, but I will be available by appointment. I will be happy to meet with any student from one of my sections as needed....</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi_1.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi_1.html</guid>
<category>Schedule</category>
<pubDate>Mon, 17 Apr 2006 17:19:44 -0700</pubDate>
</item>
<item>
<title>Lecture #Syllabus for all sect</title>
<description>Lecture #40: Review...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_40_revi.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_40_revi.html</guid>
<category>Lectures</category>
<pubDate>Mon, 17 Apr 2006 17:15:47 -0700</pubDate>
</item>
<item>
<title>Final ExaSyllabus for all sect</title>
<description>For the CS 312 Final in sections 002 and 003, I encourage you to prepare in such a way that you will be comfortable with the following topics: Definitions of Big-O, Big-Omega, Big-Theta How to prove that a problem is...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/final_exam_stud.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/final_exam_stud.html</guid>
<category>Exams</category>
<pubDate>Mon, 17 Apr 2006 11:02:38 -0700</pubDate>
</item>
<item>
<title>ProjectedSyllabus for all sect</title>
<description>The grades on BlackBoard for section 002 and 003 are up to date through Project #6. The current total possible is exactly 74 points (out of what will be 100 for the entire semester). The remaining 26 points will come...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/projected_grade.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/projected_grade.html</guid>
<category>Grades</category>
<pubDate>Mon, 17 Apr 2006 10:00:00 -0700</pubDate>
</item>
<item>
<title>Lecture #Syllabus for all sect</title>
<description>Lecture #39: Parallel Mergesort...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_39_para.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_39_para.html</guid>
<category>Lectures</category>
<pubDate>Fri, 14 Apr 2006 18:02:24 -0700</pubDate>
</item>
<item>
<title>Lecture #Syllabus for all sect</title>
<description>Lecture #37: Linear Programming: Simplex Method Several have requested full-page slides. They are here Lecture #37: Linear Programming: Simplex Method (FULL PAGE) Please note that the pseudo-code and the example in these slides come right out of the Linear Programming...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_37_line.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_37_line.html</guid>
<category>Lectures</category>
<pubDate>Fri, 14 Apr 2006 17:30:00 -0700</pubDate>
</item>
<item>
<title>Reminder:Syllabus for all sect</title>
<description>If you fill out the online evaluation for CS 312, and check the box that says &quot;allow my name to be shown in the list of people who filled out the form&quot; (or something similar) then you&apos;ll get credit for...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/fill_out_course.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/fill_out_course.html</guid>
<category>Homework</category>
<pubDate>Fri, 14 Apr 2006 10:00:00 -0700</pubDate>
</item>
<item>
<title>Section 0Syllabus for all sect</title>
<description>The exam, and key, have been written. If I were studying for the final exam, I would want to be sure I was comfortable with the following topics: How to prove that a problem is NP complete. Derrive the big-Theta...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/section_001_fin.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/section_001_fin.html</guid>
<category>Exams</category>
<pubDate>Thu, 13 Apr 2006 10:35:11 -0700</pubDate>
</item>
<item>
<title>Dr. RinggSyllabus for all sect</title>
<description>I will hold office hours one hour earlier than usual on Thursday, 4/13, only. Thanks, --Eric...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi.html</guid>
<category>Schedule</category>
<pubDate>Wed, 12 Apr 2006 18:27:22 -0700</pubDate>
</item>
<item>
<title>Lecture #Syllabus for all sect</title>
<description>Lecture #38: Parallel Algorithms...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_38_para.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_38_para.html</guid>
<category>Lectures</category>
<pubDate>Wed, 12 Apr 2006 17:17:05 -0700</pubDate>
</item>
<item>
<title>Cindy&apos;s TSyllabus for all sect</title>
<description>I&apos;m cutting my hours short on Thursday. I will be working from 5-7pm. I hope that doesn&apos;t inconvenience anyone. -Cindy...</description>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/cindys_thursday.html</link>
<guid>http://vv.cs.byu.edu/cs312/archives/2006/04/cindys_thursday.html</guid>
<category>Schedule</category>
<pubDate>Wed, 12 Apr 2006 10:33:50 -0700</pubDate>
</item>


</channel>
</rss>