# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

3 Pages

### hw4

Course: CS 521, Winter 2009
School: Washington
Rating:

Word Count: 931

#### Document Preview

521: CSE Design and Analysis of Algorithms Assignment #4 January 27, 2005 Due: Wednesday, February 2 Reading Assignment: Kleinberg and Tardos, Network Flow, handout on linear programming, section 11.6 in new book. Problems: 1. Let G = (V, E) be a graph with n nodes in which each pair of nodes is joined by an edge. There is a positive weight wij on each edge (i, j); and we will assume these weights satisfy the...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Washington >> Washington >> CS 521

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #5 February 2, 2005 Due: Wednesday, February 9Reading Assignment: Kleinberg and Tardos, Network Flow, handout on linear programming Problems: 1. Your friends have written a very fast piece of ma
Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #6 Due: Wednesday, February 16Reading Assignment: Linear programming handouts, chapter on randomized algorithms, other randomized algorithms handouts (we'll send out mail about them.) Problems:
Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #7 Due: Wednesday, Feb 23Problems:1. QuickSelect is the following simple algorithm for finding the k-th smallest element in an unsorted set S. QuickSelect(S, k): (a) Pick a pivot element p uni
Washington - CS - 521
Name:1 2 3 4 total/ 9 /10 /16 /39 /74CSE 521 Final ExamMarch 15, 2004 Instructions: You have 1 hour and 50 minutes to complete the exam. The exam is closed book, closed notes. Please do not turn the page until you are instructed to do so.
Washington - CS - 421
Measuring efficiency: The RAM modelnRAM = Random Access Machine Time # of instructions executed in an ideal assembly languagennComplexity and Representative ProblemsWinter 2005 Paul Beameneach simple operation (+,*,-,=,if,call) takes on
Washington - CS - 421
Undirected Graph G = (V,E)1 2 3 11 10Graph TraversalWinter 2005 Paul Beame12 4 5 6 7 8 13 9Directed Graph G = (V,E)1 2 3 11 12 4 5 6 7 8 13 9n n nGraph TraversalLearn the basic structure of a graph Walk from a fixed starting vertex s to
Washington - CS - 421
Greedy AlgorithmsnHard to define exactly but can give general propertiesn nGreedy AlgorithmsWinter 2005 Paul BeamenSolution is built in small steps Decisions on how to build the solution are made to maximize some criterion without looking t
Washington - CS - 421
Dynamic ProgrammingnDynamic ProgrammingnGive a solution of a problem using smaller sub-problems where all the possible sub-problems are determined in advance Useful when the same sub-problems show up again and again in the solutionDynamic Pro
Washington - CS - 421
Bipartite MatchingnnGiven: A bipartite graph G=(V,E)ME is a matching in G iff no two edges in M share a vertexnNetwork FlowWinter 2005 Paul BeameGoal: Find a matching M in G of maximum possible sizeBipartite MatchingBipartite Matchin
Washington - CS - 421
Dealing with NP-completenessWinter 2005 Paul BeameWhat to do if the problem you want to solve is NP-hardnYou might have phrased your problem too generallyne.g., in practice, the graphs that actually arise are far from arbitrary n maybe they
Washington - CSE - 590
Washington - CSEP - 590
Homeland Security / Cyber Security Autumn 2005N.B. CONTINUALLY IN FLUX Version 24: November 22 Course Requirements: Red Team Exercise (~25%): You are a member of a 5-6 person team of engineers and policy professionals that has been hired by the Depa
Washington - CSEP - 590
Homeland Security / Cyber Security Autumn 2005N.B. CONTINUALLY IN FLUX Version 24: November 22 Course Requirements: Red Team Exercise (~25%): You are a member of a 5-6 person team of engineers and policy professionals that has been hired by the Depa
Washington - CSEP - 590
CSE P 590TU: Homeland Security / Cyber Security Course Grade Histogram for UW Students4.0 3.9 3.8 3.7 3.6 3.5 3.4 3.3 3.2 3.1 3.0X X X X X X X X X XX X X X X X X X X XX X X X X X X X X X X X X X X X X X X X X X X X X
Washington - CSEP - 590
Red Team ReportHemavathy Alaganandam Parvez Anandam Jameel Alsalam Yi-Kai Liu Pravin Mittal Elena Rodriguez-Vieitez Santeri VoutilainenUniversity of Washington CSE P 590TU UC Berkeley PP 190/290-009 UCSD CSE 291 (C00) Christine Hartmann-Siantar P
Washington - CSEP - 590
Buffer Overflows: Implications for Civilian CybersecurityAndrew Hoskinsahoskins@microsoft.comMark O. Ihimoyanmark.ihimoyan@microsoft.comAdeel Rasul Iqbalaiqbal@uclink.berkeley.eduKeunwoo Leeklee@cs.washington.eduThanh Nhut Nguyenttnguye
Washington - CSEP - 590
Homeland Security / Cyber Security Autumn 2005 Course Project (&quot;White Paper&quot;) Assignment, and Topic SuggestionsVersion 5: November 2 White Paper (~55%): Teams of 3-5 students will provide a comprehensive report describing a particular threat, assess
Washington - CSEP - 590
Homeland Security / Cyber Security Autumn 2005 Course Project (&quot;White Paper&quot;) Assignment, and Topic SuggestionsVersion 5: November 2 White Paper (~55%): Teams of 3-5 students will provide a comprehensive report describing a particular threat, assess
Washington - CSEP - 590
Homeland Security / Cyber SecurityChris Hartmann-Siantar, Lawrence Livermore National Laboratory Ed Lazowska, UW Computer Science &amp; Engineering Steve Maurer, UC Berkeley Goldman School of Public Policy Stefan Savage, UCSD Computer Science &amp; Engineer
Washington - CSEP - 590
Information Technology and Public PolicyEd Lazowska, Computer Science &amp; Engineering, University of Washington Steve Maurer, Goldman School of Public Policy, University of California Berkeley Notes for presenters Students will be located at four site
Washington - CS - 321
CSE 321: Discrete Structures Assignment #1 January 7, 2009 Due: Wednesday, January 14Reading Assignment: Read Sections 1.1 - 1.4 carefully (make sure that you understand the examples). Problems: 1. Let p, q, r be the propositions. p You get sued by
Washington - CS - 321
CSE 321: Discrete Structures Assignment #2 January 15, 2009 Due: Thursday, January 22, in SectionReading Assignment: Sections 1.5 1.7 and handout on logic. Problems: 1. Determine the truth value of xy(x y 2 ) when the universe of discourse is the
Washington - CS - 321
CSE 321: Discrete Structures Assignment #3 January 22, 2009 Due: Wednesday, January 28, in ClassReading Assignment: Sections 2.1 2.3, and 3.4 3.6. Problems: 1. Section 1.6, exercise 28. 2. Prove that if you pick 10 numbers from 1 to 1000, then th
Washington - CS - 321
CSE 321: Discrete Structures Assignment #4 January 28, 2009 Due: Wednesday, February 4, in classReading Assignment: Sections 3.4 3.7 and 4.1 4.2. Problems: 1. Let a, b and c be integers. Prove that if a does not divide bc, then a does not divide
Washington - CS - 321
CSE 321: Discrete Structures Assignment #5 February 4, 2009 Due: Wednesday, February 11, in classReading Assignment: Sections 4.1 4.3 and 5.1. Problems: 1. Which amounts of money can be formed using just dimes and quarters? Prove your answer using
Washington - CS - 321
CSE 321: Discrete Structures Assignment #5 February 15, 2009 Due: Friday, February 20, in classReading Assignment: Sections 5.1 5.4. Justify your answers to the following problems. Problems: 1. Assume that friendship is always mutual; that is, if
Washington - CS - 321
CSE 321: Discrete Structures Assignment #7 February 20, 2009 Due: Wednesday, February 25, in classReading Assignment: Sections 6.1 6.4. Justify your answers to the following problems. You do not need to provide explicit numbers for permutations an
Washington - CS - 321
CSE 321: Discrete Structures Assignment #8 February 25, 2009 Due: Wednesday, March 4, in classReading Assignment: Read Sections 6.1 6.4, 8.1 8.2. Problems: 1. (a) Prove or disprove: If events E and F are independent, then so are their complementa
Washington - CS - 321
CSE 321: Discrete Structures Assignment #9 March 4, 2009 Due: Friday, March 13, in classReading Assignment: Read Sections 8.1 8.5, 9.1 9.5. Problems: 1. For the relation R = {(b, c), (b, e), (c, e), (d, a), (e, b), (e, c)} on {a, b, c, d, e}, dra
Washington - CS - 321
Discrete Structures LogicChapter 1, Sections 1.11.4Dieter FoxD. Fox, CSE-321Chapter 1, Sections 1.11.40-0Outline Propositional Logic Propositional Equivalences First-order LogicD. Fox, CSE-321Chapter 1, Sections 1.11.40-1Proposit
Washington - CS - 321
Supplementary Logic NotesCSE 321 Winter 200911.1Propositional LogicMore efcient truth table methodsThe method of using truth tables to prove facts about propositional formulas can be a very tedious procedure, especially if the formulas conta