Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
We are so confident that you will love our service, we will answer your first homework question for FREE!
*  Attach Assignment (optional):
 
Our current time in (CST) is
 
Study Smarter, Score Higher
View This Document For FREE!
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
of Fundamentals Computer Science I (CS151.02 2007S) Class 07: Characters and Strings Held: Wednesday, January 31, 2007 Summary: Today we consider two of Scheme s core data types: Characters and strings. Related Pages: EBoard. Lab: Characters and Strings. Reading: Characters in Scheme and Strings in Scheme. Notes: Any announcements of events your colleagues should attend? Any questions on HW4? Reading for Friday: Procedures. Overview: Additional lessons from yesterday. Short introduction to strings. Lab. Numeric Procedures, Revisited We ll start with a bit more discussion of what various procedures do. Think about how you explore procedures. If you are exploring a numeric procedure, you should certainly try: Different numbers of arguments. Both positive and negative arguments. Both exact and inexact arguments. Integer, real, rational, and complex arguments. Different Lessons from Yesterday Think about the arrangement of windows on the screen. Think about how you interact with DrScheme. There are a variety of techniques in use, and you might find that a different one does better for you. Type expressions the in the bottom window and look at results. 1 > (real? 3/4) #t > (rational? 3/4) #t Type the expressions in the top window, click "Run", and look at results. (real? 3/4) (rational? 3/4) RUN #t #t Name the expressions in the top window, click "Run", and query results (define ex1a (real? 3/4)) (define ex1b (rational? 3/4)) RUN > ex1a #t > ex1b #t Intersperse symbols that indicate what you re computing is-three-forths-real? (real? 3/4) is-three-forths-rational? (rational? 3/4) RUN is-three-forths-real? #t is-three-forths-rational? #t Characters and Strings Characters: The building blocks of strings Strings: Collections of characters Together: The basics types for input and output in Scheme Lab Do as much of the lab as you can. Be prepared to reflect. Copyright 2007 Samuel A. Rebelsky. 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. 2
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:

Grinnell >> CS >> 151 (Fall, 2003)
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....
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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 ...
Grinnell >> CS >> 151 (Fall, 2003)
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 ...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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 ...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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. ...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> CS >> 151 (Fall, 2003)
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...
Grinnell >> MATH >> 215 (Fall, 2008)
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 ...
Grinnell >> MATH >> 215 (Fall, 2008)
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...
Grinnell >> MATH >> 321 (Fall, 2008)
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...
Grinnell >> MATH >> 321 (Fall, 2008)
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...
Grinnell >> MATH >> 321 (Fall, 2008)
...
Grinnell >> MATH >> 321 (Fall, 2008)
...
Grinnell >> MATH >> 321 (Fall, 2008)
...
Grinnell >> MATH >> 336 (Fall, 2008)
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...
Grinnell >> MATH >> 336 (Fall, 2008)
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...
Grinnell >> MATH >> 336 (Fall, 2008)
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...
Grinnell >> MATH >> 336 (Fall, 2008)
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...
Grinnell >> MATH >> 336 (Fall, 2008)
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...
Grinnell >> MATH >> 1 (Fall, 2008)
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...
Grinnell >> MATH >> 2 (Fall, 2008)
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...
Grinnell >> MATH >> 3 (Fall, 2008)
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...
Grinnell >> MATH >> 4 (Fall, 2008)
Review Sheet for Exam 4 The fourth exam will cover sections 4.7 and 4.9, chapter 5, and chapter 6.1. Concepts 1. Explain why two antiderivatives of a function f (x) must dier by a constant. (Careful: Im not asking why if you add a constant to one ant...
Grinnell >> MATH >> 5 (Fall, 2008)
Review Sheet for Exam 5 The fth exam will cover section 5.5, chapter 6, and section 7.1. Concepts 1. Explain u-substitution. In particular, explain how it follows from the chain rule. 2. Explain the washer method. 3. Explain the shell method. 4. Expl...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) How to Use the Course Web For a number of reasons, I have chosen to make many of the handouts for this course available only in electronic format on the World Wide Web. I will not go over basic use o...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 40: Topic 29: Inference for Correlation and Regression Held: Wednesday, 7 May 2008 Summary: We conclude our exploration of statistics by examining what regression lines between two variables fr...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Course Syllabus This is an abbreviated course syllabus. Particularly because this is our first time using this text, it is almost certain to change. Weeks: 1, 2, 3, 4, 5, 6, 7, 8, break, 9, 10, 11, 1...
Grinnell >> MATH >> 1 (Fall, 2008)
Review Problems for Exam 1 1. Prove that the series converges: n=0 3n 2n 2 2. Suppose that a room containing 1200 cubic feet of air is originally free of carbon monoxide. Beginning at time t = 0 cigarette smoke, containing 4% carbon monoxide, is...
Grinnell >> MATH >> 1 (Fall, 2008)
The following problems are from the 7th Edition of Boyce and DiPrima. They are from Section 3.1, Exercises 27, 28, 30. 27. Find an equation of the form ay + by + cy = 0 for which all solutions approach a multiple of et as t . For problems 28 and 30,...
Grinnell >> MATH >> 2 (Fall, 2008)
The following problems are from the 7th Edition of Boyce and DiPrima. They are from Section 3.1, Exercises 35, 38. For problems 35 and 38, use the following method: Equations with the Independent Variable Missing. If a second order dierential equatio...
Grinnell >> MATH >> 2 (Fall, 2008)
Review Problems for Exam 2 On the second exam, the following formula will be on the front page: dx dt 2 d2 y + dx2 d2 x dx + p(t) dt2 dt dy + q(t)y = 0. dx 1. (3.1 # 17) Find a dierential equation whose general solution is y = c1 e2t + c2 e3t . 2...
Grinnell >> MATH >> 3 (Fall, 2008)
Review Problems for Exam 3 The third exam will cover section 7.8, and chapter 9. Chapter 9 has been more theoretical than previous chapters. You should be able to explain the following: 1. For a linear system x = Ax, how does the behavior of the solu...
Grinnell >> MATH >> 4 (Fall, 2008)
Review Problems for Final The nal exam is cumulative. Please refer to previous review sheets for the material through chapter 9. Use the following questions to review chapter 10. Concepts 1. Explain the formulas we obtained to nd coecients of Fourie...
Grinnell >> MATH >> 2 (Fall, 2008)
Lecture notes for Section A.2 This section covers the principle of induction, which allows us to prove an innite number of statements very quickly! Induction is useful for statements involving positive integers. For example, one might claim that for ...
Grinnell >> MATH >> 1 (Fall, 2008)
Lecture notes for Section A.1/A.3 Terminology and Principles: 1. A set is a collection of distinct objects, called elements. 2. A subset T of a set S is a set that contains some (maybe all) of the elements of S. We write T S to say T is a subset of ...
Grinnell >> MATH >> 4 (Fall, 2008)
Lecture notes for Section A.4 Terminology and Principles: 1. The Pigeonhole Principle says that if you want to associate an element in a set Y to each element in a set X by means of a function f : X Y , and X has more elements than Y , then some ele...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 39: Topic 28: Least Squares Regression Held: Monday, 5 May 2008 Summary: We consider how one computes regression lines that summarize the expected relationship between explanatory and response ...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 41: Wrapup Held: Friday, 9 May 2008 Copyright 2008 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, vis...
Grinnell >> MATH >> 2003 (Fall, 2008)
Survey on Statistics within the Liberal Arts College Tom Moore, Grinnell College and Julie Legler, St. Olaf College We base this report on a survey of liberal arts college departments of mathematical sciences. The purpose of the survey was to gain ba...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 38: Topic 27: Correlation Coefficient Held: Friday, 2 May 2008 Summary: We consider ways to describe the relationship between two quantitiative variables from a single population. Notes: Due Mo...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 37: Topic 23: Analyzing Paired Data Held: Wednesday, 30 April 2008 Summary: We explore a similar and different kind of two-quantiative-variable test, one in which each observational unit from t...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 36: Topic 22: Comparing Two Means Held: Monday, 28 April 2008 Summary: We consider tests that can be used to determine what samples of two populations reveal about the differences of means betw...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 35: Topic 20: Tests of Significance: Means Held: Friday, 25 April 2008 Summary: We return to the concept of tests of significance, moving from tests that pertain to proportions to tests that pe...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 34: Review of Key Concepts Held: Wednesday, 23 April 2008 Notes: I got enough questions on Topic 25 that I will not hold a quiz today. If you plan to take the makeup exam tomorrow, please let m...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 33: Time to Work on Projects Held: Monday, 21 April 2008 Summary: We spend time exploring the kinds of analyses you should do for the project. Notes: Exam 2 returned. We will discuss it on Wedn...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 32: Topic 25: Inference for Two-Way Tables Held: Friday, 18 April 2008 Summary: We consider yet another way in which we use samples to explore populations. We continue to emphasize categorical ...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 31: Mini-Project Presentations Held: Wednesday, 16 April 2008 Summary: Students give Lightning Talks about the first-year survey data. Notes: Due Friday: 24-6, 24-7, 24-9, 24-15, 24-20. EC for ...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 30: Topic 24: Goodness-of-Fit Tests Held: Monday, 14 April 2008 Summary: We consider yet another way to use samples to explore populations. In particular, we consider what samples can tell us a...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 29: Topic 21: Comparing Two Proportions Held: Friday, 11 April 2008 Summary: We begin to consider what samples from two populations tell us about the relationships between those populations. No...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 28: Exam 2 Held: Wednesday, 9 April 2008 Copyright 2008 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 27: Review for Exam 2 Held: Monday, 7 April 2008 Summary: We review where weve been and what weve done in preparation for the second examination. Notes: I will continue to reserve time at the s...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 26: About the Projects Held: Friday, 4 April 2008 Summary: We consider the project component of the course and try some sample explorations of data. Notes: I will continue to reserve time at th...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 25: Topic 19: Confidence Intervals: Means Held: Wednesday, 2 April 2008 Summary: We return to the computation of confidence intervals, this time using quantitative data (represented by the samp...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 24: Pause for Breath Held: Monday, 31 March 2008 Summary: We review issues we have studied recently, along with ideas and questions revealed in Topic 18. Notes: I hope you all had a good break....
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 23: Class Cancelled Held: Friday, 14 March 2008 Copyright 2008 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this ...
Grinnell >> CS >> 115 (Spring, 2008)
Introduction to Statistics (MAT/SST 115.03 2008S) Class 22: Topic 17: Tests of Significance: Proportions (Continued) Held: Wednesday, 12 March 2008 Summary: We continue to consider how to express hypotheses about population parameters and how sample...
What are you waiting for?
View This Document For FREE!