Lecture 26. Sequence Algorithms (Continued)
|
|
|
- Edward Ball
- 5 years ago
- Views:
Transcription
1 Lecture 26 Sequence Algorithms (Continued)
2 Announcements for This Lecture Lab/Finals Lab 12 is the final lab Can use Consulting hours Due next Wednesday 9:30 Final: Dec 10 th 2:00-4:30pm Study guide is posted Announce reviews next week. Conflict with Final time? Submit to conflict to CMS by next TUESDAY! Assignments A6 is now graded Mean: 91.5 Median: 95 Std Dev: 12.9 Mean: 11 hr Median: 10 hr Std Dev: 5.7 hr SEVERAL AI hearings A7 is due Tuesday Dec. 4 Due at midnight Some extensions possible 11/27/18 Sequences (Continued) 2
3 Recall: Horizontal Notation 0 k len(b) b <= sorted >= Example of an assertion about an sequence b. It asserts that: 1. b[0..k 1] is sorted (i.e. its values are in ascending order) 2. Everything in b[0..k 1] is everything in b[k..len(b) 1] b 0 h k Given index h of the first element of a segment and index k of the element that follows that segment, the number of values in the segment is k h. b[h.. k 1] has k h elements in it. h h+1 (h+1) h = 1 11/27/18 Sequences (Continued) 3
4 Partition Algorithm Given a sequence b[h..k] with some value x in b[h]: h k pre: b x? Swap elements of b[h..k] and store in j to truthify post: h i i+1 k post: b <= x x >= x inv: b h i j k <= x x? >= x Agrees with precondition when i = h, j = k+1 Agrees with postcondition when j = i+1 11/27/18 Sequences (Continued) 4
![.k] >= x while i < j-1: if b[i+1] >= x: # Move to end of block.](/docs-images/95/125508957/images/5-2.jpg "swap(b,i+1,j-1) j = j - 1 else: # b[i+1] < x swap(b,i,i+1) i = i + 1 # post: b[h..i-1] < x, b[i] is x, and b[i+1.")
5 Partition Algorithm Implementation def partition(b, h, k): """Partition list b[h..k] around a pivot x = b[h]""" i = h; j = k+1; x = b[h] # invariant: b[h..i-1] < x, b[i] = x, b[j..k] >= x while i < j-1: if b[i+1] >= x: # Move to end of block. swap(b,i+1,j-1) j = j - 1 else: # b[i+1] < x swap(b,i,i+1) i = i + 1 # post: b[h..i-1] < x, b[i] is x, and b[i+1..k] >= x return i partition(b,h,k), not partition(b[h:k+1]) Remember, slicing always copies the list! We want to partition the original list 11/27/18 Sequences (Continued) 5
6 Partition Algorithm Implementation def partition(b, h, k): """Partition list b[h..k] around a pivot x = b[h]""" i = h; j = k+1; x = b[h] # invariant: b[h..i-1] < x, b[i] = x, b[j..k] >= x while i < j-1: if b[i+1] >= x: # Move to end of block. swap(b,i+1,j-1) j = j - 1 else: # b[i+1] < x swap(b,i,i+1) i = i + 1 # post: b[h..i-1] < x, b[i] is x, and b[i+1..k] >= x return i <= x x? >= x h i i+1 j k /27/18 Sequences (Continued) 6
7 Partition Algorithm Implementation def partition(b, h, k): """Partition list b[h..k] around a pivot x = b[h]""" i = h; j = k+1; x = b[h] # invariant: b[h..i-1] < x, b[i] = x, b[j..k] >= x while i < j-1: if b[i+1] >= x: # Move to end of block. swap(b,i+1,j-1) j = j - 1 else: # b[i+1] < x swap(b,i,i+1) i = i + 1 # post: b[h..i-1] < x, b[i] is x, and b[i+1..k] >= x return i <= x x? >= x h i i+1 j k h i i+1 j k /27/18 Sequences (Continued) 7
8 Partition Algorithm Implementation def partition(b, h, k): """Partition list b[h..k] around a pivot x = b[h]""" i = h; j = k+1; x = b[h] # invariant: b[h..i-1] < x, b[i] = x, b[j..k] >= x while i < j-1: if b[i+1] >= x: # Move to end of block. swap(b,i+1,j-1) j = j - 1 else: # b[i+1] < x swap(b,i,i+1) i = i + 1 # post: b[h..i-1] < x, b[i] is x, and b[i+1..k] >= x return i <= x x? >= x h i i+1 j k h i i+1 j k h i j k /27/18 Sequences (Continued) 8
9 Partition Algorithm Implementation def partition(b, h, k): """Partition list b[h..k] around a pivot x = b[h]""" i = h; j = k+1; x = b[h] # invariant: b[h..i-1] < x, b[i] = x, b[j..k] >= x while i < j-1: if b[i+1] >= x: # Move to end of block. swap(b,i+1,j-1) j = j - 1 else: # b[i+1] < x swap(b,i,i+1) i = i + 1 # post: b[h..i-1] < x, b[i] is x, and b[i+1..k] >= x return i <= x x? >= x h i i+1 j k h i i+1 j k h i j k h i j k /27/18 Sequences (Continued) 9
10 Dutch National Flag Variant Sequence of integer values red = negatives, white = 0, blues = positive Only rearrange part of the list, not all pre: b post: b h h? < 0 = 0 > 0 k k h t i j k inv: b < 0? = 0 > 0 11/27/18 Sequences (Continued) 10
11 Dutch National Flag Variant Sequence of integer values red = negatives, white = 0, blues = positive Only rearrange part of the list, not all pre: b h? k post: b h < 0 = 0 > 0 h t i j k inv: b < 0? = 0 > 0 k pre: t = h, i = k+1, j = k post: t = i 11/27/18 Sequences (Continued) 11
12 Dutch National Flag Algorithm def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = k+1, j = k; # inv: b[h..t-1] < 0, b[t..i-1]?, b[i..j] = 0, b[j+1..k] > 0 while t < i: if b[i-1] < 0: swap(b,i-1,t) t = t+1 elif b[i-1] == 0: else: i = i-1 swap(b,i-1,j) i = i-1; j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) < 0? = 0 > 0 h t i j k /27/18 Sequences (Continued) 12
13 Dutch National Flag Algorithm def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = k+1, j = k; # inv: b[h..t-1] < 0, b[t..i-1]?, b[i..j] = 0, b[j+1..k] > 0 while t < i: if b[i-1] < 0: swap(b,i-1,t) t = t+1 elif b[i-1] == 0: else: i = i-1 swap(b,i-1,j) i = i-1; j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) < 0? = 0 > 0 h t i j k h t i j k /27/18 Sequences (Continued) 13
14 Dutch National Flag Algorithm def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = k+1, j = k; # inv: b[h..t-1] < 0, b[t..i-1]?, b[i..j] = 0, b[j+1..k] > 0 while t < i: if b[i-1] < 0: swap(b,i-1,t) t = t+1 elif b[i-1] == 0: else: i = i-1 swap(b,i-1,j) i = i-1; j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) < 0? = 0 > 0 h t i j k h t i j k h t i j k /27/18 Sequences (Continued) 14
15 Dutch National Flag Algorithm def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = k+1, j = k; # inv: b[h..t-1] < 0, b[t..i-1]?, b[i..j] = 0, b[j+1..k] > 0 while t < i: if b[i-1] < 0: swap(b,i-1,t) t = t+1 elif b[i-1] == 0: else: i = i-1 swap(b,i-1,j) i = i-1; j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) < 0? = 0 > 0 h t i j k h t i j k h t i j k h t j k /27/18 Sequences (Continued) 15
16 Changing the Invariant Different invariants = different code Need to change how we initialize, stop Also need to change the body of the loop pre: b post: b h h? < 0 = 0 > 0 k k h t i j k inv: b < 0 = 0? > 0 11/27/18 Sequences (Continued) 16
17 Changing the Invariant Different invariants = different code Need to change how we initialize, stop Also need to change the body of the loop pre: b h? k post: b h < 0 = 0 > 0 h i t j k inv: b < 0 = 0? > 0 k pre: t = h, i = h, j = k post: t = j+1 11/27/18 Sequences (Continued) 17
18 Changing the Invariant def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = h, j = k; # inv: b[h..t-1] < 0, b[i..t-1] = 0, b[t..j]?, b[j+1..k] > 0 while t < j+1: if b[???] < 0:??? < 0 = 0? > 0 h i t j k elif b[???] == 0:??? else:??? # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) 11/27/18 Sequences (Continued) 18
19 Changing the Invariant def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = h, j = k; # inv: b[h..t-1] < 0, b[i..t-1] = 0, b[t..j]?, b[j+1..k] > 0 while t < j+1: if b[t] < 0:??? < 0 = 0? > 0 h i t j k elif b[t] == 0:??? else:??? # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) 11/27/18 Sequences (Continued) 19
20 Changing the Invariant def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = h, j = k; # inv: b[h..t-1] < 0, b[i..t-1] = 0, b[t..j]?, b[j+1..k] > 0 while t < j+1: if b[t] < 0:??? < 0 = 0? > 0 h i t j k h i t j k elif b[t] == 0:??? else: swap(b,t,j) j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) 11/27/18 Sequences (Continued) 20
21 Changing the Invariant def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = h, j = k; # inv: b[h..t-1] < 0, b[i..t-1] = 0, b[t..j]?, b[j+1..k] > 0 while t < j+1: if b[t] < 0:??? elif b[t] == 0: else: t = t+1 swap(b,t,j) j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) < 0 = 0? > 0 h i t j k h i t j k h i t/j k /27/18 Sequences (Continued) 21
22 Changing the Invariant def dnf(b, h, k): """Returns: partition points as a tuple (i,j)""" t = h; i = h, j = k; # inv: b[h..t-1] < 0, b[i..t-1] = 0, b[t..j]?, b[j+1..k] > 0 while t < j+1: if b[t] < 0: swap(b,t,i) i = i+1; t = t+1; elif b[t] == 0: else: t = t+1 swap(b,t,j) j = j-1 # post: b[h..i-1] < 0, b[i..j] = 0, b[j+1..k] > 0 return (i, j) < 0 = 0? > 0 h i t j k h i t j k h i t/j k h i j t k /27/18 Sequences (Continued) 22
23 Changing the Invariant def dnf(b, h, k): """Returns: partition points""" t = h; i = h, j = k; # b[h..t-1] <, b[i..t-1] =, b[t..j]?, b[j+1..k] > while t < j+1: if b[t] < 0: swap(b,t,i) i = i+1; t = t+1; elif b[t] == 0: else: t = t+1 swap(b,t,j) j = j-1 # b[h..i-1] <, b[i..j] =, b[j+1..k] > return (i, j) VS def dnf(b, h, k): """Returns: partition points""" t = h; i = k+1, j = k; # b[h..t-1] <, b[t..i-1]?, b[i..j] =, b[j+1..k] > while t < i: if b[i-1] < 0: swap(b,i-1,t) t = t+1 elif b[i-1] == 0: else: i = i-1 swap(b,i-1,j) i = i-1; j = j-1 # b[h..i-1] <, b[i..j] =, b[j+1..k] > return (i, j) 11/27/18 Sequences (Continued) 23
24 Now we have four colors! Flag of Mauritius Negatives: red = odd, purple = even Positives: yellow = odd, green = even pre: b h? k post: b inv: b h k < 0 odd < 0 even 0 odd 0 even h r s i t k < 0, o < 0, e 0, o? 0, e 11/27/18 Sequences (Continued) 24
25 Flag of Mauritius < 0, o < 0, e 0, o? 0, e h r s i t k h r s i t k One swap is not good enough 11/27/18 Sequences (Continued) 25
26 Flag of Mauritius < 0, o < 0, e 0, o? 0, e h r s i t k h r s i t k Need two swaps for two spaces 11/27/18 Sequences (Continued) 26
27 Flag of Mauritius < 0, o < 0, e 0, o? 0, e h r s i t k h r s i t k And adjust the loop variables 11/27/18 Sequences (Continued) 27
28 Flag of Mauritius < 0, o < 0, e? 0, e h r=s i t k h r=s i t k BUT NOT ALWAYS! 11/29/18 Sorting 28
29 Flag of Mauritius < 0, o < 0, e? 0, e h r=s i t k h r=s i t k BUT NOT ALWAYS! Have to check if second swap is okay 11/29/18 Sorting 29
30 Flag of Mauritius < 0, o < 0, e 0, o? 0, e h r s i t k h r s i t k See algorithms.py for Python code 11/27/18 Sequences (Continued) 30
31 Flag of Mauritius < 0, o < 0, e 0, o? 0, e h r s i t k h r s i t k See algorithms.py for Python code h r s i t k /27/18 Sequences (Continued) 31
32 Flag of Mauritius < 0, o < 0, e 0, o? 0, e h r s i t k h r s i t k See algorithms.py for Python code h r s i t k h r s i t k /27/18 Sequences (Continued) 32
33 Extras Not Covered in Class 11/27/18 Sequences (Continued) 33
34 Loaded Dice Sequence p of length n represents n-sided die Contents of p sum to 1 p[k] is probability die rolls the number k weighted d6, favoring 5, 6 Goal: Want to roll the die Generate random number r between 0 and 1 Pick p[i] such that p[i-1] < r p[i] /27/18 Sequences (Continued) 34
35 Loaded Dice Want: Value i such that p[i-1] < r <= p[i] pre: b post: b 0 n? 0 i n r > sum r <= sum 0 i n inv: b r > sum? Same as precondition if i = 0 Postcondition is invariant + false loop condition 11/27/18 Sequences (Continued) 35
36 Loaded Dice def roll(p): """Returns: randint in 0..len(p)-1; i returned with prob. p[i] Precondition: p list of positive floats that sum to 1.""" r = random.random() # r in [0,1) # Think of interval [0,1] divided into segments of size p[i] # Store into i the segment number in which r falls. i = 0; sum_of = p[0] # inv: r >= sum of p[0].. p[i 1]; pend = sum of p[0].. p[i] while r >= sum_of: sum_of = sum_of + p[i+1] i = i + 1 # post: sum of p[0].. p[i 1] <= r < sum of p[0].. p[i] return i r < sum Analyzing the Loop 1. Does the initialization make inv true? 2. Is post true when inv is true and condition is false? 3. Does the repetend make progress? 4. Does the repetend keep inv true? 0 r is not here pend inv 1 0 r post 1 p[0] p[1] p[i] p[n 1] p[0] p[1] p[i] p[n 1]
37 Reversing a Sequence h k pre: b not reversed post: b h reversed k change: b h k h k into b h i j k inv: b swapped not reversed swapped
Lecture 25. Designing Sequence Algorithms
Lecture 25 Designing Sequence Algorithms Announcements for This Lecture Next Week Assignment 7 There is no lab next week But Tuesday hours are open Open to EVERYONE Go for help on lab or A7 But lecture
CS 1110: Introduction to Computing Using Python Sequence Algorithms
CS 1110: Introduction to Computing Using Python Lecture 22 Sequence Algorithms [Andersen, Gries, Lee, Marschner, Van Loan, White] Final Exam: Announcements May 18 th, 9am-11:30am Location: Barton Hall
CS1110. Lecture 20: Sequence algorithms. Announcements
CS1110 Lecture 20: Sequence algorithms Announcements Upcoming schedule Today (April 4) A6 out: A4 due tomorrow. Fix to memotable printing posted; see Piazza @303. Tu Apr 9: lecture on searching &sorting
Announcements for This Lecture
Lecture 26 Sorting Announcements for Tis Lecture Prelim/Finals Prelims in andbac room Gates Hall 216 Open business ours Get tem any day tis wee Final: Survey Dec still 17 up t for 2:00-4:30pm A5 Study
ASYMPTOTIC COMPLEXITY SEARCHING/SORTING
Quotes about loops O! Thou hast damnable iteration and art, indeed, able to corrupt a saint. Shakespeare, Henry IV, Pt I, 1 ii Use not vain repetition, as the heathen do. Matthew V, 48 Your if is the only
Central Algorithmic Techniques. Iterative Algorithms
Central Algorithmic Techniques Iterative Algorithms Code Representation of an Algorithm class InsertionSortAlgorithm extends SortAlgorithm { void sort(int a[]) throws Exception { for (int i = 1; i < a.length;
Foundations of Computation
The Australian National University Semester 2, 2018 Research School of Computer Science Tutorial 6 Dirk Pattinson Foundations of Computation The tutorial contains a number of exercises designed for the
CSE548, AMS542: Analysis of Algorithms, Fall 2017 Date: Oct 26. Homework #2. ( Due: Nov 8 )
CSE548, AMS542: Analysis of Algorithms, Fall 2017 Date: Oct 26 Homework #2 ( Due: Nov 8 ) Task 1. [ 80 Points ] Average Case Analysis of Median-of-3 Quicksort Consider the median-of-3 quicksort algorithm
Loop Invariants and Binary Search. Chapter 4.4, 5.1
Loop Invariants and Binary Search Chapter 4.4, 5.1 Outline Iterative Algorithms, Assertions and Proofs of Correctness Binary Search: A Case Study Outline Iterative Algorithms, Assertions and Proofs of
Recap: Prefix Sums. Given A: set of n integers Find B: prefix sums 1 / 86
Recap: Prefix Sums Given : set of n integers Find B: prefix sums : 3 1 1 7 2 5 9 2 4 3 3 B: 3 4 5 12 14 19 28 30 34 37 40 1 / 86 Recap: Parallel Prefix Sums Recursive algorithm Recursively computes sums
CS 336. We use the principle of inclusion and exclusion. Let B. = {five digit decimal numbers ending with a 5}, and
CS 336 1. The important issue is the logic you used to arrive at your answer. 2. Use extra paper to determine your solutions then neatly transcribe them onto these sheets. 3. Do not submit the scratch
Hoare Logic (I): Axiomatic Semantics and Program Correctness
Hoare Logic (I): Axiomatic Semantics and Program Correctness (Based on [Apt and Olderog 1991; Gries 1981; Hoare 1969; Kleymann 1999; Sethi 199]) Yih-Kuen Tsay Dept. of Information Management National Taiwan
Proof Calculus for Partial Correctness
Proof Calculus for Partial Correctness Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 7, 2016 Bow-Yaw Wang (Academia Sinica) Proof Calculus for Partial Correctness September
Top Down Design. Gunnar Gotshalks 03-1
Top Down Design 03-1 Top Down Description Top down is also known as step wise refinement and functional decomposition Given an operation, there are only the following three choices for refinement» Sequence
Solutions. Prelim 2[Solutions]
![Solutions. Prelim 2[Solutions]](/thumbs/93/112342343.jpg "Solutions. Prelim 2[Solutions]")
Prelim [Solutions]. Short Answer [ pts] (a) [ pts] A traversal of an expression tree produces the string + + 3. i. What kind of traversal is it? Preorder; the operator is printed before the operands. ii.
Algorithm Design and Analysis
Algorithm Design and Analysis LECTURE 6 Greedy Algorithms Interval Scheduling Interval Partitioning Scheduling to Minimize Lateness Sofya Raskhodnikova S. Raskhodnikova; based on slides by E. Demaine,
MATH 137 : Calculus 1 for Honours Mathematics. Online Assignment #2. Introduction to Sequences
1 MATH 137 : Calculus 1 for Honours Mathematics Online Assignment #2 Introduction to Sequences Due by 9:00 pm on WEDNESDAY, September 19, 2018 Instructions: Weight: 2% This assignment covers the topics
Algorithms Test 1. Question 1. (10 points) for (i = 1; i <= n; i++) { j = 1; while (j < n) {
Question 1. (10 points) for (i = 1; i
CS 591, Lecture 9 Data Analytics: Theory and Applications Boston University
CS 591, Lecture 9 Data Analytics: Theory and Applications Boston University Babis Tsourakakis February 22nd, 2017 Announcement We will cover the Monday s 2/20 lecture (President s day) by appending half
CS173 Lecture B, November 3, 2015
CS173 Lecture B, November 3, 2015 Tandy Warnow November 3, 2015 CS 173, Lecture B November 3, 2015 Tandy Warnow Announcements Examlet 7 is a take-home exam, and is due November 10, 11:05 AM, in class.
Algorithms, CSE, OSU Quicksort. Instructor: Anastasios Sidiropoulos
6331 - Algorithms, CSE, OSU Quicksort Instructor: Anastasios Sidiropoulos Sorting Given an array of integers A[1... n], rearrange its elements so that A[1] A[2]... A[n]. Quicksort Quicksort(A, p, r) if
Formal Reasoning CSE 331. Lecture 2 Formal Reasoning. Announcements. Formalization and Reasoning. Software Design and Implementation
CSE 331 Software Design and Implementation Lecture 2 Formal Reasoning Announcements Homework 0 due Friday at 5 PM Heads up: no late days for this one! Homework 1 due Wednesday at 11 PM Using program logic
May bring 1 sheet of paper with notes!! Both sides!! Printed/handwritten/whatever.. I don t really care
http://www.youtube.com/watch?v=p5_msrdg3hk This Class (Lecture 25): Death by Black Hole: Spaghettification Next Class: Compact Objects in the Solar System Night Obs due today HW9 due Monday Exam 2 next
Decision Procedures. Jochen Hoenicke. Software Engineering Albert-Ludwigs-University Freiburg. Winter Term 2016/17
Decision Procedures Jochen Hoenicke Software Engineering Albert-Ludwigs-University Freiburg Winter Term 2016/17 Jochen Hoenicke (Software Engineering) Decision Procedures Winter Term 2016/17 1 / 436 Program
University of the Virgin Islands, St. Thomas January 14, 2015 Algorithms and Programming for High Schoolers. Lecture 5
University of the Virgin Islands, St. Thomas January 14, 2015 Algorithms and Programming for High Schoolers Numerical algorithms: Lecture 5 Today we ll cover algorithms for various numerical problems:
(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
Randomized Sorting Algorithms Quick sort can be converted to a randomized algorithm by picking the pivot element randomly. In this case we can show th
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 10: September 29, 2016 Quick sort: Average Run Time In the last lecture we started analyzing the expected run time of quick sort. Let X = k 1, k 2,...,
CSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
CS483 Design and Analysis of Algorithms
CS483 Design and Analysis of Algorithms Lectures 4-5 Randomized Algorithms Instructor: Fei Li lifei@cs.gmu.edu with subject: CS483 Office hours: STII, Room 443, Friday 4:00pm - 6:00pm or by appointments
CS161: Algorithm Design and Analysis Recitation Section 3 Stanford University Week of 29 January, Problem 3-1.
CS161: Algorithm Design and Analysis Recitation Section 3 Stanford University Week of 29 January, 2018 Problem 3-1. (Quicksort Median-of-3 Partition) One way to improve the randomized quicksort procedure
CS 125 Section #12 (More) Probability and Randomized Algorithms 11/24/14. For random numbers X which only take on nonnegative integer values, E(X) =
CS 125 Section #12 (More) Probability and Randomized Algorithms 11/24/14 1 Probability First, recall a couple useful facts from last time about probability: Linearity of expectation: E(aX + by ) = ae(x)
CSE 421 Greedy Algorithms / Interval Scheduling
CSE 421 Greedy Algorithms / Interval Scheduling Yin Tat Lee 1 Interval Scheduling Job j starts at s(j) and finishes at f(j). Two jobs compatible if they don t overlap. Goal: find maximum subset of mutually
Sorting. Chapter 11. CSE 2011 Prof. J. Elder Last Updated: :11 AM
Sorting Chapter 11-1 - Sorting Ø We have seen the advantage of sorted data representations for a number of applications q Sparse vectors q Maps q Dictionaries Ø Here we consider the problem of how to efficiently
Outline. 1 Introduction. 3 Quicksort. 4 Analysis. 5 References. Idea. 1 Choose an element x and reorder the array as follows:
Outline Computer Science 331 Quicksort Mike Jacobson Department of Computer Science University of Calgary Lecture #28 1 Introduction 2 Randomized 3 Quicksort Deterministic Quicksort Randomized Quicksort
Discrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #24: Probability Theory Based on materials developed by Dr. Adam Lee Not all events are equally likely
COM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
Quick Sort Notes , Spring 2010
Quick Sort Notes 18.310, Spring 2010 0.1 Randomized Median Finding In a previous lecture, we discussed the problem of finding the median of a list of m elements, or more generally the element of rank m.
The beginnings of physics
The beginnings of physics Astronomy 101 Syracuse University, Fall 2018 Walter Freeman October 9, 2018 Astronomy 101 The beginnings of physics October 9, 2018 1 / 28 Announcements No office hours this week
Announcements Wednesday, October 25
Announcements Wednesday, October 25 The midterm will be returned in recitation on Friday. The grade breakdown is posted on Piazza. You can pick it up from me in office hours before then. Keep tabs on your
Statistical methods in NLP Introduction
Statistical methods in NLP Introduction Richard Johansson January 20, 2015 today course matters analysing numerical data with Python basic notions of probability simulating random events in Python overview
MATH10212 Linear Algebra B Homework Week 5
MATH Linear Algebra B Homework Week 5 Students are strongly advised to acquire a copy of the Textbook: D C Lay Linear Algebra its Applications Pearson 6 (or other editions) Normally homework assignments
Axiomatic Semantics: Verification Conditions. Review of Soundness of Axiomatic Semantics. Questions? Announcements
Axiomatic Semantics: Verification Conditions Meeting 18, CSCI 5535, Spring 2010 Announcements Homework 6 is due tonight Today s forum: papers on automated testing using symbolic execution Anyone looking
Hardware/Software Co-Design
1 / 45 Hardware/Software Co-Design Parallel Patterns III Miaoqing Huang University of Arkansas Fall 2011 2 / 45 Outline 1 2 3 / 45 Outline 1 2 What is segmented scan? Scan + Barriers/Flags associated with
Hoare Logic and Model Checking
Hoare Logic and Model Checking Kasper Svendsen University of Cambridge CST Part II 2016/17 Acknowledgement: slides heavily based on previous versions by Mike Gordon and Alan Mycroft Introduction In the
CSE 331 Software Design & Implementation
CSE 331 Software Design & Implementation Kevin Zatloukal Summer 2017 Lecture 2 Reasoning About Code With Logic (Based on slides by Mike Ernst, Dan Grossman, David Notkin, Hal Perkins, Zach Tatlock) Recall
Axiomatic Semantics. Lecture 9 CS 565 2/12/08
Axiomatic Semantics Lecture 9 CS 565 2/12/08 Axiomatic Semantics Operational semantics describes the meaning of programs in terms of the execution steps taken by an abstract machine Denotational semantics
LING 473: Day 3. START THE RECORDING Assignment 1 Review Probability. University of Washington Linguistics 473: Computational Linguistics Fundamentals
LING 473: Day 3 START THE RECORDING Assignment 1 Review Probability 1 Probability textbook: Resources Available Charles Grinstead and J. Laurie Snell Introduction to Probability - online on course website
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Catie Baker Spring 2015
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Catie Baker Spring 2015 Today Registration should be done. Homework 1 due 11:59pm next Wednesday, April 8 th. Review math
C241 Homework Assignment 7
C24 Homework Assignment 7. Prove that for all whole numbers n, n i 2 = n(n + (2n + The proof is by induction on k with hypothesis H(k i 2 = k(k + (2k + base case: To prove H(, i 2 = = = 2 3 = ( + (2 +
Problem One: Order Relations i. What three properties does a binary relation have to have to be a partial order?
CS103 Handout 16 Fall 2011 November 4, 2011 Extra Practice Problems Many of you have expressed interest in additional practice problems to review the material from the first four weeks of CS103. This handout
Hoare Examples & Proof Theory. COS 441 Slides 11
Hoare Examples & Proof Theory COS 441 Slides 11 The last several lectures: Agenda Denotational semantics of formulae in Haskell Reasoning using Hoare Logic This lecture: Exercises A further introduction
Analysis of Algorithms CMPSC 565
Analysis of Algorithms CMPSC 565 LECTURES 38-39 Randomized Algorithms II Quickselect Quicksort Running time Adam Smith L1.1 Types of randomized analysis Average-case analysis : Assume data is distributed
Introduction to Randomized Algorithms: Quick Sort and Quick Selection
Chapter 14 Introduction to Randomized Algorithms: Quick Sort and Quick Selection CS 473: Fundamental Algorithms, Spring 2011 March 10, 2011 14.1 Introduction to Randomized Algorithms 14.2 Introduction
Data Structures and Algorithms Chapter 2
1 Data Structures and Algorithms Chapter 2 Werner Nutt 2 Acknowledgments The course follows the book Introduction to Algorithms, by Cormen, Leiserson, Rivest and Stein, MIT Press [CLRST]. Many examples
Lecture 4. Quicksort
Lecture 4. Quicksort T. H. Cormen, C. E. Leiserson and R. L. Rivest Introduction to Algorithms, 3rd Edition, MIT Press, 2009 Sungkyunkwan University Hyunseung Choo choo@skku.edu Copyright 2000-2018 Networking
Linear Classification: Linear Programming
Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong Recall the definition of linear classification. Definition 1. Let R d denote the d-dimensional space where the domain
Announcements Monday, September 18
Announcements Monday, September 18 WeBWorK 1.4, 1.5 are due on Wednesday at 11:59pm. The first midterm is on this Friday, September 22. Midterms happen during recitation. The exam covers through 1.5. About
Info 2950, Lecture 25
Info 2950, Lecture 25 4 May 2017 Prob Set 8: due 11 May (end of classes) 4 3.5 2.2 7.4.8 5.5 1.5 0.5 6.3 Consider the long term behavior of a Markov chain: is there some set of probabilities v i for being
4/26/2017. More algorithms for streams: Each element of data stream is a tuple Given a list of keys S Determine which tuples of stream are in S
Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit
Mathematical Induction. How does discrete math help us. How does discrete math help (CS160)? How does discrete math help (CS161)?
How does discrete math help us Helps create a solution (program) Helps analyze a program How does discrete math help (CS160)? Helps create a solution (program) q Logic helps you understand conditionals
Divide and conquer. Philip II of Macedon
Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into subproblems 2) Solve the subproblems recursively, that is, run the same algorithm on the subproblems (when the subproblems
CS1110 Lab 3 (Feb 10-11, 2015)
CS1110 Lab 3 (Feb 10-11, 2015) First Name: Last Name: NetID: The lab assignments are very important and you must have a CS 1110 course consultant tell CMS that you did the work. (Correctness does not matter.)
Proving Programs Correct
Proving Programs Correct Page 1 of 9 Proving Programs Correct How can we be sure that a piece of code does what we want it to do? One way is to try testing the code on a large group of data. Another is
Data Structure and Algorithm Homework #1 Due: 2:20pm, Tuesday, March 12, 2013 TA === Homework submission instructions ===
Data Structure and Algorithm Homework #1 Due: 2:20pm, Tuesday, March 12, 2013 TA email: dsa1@csie.ntu.edu.tw === Homework submission instructions === For Problem 1, submit your source code, a Makefile
CSE 331 Winter 2018 Homework 1
Directions: - Due Wednesday, January 10 by 11 pm. - Turn in your work online using gradescope. You should turn in a single pdf file. You can have more than one answer per page, but please try to avoid
Turing Machines Part II
Turing Machines Part II Hello Hello Condensed Slide Slide Readers! Readers! This This lecture lecture is is almost almost entirely entirely animations that that show show how how each each Turing Turing
Lec 05 Arithmetic Coding
ECE 5578 Multimedia Communication Lec 05 Arithmetic Coding Zhu Li Dept of CSEE, UMKC web: http://l.web.umkc.edu/lizhu phone: x2346 Z. Li, Multimedia Communciation, 208 p. Outline Lecture 04 ReCap Arithmetic
What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )
Starter Questions Feel free to discuss these with your neighbour: Consider two states s 1 and s 2 such that s 1, x := x + 1 s 2 If predicate P (x = y + 1) is true for s 2 then what does that tell us about
Fast Sorting and Selection. A Lower Bound for Worst Case
Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 0 Fast Sorting and Selection USGS NEIC. Public domain government image. A Lower Bound
= It is easy to see that the largest prime less than 93 is 89. Therefore, the answer is = 4 dollars.
Grade 8 Solutions. The answer is.. 0. + 0.0 + 0.00 + 0.000 0. 0... It is easy to see that the largest prime less than 9 is 89. Therefore, the answer is 9 89 dollars.. Our sorted list is,,,,, 6, 8, 9. The
COMP 250: Quicksort. Carlos G. Oliver. February 13, Carlos G. Oliver COMP 250: Quicksort February 13, / 21
COMP 250: Quicksort Carlos G. Oliver February 13, 2018 Carlos G. Oliver COMP 250: Quicksort February 13, 2018 1 / 21 1 1 https://xkcd.com/1667/ Carlos G. Oliver COMP 250: Quicksort February 13, 2018 2
How many hours would you estimate that you spent on this assignment?
The first page of your homework submission must be a cover sheet answering the following questions. Do not leave it until the last minute; it s fine to fill out the cover sheet before you have completely
Divide and Conquer Strategy
Divide and Conquer Strategy Algorithm design is more an art, less so a science. There are a few useful strategies, but no guarantee to succeed. We will discuss: Divide and Conquer, Greedy, Dynamic Programming.
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
![UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis](/thumbs/90/103872711.jpg "UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis")
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 10 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 10 Notes Midterm Good job overall! = 81; =
5. Program Correctness: Mechanics
5. Program Correctness: Mechanics Program A: LinearSearch with function specification @pre 0 l u < a @post rv i. l i u a[i] = e bool LinearSearch(int[] a, int l, int u, int e) { for @ (int i := l; i u;
Week 5: Quicksort, Lower bound, Greedy
Week 5: Quicksort, Lower bound, Greedy Agenda: Quicksort: Average case Lower bound for sorting Greedy method 1 Week 5: Quicksort Recall Quicksort: The ideas: Pick one key Compare to others: partition into
SMT and Z3. Nikolaj Bjørner Microsoft Research ReRISE Winter School, Linz, Austria February 5, 2014
SMT and Z3 Nikolaj Bjørner Microsoft Research ReRISE Winter School, Linz, Austria February 5, 2014 Plan Mon An invitation to SMT with Z3 Tue Equalities and Theory Combination Wed Theories: Arithmetic,
Proof by contrapositive, contradiction
Proof by contrapositive, contradiction Margaret M. Fleck 9 September 2009 This lecture covers proof by contradiction and proof by contrapositive (section 1.6 of Rosen). 1 Announcements The first quiz will
CS156: The Calculus of Computation
Page 1 of 61 CS156: The Calculus of Computation Zohar Manna Winter 2010 Chapter 5: Program Correctness: Mechanics Page 2 of 61 Program A: LinearSearch with function specification @pre 0 l u < a @post rv
Verifying Properties of Parallel Programs: An Axiomatic Approach
Verifying Properties of Parallel Programs: An Axiomatic Approach By Susan Owicki and David Gries (1976) Nathan Wetzler nwetzler@cs.utexas.edu University of Texas, Austin November 3, 2009 Outline Introduction
MATH10212 Linear Algebra B Homework 6. Be prepared to answer the following oral questions if asked in the supervision class:
MATH0 Linear Algebra B Homework 6 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra its Applications Pearson, 006 (or other editions) Normally, homework assignments
1 What is the area model for multiplication?
for multiplication represents a lovely way to view the distribution property the real number exhibit. This property is the link between addition and multiplication. 1 1 What is the area model for multiplication?
Hoare Logic: Reasoning About Imperative Programs
Hoare Logic: Reasoning About Imperative Programs COMP1600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2017 Catch Up / Drop in Lab When Fridays, 15.00-17.00 Where N335, CSIT Building
MAT 300 RECITATIONS WEEK 7 SOLUTIONS. Exercise #1. Use induction to prove that for every natural number n 4, n! > 2 n. 4! = 24 > 16 = 2 4 = 2 n
MAT 300 RECITATIONS WEEK 7 SOLUTIONS LEADING TA: HAO LIU Exercise #1. Use induction to prove that for every natural number n 4, n! > 2 n. Proof. For any n N with n 4, let P (n) be the statement n! > 2
Turing Machine Variants
CS311 Computational Structures Turing Machine Variants Lecture 12 Andrew Black Andrew Tolmach 1 The Church-Turing Thesis The problems that can be decided by an algorithm are exactly those that can be decided
5 + 9(10) + 3(100) + 0(1000) + 2(10000) =
Chapter 5 Analyzing Algorithms So far we have been proving statements about databases, mathematics and arithmetic, or sequences of numbers. Though these types of statements are common in computer science,
Searching Algorithms. CSE21 Winter 2017, Day 3 (B00), Day 2 (A00) January 13, 2017
Searching Algorithms CSE21 Winter 2017, Day 3 (B00), Day 2 (A00) January 13, 2017 Selection Sort (MinSort) Pseudocode Rosen page 203, exercises 41-42 procedure selection sort(a 1, a 2,..., a n : real numbers
Kartsuba s Algorithm and Linear Time Selection
CS 374: Algorithms & Models of Computation, Fall 2015 Kartsuba s Algorithm and Linear Time Selection Lecture 09 September 22, 2015 Chandra & Manoj (UIUC) CS374 1 Fall 2015 1 / 32 Part I Fast Multiplication
CS341 info session is on Thu 3/1 5pm in Gates415. CS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS341 info session is on Thu 3/1 5pm in Gates415 CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/28/18 Jure Leskovec, Stanford CS246: Mining Massive Datasets,
Randomized algorithms. Inge Li Gørtz
Randomized algorithms Inge Li Gørtz Randomized algorithms Today What are randomized algorithms? Properties of randomized algorithms Two examples: Median/Select. Quick-sort Randomized Algorithms Randomized
Outline. 1 Introduction. Merging and MergeSort. 3 Analysis. 4 Reference
Outline Computer Science 331 Sort Mike Jacobson Department of Computer Science University of Calgary Lecture #25 1 Introduction 2 Merging and 3 4 Reference Mike Jacobson (University of Calgary) Computer
ABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
Summer HSSP Week 1 Homework. Lane Gunderman, Victor Lopez, James Rowan
Summer HSSP Week 1 Homework Lane Gunderman, Victor Lopez, James Rowan July 9, 2014 Questions 1 Chapter 1 Homework Questions These are the questions that should be turned in as homework. As mentioned in
CS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2/26/2013 Jure Leskovec, Stanford CS246: Mining Massive Datasets, http://cs246.stanford.edu 2 More algorithms
Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics
Dynamic Semantics Operational Semantics Denotational Semantic Dynamic Semantics Operational Semantics Operational Semantics Describe meaning by executing program on machine Machine can be actual or simulated
Lab 2: 2.1. If a>b+c or b>a+c or c > a+b: print 'Cannot be arranged to make a triangle!' else: print 'Can be arranged to make a triangle!
Lab 2: 2.1 a = input('enter the first stick"s length (assumed positive): ') b = input('enter the second stick"s length (assumed positive): ') c = input('enter the third stick"s length (assumed positive):
Final Exam. Take-Home Portion. enter class. No answers will be accepted for any reason after 8:30. NO EXCEP-
MATH 477 { Section E1 Final Exam Take-Home Portion The Rules: 1. The answers to this part of the exam will be due on Wednesday, July 29 th when you enter class. No answers will be accepted for any reason
CS 231: Algorithmic Problem Solving
CS 231: Algorithmic Problem Solving Naomi Nishimura Module 4 Date of this version: June 11, 2018 WARNING: Drafts of slides are made available prior to lecture for your convenience. After lecture, slides
Chapter 4. Greedy Algorithms. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 4 Greedy Algorithms Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 4.1 Interval Scheduling Interval Scheduling Interval scheduling. Job j starts at s j and
Use mathematical induction in Exercises 3 17 to prove summation formulae. Be sure to identify where you use the inductive hypothesis.
Exercises Exercises 1. There are infinitely many stations on a train route. Suppose that the train stops at the first station and suppose that if the train stops at a station, then it stops at the next