# 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

### Ch02.Programs

Course: CS 381, Fall 2008
School: Oregon State
Rating:

Word Count: 3109

#### Document Preview

2 Chapter - Creating Python Programs While using python in an interactive fashion is easy and powerful, it becomes tiresome when you need to perform the same task more than once. Each time requires you to enter the commands all over again. Fortunately, there is an alternative. Python statements can be stored in a file. You can then direct the Python system to read and execute the commands from the file, rather...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Oregon >> Oregon State >> CS 381

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.

Textbooks related to the document above:
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:

Oregon State - CS - 381
Test Cases for Homework 2The following test cases were used to test your solutions to excercises 1 and 2. If you have any questions, please contact me.Exercise 1Example trees: t1 = Leaf t2 = Node True Leaf t3 = Node 3 (Node 4 (Node 4 t4 = Node 3
Oregon State - CS - 480
CS 480/580 Midterm 1 Winter 2000The exam has 100 points total, 20 points for each of the five questions. (120 points for 580 students). Closed book, closed notes, closed neighbors.Name: 1. Here is just a portion of the grammar for our programming
Oregon State - CS - 556
CS 556 Computer VisionProgram #1: Edge Detection and the Hough Transform Due date: Monday, Oct. 20, 2003 Programming: This programming assignment consists of two major components, each of which contains smaller pieces. This assignment will be writt
Oregon State - CS - 151
Midterm Exam CS 151 Section 2 Spring 2003 - Gary WatsonName (Last, First):_ Student ID: _ Signature:_ Date: May 6, 2003Test Form No: 1 - You must record this number on your answer sheet. There are multiple versions of this test! Read This Befor
Oregon State - MATH - 634
Singular SimplicesDefinitions A singular n-simplex in a space X is a map : n X Cn (X ) is the free abelian group with basis the set of singular n-simplices of XChain Complex Computation [v0 , vn ] = (-1)i [v0 , vi , , vn ] =i =0 n
Oregon State - MATH - 635
Universal Coefficient Theorem PreviewRead pages 185-189 for cohomology overview, 190-197 for UCT. Our immediate goal is to define cohomology groups of a space X with coefficients in an abelian group G, H m (X ; G) and to prove: H n (X ; G) Hom(Hn (X
Oregon State - MATH - 635
UCT for HomologyRead: 218, 261-267 Theorem: Given a free chain complex C and an abelian group G, there is short exact sequence 0 Hn G Hn (C ; G) Hn1 G 0 The sequence is natural with respect to chain maps, but the splitting is not.DetailsMai
Oregon State - MATH - 635
Recall Cup Products:cp c q , p+q = c p , |[v0 , ,vp ] c q , |[vp , ,vp+q ] Bilinearity: p p p c1 + c2 c q = c1 q q cp c1 + c2 = c p Associativity: (c p c q ) c r = c pp c + c2 q c1 + c p qCohomology LevelTheorem inducesc , q c2q: H p (X ;
Oregon State - MATH - 636
Covering Dimension(All spaces are separable metric in this section.) Denition: The covering dimension of X , dim(X ) is n if every nite open cover of X has a nite open renement of order n + 1. dim(X ) = n if dim(X ) n and dim(X ) n 1. Denition:
Oregon State - MATH - 634
DefinitionsRead Chapter 0 Retract Deformation Retraction Homotopy Homotopy Equivalence Homotopy Type Contractible Null Homotpic Mapping Cylinder Mf associated with f : X YMth 634 Fall 20071/7CW ComplexesA space X is a CW complex if it is fo
Oregon State - MATH - 634
Homology of Good Pairs, RevisitedFirst, recall Hn (X , A)q inc/ Hn (X , V ) o qexcHn (X \ A, V \ A)qHn (X /A, A/A)inc/ Hn (X /A, V /A) o excHn (C , D )where (C , D ) = (X /A \ A/A, V /A \ A/A)Mth 634 Fall 20071/6Other Res
Oregon State - MTH - 611
M TH 611 A SSIGNMENT 5 Due: Wednesday June 12, 2002 Bent E. Petersen petersen@math.orst.eduLast AssignmentUse this page as cover sheet stapled onto your submission, or do all your work on this page if there is sufficient room. This final assignm
Oregon State - MTH - 611
M TH 611 A SSIGNMENT 3 Due: Monday April 29, 2002 Bent E. Petersen petersen@math.orst.eduContour IntegralsUse this page as cover sheet stapled onto your submission, or do all your work on this page if there is sufficient room.Name: Problem 1.
Oregon State - MTH - 611
M TH 611 N OTES :May 27, 2003 Summary Week 68Let be a connected set, let f be a function analytic in and suppose f (z) = 0 for each z . Then g is called a branch of the logarithm of f , or, less formally, a branch of log f (z), if1. g is
Oregon State - MTH - 611
M TH 611 N OTES :April 26, 2003 Summary Week 4We showed a function f analytic in an open disk D(a, R), R &gt; 0, is the sum of a convergent power seriesf (z) =n=0cn (z a)nin the disk. Note it follows that the series has radius of converg
Oregon State - MTH - 611
M TH 611 N OTES :April 21, 2003 Summary First 3 WeeksWe have obtained a number of results but here I will mention only the highlights. We started by discussing power series and the radius of convergence of a power series. We saw that the sum o
Oregon State - MTH - 254
Vector Calculus I Mth 254Archive Winter 1996 FilesSept 27, 1999 Rev. Sept 28, 1999Contents1 Railroad track right angle turn 2 Railroad track reverse direction 3 Example 1: Curvature of a parametric curve 4 Example 2: Curvature of a parametr
Oregon State - MTH - 256
Applied Differential Equations Mth 256Archive Spring 1997 Files Oct 8, 2000This archive contains the sample problems, two quizzes and the nal exam from Mth 256 Spring 1997. The original test instructions, headers and formatting have not been pre
Oregon State - MTH - 611
M TH 611 A SSIGNMENT 4 Due: Wednesday May 8, 2002 Bent E. Petersen petersen@math.orst.eduCauchy InequalitiesUse this page as cover sheet stapled onto your submission, or do all your work on this page if there is sufficient room.Name: Problem 1
Oregon State - BA - 378
Center for Research on Information Technology and OrganizationsI.T. in Business (University of California, Irvine)Year Paper The Productivity Paradox: Is it Resolved? Is there a New One? What Does It All Mean for Managers?Jason DedrickUniversi
Virginia Tech - AOE - 3054
1. ) = =&gt; = = 0.15 =&gt; = 24b) P = V i = 24 0.15 =&gt; = . 2. )Peak-to-Peak = 2Amplitude = 25 =10V 5 b) RMS = = = . 2 2 c) From section 3 of the electronics review, the amplitude of the signal when connected V2 is related to the amplit
Oregon State - CS - 533
CS533 Intelligent Agents and Decision Making Homework 3, Winter 20091. Prove that for any STRIPS planning problem that the length of the optimal relaxed plan from any state s to the goal g is an admissible heuristic for state s. (NOTE: This does not
Oregon State - CS - 321
CS321 Theory of Computation Quiz 6, Fall 2008Name: 1. [5pt] What is a conguration of a non-deterministic pushdown automaton (NPDA)? A conguration of an NPDA is a triple (q, w, u) where q is a state, w is the remaining input to be read in, and u
Cornell - TAM - 203
Your Name: Your TA:T&amp;AM 203Tuesday March 28, 2000Prelim 27:30 - 9:00+ PMDraft March 28, 20003 problems, 100 points, and 90+ minutes. Please follow these directions to ease grading and to maximize your score. a) No calculators, books or note
Oregon State - ECE - 441
ID 1Task Name All individual parts laid out on PCBDuration 2.3 daysStart Fri 1/11/08Finish Tue 1/15/08Jan 13, '08 Jan 20, '08 Jan 27, '08 Feb 3, '08 Feb 10, '08 Feb 17, '08 Feb 24, '08 Mar 2, '08 Mar 9, '08 Mar 16, '08 Mar 23, '08 Mar 30, '
Oregon State - ECE - 441
ID 2 14 15 16 17 19 22 25 26 27 28 29 30 31 32 38 39 41 44 47 48 49 50 51Task Name Test plan revision Order Parts Getting info from Freescale and Battery junction Preliminary Schematic Final Schematic Review Schematic/PCB test Order/Receive PCB Cod
Oregon State - ECE - 441
ID 2 14 15 16 17 19 22 25 26 27 28 29 30 31 32 38 39 41 44 47 48 49 50 51Task Name Test plan revision Order PartsDuration 4 days 0 days 1 day 5 days 5 days 7 days 6 days 4 days 5 days? 1 day 1 day? 2 days? 2 days? 2 days? 3 days 6 days? 1 day? 1
Oregon State - ECE - 441
ID 2 14 15 16 17 21 23 26 29 36 37 45 46 48 52 53 54 55 56Task Name Test plan revision Order PartsDuration 4 days 0 days 1 day 5 days 5 days 7 days 6 days 1 day? 5 days? 3 days 1 day? 3 days? 1 day? 1 day? 5 days? 1 day 0 days 0 days 5 days?Sta
Oregon State - ECE - 441
ID 1 2 3 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56Task Name All individual parts laid out on PCB Test plan revision Gantt chart update Finish initial Gantt ch
Johns Hopkins - V - 019
Since coming to power Wade has sought by all available means to control every political force.The high level of voter abstention from the legislative elections has cast doubt on the February presidential results and discredit on a parliament that h
Johns Hopkins - AMS - 391
Computers Math. PergamonPII: SOS98-1221(97)00126-OVol. 34, No. 2-4, pp. 245-251, 1997 Copyright@1997 Elsevier Science Ltd Printed in Great Britain. All rights reserved 08981221/97 \$17.00 + 0.00Applic.HomoclinicPhenomenaA. L.SHIL'NIKOVin