PPT-Cse 373 April 3 rd – Algorithm Analysis

Assorted minutiae HW1P1 due tonight at midnight HW1P2 due Friday at midnight HW2 out tonight Second Java review session Friday 1030 ARC 147 Todays Schedu le Algorithm Analysis cont. Rao CSE 326 CSE 326 Lecture 7 More on Search Trees Todays Topics Lazy Operations Run Time Analysis of Binary Search Tree Operations Balanced Search Trees AVL Trees and Rotations Covered in Chapter 4 of the text R CSE 2331/5331. Topic 10:. Basic Graph Alg.. . Representations . Basic traversal algorithms. . Topological . sort. . CSE 2331/5331. What Is A Graph. Graph G = (V, E). V: set of nodes. E: set of edges. 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: Midterm Review Data Structures and Algorithms CSE 373 SP 18 - Kasey Champion 1 Warm Up Imagine you are asked to test a method in a class that implements a Binary Search Tree. This method should be able to take in any node and then return back the height of the given tree. 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( Lecture 17: . Topological Sort / Graph Traversals. Linda Shapiro. Winter 2015. Announcements . We are all caught up on grading.. HW05 is due Monday March 2.. Graphs this week.. HW06 will cover B+-Trees and Graphs. It will be mostly paper and pencil with one problem requiring a little programming.. 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). Data Structures and Algorithms. CSE 373 19 SP - Kasey Champion. 1. Administrivia. We clarified Exercise 5 Problem [] to explicitly mention “worst-case”. CSE 373 SP 18 - Kasey Champion. 2. Administrivia. 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. Data Structures and Algorithms. CSE 373 19 . Sp. - Kasey Champion. 1. Administrivia. HW 7 Due Friday. Final exam review Wednesday 6/5 4-5:50. Final exam next Tuesday!. Double check all grades . Please fill out survey. 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 19 . Sp. - Kasey Champion. 1. Warm Up - Code Modeling. public static . boolean. . isPrime. (. int. n) {. for (. int. . i. = 2; . i. < n; . Winter 2017. 1. Presentations on Monday. 2:30-4:20pm, Monday 3/13. No . more than 5 slides (including title slide. ). Time limit to be announced. Both partners should speak. Slides are due BY NOON (12pm) on Mon 3/13 to catalyst.