PPT-CSE 373 : Data Structure & Algorithms

Comparison Sorting Riley Porter Winter 2017 CSE373 Data Structures amp Algorithms 1 Course Logistics HW4 preliminary scripts out HW5 out more graphs Last main course topic this week Sorting. : Data Structures & Algorithms. Spanning Trees and Minimum . Spanning Trees. Riley Porter. Winte. r 2017. CSE373: Data Structures & Algorithms. 1. Course Logistics. HW4 due tonight. HW5 out . CSE 373 SP 18 - Kasey Champion. 1. Warm Up. public int sum1(int n, int m, int[][] table) {. int output = 0;. for (int . i. = 0; . i. < n; . i. ) {. for (int j = 0; j < m; . j . Lecture 7: Solving Recurrences CSE 373: Data Structures and Algorithms CSE 373 19 sp - Kasey Champion 1 Thought Experiment Discuss with your neighbors: Imagine you are writing an implementation of the List interface that stores integers in an Array. What are some ways you can assess your program’s correctness in the following cases: Lecture 24: Final Review CSE 373 – Data Structures and Algorithms CSE 373 19Su - Robbie Weber 1 Administrivia Please fill out: Course evaluations (for both section and lecture) so the TAs and I can improve Lecture 8: Tree Method CSE 373: Data Structures and Algorithms CSE 373 19 SP - Kasey Champion 1 Warm Up – Writing Recurrence Write a recurrence for the following piece of code: public void mystery2( CSE 373: Data Structures and Algorithms. Thanks to Kasey Champion, Ben Jones, Adam Blank, Michael Lee, Evan McCarty, Robbie Weber, Whitaker Brand, Zora Fung, Stuart . Reges. , Justin Hsia, Ruth Anderson, and many others for sample slides and materials .... CSE 373: Data Structures and Algorithms. CSE 373 Su 19 - Robbie Weber. 1. Administriva. Midterm solutions are on the exams section of the webpage.. Project 3 is due today. Proejct. 4 (the last project) out soon (probably sometime tomorrow). CSE 373: Data Structures and Algorithms. CSE 373 19 Wi - Kasey Champion. 1. Warm Up – Writing Recurrences. 2. CSE 373 19 Wi - Kasey Champion. Administriva. HW 2 Part 1 due Friday. - git runners will get overloaded on Friday, plan accordingly. Proof by Induction. Ezgi . Shenqi. Bran. 4/4/2016. 1. CSE 373 Spring 2016. ADTs so far . List. Stack. Queue. Adding Elements. insert. (at . any. . location. ). push. (only to. the last location,. top of the stack). CSE 373: Data Structures and Algorithms. CSE 373 19 . wi. - Kasey Champion. 1. Announcements. Asks of you. Course . evals. by Sunday. Course survey for 3 Socrative . ec. points. TA nominations. Grades. CSE 373 Data Structures and Algorithms. CSE 373 SP 18 - Kasey Champion. 1. Administrivia. Sorry no office hours this afternoon :/. Midterm review session Monday 6-8pm . Sieg. 134 (hopefully). Written HW posted later today – individual assignment. Graph . Traversals: . Dijkstra’s. Riley Porter. Winter 2017. CSE373: Data Structures & Algorithms. 1. Course Logistics. HW4 out. .  graphs!. Topic Summary on Graphs coming out by tomorrow evening. We’ll add more after we finish Graphs next week.. CSE 373 – Data Structures and Algorithms. CSE 373 19 Su - Robbie Weber. 1. Strongly Connected Components. Note: the direction of the edges matters!. CSE 373 19 Su - Robbie Weber. 2. A subgraph C such that every pair of vertices in C is connected via some path . 1. Warm Up!. 2. CSE 373 SP 20 – Chun & Champion. for (. int. . i. = 0; . i. < n; . i. ++) {. for (. int. j = 0; j < . i. ; . j++. ) {. . System.out.println. (“Hello!”);. }.