# 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

### TI83PrecalcTOC

Course: MATH 147, Fall 2008
School: Boise State
Rating:

Word Count: 421

#### Document Preview

THE USING TI-83 GRAPHING CALCULATOR IN PRECALCULUS 1.0 General Information 2.0 Calculator Basics 2.1. Turning the Calculator ON/OFF 2.2. The Keyboard 2.3. Predefined Functions and Constants 2.4. The Home Screen 2.5. Adjusting the Contrast on the Screen 2.6. Selecting Items from a List or a Menu 2.7. The CATALOG Feature 2.8. Inserting and Deleting Characters 2.9. Editing and Re-executing Lines of Code 2.10....

Register Now

#### Unformatted Document Excerpt

Coursehero >> Idaho >> Boise State >> MATH 147

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.
THE USING TI-83 GRAPHING CALCULATOR IN PRECALCULUS 1.0 General Information 2.0 Calculator Basics 2.1. Turning the Calculator ON/OFF 2.2. The Keyboard 2.3. Predefined Functions and Constants 2.4. The Home Screen 2.5. Adjusting the Contrast on the Screen 2.6. Selecting Items from a List or a Menu 2.7. The CATALOG Feature 2.8. Inserting and Deleting Characters 2.9. Editing and Re-executing Lines of Code 2.10. Interpreting Error Messages 2.11. Transferring Programs Between TI-83s 2.12. Executing a Program 3.0 Using the CBL System 3.1. Creating a Graph Using a Motion Detector 3.2. Matching a Graph Using a Motion Detector 4.0 Analyzing Data Collected by the CBL System 4.1. Examining the Table of Data 4.2. Viewing the Graphs 4.3. Tracing the Graphs 4.4. Zooming In 5.0 Arithmetic Operations and Expressions 5.1. Order of Operations 5.2. Entering and Evaluating an Expression 5.3. Subtraction and Negation 5.4. Implied Multiplication 5.5. Exponentiation 6.0 The MODE Key 6.1. Float/0123456789 6.2. Radian/Degree 6.3. Connected/Dot 6.4. Full/HorizontaVGraph-Table Screens 7.0 Using Variables 7.1. Real Variable Names 7.2. Assigning a Value to a Variable 7.3. Clearing a Variable 8.0 The TEST Menu 8.1. Relational Operations 8.2. Boolean Operators 9.0 The MATH Menu 9.1. Representing a Value as a Fraction 9.2. Approximating the Minimum or Maximum Value of a Function 9.3. The Absolute Value Function 9.4. The Round Function 9.5. The Greatest Integer Function 9.6. Finding the Smallest or Largest Item in a List 10.0 Representing a Function Symbolically 10.1. Storing a Function in the Y= Editor 10.2. Specifying the of Domain a Function 10.3. Selecting a Function Using the VARS Key 10.4. Evaluating a Function Stored in the Y= Editor 10.5. Creating New Functions from Old 10.6. Selecting and De-selecting Functions in the Y = Editor 11. Representing a Piecewise-Defined Function 12.0 Representing a Function Graphically 12.1. Choosing the Display Styles 12.2. Adjusting the Viewing Window 12.3. Viewing the Graph 13.0 The FORMAT Menu 13.1. GridOff/GridOn 13.2. LabeIOff/LabeIOn 14.0 The TRACE Feature 14.1. Tracing a Curve 14.2. Moving Among Curves 14.3. Evaluating a Function Using the TRACE Feature 15.0 The ZOOM Feature 15.1. ZBox 15.2. Zoom In and Zoom Out 15.3. ZStandard and ZDecimal 15.4. ZTrig 15.5. ZoomStat 15.6. ZoomFit 15.7. ZPrevious 16.0 Representing a Function as a Table 16.1. Displaying Values of a Function in a Table 16.2. Evaluating a Function Using a Table 16.3. Viewing a Table and a Graph Together 16.4. Clearing a Table 17.0 Representing a Discrete Function 1...

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:

St. Xavier - CSCI - 180
Liz Brondos The Adventures of Super Class Man, Yet Another Superhero DoME programmer: Help, I'm going crazy trying to keep track of our inventory! Back in the old days, it was easy because all we had to keep track of were books and CDs. Now we have v
St. Xavier - CSCI - 180
Liz Brondos 10/28/03 Discussion Between an Angry Maintenance Programmer and his Nave Assistant Maintenance Programmer: I've been looking at this code you wrote for the application we're both working on, and, frankly. Nave Assistant: Yes? Maintenance
St. Xavier - CSCI - 390
Interruptions on Software Teams: A Comparison of Paired and Solo ProgrammersJan Chong, Rosanne SiinoCenter for Work, Technology and Organization Department of Management Science and Engineering Stanford University 380 Panama Way, Stanford, CA 94305
St. Xavier - CSCI - 390
On the Feasibility of Commercial, Legal P2P Content DistributionPablo RodriguezMicrosoft Research Cambridge, UKSee-Mong TanMicrosoft Corporation Redmond, WA. USAChristos GkantsidisMicrosoft Research Cambridge. UKpablo@microsoft.com ABSTRACT
St. Xavier - CSCI - 390
Developing a Location Based Tourist Guide ApplicationTodd Simcock, Stephen Peter Hillenbrand, and Bruce H. Thomas Wearable Computer Laboratory School of Computer and Information Science University of South Australia Mawson Lakes Boulevard, Mawson La
St. Xavier - CSCI - 390
Analysis of Multimedia Workloads with Implications for Internet StreamingLei Guo1 , Songqing Chen2 , Zhen Xiao3 and Xiaodong Zhang11Department of Computer Science College of William and Mary Williamsburg, VA 23187, USA{lguo,2Department of Co
St. Xavier - CSCI - 390
Reliable Servers: Design and Implementation in Avalon/CccRichard Alien Lerner' Department of Computer Science Carnegie Mellon University Pittsburgh, PA 15213-3890AbstractAvalon/C+ is a programming language that supports the construction of reliab
St. Xavier - CSCI - 250
List of Typographical Errors Theory of Computation: A Gentle Introduction by Efim Kinber and Carl SmithPage xvi, 7 lines from the bottom, change &quot;imporved&quot; to &quot;improved&quot;.Discovered by Mir Abdul Tawab Wakil, University of Maryland Page 4, second lin
St. Xavier - CSCI - 250
CSCI 250 Spring 08GOLDWEBER 4/14/08Homework 8Due Date: Monday April 21, 2008. There is a possible 47 points for this homework assignment. Problem 1. (3 pts) Is the following statement true or false? If L1 , L2 , . . . are recursively enumerable
St. Xavier - CSCI - 250
CSCI 250 Spring 08GOLDWEBER 3/28/08Homework 7Due Date: Wednesday, April 4, 2008. There is a possible 38 points for this homework assignment. Problem 1. (20 pts.) Draw a transition diagram for a Turing machine accepting each of the following lang
St. Xavier - CSCI - 250
CSCI 250 Spring 08GOLDWEBER 3/6/08Homework 6Due Date: Wednesday, March 12, 2008. There is a possible 56 points for this homework assignment. Problem 1. (6 pts.) Exercise 3.13 on page 112 of the text. Problem 2. (4 pts.) Exercise 3.37, part a onl
St. Xavier - CSCI - 250
CSCI 250 Spring 08GOLDWEBER 3/10/08Study Guide #2Chapter 3 of the text in addition to all Web pages associated with the course. Push-Down Automata: Overall definition, general idea of, and how they operate: final state vs empty stack. The eq
St. Xavier - CSCI - 250
CSCI 250 Spring 08GOLDWEBER 4/23/08Homework 9Due Date: Wednesday April 30, 2008. There is a possible 85 points for this homework assignment. Problem 1. (5 pts. Polynomial reduction) Let = {a, b}, let L1 be the language of palindromes over , and
St. Xavier - CSCI - 250
CSCI 250: Languages and Automata Exam I Review Fun 1. Consider the NFA defined by = {a,b}, Q = {q0 , q1 , q2 }, F = {q2 }, q0 is the start state, and defined by (q0 , a) = { q0 , q1 } (q0 , b) = { q0 } (q1 , a) = { q1 } (q1 , b) = { q1 , q2 } (q2 ,
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 4/22/05Homework 9Due Date: Friday April 29, 2005. There is a possible 35 points for this homework assignment. Problem 1. (5 pts. Polynomial reduction) Let = {a, b}, let L1 be the language of palindromes over , and le
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 2/21/05Homework 4Due Date: Monday February 28, 2005. There is a possible 71 points for this homework assignment. Problem 1. (16 pts.) In each case, say what language is generated by the context-free grammar with the i
St. Xavier - CSCI - 250
The Power Set of a Countably Infinite Set is UncountableTheorem 1 If S is a countably infinite set, 2S (the power set) is uncountably infinite. Proof: We show 2S is uncountably infinite by showing that 2N is uncountably infinite. (Given the natural
St. Xavier - CSCI - 250
CSCI 250 Spring 06GOLDWEBER 1/25/06Homework 2Due Date: Wednesday, February 1, 2006. There is a possible 51 points for this homework assignment. Problem 1. (3 pts.) Exercise 2.14 on page 60 of the text. Problem 2. (18 pts.) Exercise 2.16 on page
St. Xavier - CSCI - 250
PDA to CFGLet M = ({q0 , q1 }, {0, 1}, {X, Z0 }, q0 , Z0 , , ) where is defined as: (q0 , 0, Z0 ) = {(q0 , XZ0 )} (q0 , 0, X) = {(q0 , XX)} (q0 , 1, X) = {(q1 , )} (q1 , 1, X) = {(q1 , )} (q1 , , X) = {(q1 , )} (q1 , , Z0 ) = {(q1 , )} S [q0 , Z0
St. Xavier - CSCI - 250
CSCI 250 Spring 06GOLDWEBER 3/13/06Homework 7Due Date: Monday, March 20, 2006. There is a possible 46 points for this homework assignment. Problem 1. (20 pts.) In each case, show using the pumping lemma that the given language is not a CFL. a) L
St. Xavier - CSCI - 250
CSCI 250 Spring 06GOLDWEBER 3/27/06Homework 8Due Date: Friday March 31, 2006. There is a possible 38 points for this homework assignment. Problem 1. (20 pts.) Draw a transition diagram for a Turing machine accepting each of the following languag
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 4/13/05Homework 8Due Date: Wednesday April 20, 2005. There is a possible 47 points for this homework assignment. Problem 1. (3 pts) Is the following statement true or false? If L1 , L2 , . . . are recursively enumerab
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 3/9/05Homework 6Due Date: Monday March 14, 2005. There is a possible 46 points for this homework assignment. Problem 1. (20 pts.) In each case, show using the pumping lemma that the given language is not a CFL. a) L =
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 1/12/05Homework 1Due Date: Friday January 21, 2005. There is a total of 44 points for this homework assignment. Problem 1. (3 pts.) Let L be a language. It is clear from the definitions that L+ L . Under what circums
St. Xavier - CSCI - 250
CSCI 250 Spring 06GOLDWEBER 4/3/06Homework 9Due Date: Monday April 10, 2006. There is a possible 47 points for this homework assignment. Problem 1. (3 pts) Is the following statement true or false? If L1 , L2 , . . . are recursively enumerable s
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 3/2/05Homework 5Due Date: Monday March 7, 2005. There is a possible 50 points for this homework assignment. Problem 1. (6 pts.) Provide a PDA to accept the following subsets of {a.b} a) The language of even-length pal
St. Xavier - CSCI - 250
CSCI 250 Spring 05GOLDWEBER 1/21/05Homework 2Due Date: Friday January 28, 2003. There is a possible 45 points for this homework assignment. Problem 1. (4 pts.) Consider the two regular expressions: r = 0 + 1 s = 01 + 10 + 1 0 + (0 1) 1. Find a s
St. Xavier - CSCI - 300
CSCI 300 Programming Languages, Fall 2005 Gary Lewandowski Exam Review Notions These questions are taken without modification from previous exams I have given. You may not be familiar with some of the languages mentioned, but you can expect the type
St. Xavier - CSCI - 300
Presentation HW #1: Prolog1) The nature of Prolog sometimes allows for predicates to be useful in ways other than what was originally intended - by changing the order of the arguments or by replacing an explicit argument with a variable and vice ver
St. Xavier - CSCI - 300
PROgramming in LOGicPart IIBy Forrest Pepper 12/7/07Anatomy of a Program We discussed the three main constructs of a Prolog program Facts contain a property or state a relationship between two or more objects. These are considered always true
St. Xavier - CSCI - 380
Topics for exam Reading from book: Chapters 1-6 Types of parallel computers o Shared memory o Message passing o Distributed shared memory Ways in which parallelism is supported o Specialized programming language o Extensions to programming languages
St. Xavier - CSCI - 380
CSCI 380 Spring 05GOLDWEBER 2/15/05Homework 4: Functional Dependency and Normal FormsDue Date: Tuesday February 22, 2005. There is a possible 49 points for this homework assignment. Problem 1. (3 pts.) Problem 6.8 on page 246 of the text: FD dis
Michigan State University - FOR - 845
1. What are the primary differences between certification of a company's management practices and its management systems? What is your opinion about which system would be more likely to advance the objective of sustainable forest management? Why? 2.
St. Xavier - MATH - 120
Quadratic Functions Revisited When we first studied quadratic functions, we saw that their graphs are always parabolas and their formulas can be expressed in standard form as y = f (x) = ax 2 + bx + c , and (sometimes) in factored form as y = f (x) =
St. Xavier - MATH - 120
Power Functions Two quantities are in direct proportion if one is a constant multiple of the other; alternatively, one can say that the one quantity varies directly with the other. So for instance, the volume V of a sphere is in direct proportion to
St. Xavier - MATH - 120
Logarithms It is not too hard to see that the inverse function of any linear function (with nonzero slope) is another linear function. Things are not as straightforward for exponential functions: the inverse of an exponential function cannot be anoth
St. Xavier - MATH - 120
Functions The idea of a mathematical function was only developed about 150 years ago. It has become the central concept in applied mathematics, used widely in mathematical modeling as a way to represent quantifiable phenomena. A function is a rule (o
St. Xavier - MATH - 120
Linear regression Data collected from measurements of real phenomena are often well-described by linear functions. However, such data is generally subject to errors or other &quot;noise&quot; that corrupts the measurements, so a graph of the points in the data
St. Xavier - MATH - 120
Arithmetic of Functions Functions with the same domain set and outputs that are measured in the same units can be added or subtracted to build new functions. [Example: p. 379, #26(a), 7] Functions with the same domain can also be combined by multiply
St. Xavier - MATH - 120
MATH 120 Elementary Functionse and continuous compoundingWe have seen how compound interest works; as an investment method, it is far preferable to simple interest. Simple interest investments grow linearly, since the interest payment is a certai
St. Xavier - MATH - 120
MATH 120 Elementary FunctionsDomain and RangeThe domain and range of a function are sometimes inferable directly from its presentation. This is particularly easy when the function is given as a table of values, or in graphical form. 1. Recall the
St. Xavier - MATH - 120
MATH 120 Elementary FunctionsFunctions and their representations1.Theophylline is a common asthma drug. The table below shows the drug's concentration in the bloodstream (in units of mg/L, or milligrams per liter) measured periodically after a
Michigan State University - CEP - 812
Answer Key1. How did the slave trade start in the first place? a. The Portuguese were the first Europeans to go to Africa for slaves, and they went there in the first place for Gold. b. They were captured during war or kidnapped during raiding parti
Michigan State University - CEP - 812
3. Where did most slaves come from?There are a bunch of puzzle pieces below. The red represents major areas of slave trade, the yellow, not so much slave trade. To put the pieces on the map, click, hold, and drag the pieces to about where they need
Michigan State University - CEP - 812
2. Why did the New World want slaves?You need to fill in the map below using information from the Slavery in America Website. To fill in the legend, just click next to the symbols and type. To fill in the map, click on the symbols next to the words
Oregon - MATH - 391
Oregon - MATH - 391
Oregon - MATH - 391
Oregon - MATH - 391
Math 391: Homework 8 (due M November 26)This is the last GRADED homework. Note it is not due until MONDAY of dead week. There will be some more reading next week and some review questions to come too. Part I: reading. Read section 4.1 again (especia
Oregon - MATH - 391
St. Cloud - CSCI - 201
CSCI 201: Fundamentals of Computer Science (Spring 2009) Instructor: Pranava K. Jha Solution to Quiz 1Which of the following are valid/not valid as user-defined identifiers in C+? Give a reason for those that are not valid identifiers. DOUBLE _anth
St. Cloud - CSCI - 201
CSCI 201: Fundamentals of Computer Science Instructor: Pranava K. Jha Building and Maintaining a Singly Linked List A linked list is a sequence of nodes where a node consists of some data value and a link to the next node on the list. (The link field
National Taiwan University - CSE - 101
Name _ Lecture Time:_The space on this sheet (both sides) may be used for your notes. These notes must be hand written no photocopies and/or pasted/typed sheets. This sheet must be turned in with your exam.Functions - Optional arguments are shown
St. Cloud - CSCI - 201
CSCI 201: Fundamentals of Computer Science (Instructor: Pranava K. Jha)Design and implement a class dayType that implements the day of a week in a program. The class dayType should store the day, such as Sun for Sunday. The program should be able t
St. Cloud - CSCI - 201
/ Implementation File for the class clockType / See the header file clock.h for the documentation / Reference: D.S. Malik, &quot;C+ Programming,&quot; Course Technology #include &lt;iostream&gt; #include &quot;clock.h&quot; using namespace std; void clockType:setTime(int hour
St. Cloud - CSCI - 201
CSCI 201: Test file for the class IntNode (Instructor: Pranava K. Jha)/* St. Cloud State University CSCI 201: Fundamentals of Computer Science Instructor: Pranava K. Jha This is the test file: ListTest.cpp. It is designed to test most functions of
St. Cloud - CSCI - 201
CSCI 201: Test file for a queue of integers (Instructor: Pranava K. Jha)/* St. Cloud State University CSCI 201 Instructor: Pranava K. Jha */ / This is the test file qTest.cpp for a stack of integers. / Header file is q.h and implementation file is
St. Cloud - CSCI - 201
/ Name: / Date: Aug. 8, 2007 / Header file day.h for the class dayType enum DaysOfaWeek {Sun, Mon, Tue, Wed, Thu, Fri, Sat}; / Enumerated data type for the day of a week class dayType { private: DaysOfaWeek day; / variable to store the day of a week
St. Cloud - CSCI - 201
CSCI 201: Fundamentals of Computer Science (Instructor: Pranava K. Jha) Solution to exercises on pointers and dynamic arrays1. Consider the following declarations: int i = 5, j = 7, *p = &amp;i, *q = &amp;j; float x = 2.0, y = 8.0, *r = &amp;x, *s = &amp;y; Mark t
St. Cloud - CSCI - 201
CSCI 201: Fundamentals of Computer Science Instructor: Pranava K. Jha Some simple exercises on linked listsIn all exercises below, a node has the following blueprint: struct nodeType { int info; nodeType* link; }; typedef nodeType* nodeTypePtr;1.
St. Cloud - CSCI - 201
CSCI 201: Fundamentals of Computer Science (Spring 2009) Instructor: Pranava K. Jha Quiz 5 (Wednesday, March 4) Determine the output in its content and form corresponding to execution of the following program. #include &lt;iostream&gt; using namespace std;