2 Pages

syllabus

Course: CS 322, Fall 2009
School: Washington
Rating:
 
 
 
 
 

Word Count: 623

Document Preview

322: CSE Formal Models in Computer Science Website: http://www.cs.washington.edu/322 Lecture Times: MWF 1:30-2:30 in EE 045 (in the dungeon of EE.) Instructor: Dave Bacon Office: CSE 460 Email: dabacon@cs.washington.edu Phone: 206-221-6503 Office hours: M 2:30-3:00, W 2:30-3:30 in CSE 460 or by appointment Teaching Assistant: Hao Lu Email: hlv@cs.washington.edu Office hours: Th 5:30-7:00 in CSE 216 Teaching...

Register Now

Unformatted Document Excerpt

Coursehero >> Washington >> Washington >> CS 322

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.
322: CSE Formal Models in Computer Science Website: http://www.cs.washington.edu/322 Lecture Times: MWF 1:30-2:30 in EE 045 (in the dungeon of EE.) Instructor: Dave Bacon Office: CSE 460 Email: dabacon@cs.washington.edu Phone: 206-221-6503 Office hours: M 2:30-3:00, W 2:30-3:30 in CSE 460 or by appointment Teaching Assistant: Hao Lu Email: hlv@cs.washington.edu Office hours: Th 5:30-7:00 in CSE 216 Teaching Assistant: Isaac Myers Email: eyezac@cs.washington.edu Office hours: Th 11:30-12:30 in CSE 216 Syllabus March 31, 2008 Textbook: Michael Sipser, Introduction to the Theory of Computation, PWS Publishing, Second edition. First edition is also okay (problems and reading from text will be noted when they have different numbers in different editions.) The international edition is not supported: use at your own risk. Class Mailing List: Sign up immediately! Direct your browser to: https://mailman.cs.washington.edu/mailman/listinfo/cse322. Grading: Homeworks, midterm, and a final. Homeworks will generally be due on Friday. Grade breakdown is Homework: 55%, Midterm: 20%, Final: 25%. Lowest homework score will be dropped. Homework Late Policy: There will be weekly problem sets, generally due on Fridays. Homework should be handed in at the beginning of lecture on the day it is due. Late problem sets will not receive credit. (If a genuine emergency situation prevents you from handing in an assignment on time, come talk to one of us and we can work something out. Similarly, if you can anticipate an extraordinary or unusual circumstance that will necessitate an extension, please talk to us ahead of time.) Extra credit: Occasionally there will be extra credit on the homework. This will result in a minimal impact on your final grade. They are mostly to enrich your learning. Do then for the glory, not the points, and don't even start working on them until you've got the normal problems done. Collaboration on Homeworks: we Unless specifically state otherwise, we permit collaboration on the problem sets to the extent of formulating ideas as a group, provided (1) You spend at least 30 minutes on each and every problem alone, before discussing it with others (this might seem very restrictive, but this will almost certainly help you in the midterm and final exams), (2) You write up each and every problem in your own writing, using your own words, and understand the solution thoroughly and completely (a good approach to make sure that your write-up is independent is to engage in some other activity for 30 minutes after any discussion with others and before you write up your own solution), and (3) You clearly acknowledge and list the names of everyone that you discussed the problem set with. Cheating: Short version: don't do it! Long version: Your solutions to the problem sets must be original work (modulo collaboration as permitted above). Copying someone else's solutions obviously counts as cheating (see below), as does copying the homework from another source (the web, other classes, etc.). The questions in the problem sets have been carefully selected for their peda...

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 Winter 2005 Course InformationInstructor: TAs:Anna R. Karlin Neva Cherniavsky Ning ChenPGA 594 PGA 378 PGA 310karlin@cs.washington.edu nchernia@cs.washington.edu ning@cs.washington.edu543-9344 685-
Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #0 January 3, 2005 Due: Wednesday, January 5Reading Assignment: Kleinberg and Tardos, Chapters 1 and 4 Questions: 1. For each of the following topics, indicate your level of comfort on a scale o
Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #1 January 5, 2005 Due: Wednesday, January 12Reading Assignment: Kleinberg and Tardos, Chapters 1 and 4 Problems:1. Gale and Shapley published their paper on the stable marriage problem in 196
Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #2 January 12, 2005 Due: Wednesday, January 19 Reading Assignment: K&T, Section 5.1, 5.2, 5.4, 5.6, 5.7, 5.9 Questions: 1. (Kleinberg and Tardos, Chapter 4, Problem 5) Let's consider a long, quiet
Washington - CS - 521
CSE 521: Design and Analysis of Algorithms Assignment #4 January 27, 2005 Due: Wednesday, February 2Reading Assignment: Kleinberg and Tardos, Network Flow, handout on linear programming, section 11.6 in new book. Problems:1. Let G = (V, E) be a g
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 ("White Paper") 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 ("White Paper") 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 & Engineering Steve Maurer, UC Berkeley Goldman School of Public Policy Stefan Savage, UCSD Computer Science & Engineer
Washington - CSEP - 590
Information Technology and Public PolicyEd Lazowska, Computer Science & 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