Course Hero - We put you ahead of the curve!
You have requested the below document.
Sign up now to view this document for free!
- Title: outline.15
- Type: Notes
- School: Grinnell
- Course: CS 151
- Term: Fall
Coursehero >> Iowa >> Grinnell >> CS 151
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> CS >> 151 Fall, 2003
Path: Grinnell >> MATH >> 215 Fall, 2008
Path: Grinnell >> MATH >> 215 Fall, 2008
Path: Grinnell >> MATH >> 321 Fall, 2008
Path: Grinnell >> MATH >> 321 Fall, 2008
Path: Grinnell >> MATH >> 321 Fall, 2008
Path: Grinnell >> MATH >> 321 Fall, 2008
Path: Grinnell >> MATH >> 321 Fall, 2008
Path: Grinnell >> MATH >> 336 Fall, 2008
Path: Grinnell >> MATH >> 336 Fall, 2008
Path: Grinnell >> MATH >> 336 Fall, 2008
Path: Grinnell >> MATH >> 336 Fall, 2008
Path: Grinnell >> MATH >> 336 Fall, 2008
Path: Grinnell >> MATH >> 1 Fall, 2008
Path: Grinnell >> MATH >> 2 Fall, 2008
Path: Grinnell >> MATH >> 3 Fall, 2008
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, and exam answer keys.
of Fundamentals Computer Science I: Media Computing (CS151.02 2007F) Class 15: Representing Images as Lists of Spots Held: Monday, 24 September 2007 Summary:Today we consider one simple representation of images in which we list the positions and colors of the colored spots in an image. Along the way, we explore lists, an important structured data type in Scheme. Related Pages: EBoard. Lab: Representing Images as Lists of Spots. Reading: Representing Images as Lists of Spots. Notes: Are there questions on Exam 1? Reading for Tuesday: Iterating Over Lists. Sorry for the problems with DrFu over the weekend. We re hoping not too many more crop up. For those of you who did the reading early: I ve changed terminology slightly. New groups! Overview: Spot lists: Another perspective on images. Lists in Basic Scheme. list operations. Processing spot lists. Copyright 2007 Janet Davis, Matthew Kluber, and Samuel A. Rebelsky. (Selected materials copyright by John David Stone and Henry Walker and used by permission.) This material is based upon work partially supported by the National Science Foundation under Grant No. CCLI-0633090. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/2.5/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA. 1
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more.
Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:
outline.01.pdf
Path: Grinnell >> CS >> 302 Spring, 2006
Description: Programming Languages (CS302 2007S) Class 01: Introduction to the Course Held: Monday, January 22, 2007 Summary: Today we begin the class by considering the key issues we will discuss this semester. Related Pages: EBoard. Assignments Do Wednesdays r...
outline.15.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 15: Recursion with Natural Numbers (2) Held: Tuesday, 19 September 2006 Summary: Today we begin our real exploration of numeric recursion. Related Pages: EBoard. Lab: Numeric Recursion. Readi...
outline.13.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 13: Documenting Programs and Procedures Held: Tuesday, 12 February 2008 Summary: We consider documentation for your programs - Why to write it, when to write it, how to write...
outline.14.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 14: Recursion with Natural Numbers (1) Held: Monday, 18 September 2006 Summary: Today we consider recursion over a different domain, that of the natural numbers. Related Pages: EBoard. Lab: N...
outline.14.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 14: Conditionals, Revisited Held: Friday, 21 September 2007 Summary: We consider our preliminary explorations of Schemes conditional structures. Related Pages: EBoard. Lab: C...
outline.14.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 14: Recursion with Natural Numbers (1) Held: Tuesday, February 13, 2007 Summary: Today we consider recursion over a different domain, that of the natural numbers. Related Pages: EBoard. Lab: ...
outline.12.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 12: Raster Graphics and RGB Colors Held: Monday, 11 February 2008 Summary: We consider the basics of raster graphics, a common technique for describing and representing image...
outline.13.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 13: Recursion with Lists Held: Monday, February 12, 2007 Summary: Today we continue our exploration of recursion by developing recursive procedures that take lists as parameters and do non-nu...
outline.11.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 11: Spot Lists, Continued Held: Friday, 8 February 2008 Summary: We continue our exploration of lists, spots, and lists of spots. Related Pages: EBoard. Lab: Representing Ima...
outline.13.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 13: Recursion with Lists Held: Friday, 15 September 2006 Summary: Today we continue our exploration of recursion by developing recursive procedures that take lists as parameters and do non-nu...
outline.12.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 12: Recursion, Revisited Held: Wednesday, 13 September 2006 Summary: Today we continue our consideration of the process of recursion. Related Pages: EBoard. Lab: Recursion. Reading: Recursion...
outline.12.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 12: Recursion, Revisited Held: Friday, February 9, 2007 Summary: Today we continue our consideration of the process of recursion. Related Pages: EBoard. Lab: Recursion. Reading: Recursion. Du...
outline.10.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 10: Representing Images as Lists of Spots Held: Wednesday, 6 February 2008 Summary: We consider one simple representation of images in which we list the positions and colors ...
outline.12.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 12: Boolean Values and Predicate Procedures Held: Tuesday, 18 September 2007 Summary: We consider the ways in which Scheme supports yes/no questions and procedures that can b...
outline.11.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 11: Iterating Over Positions Held: Monday, 17 September 2007 Summary: We consider a simple approach to working with images - looping over the pixels in an image and computing...
outline.11.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 11: Recursion Held: Wednesday, February 7, 2007 Summary: Today we begin to consider one of the most powerful tools in Scheme, recursion. Recursion allows you to repeat operations. Related Pag...
outline.11.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 11: Recursion Held: Tuesday, 12 September 2006 Summary: Today we begin to consider one of the most powerful tools in Scheme, recursion. Recursion allows you to repeat operations. Related Page...
outline.09.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 09: Computing with Symbols and Numbers Held: Tuesday, 5 February 2008 Summary: We explore some of Schemes standard numeric functions. Related Pages: EBoard. Lab: Numeric Comp...
outline.10.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 10: Conditionals Held: Tuesday, February 6, 2007 Summary: Today we consider how to control the behavior of Scheme programs using Schemes two primary conditionals: if and cond. Related Pages: ...
outline.10.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 10: Conditionals Held: Monday, 11 September 2006 Summary: Today we consider how to control the behavior of Scheme programs using Schemes two primary conditionals: if and cond. Related Pages: ...
outline.10.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 10: Computing with Numbers Held: Friday, 14 September 2007 Summary: Today we explore how some of Schemes standard numeric functions to create some interesting images. Related...
outline.08.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 08: Writing Your Own Procedures Held: Monday, 4 February 2008 Summary: We begin to consider how you can write your own procedures and why you might do so. Related Pages: EBoa...
outline.09.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 09: Boolean Values and Predicates Held: Friday, 8 September 2006 Summary: Today we explore Boolean values and the core opeartions on Boolean values. Related Pages: EBoard. Lab: Boolean Values...
outline.09.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 09: Boolean Values and Predicates Held: Monday, February 5, 2007 Summary: Today we explore Boolean values and the core opeartions on Boolean values. Related Pages: EBoard. Lab: Boolean Values...
outline.07.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 07: Drawings as Values Held: Friday, 1 February 2008 Summary: We consider another way to think about image. In particular, we consider what we call the drawings as values mod...
outline.09.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 09: Writing Your Own Color Transformations Held: Thursday, 13 September 2007 Summary: We consider procedures in Scheme, the purity of anonymous procedures, and their applicat...
outline.08.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 08: Procedure Definitions Held: Wednesday, 6 September 2006 Summary: Today we begin to consider how you can write your own procedures and why you might do so. Related Pages: EBoard. Lab: Defi...
outline.06.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 06: Turtle Graphics Held: Wednesday, 30 January 2008 Summary: We explore another imperative model of images, turtle graphics. In this model, we give drawing expressions to ro...
outline.08.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 08: Procedure Definitions Held: Friday, February 2, 2007 Summary: Today we begin to consider how you can write your own procedures and why you might do so. Related Pages: EBoard. Lab: Definin...
outline.08.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 08: Transforming Images Held: Tuesday, 11 September 2007 Summary: Today we consider some basic control stuctures that will allow us to write more interesting image filters. R...
outline.07.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 07: Characters and Strings Held: Tuesday, 5 September 2006 Summary: Today we consider two of Schemes core data types: Characters and strings. Related Pages: EBoard. Lab: Characters and String...
outline.05.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 05: Tools for Scripting the Gimp Held: Tuesday, 29 January 2008 Summary: We explore techniques for programming with the basic GIMP tools. Related Pages: EBoard. Lab: Lab: GIM...
outline.07.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 07: A Design Perspective Held: Monday, 10 September 2007 Summary: We consider the basics of color theory. Related Pages: EBoard. Lab: None. Reading: None. Notes: Assignment 3...
outline.07.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 07: Characters and Strings Held: Wednesday, January 31, 2007 Summary: Today we consider two of Schemes core data types: Characters and strings. Related Pages: EBoard. Lab: Characters and Stri...
outline.06.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 06: Numeric Values Held: Monday, 4 September 2006 Summary: Today we begin our first real exploration of numbers in Scheme. Related Pages: EBoard. Lab: Numeric Values. Reading: Numeric Values....
outline.06.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 06: Numeric Values Held: Tuesday, January 30, 2007 Summary: Today we begin our first real exploration of numbers in Scheme. Related Pages: EBoard. Lab: Numeric Values. Reading: Numeric Values...
outline.06.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 06: Transforming Colors Held: Friday, 7 September 2007 Summary: Today we explore common ways in which to transform colors, pixels, and images. Along the way, we consider two ...
outline.04.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 04: An Introduction to Scheme Held: Monday, 28 January 2008 Summary: Today we begin your exploration of the Scheme programming language and the environment in which you will ...
outline.05.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 05: Symbols and Lists Held: Monday, January 29, 2007 Summary: Today we consider two of Schemes most important types of data: symbolic values and lists. Related Pages: EBoard. Lab: Symbols and...
outline.05.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 05: Symbols and Lists Held: Friday, 1 September 2006 Summary: Today we consider two of Schemes most important types of data: symbolic values and lists. Related Pages: EBoard. Lab: Symbols and...
outline.05.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 05: RGB Colors Held: Thursday, 6 September 2007 A problem: Representing colors CS is the study of data and algorithms. When working with data, we have to think about how to ...
outline.03.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 03: An Introduction to the GIMP Held: Friday, 25 January 2008 Summary: We begin our exploration of GIMP, the GNU Image Manipulation Program. GIMP is an open-source raster gra...
outline.04.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 04: Beginning Scheme Held: Friday, January 26, 2007 Summary: Today we begin your exploration of the Scheme programming language (and of algorithm development) in earnest. Related Pages: EBoar...
outline.02.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 02: An Introduction to CSC151 Held: Wednesday, 23 January 2008 Summary: Today we begin to consider the structure and content of the course. We also prepare ourselves to use t...
outline.04.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 04: Raster Graphics Held: Tuesday, 4 September 2007 Summary: We consider the basics of raster graphics, a common technique for describing and representing images. Related Pag...
outline.03.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 03: Working in DrScheme Held: Wednesday, January 24, 2007 Summary: Today we explore DrScheme, the interactive program development environment in which we will work for most of this semester. ...
outline.03.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 03: An Introduction to Scheme Held: Monday, 3 September 2007 Summary: Today we begin your exploration of the Scheme programming language and the DrFu environment in which you...
outline.03.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 03: Working in DrScheme Held: Tuesday, 29 August 2006 Summary: Today we explore DrScheme, the interactive program development environment in which we will work for most of this semester. Rela...
outline.01.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.01 2008S) Class 01: An Introduction to Algorithms Held: Tuesday, 22 January 2008 Related Pages: EBoard. Lab: Drawing Smiley Faces. Overview: Introduction: What is CS? Exercise: Drawing smile...
outline.02.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 02: An Introduction to CSC151 Held: Monday, 28 August 2006 Summary: Today we begin to consider the structure and content of the course. Related Pages: EBoard. Lab: Getting Started in the Math...
outline.02.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 02: An Introduction to CSC151 Held: Tuesday, January 23, 2007 Summary: Today we begin to consider the structure and content of the course. We also prepare ourselves to use the MathLAN worksta...
outline.02.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 02: An Introduction to CSC151 Held: Friday, 31 August 2007 Summary: Today we begin to consider the structure and content of the course. We also prepare ourselves to use the L...
outline.01.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.02 2007S) Class 01: An Introduction to Algorithms Held: Monday, January 22, 2007 Summary: We begin the class by considering the discipline of CS and by trying to formally give instructions for an everyday pr...
outline.01.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I: Media Computing (CS151.02 2007F) Class 01: An Introduction to Algorithms Held: Thursday, 30 August 2007 Related Pages: EBoard. Lab: Drawing Smiley Faces. Overview: Introduction: What is CS? Exercise: Drawing smile...
outline.01.pdfPath: Grinnell >> CS >> 151 Fall, 2003
Description: Fundamentals of Computer Science I (CS151.01 2006F) Class 01: An Introduction to Algorithms Held: Friday, 25 August 2006 We begin the class by considering the discipline of CS and by trying to formally give instructions for an everyday problem. Rela...
syllabus.psPath: Grinnell >> MATH >> 215 Fall, 2008
Description: Math 215.01 Fall 2000 E. Moore Linear Algebra Instructor: Emily H. Moore O ce: Science 2416, x4205. See the sign-up sheet outside my o ce for o ce hours. Text: David C. Lay, Linear Algebra and its Applications, 2nd edition, Updated. (We will cover ...
intromatlab.psPath: Grinnell >> MATH >> 215 Fall, 2008
Description: An Introduction to MATLAB for Math 215 February 11, 2005 MATLAB is a large, professional package for numerical computation and graphics. Its matrix computations are especially powerful. This document is meant to introduce you to MATLAB, especially it...
syllabus.psPath: Grinnell >> MATH >> 321 Fall, 2008
Description: Math 321 Fall 2000 Foundations of Abstract Algebra Instructor: Emily H. Moore O ce: Science 2416, x4205. See the sign-up sheet outside my o ce for o ce hours. Text: J. Gallian, Contemporary Abstract Algebra, 4th ed. M W F 10:00 a.m., Science 2424 T...
assn1.psPath: Grinnell >> MATH >> 321 Fall, 2008
Description: Math 321 Fall 2000 Assignment Sheet 1 Solutions to all starred problems must be justi ed, even when the problem does not explicitly require a proof. The grade for your work will be based primarily on the starred problems. Note: Date Topic Aug. 25 A...
assn2alt.psPath: Grinnell >> MATH >> 321 Fall, 2008
Description: ...
assn3of2000.psPath: Grinnell >> MATH >> 321 Fall, 2008
Description: ...
assn4of2000.psPath: Grinnell >> MATH >> 321 Fall, 2008
Description: ...
weekly1y09.pdfPath: Grinnell >> MATH >> 336 Fall, 2008
Description: Math 336.01 Spring, 2009 Weekly Problems #1 A) Go to the course web page and nd the Classroom link called Condence Interval Simulation for a Proportion. The R code there generates 1000 random samples of size n = 50 of 0-1 data with a known success pr...
project-2009.pdfPath: Grinnell >> MATH >> 336 Fall, 2008
Description: Project Report Guidelines Math 336 Spring 2009 Here are some reasons for doing a project: To learn fundamentals of data analysis. To work on a problem that interests you. To deal with the messiness and complexity of a real problem. To work coop...
exam1_2006.pdfPath: Grinnell >> MATH >> 336 Fall, 2008
Description: Math 336.01 Exam I February 27, 2006 Directions: Work all problems on separate paper. Be neat and show your work. 1. (24 points) Suppose busses in a city are uniquely labeled with ID numbers from the consecutive positive integers 1, 2, ., N . Jack...
Weekly5Sp08.pdfPath: Grinnell >> MATH >> 336 Fall, 2008
Description: Math 336 Spring 2008 This question relates to survey research methods. Researchers almost always promise condentiality to subjects in a survey setting and sometimes they will even take steps to assure complete anonymity. With particularly sensitive q...
Codebook2008.docPath: Grinnell >> MATH >> 336 Fall, 2008
Description: What is a Codebook? The following information is taken from the ICPSR web site, in particular at: http:/www.icpsr.umich.edu/cocoon/ICPSR/FAQ/0063.xml A codebook is a careful description of the contents of the Minitab worksheet. It will contain: a pro...
Review1.pdfPath: Grinnell >> MATH >> 1 Fall, 2008
Description: Review Sheet for Exam 1 In general, exams will consist of some computational questions and some conceptual questions. Conceptual questions are mini-essays; be sure to use the right words to show me you understand whatever equations youre including. B...
Review2.pdfPath: Grinnell >> MATH >> 2 Fall, 2008
Description: Review Sheet for Exam 2 The second exam will cover all the material we did on chapter 3, from section 1 through section 8, though problems from section 8, if they appear, will be most like the low-numbered homework problems. Concepts 1. What is the d...
Review3.pdfPath: Grinnell >> MATH >> 3 Fall, 2008
Description: Review Sheet for Exam 3 The third exam will cover chapter 7, sections 7 and 8, and the material on chapter 4, sections 1, 3, 4, and 7. Concepts 1. What is the denition of an absolute maximum and a local maximum? (Check your answer on page 205) 2. Sta...