Introduction to Algorithms CSE 421 Richard Anderson 122022

Introduction to Algorithms CSE 421 Richard Anderson 1/2/2022 CSE 421, University of Washington, Autumn 2006 1

Draw a picture of something from Beijing 1/2/2022 CSE 421, University of Washington, Autumn 2006 Student 2 Submission

Where are you from? 1/2/2022 CSE 421, University of Washington, Autumn 2006 Student 3 Submission

Classroom Presenter 1/2/2022 CSE 421, University of Washington, Autumn 2006 4

Introduction to Algorithms • Undergraduate Algorithms Course – Algorithm Analysis – Graphs – Greedy Algorithms – Divide and Conquer – Dynamic Programming – Network Flow – NP-Completeness 1/2/2022 CSE 421, University of Washington, Autumn 2006 5

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 1/2/2022 CSE 421, University of Washington, Autumn 2006 6

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. 1/2/2022 CSE 421, University of Washington, Autumn 2006 7

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! 1/2/2022 CSE 421, University of Washington, Autumn 2006 8

Student Attention vs. Time Attention 10 1/2/2022 20 30 40 50 CSE 421, University of Washington, Autumn 2006 60 Time Student 9 Submission

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 1/2/2022 CSE 421, University of Washington, Autumn 2006 10

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 1/2/2022 CSE 421, University of Washington, Autumn 2006 11

Do you have any questions? 1/2/2022 CSE 421, University of Washington, Autumn 2006 Student 12 Submission

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 “? ” 1/2/2022 CSE 421, University of Washington, Autumn 2006 13

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

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

Graph theory • Draw an undirected graph with six vertices that has – – 1/2/2022 One vertex of degree one One vertex of degree two Three vertices of degree three One vertex of degree four CSE 421, University of Washington, Autumn 2006 Student 16 Submission

Graph Theory • Draw an undirected graph on five vertices where every vertex has degree three 1/2/2022 CSE 421, University of Washington, Autumn 2006 Student 17 Submission

Find a minimum spanning tree 2 5 4 6 2 1 3 2 2 1 3 3 2 3 4 2 1/2/2022 CSE 421, University of Washington, Autumn 2006 Value: Student 18 Submission

CSE 421 • Course Text Book – Algorithm Design, Kleinberg, Tardos – Chinese Edition (68 Yuan) / US Edition ($94. 00) • Course information www. cs. washington. edu/education/courses/cse 421/06 au/ • Richard Anderson – anderson@cs. washington. edu • Acknowledgements – Professors Li, Ma, and Han – Microsoft Research Asia 1/2/2022 CSE 421, University of Washington, Autumn 2006 19