## SSE2025.Schedule History

Hide minor edits - Show changes to output

Changed lines 12-13 from:

|| 10th ||Graph ~~1~~ || [[(Attach:)~~Lecture9~~.ppt|graph ~~1~~]] || holiday || [[(Attach:)hw3.pdf|HW3]] ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph~~algorithms~~]] || May 12 || ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph

to:

|| 10th ||Graph || [[(Attach:)Lecture8-9.ppt|graph ]] || holiday || [[(Attach:)hw3.pdf|HW3]] ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10-11.ppt| graph theory]] || May 12 || ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10-11.ppt| graph theory]] || May 12 || ||

Changed line 12 from:

|| 10th ||Graph 1 || [[(Attach:)Lecture9.ppt|graph 1]] || holiday || [[(Attach:)hw3.~~ppt~~|HW3]] ||

to:

|| 10th ||Graph 1 || [[(Attach:)Lecture9.ppt|graph 1]] || holiday || [[(Attach:)hw3.pdf|HW3]] ||

Changed line 12 from:

|| 10th ||Graph 1 || [[(Attach:)Lecture9.ppt|graph ~~traversal~~]] || holiday || [[(Attach:)hw3.ppt|HW3]] ||

to:

|| 10th ||Graph 1 || [[(Attach:)Lecture9.ppt|graph 1]] || holiday || [[(Attach:)hw3.ppt|HW3]] ||

Changed line 12 from:

|| 10th ||Graph ~~Traversal~~ || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || [[(Attach:)hw3.ppt|HW3]] ||

to:

|| 10th ||Graph 1 || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || [[(Attach:)hw3.ppt|HW3]] ||

Changed line 9 from:

|| 7th ||~~Number Theory ~~|| ~~ [[(Attach:)Lecture7.ppt|number theory]]~~ || April 14 || [[(Attach:)hw2.pdf|HW2]] ||

to:

|| 7th ||Review || || April 14 || [[(Attach:)hw2.pdf|HW2]] ||

Changed line 9 from:

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || [[(Attach:)hw2.~~ppt~~|HW2]] ||

to:

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || [[(Attach:)hw2.pdf|HW2]] ||

Changed line 10 from:

|| 8th ||[Midterm Exam] || [[(Attach:)~~Midterm~~.~~ppt~~| Solution]] || || ||

to:

|| 8th ||[Midterm Exam] || [[(Attach:)mid_solution.pdf| Solution]] || || ||

Changed line 6 from:

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || [[(Attach:)hw1.~~ppt~~|HW1]] ||

to:

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || [[(Attach:)hw1.pdf|HW1]] ||

Changed line 7 from:

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 || ||

to:

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5-2.ppt|arithmetics]] || Mar 31 || ||

Changed line 16 from:

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||||

to:

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 || ||

Changed lines 15-16 from:

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || |~~|~~

|| 14th ||Geometry Problems|| ~~[[(Attach:)Lecture13.ppt| geometry]] ~~||~~ June 2~~ || [[(Attach:)~~team~~.ppt|~~team~~]] ||

|| 14th ||Geometry Problems

to:

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || [[(Attach:)team.ppt|team]] ||

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||||

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||||

Changed line 16 from:

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||[[(Attach:)team.ppt|team]] ||

to:

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 || [[(Attach:)team.ppt|team]] ||

Changed lines 11-12 from:

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || ~~[[(Attach:)hw3.ppt~~|~~HW3]] ~~||

|~~|~~ 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || ||

to:

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || [[(Attach:)hw3.ppt|HW3]] ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || [[(Attach:)hw3.ppt|HW3]] ||

Changed line 14 from:

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || ~~ [[(Attach:)team.ppt|team]]~~ ||

to:

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || ||

Changed line 16 from:

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 || ||

to:

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||[[(Attach:)team.ppt|team]] ||

Changed lines 2-18 from:

||! Weeks ||! Topics ||! Slides || Lab (Wed) ||

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture ||

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 ||

~~|| 5th ~~|~~|Arithmetic Problems~~|| ~~[[(Attach:)Lecture5.ppt~~|~~arithmetics]] ~~ ~~ ~~|~~| Mar 31~~ ||

|| 6th||~~Combinatorics~~ || ~~[[(Attach:)Lecture6.ppt| combinatorics]] ~~||~~ April 7 ~~||

|~~| 7th~~ ||~~Number Theory ~~|| ~~[[(Attach:)Lecture7.ppt|number theory]]~~ ~~ ~~|| ~~April 14 ||~~

~~||~~ ~~8th~~ ||~~[Midterm Exam] ~~|| [[(Attach:)~~Midterm~~.ppt|~~ Solution~~]] ||~~ ~~||

~~|| 9th ~~||~~Backtracking ~~ || [[(Attach:)~~Lecture8~~.ppt| ~~backtracking~~]] || ~~April 28 ~~||

|| ~~10th ~~||~~Graph Traversal ~~|| ~~ ~~[[(Attach:)~~Lecture9~~.ppt|~~graph traversal~~]] ~~ ~~|| ~~holiday ~~||

|~~| 11th~~ ||~~Graph Algorithms~~ ||~~ ~~[[(Attach:)~~Lecture10~~.ppt|~~ ~~graph ~~algorithms~~]] ~~|| May 12 ~~||

|| ~~12th ~~||~~Dynamic Programming ~~||~~ ~~ [[(Attach:)~~Lecture11~~.ppt|~~dynamic]] ~~ || May ~~19~~ ||

|| ~~13th~~ ||~~Grid Problems~~ || ~~ ~~[[(Attach:)~~Lecture12~~.ppt|~~grid~~]] ~~ ~~|| ~~May 26 ~~||~~ ~~

|| ~~14th~~ ||~~Geometry~~ Problems ~~ ~~|| [[(Attach:)~~Lecture13~~.ppt|~~ geometry~~]] ~~|| June 2~~ ||

~~|| 15th ~~||~~Computational Geometry~~ || ~~ [[(Attach:)Lecture14.ppt~~|~~computational geo]]~~ || ~~reserved ~~||

|| 16th ||~~Final Exam ~~|| ||~~ ~~ ||

|| 6th

|| 16th

to:

||! Weeks ||! Topics ||! Slides || Lab (Wed) || Assignment ||

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture || ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture || ||

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 || ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || [[(Attach:)hw1.ppt|HW1]] ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 || ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 || ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || [[(Attach:)hw2.ppt|HW2]] ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || || ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || [[(Attach:)hw3.ppt|HW3]] ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 || ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || [[(Attach:)team.ppt|team]] ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || ||

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 || ||

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] || reserved || ||

|| 16th ||Final Exam || || || ||

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture || ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture || ||

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 || ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || [[(Attach:)hw1.ppt|HW1]] ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 || ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 || ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || [[(Attach:)hw2.ppt|HW2]] ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || || ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || [[(Attach:)hw3.ppt|HW3]] ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 || ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || [[(Attach:)team.ppt|team]] ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || ||

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 || ||

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] || reserved || ||

|| 16th ||Final Exam || || || ||

Changed line 2 from:

||! Weeks ||! Topics ||! Slides || Lab (Wed) || ~~||~~

to:

||! Weeks ||! Topics ||! Slides || Lab (Wed) ||

Changed lines 5-15 from:

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 || ||

~~||~~ 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || ||

~~||~~ 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 || ||

~~||~~ 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 || ||

~~||~~ 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || ||

~~||~~ 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || || ||

~~||~~ 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || ||

~~||~~ 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || ||

~~||~~ 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 || ||

~~||~~ 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || ||

~~||~~ 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || ~~||~~

to:

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 ||

Changed lines 17-19 from:

to:

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] || reserved ||

|| 16th ||Final Exam || || ||

|| 16th ||Final Exam || || ||

Changed lines 3-4 from:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture || ||

~~||~~ 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture || ~~||~~

to:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture ||

Changed line 2 from:

||! Weeks ||! Topics ||! Slides || Lab (Wed) ||

to:

||! Weeks ||! Topics ||! Slides || Lab (Wed) || ||

Changed line 10 from:

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || ||

to:

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || || ||

Changed lines 3-15 from:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture ||

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 ||

to:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture || ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture || ||

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 || ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 || ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 || ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 || ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || ||

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture || ||

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 || ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 || ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 || ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 || ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 || ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] || ||

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 || ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday || ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 || ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 || ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 || ||

Changed line 17 from:

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] ~~ ~~||~~ reserved~~ ||

to:

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] || reserved || ||

Changed line 18 from:

|| 16th ||Final Exam || || ||

to:

|| 16th ||Final Exam || || || ||

Changed lines 5-9 from:

|| 3rd ||~~C Review II ~~|| |~~| Mar 17~~ ||

|| 4th||~~Programming & Running~~|| [[(Attach:)~~Lecture3~~.ppt|~~Programming~~]] || Mar 24 ||

|| 5th ||~~Programming & Runnung~~|| |~~| Mar 31~~ ||

~~|| 6th~~ ||~~Problem Solving ~~|| [[(Attach:)~~Lecture4~~.ppt| ~~psolving~~]] || April 7 ||

|| 7th ||~~Problem Solving II ~~|| || April 14 ||

|| 4th

|| 5th ||

|| 7th ||

to:

|| 3rd ||String Problems || [[(Attach:)Lecture3.ppt|string]] || Mar 17 ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 ||

|| 4th ||Sorting Problems|| [[(Attach:)Lecture4.ppt|sorting]] || Mar 24 ||

|| 5th ||Arithmetic Problems|| [[(Attach:)Lecture5.ppt|arithmetics]] || Mar 31 ||

|| 6th ||Combinatorics || [[(Attach:)Lecture6.ppt| combinatorics]] || April 7 ||

|| 7th ||Number Theory || [[(Attach:)Lecture7.ppt|number theory]] || April 14 ||

Changed lines 11-17 from:

|| 9th ||~~Useful Structures ~~|| [[(Attach:)~~Lecture5~~.ppt| ~~structure~~]] || April 28 ||

|| 10th ||~~Useful Structure II ~~|| |~~| holiday~~ ||

~~|| 11th~~ ||~~Problem Solcing with Structres ~~||~~ ~~[[(Attach:)~~Lecture6~~.ppt| ~~Cache 2~~]] || May 12 ||

|| 12th ||~~Problem Solving with Structure II ~~|~~|~~ ~~|| May 19 ~~||

~~|| 13th ~~||~~Reserved ~~|| |~~| May 26 ||~~

|| 14th ||Data Processing || ~~[[(Attach:)Lecture7.ppt| data]] ~~|| ~~June 2 ~~||

|| 15th ||~~Data Processing II~~ || ~~ ~~ || ~~Lecture~~ ||

|| 10th ||

|| 12th ||

|| 14th ||Data Processing

|| 15th

to:

|| 9th ||Backtracking || [[(Attach:)Lecture8.ppt| backtracking]] || April 28 ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 ||

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] || reserved ||

|| 10th ||Graph Traversal || [[(Attach:)Lecture9.ppt|graph traversal]] || holiday ||

|| 11th ||Graph Algorithms || [[(Attach:)Lecture10.ppt| graph algorithms]] || May 12 ||

|| 12th ||Dynamic Programming || [[(Attach:)Lecture11.ppt|dynamic]] || May 19 ||

|| 13th ||Grid Problems || [[(Attach:)Lecture12.ppt|grid]] || May 26 ||

|| 14th ||Geometry Problems || [[(Attach:)Lecture13.ppt| geometry]] || June 2 ||

|| 15th ||Computational Geometry || [[(Attach:)Lecture14.ppt|computational geo]] || reserved ||

Changed line 4 from:

|| 2nd ||~~C Review~~|| [[(Attach:)Lecture2.ppt|~~C Review~~]] || Lecture ||

to:

|| 2nd ||Data Structures|| [[(Attach:)Lecture2.ppt|Data Structure]] || Lecture ||

Changed lines 3-4 from:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || ~~no lab ~~||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] ||~~no lab~~ ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] ||

to:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || Lecture ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] || Lecture ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] || Lecture ||

Changed line 12 from:

|| 10th ||Useful Structure II || || ~~no lab.~~ ||

to:

|| 10th ||Useful Structure II || || holiday ||

Changed line 17 from:

|| 15th ||Data Processing II || || ~~no lab~~ ||

to:

|| 15th ||Data Processing II || || Lecture ||

Changed lines 11-18 from:

|| 9th ||~~ ~~Useful Structures || [[(Attach:)Lecture5.ppt| structure]] || April 28 ||

|| 10th ||~~ ~~Useful Structure II || || no lab. ||

|| 11th ||~~ ~~Problem Solcing with Structres || [[(Attach:)Lecture6.ppt| Cache 2]] || May 12 ||

|| 12th ||~~ ~~Problem Solving with Structure II || || May 19 ||

|| 13th ||~~ ~~Reserved|| || May 26 ||

|| 14th ||~~ ~~Data Processing || [[(Attach:)Lecture7.ppt| data]] || June 2 ||

|| 15th ||~~ ~~Data Processing II || || no lab ||

|| 16th ||~~[~~Final Exam~~]~~ || || ||

|| 10th ||

|| 11th ||

|| 12th ||

|| 13th ||

|| 14th ||

|| 15th ||

|| 16th ||

to:

|| 9th ||Useful Structures || [[(Attach:)Lecture5.ppt| structure]] || April 28 ||

|| 10th ||Useful Structure II || || no lab. ||

|| 11th ||Problem Solcing with Structres || [[(Attach:)Lecture6.ppt| Cache 2]] || May 12 ||

|| 12th ||Problem Solving with Structure II || || May 19 ||

|| 13th ||Reserved || || May 26 ||

|| 14th ||Data Processing || [[(Attach:)Lecture7.ppt| data]] || June 2 ||

|| 15th ||Data Processing II || || no lab ||

|| 16th ||Final Exam || || ||

|| 10th ||Useful Structure II || || no lab. ||

|| 11th ||Problem Solcing with Structres || [[(Attach:)Lecture6.ppt| Cache 2]] || May 12 ||

|| 12th ||Problem Solving with Structure II || || May 19 ||

|| 13th ||Reserved || || May 26 ||

|| 14th ||Data Processing || [[(Attach:)Lecture7.ppt| data]] || June 2 ||

|| 15th ||Data Processing II || || no lab ||

|| 16th ||Final Exam || || ||

Changed line 18 from:

|| 16th ||[Final Exam] || ||

to:

|| 16th ||[Final Exam] || || ||

Changed line 17 from:

|| 15th || Data Processing II || || ~~June 9~~ ||

to:

|| 15th || Data Processing II || || no lab ||

Changed lines 3-5 from:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] ||

~~|| 2nd~~ ||~~C Review~~|| ~~[[(Attach:)Lecture2.ppt|C Review]] ~~||

|| ~~3rd~~ ||~~C Review II ~~|| ||~~ Mar 17~~ ||

to:

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] || no lab ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] || no lab ||

|| 3rd ||C Review II || || Mar 17 ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] || no lab ||

|| 3rd ||C Review II || || Mar 17 ||

Changed lines 2-3 from:

||! Weeks ||! Topics ||! Slides || Lab ||

|| 1st ||Overview & Introduction || [[(Attach:)Lecture1.ppt|Intro]] ||

|| 1st ||Overview & Introduction || [[(Attach:)Lecture1.ppt|Intro]] ||

to:

||! Weeks ||! Topics ||! Slides || Lab (Wed) ||

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] ||

|| 1st ||Overview & Introduction (March 3) || [[(Attach:)Lecture1.ppt|Intro]] ||

Changed lines 5-9 from:

|| 3rd ||C Review II || ~~Lab~~ ||

~~|| 4th~~ ||~~Programming & Running~~|| [[(Attach:)Lecture3.ppt|Programming]] || ~~Lab ~~||

|| 5th ||~~Processor - datapath and control ~~|| ~~[[(Attach:)05-Processor1.ppt|Processor 1]] ~~||

|| 6th ||~~Processor - multicycle implementation ~~|| [[(Attach:)~~06-Processor2~~.ppt| ~~Processor 2~~]] ~~ ~~ ||

|| 7th ||~~Pipelining - data hazard ~~|| ~~[[(Attach:)07-pipeline1.ppt| Pipeline 1]] ~~ ||

|| 5th ||

|| 6th ||

|| 7th ||

to:

|| 3rd ||C Review II || || Mar 17 ||

|| 4th ||Programming & Running|| [[(Attach:)Lecture3.ppt|Programming]] || Mar 24 ||

|| 5th ||Programming & Runnung|| || Mar 31 ||

|| 6th ||Problem Solving || [[(Attach:)Lecture4.ppt| psolving]] || April 7 ||

|| 7th ||Problem Solving II || || April 14 ||

|| 4th ||Programming & Running|| [[(Attach:)Lecture3.ppt|Programming]] || Mar 24 ||

|| 5th ||Programming & Runnung|| || Mar 31 ||

|| 6th ||Problem Solving || [[(Attach:)Lecture4.ppt| psolving]] || April 7 ||

|| 7th ||Problem Solving II || || April 14 ||

Changed lines 11-17 from:

|| 9th ||~~Pipelining - control hazard ~~|| [[(Attach:)~~08-Pipeline2~~.ppt| ~~Pipeline 2~~]] ~~ ~~||

|| 10th ||~~Cache Basics || [[(Attach:)09-Cache1.ppt| Cache 1]]~~ ~~ ~~||

|| 11th ||~~Cache Optimizations || ~~[[(Attach:)~~10-Cache2~~.ppt| Cache 2]] ~~ ~~||

|| 12th ||~~Virtual Memory || [[(Attach:)11-VIrtual-Memory.ppt| Virtual Memory]]~~ ~~ ~~||

|| 13th ||~~DRAM ~~|| ~~[[(Attach:)12-DRAM.ppt| DRAM]]~~ ~~ ~~||

|| 14th ||~~Storage & I/O~~ ~~ ~~|| [[(Attach:)~~12-Storage~~.ppt| ~~Storage~~]] ~~ ~~ ~~ ~~||

~~|| 15th~~ ||~~Multiprocessors || [[(Attach:)13-Multicore.ppt| Multiprocessors]] ~~ ||

|| 10th ||

|| 11th ||

|| 12th ||

|| 13th ||

|| 14th ||

to:

|| 9th || Useful Structures || [[(Attach:)Lecture5.ppt| structure]] || April 28 ||

|| 10th || Useful Structure II || || no lab. ||

|| 11th || Problem Solcing with Structres || [[(Attach:)Lecture6.ppt| Cache 2]] || May 12 ||

|| 12th || Problem Solving with Structure II || || May 19 ||

|| 13th || Reserved|| || May 26 ||

|| 14th || Data Processing || [[(Attach:)Lecture7.ppt| data]] || June 2 ||

|| 15th || Data Processing II || || June 9 ||

|| 10th || Useful Structure II || || no lab. ||

|| 11th || Problem Solcing with Structres || [[(Attach:)Lecture6.ppt| Cache 2]] || May 12 ||

|| 12th || Problem Solving with Structure II || || May 19 ||

|| 13th || Reserved|| || May 26 ||

|| 14th || Data Processing || [[(Attach:)Lecture7.ppt| data]] || June 2 ||

|| 15th || Data Processing II || || June 9 ||

Added lines 1-18:

|| border=1 cellpadding=2 cellspacing=0 width=100%

||! Weeks ||! Topics ||! Slides || Lab ||

|| 1st ||Overview & Introduction || [[(Attach:)Lecture1.ppt|Intro]] ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] ||

|| 3rd ||C Review II || Lab ||

|| 4th ||Programming & Running|| [[(Attach:)Lecture3.ppt|Programming]] || Lab ||

|| 5th ||Processor - datapath and control || [[(Attach:)05-Processor1.ppt|Processor 1]] ||

|| 6th ||Processor - multicycle implementation || [[(Attach:)06-Processor2.ppt| Processor 2]] ||

|| 7th ||Pipelining - data hazard || [[(Attach:)07-pipeline1.ppt| Pipeline 1]] ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] ||

|| 9th ||Pipelining - control hazard || [[(Attach:)08-Pipeline2.ppt| Pipeline 2]] ||

|| 10th ||Cache Basics || [[(Attach:)09-Cache1.ppt| Cache 1]] ||

|| 11th ||Cache Optimizations || [[(Attach:)10-Cache2.ppt| Cache 2]] ||

|| 12th ||Virtual Memory || [[(Attach:)11-VIrtual-Memory.ppt| Virtual Memory]] ||

|| 13th ||DRAM || [[(Attach:)12-DRAM.ppt| DRAM]] ||

|| 14th ||Storage & I/O || [[(Attach:)12-Storage.ppt| Storage]] ||

|| 15th ||Multiprocessors || [[(Attach:)13-Multicore.ppt| Multiprocessors]] ||

|| 16th ||[Final Exam] || ||

||! Weeks ||! Topics ||! Slides || Lab ||

|| 1st ||Overview & Introduction || [[(Attach:)Lecture1.ppt|Intro]] ||

|| 2nd ||C Review|| [[(Attach:)Lecture2.ppt|C Review]] ||

|| 3rd ||C Review II || Lab ||

|| 4th ||Programming & Running|| [[(Attach:)Lecture3.ppt|Programming]] || Lab ||

|| 5th ||Processor - datapath and control || [[(Attach:)05-Processor1.ppt|Processor 1]] ||

|| 6th ||Processor - multicycle implementation || [[(Attach:)06-Processor2.ppt| Processor 2]] ||

|| 7th ||Pipelining - data hazard || [[(Attach:)07-pipeline1.ppt| Pipeline 1]] ||

|| 8th ||[Midterm Exam] || [[(Attach:)Midterm.ppt| Solution]] ||

|| 9th ||Pipelining - control hazard || [[(Attach:)08-Pipeline2.ppt| Pipeline 2]] ||

|| 10th ||Cache Basics || [[(Attach:)09-Cache1.ppt| Cache 1]] ||

|| 11th ||Cache Optimizations || [[(Attach:)10-Cache2.ppt| Cache 2]] ||

|| 12th ||Virtual Memory || [[(Attach:)11-VIrtual-Memory.ppt| Virtual Memory]] ||

|| 13th ||DRAM || [[(Attach:)12-DRAM.ppt| DRAM]] ||

|| 14th ||Storage & I/O || [[(Attach:)12-Storage.ppt| Storage]] ||

|| 15th ||Multiprocessors || [[(Attach:)13-Multicore.ppt| Multiprocessors]] ||

|| 16th ||[Final Exam] || ||