Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Similar documents
Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Tangram Fractions Overview: Students will analyze standard and nonstandard

d e c b a d c b a d e c b a a c a d c c e b

The University of Sydney MATH 2009

Weighted Graphs. Weighted graphs may be either directed or undirected.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e

Probability. Probability. Curriculum Ready ACMSP: 225, 226, 246,

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

QUESTIONS BEGIN HERE!

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

Decimals DECIMALS.

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

In which direction do compass needles always align? Why?

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT

(Minimum) Spanning Trees

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

G-001 CHATHAM HARBOR AUNT LYDIA'S COVE CHATHAM ATLANTIC OCEAN INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 500' CANADA

Physics 222 Midterm, Form: A

QUESTIONS BEGIN HERE!

What do you know? Listen and find. Listen and circle. Listen and chant. Listen and say. Lesson 1. sheep. horse

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

SOCKET WELD OR THREADED BODY TYPE (3051SFP FLOWMETER SHOWN THROUGHOUT / 3051CFP, 2051CFP AVAILABLE)

THE EFFECT OF SEED AND SOIL APPLIED SYSTEMIC INSECTICIDES ON APHIDS IN SORGHUM. Texas Agricultural Experiment Station, Nueces County, 2000

CS 103 BFS Alorithm. Mark Redekopp

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

TCI SERIES, 3 CELL THE COOLING TOWER CO., L.C. TCI 3 CELL SERIES GA

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance

G-001 SACO SACO BAY BIDDEFORD INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 1000' CANADA MAINE STATE PLANE GEOGRAPHIC NO.

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

P001 FLOW TEST DATA PLUMBING MATERIALS AND NOTES 2018 NORTH CAROLINA ENERGY CONSERVATION CODE COMMISSIONING NOTE NCECC C408

Designing A Uniformly Loaded Arch Or Cable

1 I ( can / can t ) read a book, but I ( can / can t ) read a map. 2 They ( can / can t ) swim, but they ( can / can t ) pitch a tent.

OpenMx Matrices and Operators

SWAGELOK BRISTOL SOPFAB SOPFAB04-AR-271A/B SAMPLE TO ANALYSER SURPLUS TUBE CUTBACK TO SUIT AIR IN CAL 1 FLARE CAL 2 STEAM IN AIR IN

CEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

160 SSC Variable Speed Drive (Series C)

L E N BRN C102.1/ 250VAC R K C103.1/ 250VAC R K R (F) K101 K102 C101.1/250V D103 R (F) 1N4004 POWERUP U101 PS7341-1A

SAMPLE LITANY OF THE SAINTS E/G. Dadd9/F. Aadd9. cy. Christ, have. Lord, have mer cy. Christ, have A/E. Dadd9. Aadd9/C Bm E. 1. Ma ry and. mer cy.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Lecture 20: Minimum Spanning Trees (CLRS 23)

CS September 2018

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH

1 Introduction to Modulo 7 Arithmetic

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Probability The Language of Chance P(A) Mathletics Instant Workbooks. Copyright

Present state Next state Q + M N

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Yehuda Lindell Bar-Ilan University

I N A C O M P L E X W O R L D

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

ROSEMOUNT 3051S SCALABLE OR 3051SMV MULTIVARIABLE COPLANAR PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

EE1000 Project 4 Digital Volt Meter

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

7 ACM FOR FRAME 2SET 6 FRAME 2SET 5 ACM FOR MAIN FRAME 2SET 4 MAIN FRAME 2SET 3 POLE ASSLY 1 2 CROWN STRUCTURE ASSLY 1 1 CROWN ASSLY 1

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas


Problem 1. Solution: = show that for a constant number of particles: c and V. a) Using the definitions of P

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

ROOM NAME A2.0 A1.10 3'-8" UNIT 2A PROVIDE PERFORATED AND SLEEVED PIPE FOR CONNECTION TO FUTURE RADON MITIGATION SYSTEM. UNIT 1A UNIT 1A 104

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Solutions to Homework 5

(4, 2)-choosability of planar graphs with forbidden structures

MR 7 CONCRETE WASH EDGE BIKE RACKS FOR 20 BIKES MR 7 ELECTRICAL, PLUMBING, FIRE PROTECTION ENGINEER ATTENDANT BOOTH MR 8 EXISTING EQUIPMENT ENCLOSURE

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

CONNECTOR SYMBOL A SPLICE WIRE GAUGE CHART:

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister

STRUCTURAL GENERAL NOTES

Applications of trees

DOCUMENT STATUS: RELEASE

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

Biddle Consulting Group s Standard AAP Reports

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

F102 1/4 AMP +240 VDC SEE FIGURE 5-14 FILAMENT AND OVEN CKTS BLU J811 BREAK-IN TB103 TO S103 TRANSMITTER ASSOCIATED CAL OFF FUNCTION NOTE 2 STANDBY

Closed Monochromatic Bishops Tours

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

A L A BA M A L A W R E V IE W

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Contents: A The mean of continuous data [11.5] B Histograms [11.6] C Cumulative frequency [11.7]

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

Transcription:

Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1

Mt 166 WIR, Sprin 2012, Bnjmin urisp 2. In survy o 175 popl, it ws oun tt 86 orr pizz rom Pp Jon s in t pst mont, 96 not orr pizz rom Pizz Hut in t pst mont, n 138 orr pizz rom t lst on o t two. Fill in t Vnn irm low wit t orrt numr o popl in rion. PJ PH lult: () n(ph PJ) () n(ph PJ) () t numr o popl wo orr Pp Jons or i not orr Pizz Hut. 3. survy ws on o 250 popl out wtr ty v visit Europ, ri, or Sout mri. T ollowin inormtion ws oun. 45 popl v only n to Europ. 107 popl v n to Sout mri. 21 popl v n to Europ n Sout mri, ut not ri. 95 popl v n to xtly 1 o ts tr ontinnts. n( E S ) = 20 67 popl v n to ri or Sout mri, ut not Europ. 66 popl v n to Europ n ri. E S () How mny popl v n to Europ or Sout mri? () How mny popl v n to xtly 2 o t tr? 2

Mt 166 WIR, Sprin 2012, Bnjmin urisp 4. survy o oll stunts ws on out wt kin o ms (Monopoly, onnt Four, & Guss Wo) ty ply rowin up. T rsults r ivn low. 75 stunts ply Monopoly ut not Guss Wo. n((m ) ) = 44 73 stunts ply only Guss Wo or only Monopoly. 96 stunts i not ply Monopoly. n(m G ) = 17 64 stunts ply t lst two o ts tr ms. 107 stunts ply Guss Wo or onnt Four, ut not ot o tm. 21 stunts ply non o ts ms. M G () How mny stunts ply Monopoly n t lst on o t otr two ms? () lult n((g ) ) n sri in wors wt it rprsnts. () lult n(g ) n sri in wors wt it rprsnts. 5. Writ smpl sps or t ollowin xprimnts. () r is rwn t rnom rom stnr k o rs n t suit o t r is ror. () Two ir 5-si i r roll n t sum o t numrs roll is ror. () oin is toss, notin t si tt lns up. I t oin lns s, it is toss on mor. Otrwis t xprimnt ns. 3

Mt 166 WIR, Sprin 2012, Bnjmin urisp 6. n xprimnt onsists o rnomly sltin r rom stnr k n notin t olor o t r. I lk r is osn, oin is toss notin t si tt lns up. I r r is osn, ir 6-si i is roll osrvin t numr roll. () Wt is t smpl sp S or tis xprimnt. () Wt is t vnt E tt lk r is osn? () Wt is t vnt F tt n vn numr is roll? () r E n F mutully xlusiv? 7. n xprimnt onsists o tossin oin n osrvin t si tt lns up n tn rnomly sltin mrl rom jr ill wit 3 r, 3 lu, n 3 rn mrls n notin t olor. () Wt is t smpl sp or tis xprimnt? () Dtrmin t vnt E tt r mrl is rwn. () Dtrmin t vnt F tt til is toss or rn mrl is rwn. () r E n F mutully xlusiv vnts? () ssumin tis is uniorm smpl sp (it is), lult P(F). 4

Mt 166 WIR, Sprin 2012, Bnjmin urisp 8. r is rwn rom stnr k o rs. lult t proility o t ollowin vnts. () lk r is rwn. () r 3 is rwn. () Kin is not rwn. 9. Two ir 4-si i (on r, on lu) r roll n t numrs sown r osrv. () Wt is t smpl sp or tis xprimnt? () Writ t vnt E tt 3 is roll. () Wt is t proility tt t sum o t i is mor tn 5. () Fin t proility istriution or t PRODUT o t numrs roll on t i. 5

Mt 166 WIR, Sprin 2012, Bnjmin urisp 10. o Skittls ontins 13 yllow, 11 rn, 9 orn, 6 r, n 5 purpl. I r in n pull out on Skittl. (ssum Skittl is qully likly to osn.) () Fin t proility istriution or t olor o t Skittl pull. () lult t proility tt I will t rn or n orn. () lult t proility tt I will not t purpl. 11. rtin usinss ount t numr o -mils snt y its mploys on ivn y. T rsults r ivn in t tl low. Numr o E-mils 0-10 11-20 21-30 31-40 Mor tn 40 Numr o Employs 10 19 33 25 15 () Wt is t mpiril proility tt n mploy wo works or tis ompny will sn mor tn 30 mils on ivn y? () Wt is t mpiril proility tt n mploy wo works or tis ompny will sn t most 40 mils on ivn y? () Fin t mpiril proility istriution or t numr o mils snt y n mploy o tis ompny. 6