<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithms | Yao Zheng@UHM</title><link>https://gustybear.github.io/tags/algorithms/</link><atom:link href="https://gustybear.github.io/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><description>Algorithms</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 09 Dec 2024 10:07:39 -1000</lastBuildDate><image><url>https://gustybear.github.io/media/logo_hu_d0a0b1783c391ac0.png</url><title>Algorithms</title><link>https://gustybear.github.io/tags/algorithms/</link></image><item><title>ECE602: Algorithm I</title><link>https://gustybear.github.io/teaching/course_ece602_2025_spring/</link><pubDate>Mon, 09 Dec 2024 10:07:39 -1000</pubDate><guid>https://gustybear.github.io/teaching/course_ece602_2025_spring/</guid><description>&lt;h1 id="executive-summary">Executive Summary&lt;/h1>
&lt;p>Design and evaluation of machine representations, techniques and algorithms for sorting, pattern processing, computational geometry, mathematical computations, and engineering applications. Introduction to computational issues of time, space, communication, and program correctness. Pre: 367 or consent.&lt;/p>
&lt;h1 id="logistics">Logistics&lt;/h1>
&lt;ul>
&lt;li>
&lt;p>&lt;strong>CRN&lt;/strong>&lt;/p>
&lt;table>
&lt;thead>
&lt;tr>
&lt;th>ECE602 001&lt;/th>
&lt;/tr>
&lt;/thead>
&lt;tbody>
&lt;tr>
&lt;td>88856&lt;/td>
&lt;/tr>
&lt;/tbody>
&lt;/table>
&lt;/li>
&lt;li>
&lt;p>&lt;strong>Personnel&lt;/strong>:&lt;/p>
&lt;table>
&lt;thead>
&lt;tr>
&lt;th>&lt;/th>
&lt;th>&lt;/th>
&lt;/tr>
&lt;/thead>
&lt;tbody>
&lt;tr>
&lt;td>Lecturer:
&lt;/td>
&lt;td>Office Hours: see
&lt;/td>
&lt;/tr>
&lt;/tbody>
&lt;/table>
&lt;/li>
&lt;li>
&lt;p>&lt;strong>Format&lt;/strong>:&lt;/p>
&lt;table>
&lt;thead>
&lt;tr>
&lt;th>Lecture Time&lt;/th>
&lt;th>Lecture Location&lt;/th>
&lt;th>Textbook&lt;/th>
&lt;th>Quiz&lt;/th>
&lt;th>Assignment&lt;/th>
&lt;/tr>
&lt;/thead>
&lt;tbody>
&lt;tr>
&lt;td>MW 12:00pm-13:15pm&lt;/td>
&lt;td>Keller Hall 314/Zoom/Ad hoc&lt;/td>
&lt;td>&lt;em>Required&lt;/em>: An Introduction to the Analysis of Algorithms&lt;/td>
&lt;td>Individual&lt;/td>
&lt;td>Individual&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>&lt;/td>
&lt;td>&lt;/td>
&lt;td>&lt;em>Required&lt;/em>: Analytic Combinatorics&lt;/td>
&lt;td>&lt;/td>
&lt;td>&lt;/td>
&lt;/tr>
&lt;/tbody>
&lt;/table>
&lt;/li>
&lt;/ul>
&lt;h1 id="grading-policy">Grading Policy&lt;/h1>
&lt;p>&amp;ndash; &lt;strong>Breakdown&lt;/strong>&lt;/p>
&lt;table>
&lt;thead>
&lt;tr>
&lt;th>Quiz &amp;amp; Assignment&lt;/th>
&lt;th>Discussion &amp;amp; Participation&lt;/th>
&lt;/tr>
&lt;/thead>
&lt;tbody>
&lt;tr>
&lt;td>80%&lt;/td>
&lt;td>20%&lt;/td>
&lt;/tr>
&lt;/tbody>
&lt;/table>
&lt;ul>
&lt;li>
&lt;p>&lt;strong>Cutoffs&lt;/strong>&lt;/p>
&lt;table>
&lt;thead>
&lt;tr>
&lt;th>A-&lt;/th>
&lt;th>B-&lt;/th>
&lt;th>C-&lt;/th>
&lt;/tr>
&lt;/thead>
&lt;tbody>
&lt;tr>
&lt;td>70%&lt;/td>
&lt;td>50%&lt;/td>
&lt;td>30%&lt;/td>
&lt;/tr>
&lt;/tbody>
&lt;/table>
&lt;/li>
&lt;li>
&lt;p>&lt;strong>Proscribed Conduct&lt;/strong>: Copying or otherwise cheating on homework, lab reports, or exam will result in a failing grade for the course. More details can be found at student conduct code policies,
&lt;/p>
&lt;/li>
&lt;/ul>
&lt;h1 id="schedule">Schedule&lt;/h1>
&lt;table>
&lt;thead>
&lt;tr>
&lt;th>TIME&lt;/th>
&lt;th>TOPICS&lt;/th>
&lt;th>READING/HW/EXAM&lt;/th>
&lt;th>DEADLINE&lt;/th>
&lt;/tr>
&lt;/thead>
&lt;tbody>
&lt;tr>
&lt;td>Week 1 (1/13, 1/15)&lt;/td>
&lt;td>Analysis of Algorithms&lt;/td>
&lt;td>
&lt;/td>
&lt;td>1/19, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 2 (1/22)&lt;/td>
&lt;td>Recurrence Relations&lt;/td>
&lt;td>
&lt;/td>
&lt;td>1/26, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 3 (1/27, 1/29)&lt;/td>
&lt;td>Generating Functions&lt;/td>
&lt;td>
&lt;/td>
&lt;td>2/2, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 4 (2/3, 2/5)&lt;/td>
&lt;td>Asymptotic Approximations&lt;/td>
&lt;td>
&lt;/td>
&lt;td>2/9, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 5 (2/10, 2/12)&lt;/td>
&lt;td>Analytic Combinatorics&lt;/td>
&lt;td>
&lt;/td>
&lt;td>2/18, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 6 (2/19)&lt;/td>
&lt;td>Trees&lt;/td>
&lt;td>
&lt;/td>
&lt;td>2/23, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 7 (2/24, 2/26)&lt;/td>
&lt;td>Permutations&lt;/td>
&lt;td>
&lt;/td>
&lt;td>3/2, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 8 (3/3, 3/5)&lt;/td>
&lt;td>Strings and Tries&lt;/td>
&lt;td>
&lt;/td>
&lt;td>3/9, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 9 (3/10, 3/12)&lt;/td>
&lt;td>Words and Maps&lt;/td>
&lt;td>
&lt;/td>
&lt;td>3/16, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Spring Recess (3/17 - 3/21)&lt;/td>
&lt;td>&amp;ndash;&lt;/td>
&lt;td>&amp;ndash;&lt;/td>
&lt;td>&amp;ndash;&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 10 (3/24, 3/26)&lt;/td>
&lt;td>Combinatorial Structures and OGFs&lt;/td>
&lt;td>
&lt;/td>
&lt;td>3/30, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 11 (3/31, 4/2)&lt;/td>
&lt;td>Labelled Structures and EGFs&lt;/td>
&lt;td>
&lt;/td>
&lt;td>4/6, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 12 (4/7, 4/9)&lt;/td>
&lt;td>Combinatorial Parameters and MGFs&lt;/td>
&lt;td>
&lt;/td>
&lt;td>4/13, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 13 (4/14, 4/16)&lt;/td>
&lt;td>Complex Analysis, Rational and Meromorphic Asymptotics&lt;/td>
&lt;td>
&lt;/td>
&lt;td>4/20, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 14 (4/21, 4/23)&lt;/td>
&lt;td>Applications of Rational and Meromorphic Asymptotics&lt;/td>
&lt;td>
&lt;/td>
&lt;td>4/27, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 15 (4/28, 4/30)&lt;/td>
&lt;td>Singularity Analysis&lt;/td>
&lt;td>
&lt;/td>
&lt;td>5/4, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 16 (5/5, 5/7)&lt;/td>
&lt;td>Applications of Singularity Analysis&lt;/td>
&lt;td>
&lt;/td>
&lt;td>5/11, 11:59PM&lt;/td>
&lt;/tr>
&lt;tr>
&lt;td>Week 17 (5/12，5/14)&lt;/td>
&lt;td>Saddle Point Asymptotics&lt;/td>
&lt;td>
&lt;/td>
&lt;td>5/18, 11:59PM&lt;/td>
&lt;/tr>
&lt;/tbody>
&lt;/table></description></item></channel></rss>