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.

2 Pages

Exam1_StudyGuide

Course: MATH 260, Fall 2009
School: illinoisstate.edu
Rating:

Word Count: 317

Document Preview

260 Math Fall 2008 H. Jordon Study Guide for Exam 1 In what follows is a brief synopsis of what we have covered in Sections 2.1, 2.2, 2.4, 2.5, 3.1, 3.2. Use this list a guide to help you make up your own study guide. On the exam, you can expect several proofs, TRUE/FALSE questions, and give-an-example-of type questions. The problems that have been assigned in class (but not necessarily collected) or very similar...

Register Now

Unformatted Document Excerpt

Coursehero

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.
260 Math Fall 2008 H. Jordon Study Guide for Exam 1 In what follows is a brief synopsis of what we have covered in Sections 2.1, 2.2, 2.4, 2.5, 3.1, 3.2. Use this list a guide to help you make up your own study guide. On the exam, you can expect several proofs, TRUE/FALSE questions, and give-an-example-of type questions. The problems that have been assigned in class (but not necessarily collected) or very similar problems could appear on the exam; therefore it is highly recommended that you make every effort to complete those problems. Exam 1 Topics: 1. Sets: showing two sets are equal, showing one set is a subset of another, set notation, setbuilder notation, finding the power set of a given set, the sets N, Z, Q, R. 2. Set operations: union, intersection, set difference, complement, symmetric difference, cartesian product. Given various sets, applying these operations. 3. De Morgan's Laws and Set Properties proving various set properties are true or finding a counter-example to show a statement is false. 4. Binary relations, reflexive, symmetric, transitive: showing that given a relation is reflexive, symmetric, or transitive or finding a counter-example to show that the relation does not satisfy any one of these properties. 5. Equivalence relations: determining whether a given relation is an equivalence relation, finding the equivalence classes. 6. The relationship between equivalence relations and partitions. 7. Definition of a function. 8. Surjections, injections, and bijections: showing that a function is one-to-one or onto. 9. Composition of functions: what is it, how is it defined. 10. The Division Algorithm, finding the "q" and the "r". 11. Definition of divides and properties of divi...

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:

illinoisstate.edu - MATH - 260
H. Jordon Math 260 Fall 2008Reading Assignment GuidelinesFor almost every class meeting this term, you will be given a reading assignment together with two or three questions to which you must respond. Below is a description of the requirements you will
illinoisstate.edu - MATH - 260
Math 260, Fall 2008 H. JordonExtra Homework ProblemsInstructions: Answer each of the following questions on a separate piece or pieces of paper. Each question is worth 5 points. You may work with each other to solve the problems but the final write-up m
illinoisstate.edu - MATH - 260
Fall 2008Math 260 Discrete MathematicsInstructor: Office: Phone: Email: Office Hours: Course Home Page: Dr. Heather Jordon Stevenson 339 4387838 hjordon@ilstu.edu (great way to ask me a question if you cannot come to office hours) 2:003:15 MW, and by ap
illinoisstate.edu - MATH - 260
Math 260 Fall 2008 H. JordonSolutions to Section 9.2 &amp; 9.3 Graded ProblemsSection 9.2: 2. (5 pts.) Prove by mathematical induction that 4(2n ) + 3 is a solution to the recurrence relation sn = 2sn-1 - 3 for n 1 with the initial condition s0 = 7. Proof.
UCSB - ES - 100
Ecologically Sustainable YieldMarine conservation requires a new ecosystem-based concept for fisheries management that looks beyond sustainable yield for individual fish speciesRichard W. Zabel, Chris J. Harvey, Stephen L. Katz, Thomas P. Good and Phill
GCSU - CBIS - 3210
Systems Analysis and Design in a Changing World, Fourth Edition22Learning ObjectivesxExplain the purpose and various phases of the systems development life cycle (SDLC) Explain when to use an adaptive approach to the SDLC in place of a more predictiv
Cornell - WEB - 105
Cornell - WEB - 105
Math 105 Prelim #2 October 28, 2004This exam has a formula sheet, 7 problems and 7 numbered pages. You have 90 minutes to complete this exam. Please read all instructions carefully, and check your answers. Show all work neatly and in order, and clearly i
Cornell - WEB - 105
Math 105, Fall 2004 Solutions to Prelim 21.(a) Henri has to take 3 bottles from 5+7=12, and the order in which they are taken doesn't matter. Therefore, there are 12 3 possible choices. (b) Henri has to choose 1 bottle from the 5 bottles of red and 2 bo
Cornell - WEB - 105
MATH 105 Prelim 2 and Solutions- Fall 2007Problem 1 - (15 total points) Consider an experiment where you roll two fair dice and add the two values together. (a) (5 points) Write down the sample space of the experiment above. Solution: All possible sums o
Cornell - WEB - 105
Prelim 1 SolutionsProblem 1 (Total 10 points) Give the least square line that has the best fit to the following data points: (0, 2), (1, -2), (2, -2) and (3, 2). Hint: Recall that the slope and y-intercept of the best fit line are given by the formulasn
Allan Hancock College - E - 1195288
Java 2 Network SecurityMarco Pistoia, Duane F. Reller Deepak Gupta, Milind Nagnur, Ashok K. RamaniInternational Technical Support Organization http:/www.redbooks.ibm.comSG24-2109-01SG24-2109-01International Technical Support Organization Java 2 Netwo
Naval Academy - IT - 430
IT430 Lab 2 - Network Protocols and Scanning Name _, _ Directions: Work in groups of 2 to complete this lab. Goals: - Learn how to use VMWare - Understand the importance of using secure network protocols - Understand why hackers can transport a great quan
Naval Academy - IT - 430
Scenario 1: Mobile Tactical Network for Special Operations Customer: J6, US Special Operations Command Support Staff: 1 Army officer and 20 brand-new enlisted troops with a mix of all services. You are tasked with designing a network for Special Operation
Naval Academy - IT - 430
Lab 14a Wireless Security Names _, _ Goals: Understand why wireless is not a secure method of transmission and how to mitigate security risks So you want to hack wireless. Here's hacking wireless in a few easy steps: 1. Wireless &quot;war drive&quot; to find juicy
Naval Academy - IT - 430
IT430 Lab 4 Gaining Network Access Names _, _ Directions: Work in groups of 2 to complete the following tasks and provide answers Goals: - Understand how hackers might use a listener program to gain access to a network - Understand how programs bypass ant
Naval Academy - IT - 430
IT430 Network and Firewall Lab Name _, _ This lab is to be completed in teams of 2, no more than 3. Goals: Understand basic networking components Connect a simple network Understand Cisco Commands Understand the difference between a host firewall and a ne
Naval Academy - IT - 430
IT430 - Information Assurance - Lab 11 - Digital Forensics Names _, _ Work in groups of 2 to complete this lab Goals: - Understand forensics chain of custody - Understand forensic techniques: Image Copying, Data Analysis, Network Traffic Analysis, Registr
Naval Academy - IT - 430
IT430 Lab 8 Penetration Testing Demo Name(s) _, _ Goals: - Analyze vulnerabilities and determine possible attack vectors for many of the exploits learned in class Part I Metasploit Open the each image and go to the initial snapshot for each Open Green-XP
Naval Academy - IT - 430
IT430 Lab 5 Linux and Unix Security Names _, _ Directions: Work in groups of 2 to complete the following tasks and provide answers Goals: - Understand the basic steps in improving the security on a Linux system Stopping unnecessary services/closing ports
Naval Academy - IT - 430
IT430 Lab 10 Password Cracking Name _, _ Directions: Complete these tasks in groups of two. Goals: - Understand the pros, cons and difference of relative speed of between dictionary, rainbow table and brute force attacks - Understand the concept of adding
Naval Academy - IT - 430
IT430 Information Assurance Lab 6 MS Windows and Vulnerability Scanning Names _, _ Directions: Work in groups of 2 to complete these tasks Goals: - Understand Security Aspects of Microsoft Windows Group Policies - Understand Analysis of Vulnerability Scan
Pensacola Junior College - ITECH - 2211
CHM 2211 Problem Set 13 Solutions Synthesis of Carboxylic Acid DerivativesI. 1.H3CComplete the following reactions. If no reaction occurs, write N.R.COOH CH3 SOCl2 CHCl3 CH3O C H3CCl CH3CH32.O CH3 C OHOH2SO4 heatCH3 C O C CH3 OO H2C H2C C O C
East Los Angeles College - MEET - 040524
StatusBower 5/24/04
GCSU - CBIS - 3210
Systems Analysis and Design in a Changing World, Fourth Edition1414Learning ObjectivesxDiscuss examples of system interfaces found in information systemsxDefine system inputs and outputs based on the requirements of the application programxDesign
Santa Clara - LSB - 06011
Chapter 7Reporting and Interpreting Cost of Goods Sold and InventoryANSWERS TO QUESTIONS1. Inventory often is one of the largest amounts listed under assets on the balance sheet which means that it represents a significant amount of the resources avail
University of Florida - IPM - 5305
Pesticides in the Environment (Learning Objectives) 1. Understand how pesticides enter the environment and the factors that affect them. 2. Define the terms, &quot;residue&quot; and &quot;tolerance.&quot; 3. Understand potential impacts of pesticides on sensitive areas: a. E
Stanford - ILPUBS - 384
Washington - PHYS - 2278
Lecture 25 Appendix B: Some sample problems from Boas Here are some solutions to the sample problems concerning solutions of 2 nd order differential equations, sometimes with time dependence as in Chapter 13.13.4: 2 Solutions: Here we consider the 1-D wa
Rutgers - ECE - 427
DISCRETE SEMICONDUCTORSDATA SHEETM3D1252N2222; 2N2222A NPN switching transistorsProduct specification Supersedes data of September 1994 File under Discrete Semiconductors, SC04 1997 May 29Philips SemiconductorsProduct specificationNPN switching tra
Purdue - CE - 691
# # # # # # # # # # # #
Washington University in St. Louis - ECON - 101
Final Exam: Economics 101 June 12, 2002READ THE INSTRUCTIONS: You have three hours. Do all 5 questions; each has equal weight. Please be sure to number each problem by number and part, especially if you choose to do them out of order. You will get credit
Washington University in St. Louis - ECON - 101
Final Exam Answers: Economics 101December 8, 1997 David K. Levine1. Normal Form Games (note that a complete answer must include a drawing of the socially feasible sets)a) L U D 2*,5* 0,0 R 0,0 5*,2*Two pure strategy equilibria as marked. Mixed for pla
Washington University in St. Louis - ECON - 101
Copyright (C) 2001 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of version 1 of the open text license amendment to version 2 of the GNU General Public License. The open text license amendment
Washington University in St. Louis - ECON - 101
Midterm Exam: Economics 101You have one hour and fifteen minutes. Do all 3 questions; each have equal weight. Good luck.February 10, 1997 David K. Levine1. Short AnswersFor each of the normal form games below, find all of the Nash equilibria. Which ar
Washington University in St. Louis - ECON - 101
Copyright (C) 2001 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of version 1 of the open text license amendment to version 2 of the GNU General Public License. The open text license amendment
University of Florida - GTLAX - 25
&gt; REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) &lt;1Preparation of Papers for IEEE TRANSACTIONS and JOURNALS (March 2004)First A. Author, Second B. Author, Jr., and Third C. Author, Member, IEEEAbstractThese instruc
VCU - GEN - 619
Power of the Classical Twin Design Revisited: II Detection of Common Environmental VariancePeter M. Visscher,1 Scott Gordon,1 and Michael C. Neale21 2Genetic Epidemiology, Queensland Institute of Medical Research, Brisbane, Australia Virginia Institute
Old Dominion - PHYS - 111
Chapter 6 Circular Motion and GravitationCircular MotionConsider an object moving at constant speed in a circle. The direction of motion is changing, so the velocity is changing. Therefore, the object is accelerating. The direction of the acceleration i
UMass (Amherst) - CS - 687
A. 1. SamuelAbstract: Two machine-learning procedures have been investigatedin some detail using the game ofcheckers. Enough work has been done to verify the fact that a computer can be programmed so that it will1learn to play a better game of checke
Allan Hancock College - CS - 501
COVER FEATUREThe Architecture of Virtual MachinesA virtual machine can support individual processes or a complete system depending on the abstraction level where virtualization occurs. Some VMs support flexible hardware usage and software isolation, whi
Allan Hancock College - CS - 501
A Case for End System MulticastYang-hua Chu, Sanjay G. Rao, and Hui Zhangfyhchu,sanjay,hzhangg@cs.cmu.eduCarnegie Mellon UniversityABSTRACTThe conventional wisdom has been that IP is the natural protocol layer for implementing multicast related funct
Allan Hancock College - CS - 501
Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing WorkloadKrishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan Department of Computer Science and Engineering University of Washington Sea
Allan Hancock College - CS - 501
Chord: A Scalable Peer-to-peer Lookup Service for Internet ApplicationsIon Stoica Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan ,MIT Laboratory for Computer Science chord@lcs.mit.edu http:/pdos.lcs.mit.edu/chord/AbstractA fundament
Allan Hancock College - CS - 501
Mesh-Based Content Routing using XMLAlex C. Snoeren, Kenneth Conley, and David K. GiffordMIT Laboratory for Computer Science Cambridge, MA 02139cfw_snoeren, conley, gifford@lcs.mit.edu AbstractWe have developed a new approach for reliably multicasting
Allan Hancock College - CS - 501
| | sIyy@v'4Iy6e4 #ssj# y Dy4d4ys#hs @sy4bs44 #ss#yRy4y | sy## 4mmos44 x y4 4m6 vsb#mmsv4 ' 'Ico#cfw_ssEs#yDs#es4y'y|s2cm | cfw_ s#@# s4ymymyssxsy cfw_ | 'h#mbRsym'yv!4s@y | | @msjs'mmp#y '@syyo | 4h#ysymymycmm#y c#y|#@# pcfw_s'mmp# yDy |
Allan Hancock College - CS - 501
A Framework for Scalable Global IP-Anycast (GIA)Dina Katabi, John WroclawskiMIT Laboratory for Computer Science 545 Technology Square Cambridge, MA 02139 cfw_dina,jtw@lcs.mit.eduABSTRACTThis paper proposes GIA, a scalable architecture for global IPany
Allan Hancock College - CS - 501
Active Names: Flexible Location and Transport of Wide-Area ResourcesAmin Vahdat Michael Dahlin Department of Computer Science Department of Computer Science Duke University University of Texas, Austin Thomas Anderson Amit Aggarwal Department of Computer
Allan Hancock College - CS - 501
Design and Evaluation of a Continuous Consistency Model for Replicated Services Haifeng Yu Amin Vahdatfyhf, vahdatg@cs.duke.edu http:/www.cs.duke.edu/fyhf, vahdatgAbstractThe tradeoffs between consistency, performance, and availability are well unders
Allan Hancock College - CS - 501
Network Working Group R. DanielRequest for Comments: 2168 Los Alamos National LaboratoryCategory: Experimental M. Mealling Network Solutions, Inc. June 1997 Resolution of Uniform Resource Identifiers using the Domain Name SystemStatus of this Memo
Allan Hancock College - CS - 501
Congestion Avoidance and ControlVan JacobsonLawrence Berkeley LaboratoryMichael J. KarelsUniversity of California at BerkeleyNovember, 1988IntroductionComputer networks have experienced an explosive growth over the past few years and with that grow
Allan Hancock College - CS - 501
Distributed Computing SeminarLecture 5: Graph Algorithms &amp; PageRankChristophe Bisciglia, Aaron Kimball, &amp; Sierra Michels-Slettvet Summer 2007Except as otherwise noted, the content of this presentation is 2007 Google Inc. and licensed under the Creative
Allan Hancock College - CS - 501
Distributed Computing SeminarLecture 2: MapReduce Theory and ImplementationChristophe Bisciglia, Aaron Kimball, &amp; Sierra Michels-SlettvetSummer 2007Except as otherwise noted, the contents of this presentation are Copyright 2007 University of Washingto
Allan Hancock College - CS - 402
MapReduce: Simplied Data Processing on Large ClustersJeffrey Dean and Sanjay Ghemawatjeff@google.com, sanjay@google.comGoogle, Inc.AbstractMapReduce is a programming model and an associated implementation for processing and generating large data sets
Allan Hancock College - CS - 101
Introduction to Algorithms, Second EditionThomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein The MIT Press Cambridge , Massachusetts London, England McGraw-Hill Book Company Boston Burr Ridge , IL Dubuque , IA Madison , WI New York San
Allan Hancock College - CS - 501
Dynamo: Amazons Highly Available Key-value StoreGiuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall and Werner VogelsAmazon.comABSTRACTReliability at mas
Allan Hancock College - CS - 101
Notes on Using gdb, the GNU Debugger Benjamin ZornUsing a symbolic debugger will make writing and debugging the programs you will write in this course much easier. The best debugger to use with the version of C+ we are using in this class is gdb, the GNU
Allan Hancock College - CS - 501
The Chubby lock service for loosely-coupled distributed systemsMike Burrows, Google Inc.AbstractWe describe our experiences with the Chubby lock service, which is intended to provide coarse-grained locking as well as reliable (though low-volume) storag
Grand Valley State - CS - 656
Distributed Deadlock DetectionK. MANI CHANDY and JAYADEV MISRA University of Texas and LAURA M. HAASIBMDistributed deadlock models are presented for resource and communication deadlocks. Simple distributed algorithms for detection of these deadlocks ar
Iowa State - UI - 181
I. refinement A. definition- REFINEMENT GIVES A STRONGER SPECIFICATIONA specification S1 is refined by S2 (S1 &lt;= S2)if and only if every correct implementation of S2is a correct implementation of S1.A refinement is &quot;plug compatible&quot;; this includes
Iowa State - UI - 181
I. Specifications (Cohen's chapter 4) A. what is programming? (omit)- EQUATION WITH UNKNOWN SPECIFIEDconsider x*x + b*x + c = 0could solve for x, b, or c!x: x*x + b*x + c = 0means solve for x in.-- WHAT IS PROGRAMMING?Programming is solving t