PPT-CSE 373 Optional Section

Disjoint Sets amp Homework 4 February 13 2014 Nicholas Shahan amp A Conrad Nied Agenda Disjoint Sets Review Homework 4 Examples Disjoint Sets Review OUTBREAK trailer Interactive Example. Packet#1. What is meant by “Mountain Meteorology”?. http://www.ils.unc.edu/parkproject/webcam/webcam.html. ATMS 373- Mountain Meteorology. Outline. Introduction. Topics. Literature search. http://www.ils.unc.edu/parkproject/webcam/webcam.html. 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. 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). 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. 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 19 . wi. - Kasey Champion. 1. Warm Up. Read through the code on the worksheet given. Come up with a test case for each of the described test categories . Data Structures and Algorithms. CSE 373 SP 18 - Kasey Champion. 1. Warm Up. Construct a mathematical function modeling the worst-case runtime of the following method. Your function should be written in terms of n, the provided input.. 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 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 . 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; . CSE 373: Data Structures and Algorithms. CSE 373 21 . sp. - Kasey Champion. 1. Administriva. EX4 due tonight, late turn in until Monday night. Final exam goes out late tonight on . Gradescope. Group assignment. 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.