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.
1 Page
prac-hw
Course: CS 473, Fall 2008School: University of Illinois,...
Rating:
Document Preview
Homework CS Practice 473: Algorithms Assigned: Friday March 14, 2008 Due on: Never Instructions: Please do not turn in solutions to this homework. Recommended Chapter Reading: 7 of the textbook and lecture notes 13 through 15 on the web. Homework Problems: Solve problems 7.6, 7.7, and 7.21 from the class textbook. 1
Unformatted Document Excerpt
Coursehero >> Illinois >> University of Illinois, Urbana Champaign >> CS 473Course 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.
Homework
CS Practice 473: Algorithms
Assigned: Friday March 14, 2008 Due on: Never
Instructions: Please do not turn in solutions to this homework. Recommended Chapter Reading: 7 of the textbook and lecture notes 13 through 15 on the web. Homework Problems...
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:
Below is a small sample set of documents:
University of Illinois, Urbana Champaign - CS - 473
How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for StudentsIan Parberryy Department of Computer Sciences University of North Texas July 29, 1993There are many points in your career at which you will be called upon to pres
University of Illinois, Urbana Champaign - CS - 473
CS 473: AlgorithmsAssigned: Friday April 4, 2008 Due on: April 11, 2008Homework 8Instructions: Solve the homework in groups of at most 3. Solution to each problem must start on a separate sheet. Please staple the pages for each problem but do no
University of Illinois, Urbana Champaign - CS - 473
CS 473: AlgorithmsAssigned: Friday March 28, 2008 Due on: April 4, 2008Homework 7Instructions: Solve the homework in groups of at most 3. Solution to each problem must start on a separate sheet. Please staple the pages for each problem but do no
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugSet CoverPart I Set CoverViswanathanCS473ugSet CoverThe Problem Greedy Heuristic Ana
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugBipartite Matching Edge Disjoint PathsPart I Network Flow Applications IViswanathanCS473
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugPreliminaries NP Cook-Levin TheoremPart I NP CompletenessViswanathanCS473ugPreliminari
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugMaximum Flow Algorithms Correctness and Analysis Polynomial Time AlgorithmsPart I Network Fl
University of Illinois, Urbana Champaign - CS - 473
Basic Graph Theory Breadth First search Depth First Search Directed GraphsCS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugBasic Graph Theory
University of Illinois, Urbana Champaign - CS - 473
Head-Banging Session 8CS 473: AlgorithmsProblem 1. Tonian Paths: The problem of Finding a Tonian path in a graph is that of nding a simple path that goes through more than half the vertices of a graph. (Where a simple path is one with no repeated v
University of Illinois, Urbana Champaign - CS - 473
Head-Banging Session 9CS 473: AlgorithmsProblem 1. Consider a set A = {a1 , ., an } and a collection B1 , B2 , ., Bm of subsets of A (i.e. Bi A for each i). We say that a set H A is a hitting set for the collection B1 , B2 , .Bm if H contains at
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugMinimum Spanning TreePart I Greedy Algorithms: Minimum Spanning TreeViswanathanCS473ug
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugImage Segmentation Project Selection Baseball Pennant RacePart I Applications of Max-Flow Mi
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugPricing MethodPart I Pricing Method: Vertex CoverViswanathanCS473ugPricing MethodThe
University of Illinois, Urbana Champaign - CS - 473
CS 473ug: AlgorithmsMahesh Viswanathan vmahesh@cs.uiuc.edu 3232 Siebel CenterUniversity of Illinois, Urbana-ChampaignSpring 2008ViswanathanCS473ugThe Problem Algorithmic Solution Running Time AnalysisPart I Closest PairViswanathanCS47
University of Illinois, Urbana Champaign - CS - 473
Head-Banging Session 11CS 473: AlgorithmsProblem 1. 3-Coloring: Model the 3-Coloring problem with an Integer Linear Program. The 3-Coloring problem is: Given a graph, is it possible to color each node either red, green, or blue, so that no two node
University of Illinois, Urbana Champaign - CS - 473
Head-Banging Session 7CS 473: AlgorithmsProblem 1. Which of the following statements are true and which are false? Justify your answer. 1. If all directed edges in a network have distinct capacities, then there is a unique max ow. 2. If we replace
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 4 SolutionsThis homework contains four problems. As usual, please submit each problem on a separate sheet of paper. Turn in your homework at Elaine Wilson's office (3229 Siebel). 1. NFA
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 12 Solutions1. Decidable problems. Prove that L is a decidable language: L= D, k D accepts no string of length k, and D is a NFA .Solution:L is decidable because we can design a dec
University of Illinois, Urbana Champaign - CS - 414
Homework 2 CS414, Multimedia Systems (Instructor: Klara Nahrstedt)Posted: April 18, 2008 Due: April 25, 2008 at 11:59pm CSTImportant InstructionsThis homework assignment should be done individually. Penalties for cheating as described in the grad
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 7 Due Monday, March 3rd, 4pm.Version: 1.01 This homework contains four problems. Please submit each on a separate sheet of paper. This will help us grade your homeworks more quickly. Tu
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 5 SolutionsSolution: 1: The original NFA. 2: Normalizing it.=3: Remove state A. 4: Redrawn without old edges.==5: Removing B.=16: Redrawn. =7: Removing C and redrawn.
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 1 (due Tuesday, January 22nd, 4pm)1. Set theory (10 points) Let A = {1, 2, 3} , B = {, {1}, {2} and C = {1, 2, {1, 2} . Compute A B, A B, B C, A C, A B, A C, C - A, C - B, A B C
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 8 Solutions1. Extract language from PDA. Give the language of the following PDA. b, , , b, , c, a ,$ b, a ,$ a, aa , $b, Solution:L = an bm |m| 2|n| an bm ck |k| = 2n,
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 14 Solutions1. Dovetailing (a) Briey sketch an algorithm for enumerating all Turing machine encodings. Remember that each encoding is just a string, with some specic internal syntax (e.
University of Illinois, Urbana Champaign - CS - 273
CS 273: Intro to Theory of Computation, Spring 2008 Problem Set 5 (due Monday, February 18th, 4pm)This homework contains only one problem, intended to help you study for the rst midterm. As usual, please turn in your homework at Elaine Wilsons oce (
University of Illinois, Urbana Champaign - CS - 579
PCPLecture 26 And Hardness of ApproximationThursday, April 24, 20081Promise ProblemsDecision problems, but with dont cares Specied by a Yes set and a No set, disjoint A TM is said to decide a promise problem if it correctly answers Yes or No
University of Illinois, Urbana Champaign - CS - 273
CS 273 Lecture 26: Posts Correspondence Problem and Tilings24 April 2008This lecture covers Posts Correspondence Problem (section 5.2 in Sipser). Undecidability of this problem implies the undecidability of CFG ambiguity. We will also see how to si
University of Illinois, Urbana Champaign - CS - 598
CS 598CSC: Approximation Algorithms Instructor: Chandra ChekuriLecture date: January 23, 2009 Scribe: Sungjin ImIn the previous lecture, we had a quick overview of several basic aspects of approximation algorithms. We also addressed approximation
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of Computation Sariel Har-Peled and Madhusudan ParthasarathyProblem Set 0Due: Thursday Jan 29 at 12:30 in class (i.e., SC 1105) This homework contains four problems (and one extra credit problem). Please follow the homework forma
University of Illinois, Urbana Champaign - CS - 373
CS 273 Lecture 26: Posts Correspondence Problem and Tilings24 April 2008This lecture covers Posts Correspondence Problem (section 5.2 in Sipser). Undecidability of this problem implies the undecidability of CFG ambiguity. We will also see how to si
University of Illinois, Urbana Champaign - CS - 373
CS 273, Lecture 22 Reductions10 April 2008This lecture covers basic undecidability reductions. This is the rst half of Sipser section 5.1 (through most of p. 192).1What is a reduction?Last lecture we proved that ATM is undecidable. Now that w
University of Illinois, Urbana Champaign - CS - 373
CS 273 Lecture : Review of topics coveredThis review of the class notes was written by Madhusudan Parthasarathy.1IntroductionThe theory of computation is perhaps the fundamental theory of computer science. It sets out to dene, mathematically,
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of Computation Sariel Har-Peled and Madhusudan ParthasarathyDiscussion 2: Examples of DFAs27 January 2009Purpose: This discussion demonstrates a few constructions of DFAs. How-ever, its main purpose is to show how to move fr
University of Illinois, Urbana Champaign - CS - 373
CS 273, Lecture 24 Linear Bounded Automata17 April 2008This lecture covers Linear Bounded Automata, an interesting compromise in power between Turing machines and the simpler automata (DFAs, NFAs, PDAs). We will use LBAs to show two CFG grammar pro
University of Illinois, Urbana Champaign - CS - 579
Complexity Homework 1Released: January 27, 2008 Due: February 10, 2008 For problems that involve nondeterministic complexity classes, the solutions maybe simpler when phrased in terms of certicates (instead of non-determinism). Problem 1: (a) Let L1
University of Illinois, Urbana Champaign - CS - 477
Homework Problem Set 1CS 477 Spring 2009Assigned: February 3, 2009 Due: February 10, 2009Instructions: You are welcome to collaborate while working out the ideas for a solution. However, you must write down the solutions independently, and must
University of Illinois, Urbana Champaign - CS - 579
Computational ComplexityLecture 1 in which we talk about Time Complexity, P, NP and coNPEvolution of ComputationEvolution of ComputationThe program (Turing Machine) starts in an initial conguration (tape-contents, control-state, headposition)
University of Illinois, Urbana Champaign - CS - 418
Some Sample Triangle MeshesWhat Polygon Meshes AreExplicit mesh description a list of polygonal faces F = ( f1, f2, , fn ) each polygon fi is a list of points this is sometimes called a polygon soup model vertices will be duplicated several ti
University of Illinois, Urbana Champaign - CS - 438
CS/ECE 438: Communication Networks Machine Problem 2Spring 2009 Due: 11:59 PM, Friday, March 20thReliable File TransferPlease read all sections of this document before you begin to code. Also, note that this is a challenging MP. It is not possib
University of Illinois, Urbana Champaign - CS - 438
CS/ECE 438: Communication Networks for Computers Problem Set 1Network Overview, Utilities and Basic ProbabilityAll problems carry equal weight. To receive full credit, show all of your work. 1.Spring 2009 SolutionsYou need 4TB / 8 GB = 500 flas
University of Illinois, Urbana Champaign - CS - 438
CS/ECE 438: Communication Networks Problem Set 3Fall 2007 Due Wednesday, Oct 17NOTE: There will be no automatic extension for this assignment. If you do not hand in the assignment by the start of class on Oct 17, you will get no credit for the as
University of Illinois, Urbana Champaign - CS - 438
CS/ECE 438: Communication Networks Problem Set 51. Slow StartFall 2007 Due Wednesday, Dec 5Assume a connection with RTT=50ms, MSS=1000 bytes. Ignoring overhead spent on headers, calculate the transfer time and the eective throughput for transfer
University of Illinois, Urbana Champaign - CS - 411
CS411 Database SystemsFall 2007HW#1Due: 3:00pm CST, 09/26/07Note: Print your name and NetID in the upper right corner of every page of your submission. Handin your stapled homework to Donna Coleman in 2120 SC. In case Donna is not in oce, slide
University of Illinois, Urbana Champaign - CS - 425
CS 425 Distributed Systems, Fall 2007, University of Illinois at Urbana-ChampaignMachine Problem 0 - TutorialDue Date - NoneOverviewThe machine programming (MP) part of the course this semester involves building a peer to peer application. We w
University of Illinois, Urbana Champaign - CS - 473
CS 473U: Algorithms, Fall 2007 Review and Practice Problems for Finals1. Recurrences and growth of functions. Review the problems in the homeworks and in midterm 1 and see if you can solve them now (without looking at the solutions!). 2. Problems 4.
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationAssigned: October 16, 2008 Due on: October 23, 2008Problem Set 6Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook its
University of Illinois, Urbana Champaign - CS - 373
Problem Set 2CS 373: Theory of ComputationAssigned: September 11, 2008 Due on: September 18, 2008Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook
University of Illinois, Urbana Champaign - CS - 373
CS 373: Theory of ComputationAssigned: October 23, 2008 Due on: October 30, 2008Problem Set 6Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook its
University of Illinois, Urbana Champaign - CS - 373
Problem Set 7CS 373: Theory of ComputationAssigned: October 23, 2008 Due on: October 30, 2008Instructions: This homework has two parts. The rst part has practice problems from the textbook many of whose solutions can be found in the textbook itse
University of Illinois, Urbana Champaign - CS - 440
Searching as Problem SolvingExample of Analytic Models(slightly more standard than textbook) N.B.: Lectures supercede textbook! World State Operators Preconditions Effects Goal Initial Stateattributes mechanism of change of operators of o
University of Illinois, Urbana Champaign - CS - 440
Issues The role of search What if we guess wrong about resolvents? Are there heuristics? Input / Unit Resolution Horn Clauses - PROLOG Completeness and refutational inferenceFrom Unsatisfiability to Returning AnswersSuppose that instead of
University of Illinois, Urbana Champaign - CS - 440
Admissibility of A*Some authors use A if not met 1) n n nodes, o operators with o(n)n h(n) cost(n,o,n) + h(n) Montonicity or Consistency (triangle inequality)Admissibility of A* (cont)2) n nodes h(n) h*(n) Informally: be optimistic (Why? Cou
University of Illinois, Urbana Champaign - CS - 440
CS 440: Introduction to AIHomework 2 Due: Tuesday, September 30th, 2008Your answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no a
University of Illinois, Urbana Champaign - CS - 440
The Infamous Dr. Bayes(or is logical inference really so bad?) Dr. Bayes has a statistics degree (not an MD) He makes diagnoses using his rule and other notions from statistics A plague has descended; there are two treatments: A and B He has tr
University of Illinois, Urbana Champaign - CS - 440
CS440: Introduction to AIHomework 4 Due: Thursday, November 13th, 2008Your answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no an
University of Illinois, Urbana Champaign - CS - 440
Midterm Exam October 7, in class A week from today! Search, Logic, Planning Unofficial sample midterms on web site Start reading Markov decision process & reinforcement learning Chapters 17 & 21Situation CalculusFOPC with some additional
University of Illinois, Urbana Champaign - CS - 440
Next: Appling Hybrid Models Beyond Planning Read Chapters 13 and 14 Uncertainty, Statistics, Probabilistic Reasoning Todays office hours 2-3 (not 3:30)Value Iterationsometimes TD for Temporal DifferencingUpdate:U ( s ) U ( s ) + rs +
University of Illinois, Urbana Champaign - CS - 440
Notation W, C, D, A, B are random variables C (binary presence of cavity) ranges over values Cs values might be Yes or No; 1 or 0; c1 or c2 Probability distribution: P(C) Probability value: P(C=c1) or P(c1) or P(c) P(A,B,C,W,D) full joint prob
University of Illinois, Urbana Champaign - CS - 440
CS 440: Introduction to AIHomework 1 Due: Tuesday September 9thYour answers must be concise and clear. Explain suciently that we can easily determine what you understand. We will give more points for a brief interesting discussion with no answer th
University of Illinois, Urbana Champaign - CS - 440
CS440 is my favorite classThere is some amount that I like CS440 and I like all other classes lessz w [Class(w) Name(w,CS440) Likes(Me,w,z) x y {[Class(x) Likes(Me,x,y) Different(x,w)] Greater(z,y)}] Likes(a,b,c) means a likes b by amount c G
University of Illinois, Urbana Champaign - CS - 440
Relevant TalkCoordinated Management of Multiple Interacting Resources on Chip Multiprocessors Jos Martnez, Cornell University November 17 (Monday), 4:00 p.m., 1404 Siebel Ph.D. Here w/ Torrellas, seen the light & now uses machine learning: Artificia