1. Introduction to Algorithms
CSE 421
Richard Anderson
February 17, 2019
CSE 421, University of Washington, Autumn 2006

2. Draw a picture of something from Beijing
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

3. CSE 421, University of Washington, Autumn 2006
Where are you from?
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

4. CSE 421, University of Washington, Autumn 2006
Classroom Presenter
February 17, 2019
CSE 421, University of Washington, Autumn 2006

5. Introduction to Algorithms
Undergraduate Algorithms Course
Algorithm Analysis
Graphs
Greedy Algorithms
Divide and Conquer
Dynamic Programming
Network Flow
NP-Completeness
February 17, 2019
CSE 421, University of Washington, Autumn 2006

6. CSE 421, University of Washington, Autumn 2006
Parallel Courses
Course offered at University of Washington
Live lectures by Prof. Anderson
Course offered at Beihang University
Lectures recorded at University of Washington
Tutored Video Instruction
Facilitators: Jie Luo, Ning Li, Jing Li
February 17, 2019
CSE 421, University of Washington, Autumn 2006

7. Tutored Video Instruction (TVI)
Developed at Stanford University in the 1970’s
On site: Stanford Master’s students
Off site: HP Engineers
Students watch pre-recorded class material with a tutor
Tutor stops the material frequently for discussion and questions
The key aspect of TVI is peer-learning
At Stanford, off site students not only out performed students who watched the videos only, but out performed the Stanford students.
February 17, 2019
CSE 421, University of Washington, Autumn 2006

8. Classroom Interaction
Student devices (Tablet PCs) used to allow students to send answers to instructors
Instructor displays the results for class discussion
Classroom Interaction will be used both at University of Washington and Beihang
But probably more often in Beihang!
February 17, 2019
CSE 421, University of Washington, Autumn 2006

9. Student Attention vs. Time
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

10. CSE 421, University of Washington, Autumn 2006
Classroom Activities
Active learning
Increase engagement
Feedback on learning
Both to student and instructor
Support for classroom instruction
Specific pedagogical goals
Discovery
Familiarity with examples
February 17, 2019
CSE 421, University of Washington, Autumn 2006

11. Making the course a success
Overcoming the language and culture barriers
Dual course offering
Materials are originating from University of Washington, but this is still a Beihang course
Tutored Video Instruction
This will require students ask questions and participate in the discussions
Classroom Interaction
Tablet PCs will support active learning
February 17, 2019
CSE 421, University of Washington, Autumn 2006

12. Do you have any questions?
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

13. CSE 421, University of Washington, Autumn 2006
Classroom Activities
Survey students’ background
Terminology and language
Activities will be drawn from a data structures course
If you are unfamiliar with the topic, just mark you submission with a “?”
February 17, 2019
CSE 421, University of Washington, Autumn 2006

14. CSE 421, University of Washington, Autumn 2006
Sorting Algorithms
List three different sorting algorithms, along with their run times
Algorithm 1:
Algorithm 2:
Algorithm 3:
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

15. CSE 421, University of Washington, Autumn 2006
Discrete Mathematics
What is the value of the sum:
What is the solution to the following recurrence:
T(n) = n + 2 T(n/2); T(1) = 1
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

16. CSE 421, University of Washington, Autumn 2006
Graph theory
Draw an undirected graph with six vertices that has
One vertex of degree one
One vertex of degree two
Three vertices of degree three
One vertex of degree four
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

17. CSE 421, University of Washington, Autumn 2006
Graph Theory
Draw an undirected graph on five vertices where every vertex has degree three
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

18. Find a minimum spanning tree2 5 6 4 2 1 3 2 2 3 3 1 2 3 4
Value: 2
Student Submission
February 17, 2019
CSE 421, University of Washington, Autumn 2006

19. CSE 421, University of Washington, Autumn 2006
Course Text Book
Algorithm Design, Kleinberg, Tardos
Chinese Edition (68 Yuan) / US Edition ($94.00)
Course information
Richard Anderson
Acknowledgements
Professors Li, Ma, and Han
Microsoft Research Asia
February 17, 2019
CSE 421, University of Washington, Autumn 2006