<?xml version="1.0" encoding="iso-8859-1"?>

<rdf:RDF
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
xmlns:admin="http://webns.net/mvcb/"
xmlns:cc="http://web.resource.org/cc/"
xmlns="http://purl.org/rss/1.0/">

<channel rdf:about="http://vv.cs.byu.edu/cs312/">
<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>
<dc:creator></dc:creator>
<dc:date>2006-06-12T16:08:02-07:00</dc:date>
<admin:generatorAgent rdf:resource="http://www.movabletype.org/?v=3.11" />


<items>
<rdf:Seq><rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/06/homework_13.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/06/homework_11.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/so_youve_master.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/ultimate_10am_w.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi_1.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_40_revi.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/final_exam_stud.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/projected_grade.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_39_para.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_37_line.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/fill_out_course.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/section_001_fin.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_38_para.html" />
<rdf:li rdf:resource="http://vv.cs.byu.edu/cs312/archives/2006/04/cindys_thursday.html" />
</rdf:Seq>
</items>

</channel>

<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/06/homework_13.html">
<title>Homework 13</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/06/homework_13.html</link>
<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>
<dc:subject>Homework</dc:subject>
<dc:creator>tonglaga</dc:creator>
<dc:date>2006-06-12T16:08:02-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/06/homework_11.html">
<title>Homework 11</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/06/homework_11.html</link>
<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>
<dc:subject>Homework</dc:subject>
<dc:creator>tonglaga</dc:creator>
<dc:date>2006-06-07T16:18:42-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/so_youve_master.html">
<title>So you&apos;veSyllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/so_youve_master.html</link>
<description>Sudoku in C#...</description>
<dc:subject>VisualStudio</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-19T08:52:05-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/ultimate_10am_w.html">
<title>Ultimate:Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/ultimate_10am_w.html</link>
<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>
<dc:subject>Announcements</dc:subject>
<dc:creator>jones</dc:creator>
<dc:date>2006-04-18T16:28:18-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi_1.html">
<title>Dr. RinggSyllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi_1.html</link>
<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>
<dc:subject>Schedule</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-17T17:19:44-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_40_revi.html">
<title>Lecture #Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_40_revi.html</link>
<description>Lecture #40: Review...</description>
<dc:subject>Lectures</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-17T17:15:47-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/final_exam_stud.html">
<title>Final ExaSyllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/final_exam_stud.html</link>
<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>
<dc:subject>Exams</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-17T11:02:38-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/projected_grade.html">
<title>ProjectedSyllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/projected_grade.html</link>
<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>
<dc:subject>Grades</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-17T10:00:00-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_39_para.html">
<title>Lecture #Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_39_para.html</link>
<description>Lecture #39: Parallel Mergesort...</description>
<dc:subject>Lectures</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-14T18:02:24-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_37_line.html">
<title>Lecture #Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_37_line.html</link>
<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>
<dc:subject>Lectures</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-14T17:30:00-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/fill_out_course.html">
<title>Reminder:Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/fill_out_course.html</link>
<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>
<dc:subject>Homework</dc:subject>
<dc:creator>jones</dc:creator>
<dc:date>2006-04-14T10:00:00-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/section_001_fin.html">
<title>Section 0Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/section_001_fin.html</link>
<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>
<dc:subject>Exams</dc:subject>
<dc:creator>jones</dc:creator>
<dc:date>2006-04-13T10:35:11-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi.html">
<title>Dr. RinggSyllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/dr_ringger_offi.html</link>
<description>I will hold office hours one hour earlier than usual on Thursday, 4/13, only. Thanks, --Eric...</description>
<dc:subject>Schedule</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-12T18:27:22-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_38_para.html">
<title>Lecture #Syllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/lecture_38_para.html</link>
<description>Lecture #38: Parallel Algorithms...</description>
<dc:subject>Lectures</dc:subject>
<dc:creator>ringger</dc:creator>
<dc:date>2006-04-12T17:17:05-07:00</dc:date>
</item>
<item rdf:about="http://vv.cs.byu.edu/cs312/archives/2006/04/cindys_thursday.html">
<title>Cindy&apos;s TSyllabus for all sect</title>
<link>http://vv.cs.byu.edu/cs312/archives/2006/04/cindys_thursday.html</link>
<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>
<dc:subject>Schedule</dc:subject>
<dc:creator>cindyStallard</dc:creator>
<dc:date>2006-04-12T10:33:50-07:00</dc:date>
</item>


</rdf:RDF>