## SWE2004S15.Schedule History

Hide minor edits - Show changes to output

Changed line 17 from:

* Week 11: Graph Algorithms [[(Attach:)Lecture10.~~pdf~~|~~pdf~~]]

to:

* Week 11: Graph Algorithms [[(Attach:)Lecture10.ppt|ppt]]

Changed line 11 from:

* Week 5: Arithmetic Problems [[(Attach:)Lecture5.~~pdf~~|~~pdf~~]]

to:

* Week 5: Arithmetic Problems [[(Attach:)Lecture5.ppt|ppt]]

Added lines 1-26:

!! SWE2004-41: Principles in Programming (Spring 2015)

!!! [Schedule]

''The following schedule is tentative and subject to change without notice.''

(:cell valign=top :)

* Week 1: Overview & Introduction - [[(Attach:)Lecture1.pdf|pdf]]

* Week 2: Data Structures - [[(Attach:)Lecture2.pdf|pdf]]

* Week 3: String Problems [[(Attach:)string.pdf|pdf]]

* Week 4: Sorting Problems [[(Attach:)Lecture4.pdf|pdf]]

* Week 5: Arithmetic Problems [[(Attach:)Lecture5.pdf|pdf]]

* Week 6: Combinatorics [[(Attach:)Lecture6.pdf|pdf]]

* Week 7: Number Theory [[(Attach:)Lecture7.pdf|pdf]]

* Week 8: Midterm Exam

* Week 9: Backtracking [[(Attach:)Lecture8.pdf|pdf]]

* Week 10: Graph Traversal [[(Attach:)Lecture9.pdf|pdf]]

* Week 11: Graph Algorithms [[(Attach:)Lecture10.pdf|pdf]]

* Week 12: Dynamic Programming [[(Attach:)Lecture11.pdf|pdf]]

* Week 13: Grid Problems [[(Attach:)Lecture12.pdf|pdf]]

* Week 14: Geometry Problems [[(Attach:)Lecture13.pdf|pdf]]

* Week 15: Computational Geometry

* Week 16: Final Exam

(:tableend:)

[[<<]]\\

%rframe%''Credit: Most of slides for this lecture are based on slides created by textbook authors, Prof. Steven Skiena at SUNY. (see [[http://www.cs.sunysb.edu/~skiena]])''

!!! [Schedule]

''The following schedule is tentative and subject to change without notice.''

(:cell valign=top :)

* Week 1: Overview & Introduction - [[(Attach:)Lecture1.pdf|pdf]]

* Week 2: Data Structures - [[(Attach:)Lecture2.pdf|pdf]]

* Week 3: String Problems [[(Attach:)string.pdf|pdf]]

* Week 4: Sorting Problems [[(Attach:)Lecture4.pdf|pdf]]

* Week 5: Arithmetic Problems [[(Attach:)Lecture5.pdf|pdf]]

* Week 6: Combinatorics [[(Attach:)Lecture6.pdf|pdf]]

* Week 7: Number Theory [[(Attach:)Lecture7.pdf|pdf]]

* Week 8: Midterm Exam

* Week 9: Backtracking [[(Attach:)Lecture8.pdf|pdf]]

* Week 10: Graph Traversal [[(Attach:)Lecture9.pdf|pdf]]

* Week 11: Graph Algorithms [[(Attach:)Lecture10.pdf|pdf]]

* Week 12: Dynamic Programming [[(Attach:)Lecture11.pdf|pdf]]

* Week 13: Grid Problems [[(Attach:)Lecture12.pdf|pdf]]

* Week 14: Geometry Problems [[(Attach:)Lecture13.pdf|pdf]]

* Week 15: Computational Geometry

* Week 16: Final Exam

(:tableend:)

[[<<]]\\

%rframe%''Credit: Most of slides for this lecture are based on slides created by textbook authors, Prof. Steven Skiena at SUNY. (see [[http://www.cs.sunysb.edu/~skiena]])''