Compliments and Disjoint Events

Size: px
Start display at page:

Download "Compliments and Disjoint Events"

Transcription

1 Compliments and Disjoint Events p. 1/ Compliments and Disjoint Events Gene Quinn

2 Compliments and Disjoint Events p. 2/ Suppose E is an event. Then "E does not occur" is also an event.

3 Compliments and Disjoint Events p. 2/ Suppose E is an event. Then "E does not occur" is also an event. The new event "E does not occur" is called the compliment of E

4 Compliments and Disjoint Events p. 2/ Suppose E is an event. Then "E does not occur" is also an event. The new event "E does not occur" is called the compliment of E The compliment of the event E is denoted by E c.

5 Compliments and Disjoint Events p. 3/ Example: Suppose in the coin toss experiment E is the event "heads". The compliment of E, E c is the event "tails"

6 Compliments and Disjoint Events p. 3/ Example: Suppose in the coin toss experiment E is the event "heads". The compliment of E, E c is the event "tails" Now suppose E is the event "A two or a four is rolled" in the die roll.

7 Compliments and Disjoint Events p. 3/ Example: Suppose in the coin toss experiment E is the event "heads". The compliment of E, E c is the event "tails" Now suppose E is the event "A two or a four is rolled" in the die roll. E c is the event "A 1, 3, 5, or 6 is rolled" in the die roll.

8 Compliments and Disjoint Events p. 3/ Example: Suppose in the coin toss experiment E is the event "heads". The compliment of E, E c is the event "tails" Now suppose E is the event "A two or a four is rolled" in the die roll. E c is the event "A 1, 3, 5, or 6 is rolled" in the die roll. In the card draw, the compliment of "A face card" is the die set of 40 non-face cards.

9 Compliments and Disjoint Events p. 4/ Probability Rule: It is always true that P(E c ) = 1 P(E)

10 Compliments and Disjoint Events p. 4/ Probability Rule: It is always true that P(E c ) = 1 P(E) This is useful because often one of the events E and E c is easier to compute than the other.

11 Compliments and Disjoint Events p. 4/ Probability Rule: It is always true that P(E c ) = 1 P(E) This is useful because often one of the events E and E c is easier to compute than the other. Sometimes the compliment E c is easier to compute than E, and some times E is easier.

12 Compliments and Disjoint Events p. 5/ To compute the probability of the event "A number less than 6 is rolled", we could add the probabilities of the five numbers 1,2,3,4,5: P(E) = P(1) + P(2) + P(3) + P(4) + P(5)

13 Compliments and Disjoint Events p. 5/ To compute the probability of the event "A number less than 6 is rolled", we could add the probabilities of the five numbers 1,2,3,4,5: P(E) = P(1) + P(2) + P(3) + P(4) + P(5) By noticing that this is the compliment of the event "A 6 is rolled", we can also compute this as: P(E) = 1 P(E c ) = 1 P(6)

14 Compliments and Disjoint Events p. 5/ To compute the probability of the event "A number less than 6 is rolled", we could add the probabilities of the five numbers 1,2,3,4,5: P(E) = P(1) + P(2) + P(3) + P(4) + P(5) By noticing that this is the compliment of the event "A 6 is rolled", we can also compute this as: P(E) = 1 P(E c ) = 1 P(6) The identity P(E c ) = 1 P(E) allows us to always compute the easier probability.

15 Compliments and Disjoint Events p. 6/ Disjoint Events Recall that all points in the sample space S are considered to be events, but not all events are in the sample space.

16 Compliments and Disjoint Events p. 6/ Disjoint Events Recall that all points in the sample space S are considered to be events, but not all events are in the sample space. Some events represent the occurrence of more than one point in the sample space.

17 Compliments and Disjoint Events p. 6/ Disjoint Events Recall that all points in the sample space S are considered to be events, but not all events are in the sample space. Some events represent the occurrence of more than one point in the sample space. The sample space for the card draw contains 52 elements corresponding to the cards in a standard deck. Each card is considered an event.

18 Compliments and Disjoint Events p. 6/ Disjoint Events Recall that all points in the sample space S are considered to be events, but not all events are in the sample space. Some events represent the occurrence of more than one point in the sample space. The sample space for the card draw contains 52 elements corresponding to the cards in a standard deck. Each card is considered an event. However, there are other events in addition to the 52 individual cards, such as "an ace" or "a space".

19 Compliments and Disjoint Events p. 6/ Disjoint Events Recall that all points in the sample space S are considered to be events, but not all events are in the sample space. Some events represent the occurrence of more than one point in the sample space. The sample space for the card draw contains 52 elements corresponding to the cards in a standard deck. Each card is considered an event. However, there are other events in addition to the 52 individual cards, such as "an ace" or "a space". These are aggregates of elements in the sample space, but are not considered to be part of the sample space themselves.

20 Compliments and Disjoint Events p. 7/ Disjoint Events Two events E and F are called disjoint if they have no elements of the sample space in common.

21 Compliments and Disjoint Events p. 7/ Disjoint Events Two events E and F are called disjoint if they have no elements of the sample space in common. In the die roll, the events E = {1, 2} and F = {5, 6} are disjoint.

22 Compliments and Disjoint Events p. 7/ Disjoint Events Two events E and F are called disjoint if they have no elements of the sample space in common. In the die roll, the events E = {1, 2} and F = {5, 6} are disjoint. The events {1, 2, 3} and {3, 4} are not disjoint because 3 belongs to both events.

23 Compliments and Disjoint Events p. 7/ Disjoint Events Two events E and F are called disjoint if they have no elements of the sample space in common. In the die roll, the events E = {1, 2} and F = {5, 6} are disjoint. The events {1, 2, 3} and {3, 4} are not disjoint because 3 belongs to both events. Two disjoint events cannot occur in the same trial of an experiment, so for disjoint events, P(E or F) = P(E) + P(F)

24 Compliments and Disjoint Events p. 8/ Disjoint Events For two non-disjoint events E and F the formula is slightly different: P(E or F) = P(E) + P(F) P(E and F)

25 Compliments and Disjoint Events p. 8/ Disjoint Events For two non-disjoint events E and F the formula is slightly different: P(E or F) = P(E) + P(F) P(E and F) For disjoint events, P(E and F) = 0 so the two formulas are consistent.

Solution: It may be helpful to list out exactly what is in each of these events:

Solution: It may be helpful to list out exactly what is in each of these events: MATH 5010(002) Fall 2017 Homework 1 Solutions Please inform your instructor if you find any errors in the solutions. 1. You ask a friend to choose an integer N between 0 and 9. Let A = {N 5}, B = {3 N

More information

UNC Charlotte 2010 Comprehensive

UNC Charlotte 2010 Comprehensive 00 Comprehensive March 8, 00. A cubic equation x 4x x + a = 0 has three roots, x, x, x. If x = x + x, what is a? (A) 4 (B) 8 (C) 0 (D) (E) 6. For which value of a is the polynomial P (x) = x 000 +ax+9

More information

Random Simulation Simulation Modeling

Random Simulation Simulation Modeling Random Simulation 5.1 86 Simulation Modeling Goal: Use probabilistic methods to analyze deterministic and probabilistic models. Example. Determine the best elevator delivery scheme. The wait is too long,

More information

Heads Up! (Continued)

Heads Up! (Continued) . Name Date A c t i v i t y 6 Heads Up! (Continued) In this activity, you will do more experiments with simulations and use a calculator program that will quickly simulate multiple coin tosses. The Problem

More information

Discrete Mathematics and Probability Theory Fall 2013 Midterm #2

Discrete Mathematics and Probability Theory Fall 2013 Midterm #2 CS 70 Discrete Mathematics and Probability Theory Fall 013 Midterm # 1. (30 points) Short Answer. No justification necessary. Please write only the answer in the space provided after each question. Please

More information

Problem Set 4 Solutions

Problem Set 4 Solutions Design and Analysis of Algorithms March 5, 205 Massachusetts Institute of Technology 6.046J/8.40J Profs. Erik Demaine, Srini Devadas, and Nancy Lynch Problem Set 4 Solutions Problem Set 4 Solutions This

More information

CIS192 Python Programming

CIS192 Python Programming CIS192 Python Programming Probability, Simulations & Course Wrap-Up Raymond Yin University of Pennsylvania December 8, 2016 Raymond Yin (University of Pennsylvania) CIS 192 December 8, 2016 1 / 21 Outline

More information

Confidence Intervals. Dennis Sun Data 301

Confidence Intervals. Dennis Sun Data 301 Dennis Sun Data 301 Statistical Inference probability Population / Box Sample / Data statistics The goal of statistics is to infer the unknown population from the sample. We ve already seen one mode of

More information

If statements and For loops

If statements and For loops Advanced Random Simulation 5.1 89 If statements and For loops In order to incorporate more complex aspects into the model, use If statements and For loops. If[condition,t,f] Advanced Random Simulation

More information

6.842 Randomness and Computation September 25-27, Lecture 6 & 7. Definition 1 Interactive Proof Systems (IPS) [Goldwasser, Micali, Rackoff]

6.842 Randomness and Computation September 25-27, Lecture 6 & 7. Definition 1 Interactive Proof Systems (IPS) [Goldwasser, Micali, Rackoff] 6.84 Randomness and Computation September 5-7, 017 Lecture 6 & 7 Lecturer: Ronitt Rubinfeld Scribe: Leo de Castro & Kritkorn Karntikoon 1 Interactive Proof Systems An interactive proof system is a protocol

More information

Skip Lists S 3 S 2 S 1. Skip Lists Goodrich, Tamassia

Skip Lists S 3 S 2 S 1. Skip Lists Goodrich, Tamassia Skip Lists S 3 15 15 23 10 15 23 36 Skip Lists 1 What is a Skip List A skip list for a set S of distinct (key, element) items is a series of lists,,, S h such that Each list S i contains the special keys

More information

1. The Normal Distribution, continued

1. The Normal Distribution, continued Math 1125-Introductory Statistics Lecture 16 10/9/06 1. The Normal Distribution, continued Recall that the standard normal distribution is symmetric about z = 0, so the area to the right of zero is 0.5000.

More information

Statistical Computing

Statistical Computing SERIES I ARTICLE Statistical Computing 1. Understanding Randomness and Random Numbers Sudhakar Kunte Elements of statistical computing are discussed in this series. We begin with the notion of random numbers

More information

Section 6.3: Further Rules for Counting Sets

Section 6.3: Further Rules for Counting Sets Section 6.3: Further Rules for Counting Sets Often when we are considering the probability of an event, that event is itself a union of other events. For example, suppose there is a horse race with three

More information

CS 31: Intro to Systems Binary Arithmetic. Kevin Webb Swarthmore College January 26, 2016

CS 31: Intro to Systems Binary Arithmetic. Kevin Webb Swarthmore College January 26, 2016 CS 31: Intro to Systems Binary Arithmetic Kevin Webb Swarthmore College January 26, 2016 Reading Quiz Unsigned Integers Suppose we had one byte Can represent 2 8 (256) values If unsigned (strictly non-negative):

More information

Intro to Contemporary Math

Intro to Contemporary Math Intro to Contemporary Math Conditional Probability Intro Department of Mathematics UK Announcement You have a homework assignment due next Monday. Sequences of Experiments Suppose two experiments are performed,

More information

CSE 21 Math for Algorithms and Systems Analysis. Lecture 14 Review of Random Variables

CSE 21 Math for Algorithms and Systems Analysis. Lecture 14 Review of Random Variables CSE 21 Math for Algorithms and Systems Analysis Lecture 14 Review of Random Variables Outline Probability spaces DefiniFon of a random variable DistribuFon funcfon of a random variable Expected Value of

More information

Topic 3: Fractions. Topic 1 Integers. Topic 2 Decimals. Topic 3 Fractions. Topic 4 Ratios. Topic 5 Percentages. Topic 6 Algebra

Topic 3: Fractions. Topic 1 Integers. Topic 2 Decimals. Topic 3 Fractions. Topic 4 Ratios. Topic 5 Percentages. Topic 6 Algebra Topic : Fractions Topic Integers Topic Decimals Topic Fractions Topic Ratios Topic Percentages Duration / weeks Content Outline PART (/ week) Introduction Converting Fractions to Decimals Converting Decimals

More information

UNC Charlotte 2004 Comprehensive

UNC Charlotte 2004 Comprehensive March 8, 2004 1 Which of the following lines has a slope that is less than the sum of its x- and y- intercepts? (A) y = 2x + 1 (B) y = 3x/2 1 (C) y = 4x 1 (D) y = 4x + 16/3 (E) y = 3x 2 Suppose a and b

More information

SECTION A / 1. Any point where graph of linear equation in two variables cuts x-axis is of the form. (a) (x, y) (b) (0, y) (c) (x, 0) (d) (y, x)

SECTION A / 1. Any point where graph of linear equation in two variables cuts x-axis is of the form. (a) (x, y) (b) (0, y) (c) (x, 0) (d) (y, x) SECTION A / Question numbers 1 to 8 carry 1 mark each. For each question, four alternative choices have been provided, of which only one is correct. You have to select the correct choice. 1 8 1 1. Any

More information

CS 31: Introduction to Computer Systems. 03: Binary Arithmetic January 29

CS 31: Introduction to Computer Systems. 03: Binary Arithmetic January 29 CS 31: Introduction to Computer Systems 03: Binary Arithmetic January 29 WiCS! Swarthmore Women in Computer Science Slide 2 Today Binary Arithmetic Unsigned addition Subtraction Representation Signed magnitude

More information

A. Incorrect! This would be the negative of the range. B. Correct! The range is the maximum data value minus the minimum data value.

A. Incorrect! This would be the negative of the range. B. Correct! The range is the maximum data value minus the minimum data value. AP Statistics - Problem Drill 05: Measures of Variation No. 1 of 10 1. The range is calculated as. (A) The minimum data value minus the maximum data value. (B) The maximum data value minus the minimum

More information

1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula

1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),

More information

EOC Review. Parallelogram Properties. Find the value of x and y in the following parallelograms

EOC Review. Parallelogram Properties. Find the value of x and y in the following parallelograms Parallelogram Properties Find the value of x and y in the following parallelograms. 1.. 2. 3. 4. GHIJ is a rectangle. Find the value of x. Could the following quadrilaterals be parallelograms? Provide

More information

Mathematics (A) (B) (C) (D) 2. In with usual notations, if a,b,c are in A.P. then (A) (B) (C) (D) 3. If then at is (A) (B) (C) (D)

Mathematics (A) (B) (C) (D) 2. In with usual notations, if a,b,c are in A.P. then (A) (B) (C) (D) 3. If then at is (A) (B) (C) (D) / MHT CET 2018 / Mathematics / Code 44 / QP Mathematics Single Correct Questions +2 0 1. 2. In with usual notations, if a,b,c are in A.P. then 3. If then at is 4. The number of solutions of in the interval

More information

11 Sets II Operations

11 Sets II Operations 11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric

More information

Double Click in in this space to open the the Calculator/Formula

Double Click in in this space to open the the Calculator/Formula TASK #2 Math II - FATHOM 10 coin Flips (How many coins would you predict land on heads?) Open a new Fathom Workspace. Drag a collection,, from the shelf into the workspace. Open the collection by positioning

More information

Linked Lists, Stacks, and Queues

Linked Lists, Stacks, and Queues Department of Computer Science and Engineering Chinese University of Hong Kong In a nutshell, a data structure describes how data are stored in memory, in order to facilitate certain operations. In all

More information

Counting. Andreas Klappenecker

Counting. Andreas Klappenecker Counting Andreas Klappenecker Counting k = 0; for(int i=1; i

More information

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved. 3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.1 Graphing Systems of Linear Inequalities in Two Variables Copyright Cengage Learning. All rights reserved.

More information

Partial Derivatives (Online)

Partial Derivatives (Online) 7in x 10in Felder c04_online.tex V3 - January 21, 2015 9:44 A.M. Page 1 CHAPTER 4 Partial Derivatives (Online) 4.7 Tangent Plane Approximations and Power Series It is often helpful to use a linear approximation

More information

CHAPTER 1 GETTING STARTED

CHAPTER 1 GETTING STARTED GETTING STARTED WITH EXCEL CHAPTER 1 GETTING STARTED Microsoft Excel is an all-purpose spreadsheet application with many functions. We will be using Excel 97. This guide is not a general Excel manual,

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting This week s menu is divided into two sections. The first part is a set of appetizer problems which can all be solved using a straight-forward application of concepts covered in class. The second part consists

More information

Discrete Mathematics Course Review 3

Discrete Mathematics Course Review 3 21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has

More information

16-17 entrance exam for grade 7 going to 8

16-17 entrance exam for grade 7 going to 8 Page 1 of 11 16-17 entrance eam for grade 7 going to 8 1. 3,672 + 389 = 4,061 2. 5,733 + 79 = 5,812 3. 705 524 = 181 4. 804 356 = 448 5. 5,200 2,461 = 2,739 6. 2 3 = 6 7. 9 6 = 54 8. 8 8 = 64 9. 36 3 108

More information

(Coins & Distributions & Bias s)

(Coins & Distributions & Bias s) (Coins & Distributions & Bias s) If you were to take 10 coins and flip them and count the heads, how many coins would you expect to be heads up? Try a brief experiment. Flip 10 coins, count the number

More information

Data 8 Final Review #1

Data 8 Final Review #1 Data 8 Final Review #1 Topics we ll cover: Visualizations Arrays and Table Manipulations Programming constructs (functions, for loops, conditional statements) Chance, Simulation, Sampling and Distributions

More information

Question 1. A Digital Scale

Question 1. A Digital Scale Question 1. A Digital Scale A digital scale that provides weights to the nearest gram is used. (a) What is the sample space for this experiment? a. The positive integers Let denote the event that a weight

More information

In this lecture we discuss the complexity of approximation problems, and show how to prove they are NP-hard.

In this lecture we discuss the complexity of approximation problems, and show how to prove they are NP-hard. In this lecture we discuss the complexity of approximation problems, and show how to prove they are NP-hard. 1 We will show how one can prove such results and then apply this technique to some approximation

More information

Module 2: Choice and Iteration

Module 2: Choice and Iteration Module 2: Choice and Iteration Ron K. Cytron * Department of Computer Science and Engineering * Washington University in Saint Louis Thanks to Alan Waldman for comments that improved these slides Prepared

More information

Announcements. Unit 2: Probability and distributions Lecture 1: Probability and conditional probability. Statistics 101. Survey.

Announcements. Unit 2: Probability and distributions Lecture 1: Probability and conditional probability. Statistics 101. Survey. Anuncements Anuncements Unit 2: and distributions Lecture 1: and conditional probability Statistics 101 Mine Çetinkaya-Rundel September 10, 2013 PS1 due Thursday. TA office hours: Christine: Monday 5-7pm

More information

Graph Contraction. Graph Contraction CSE341T/CSE549T 10/20/2014. Lecture 14

Graph Contraction. Graph Contraction CSE341T/CSE549T 10/20/2014. Lecture 14 CSE341T/CSE549T 10/20/2014 Lecture 14 Graph Contraction Graph Contraction So far we have mostly talking about standard techniques for solving problems on graphs that were developed in the context of sequential

More information

(f) d={ alchemist :( a, t ), shaman : ( s, n ), wizard : ( w, z )} d[ shaman ][1]

(f) d={ alchemist :( a, t ), shaman : ( s, n ), wizard : ( w, z )} d[ shaman ][1] CSCI1101 Final Exam December 18, 2018 Solutions 1. Determine the value and type of each of the expressions below. If the question has two lines, assume that the statement in the first line is executed,

More information

CS 320 Midterm Exam. Fall 2018

CS 320 Midterm Exam. Fall 2018 Name: BU ID: CS 320 Midterm Exam Fall 2018 Write here the number of the problem you are skipping: You must complete 5 of the 6 problems on this exam for full credit. Each problem is of equal weight. Please

More information

Section Sets and Set Operations

Section Sets and Set Operations Section 6.1 - Sets and Set Operations Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase

More information

Programming for Engineers Functions

Programming for Engineers Functions Programming for Engineers Functions ICEN 200 Spring 2018 Prof. Dola Saha 1 Introduction Real world problems are larger, more complex Top down approach Modularize divide and control Easier to track smaller

More information

Loop-Body Returns. Another way to terminate a loop.

Loop-Body Returns. Another way to terminate a loop. 12. Loops and Logic Topics: Loop-Body Return The Idea of a Random Walk Showcase: Open-Ended Iteration Showcase: Computing Averages Showcase: Top-Down Development Loop-Body Returns Loop-Body Returns Another

More information

Conditional Probability, Random Variables, Loops and Conditionals

Conditional Probability, Random Variables, Loops and Conditionals Version 4.6.2 The Sage Notebook raazesh.sainudiin Toggle Home Published Log Settings Help Report a Problem Sign out STAT221Week03 last edited on April 04, 2011 02:39 PM by raazesh.sainudiin Save Save &

More information

Applications. 72 Variables and Patterns

Applications. 72 Variables and Patterns Applications. Sean bought a DVD player and a receiver. The store offered him an interest-free payment plan with weekly installments. Sean figured out that after n weeks of payments, he would still owe

More information

Chapter 6 Normal Probability Distributions

Chapter 6 Normal Probability Distributions Chapter 6 Normal Probability Distributions 6-1 Review and Preview 6-2 The Standard Normal Distribution 6-3 Applications of Normal Distributions 6-4 Sampling Distributions and Estimators 6-5 The Central

More information

Objectives/Outcomes. Introduction: If we have a set "collection" of fruits : Banana, Apple and Grapes.

Objectives/Outcomes. Introduction: If we have a set collection of fruits : Banana, Apple and Grapes. 1 September 26 September One: Sets Introduction to Sets Define a set Introduction: If we have a set "collection" of fruits : Banana, Apple Grapes. 4 F={,, } Banana is member "an element" of the set F.

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 32 Multiple Server Queueing Models In this lecture, we continue our discussion

More information

Linked List Implementation of Queues

Linked List Implementation of Queues Outline queue implementation: linked queue application of queues and stacks: data structure traversal double-ended queues application of queues: simulation of an airline counter random numbers recursion

More information

Today s outline: pp

Today s outline: pp Chapter 3 sections We will SKIP a number of sections Random variables and discrete distributions Continuous distributions The cumulative distribution function Bivariate distributions Marginal distributions

More information

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets. SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,

More information

You ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation

You ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation Unit 5 SIMULATION THEORY Lesson 39 Learning objective: To learn random number generation. Methods of simulation. Monte Carlo method of simulation You ve already read basics of simulation now I will be

More information

1.3 Graphical Summaries of Data

1.3 Graphical Summaries of Data Arkansas Tech University MATH 3513: Applied Statistics I Dr. Marcel B. Finan 1.3 Graphical Summaries of Data In the previous section we discussed numerical summaries of either a sample or a data. In this

More information

Further Differentiation

Further Differentiation Worksheet 39 Further Differentiation Section Discriminant Recall that the epression a + b + c is called a quadratic, or a polnomial of degree The graph of a quadratic is called a parabola, and looks like

More information

CSE 613: Parallel Programming. Lecture 11 ( Graph Algorithms: Connected Components )

CSE 613: Parallel Programming. Lecture 11 ( Graph Algorithms: Connected Components ) CSE 61: Parallel Programming Lecture ( Graph Algorithms: Connected Components ) Rezaul A. Chowdhury Department of Computer Science SUNY Stony Brook Spring 01 Graph Connectivity 1 1 1 6 5 Connected Components:

More information

2.1 Symbols and Terminology

2.1 Symbols and Terminology 2.1 Symbols and Terminology A is a collection of objects or things. The objects belonging to the are called the, or. - : there is a way of determining for sure whether a particular item is an element of

More information

UNC Charlotte 2010 Comprehensive

UNC Charlotte 2010 Comprehensive 00 Comprehensive with solutions March 8, 00. A cubic equation x 4x x + a = 0 has three roots, x, x, x. If x = x + x, what is a? (A) 4 (B) 8 (C) 0 (D) (E) 6 Solution: C. Because the coefficient of x is

More information

Graph Theory Questions from Past Papers

Graph Theory Questions from Past Papers Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory

More information

The Probabilistic Method

The Probabilistic Method The Probabilistic Method Po-Shen Loh June 2010 1 Warm-up 1. (Russia 1996/4 In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees

More information

CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions

CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam Sample Solutions Question 1: Cardinality How many distinct elements does the set S contain in each case? Check the appropriate

More information

Sorting. There exist sorting algorithms which have shown to be more efficient in practice.

Sorting. There exist sorting algorithms which have shown to be more efficient in practice. Sorting Next to storing and retrieving data, sorting of data is one of the more common algorithmic tasks, with many different ways to perform it. Whenever we perform a web search and/or view statistics

More information

Section The Law of Sines and the Law of Cosines

Section The Law of Sines and the Law of Cosines Section 7.3 - The Law of Sines and the Law of Cosines Sometimes you will need to solve a triangle that is not a right triangle. This type of triangle is called an oblique triangle. To solve an oblique

More information

Data Handling. Moving from A to A* Calculate the numbers to be surveyed for a stratified sample (A)

Data Handling. Moving from A to A* Calculate the numbers to be surveyed for a stratified sample (A) Moving from A to A* A* median, quartiles and interquartile range from a histogram (A*) Draw histograms from frequency tables with unequal class intervals (A) Calculate the numbers to be surveyed for a

More information

CS 4110 Programming Languages & Logics. Lecture 17 Programming in the λ-calculus

CS 4110 Programming Languages & Logics. Lecture 17 Programming in the λ-calculus CS 4110 Programming Languages & Logics Lecture 17 Programming in the λ-calculus 10 October 2014 Announcements 2 Foster Office Hours 11-12 Enjoy fall break! Review: Church Booleans 3 We can encode TRUE,

More information

Grade 6 Number Strand

Grade 6 Number Strand Grade 6 Number Strand Outcome 6.N.1. Demonstrate an understanding of place value for numbers greater than one million less than one thousandth [C, CN, R, T] 6.N.2. Solve problems involving large numbers,

More information

JUDGING STANDARDS IN YEAR 8

JUDGING STANDARDS IN YEAR 8 JUGING STANARS IN YAR 8 MATHMATIS Assessment pointers validate teachers professional judgement when reporting against a five-point scale. The pointers: are examples of evidence in relation to the achievement

More information

Info 2950, Lecture 6

Info 2950, Lecture 6 Info 2950, Lecture 6 14 Feb 2017 More Programming and Statistics Boot Camps? Prob Set 2: due Fri night 24 Feb Brief Summary Expectation value: E[X] = P s2s p(s)x(s) Variance: V [X] = P s2s p(s)(x(s) E[X])2

More information

Graphs and Linear Functions

Graphs and Linear Functions Graphs and Linear Functions A -dimensional graph is a visual representation of a relationship between two variables given by an equation or an inequality. Graphs help us solve algebraic problems by analysing

More information

February 23 Math 2335 sec 51 Spring 2016

February 23 Math 2335 sec 51 Spring 2016 February 23 Math 2335 sec 51 Spring 2016 Section 4.1: Polynomial Interpolation Interpolation is the process of finding a curve or evaluating a function whose curve passes through a known set of points.

More information

Graphs and networks Mixed exercise

Graphs and networks Mixed exercise Graphs and networks Mixed exercise E.g. 2 a, e and h are isomorphic. b and i are isomorphic. c and g are isomorphic. d and f are isomorphic. 3 a b i ii iii Pearson Education Ltd 208. Copying permitted

More information

3. Probability 51. probability A numerical value between 0 and 1 assigned to an event to indicate how often the event occurs (in the long run).

3. Probability 51. probability A numerical value between 0 and 1 assigned to an event to indicate how often the event occurs (in the long run). 3. Probability 51 3 Probability 3.1 Key Definitions and Ideas random process A repeatable process that has multiple unpredictable potential outcomes. Although we sometimes use language that suggests that

More information

This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.

This Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets. Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection

More information

ds dt ds 1 dt 1 dt v v v dt ds and the normal vector is given by N

ds dt ds 1 dt 1 dt v v v dt ds and the normal vector is given by N Normal Vectors and Curvature In the last section, we stated that reparameterization by arc length would help us analyze the twisting and turning of a curve. In this section, we ll see precisely how to

More information

4.2 Function definitions the basics

4.2 Function definitions the basics 4.2. FUNCTION DEFINITIONS THE BASICS 89 4.2 Function definitions the basics There are three questions you must answer before you can write a function definition: What will the function do? What inputs

More information

LSP 121. LSP 121 Math and Tech Literacy II. Topics. Loops. Loops. Loops

LSP 121. LSP 121 Math and Tech Literacy II. Topics. Loops. Loops. Loops LSP 121 Math and Tech Literacy II Greg Brewster DePaul University Topics The FOR loop Repeats a set of statements a fixed number of times The WHILE loop Repeats a set of statements until a condition is

More information

CS1800 Discrete Structures Final Version B

CS1800 Discrete Structures Final Version B CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 15, 2017 CS1800 Discrete Structures Final Version B Instructions: 1. The exam is closed book and closed notes. You may not use

More information

Chapter Summary. Recursively defined Functions. Recursively defined sets and Structures Structural Induction

Chapter Summary. Recursively defined Functions. Recursively defined sets and Structures Structural Induction Section 5.3 1 Chapter Summary Recursively defined Functions. Recursively defined sets and Structures Structural Induction 5.3 Recursive definitions and structural induction A recursively defined picture

More information

Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017

Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017 (1/25) MA284 : Discrete Mathematics Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017 1 Definitions 1. A graph 2. Paths and connected graphs 3. Complete graphs 4. Vertex degree

More information

Revision Topic 11: Straight Line Graphs

Revision Topic 11: Straight Line Graphs Revision Topic : Straight Line Graphs The simplest way to draw a straight line graph is to produce a table of values. Example: Draw the lines y = x and y = 6 x. Table of values for y = x x y - - - - =

More information

Definition 1.1. A matching M in a graph G is called maximal if there is no matching M in G so that M M.

Definition 1.1. A matching M in a graph G is called maximal if there is no matching M in G so that M M. 1 Matchings Before, we defined a matching as a set of edges no two of which share an end in common. Suppose that we have a set of jobs and people and we want to match as many jobs to people as we can.

More information

Lines and Planes in 3D

Lines and Planes in 3D Lines and Planes in 3D Philippe B. Laval KSU January 28, 2013 Philippe B. Laval (KSU) Lines and Planes in 3D January 28, 2013 1 / 20 Introduction Recall that given a point P = (a, b, c), one can draw a

More information

Modeling RNA/DNA with Matlab - Chemistry Summer 2007

Modeling RNA/DNA with Matlab - Chemistry Summer 2007 Modeling RNA/DNA with Matlab - Chemistry 694 - Summer 2007 If you haven t already, download MatlabPrograms.zip from the course Blackboard site and extract all the files into a folder on your disk. Be careful

More information

Parallel quicksort algorithms with isoefficiency analysis. Parallel quicksort algorithmswith isoefficiency analysis p. 1

Parallel quicksort algorithms with isoefficiency analysis. Parallel quicksort algorithmswith isoefficiency analysis p. 1 Parallel quicksort algorithms with isoefficiency analysis Parallel quicksort algorithmswith isoefficiency analysis p. 1 Overview Sequential quicksort algorithm Three parallel quicksort algorithms Isoefficiency

More information

Submit: Your group source code to mooshak

Submit: Your group source code to mooshak Tutorial 2 (Optional) Genetic Algorithms This is an optional tutorial. Should you decide to answer it please Submit: Your group source code to mooshak http://mooshak.deei.fct.ualg.pt/ up to May 28, 2018.

More information

Simulations How To for Fathom

Simulations How To for Fathom Simulations How To for Fathom. Start by grabbing a collection box (the picture of a treasure box) and drop it on your screen. You can double click on the word collection to rename it. 2. Click on your

More information

Chapter Four: Loops II

Chapter Four: Loops II Chapter Four: Loops II Slides by Evan Gallagher & Nikolay Kirov Chapter Goals To understand nested loops To implement programs that read and process data sets To use a computer for simulations Processing

More information

CHAPTER-13. Mining Class Comparisons: Discrimination between DifferentClasses: 13.4 Class Description: Presentation of Both Characterization and

CHAPTER-13. Mining Class Comparisons: Discrimination between DifferentClasses: 13.4 Class Description: Presentation of Both Characterization and CHAPTER-13 Mining Class Comparisons: Discrimination between DifferentClasses: 13.1 Introduction 13.2 Class Comparison Methods and Implementation 13.3 Presentation of Class Comparison Descriptions 13.4

More information

Lower Bound on Comparison-based Sorting

Lower Bound on Comparison-based Sorting Lower Bound on Comparison-based Sorting Different sorting algorithms may have different time complexity, how to know whether the running time of an algorithm is best possible? We know of several sorting

More information

Problem Dice program

Problem Dice program Activity 1 Problem Dice program Aim: Based on the Maths 00 activity Problem Dice, Introduce the Program app to simulate 100 rolls of the dice. Creating a program automates a sequence of instructions we

More information

1 Sets, Fields, and Events

1 Sets, Fields, and Events CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection

More information

Two Dimensional Array - An array with a multiple indexs.

Two Dimensional Array - An array with a multiple indexs. LAB5 : Arrays Objectives: 1. To learn how to use C array as a counter. 2. To learn how to add an element to the array. 3. To learn how to delete an element from the array. 4. To learn how to declare two

More information

Math 574 Review Exam #1

Math 574 Review Exam #1 Math 574 Review Exam 1 1. How many 8-card hands, dealt from a standard deck of 5, consist of: (a). 5 of one suit and 3 of another suit? (b). 4 each of two suits. (c). 3 of one suit, 3 of a second suit,

More information

ITCS 6150 Intelligent Systems. Lecture 5 Informed Searches

ITCS 6150 Intelligent Systems. Lecture 5 Informed Searches ITCS 6150 Intelligent Systems Lecture 5 Informed Searches Informed Searches We are informed (in some way) about future states and future paths We use this information to make better decisions about which

More information

Name Student Activity

Name Student Activity Open the TI-Nspire document Exponential_Dice.tns. Any quantity that grows or decays at a fixed rate at regular intervals grows or decays exponentially. Many real world phenomena can be modeled by exponential

More information

Binary Search. Roland Backhouse February 5th, 2001

Binary Search. Roland Backhouse February 5th, 2001 1 Binary Search Roland Backhouse February 5th, 2001 Outline 2 An implementation in Java of the card-searching algorithm is presented. Issues concerning the correctness of the implementation are raised

More information

1 Probability Review. CS 124 Section #8 Hashing, Skip Lists 3/20/17. Expectation (weighted average): the expectation of a random quantity X is:

1 Probability Review. CS 124 Section #8 Hashing, Skip Lists 3/20/17. Expectation (weighted average): the expectation of a random quantity X is: CS 124 Section #8 Hashing, Skip Lists 3/20/17 1 Probability Review Expectation (weighted average): the expectation of a random quantity X is: x= x P (X = x) For each value x that X can take on, we look

More information