• 90 Pages 381notes
    381notes

    School: Washington

    Course: Discrete Math Model

    szxs us rmom k p{ywvtpqpnli j hgfgf%eydeIpG x w 1SeGyv V @ 0 s VX 2 F CIutrqp) h f ig@ d 0X F D H YX V ecbaC`EWU 2 0 %1) ( F H 0 @ P H F D B @ 8 6 4 TISRQIGECA9753 ' % $" & # ! cpqqGT b{Tavrc rb d{` n

  • 4 Pages Homework 1 Winter 2007 Solutions
    Homework 1 Winter 2007 Solutions

    School: Washington

    Course: Discrete Mathematical Modeling

    Math 381 Solutions for HW #1 Greenbaum January 17, 2007 Solutions for HW #1 1. (a) There are 5! = 120 ways to make a cycle starting at London and visiting 5 other cities. (b) We need to construct a minimal spanning tree for the following network. London 3

  • 2 Pages Homework 1 Winter 2007
    Homework 1 Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    n l " w( j g lr g ( ' r w( j m l( ( ( m l l l d n " ( i65pcfw_vrqsie)T$0)|p)ha56&z)v5v6&)i(Bq$0$ ( n " # d( ( ' l r l d ' gn l n " # g j 7 ' ' )0|q$T5a)pVq5v6|uiz(|ivg$vz|q$bvg@)3)s6 9)vvlvg@)e)eaf(|o)0$oBTq$3acfw_Vhraqsio)TVivgq6vo|pq$f)va@$x6 m g j 7 '

  • 1 Page Homework 2 Winter 2007
    Homework 2 Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    j ' (| "(8 x( p n p l n | " ' ( "(8 n p )~b)0)qdqp ob4)0q(~$07o(7)Q)" j n| # x n " ( # " ( p l p # ' ( p Qd$q"Qw(o8nQ)$b047)0QQq|$2&$q Qd)doQd$0( B p ( x( p p ' " p # ( p # " p p 6q0fdohzh! ~U~qd74q#40d4Qd )q$77d$#$q j6q0f$4)9ob97Q44Q$04d )q7$7d$q#$q 4)o

  • 8 Pages Midterm Exam Practice Winter 2007 Solutions
    Midterm Exam Practice Winter 2007 Solutions

    School: Washington

    Course: Discrete Mathematical Modeling

    g v r x mspe sx vx x tx v HWuf4hRyHuHwr`y` h t p js g ts g xx t r rj s s pe j t t j v r t x s t Hujs9Tis`vHwruHluiyrrHHiuf4wHrruHBwwWi hx s rj g p p g p p t WiHoyf!fyrrwj)4x vHrHmn&wuHpyrw#popi4ejkwrHuwqwscHu`yH(fy`uHu1piyfuwrh(v j j t tx p j t t t j x t

  • 4 Pages Midterm Exam Practice Winter 2007
    Midterm Exam Practice Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    T a r q ` X g rq g cq ga ` X agi g rq egg a X u U gq Xi qagqi X ra g rq g g q a v ag c y `g gi bbS1bdfdxbSGhdhpAhSdtGhdhdePdtnDfwthf`Shd) `g yig g ` Xq y c e ` X agi `g r U T ` w Xq q egq v ` cq qa gi v y ca a r q ` X g r 1)dphf`)bSdhiPpxxPAPp8XSXdPdvGbsg

  • 2 Pages Homework 6 Winter 2007
    Homework 6 Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    %1diu@ iu@ p@ 17 3 @A @ r1'ufB@ X1@ ) ! # Y5 m0 t$%$ 3 l @ ) e 9A l A0% 60"1 wr u 0%B%"%BX%x 1Ed1|d%asiYo5y%wozx l ~ cfw_ $ ) w tt # ) ( w) l ! w $ ! # ) v # ) # ) ! e l $ ! ) # d1v'%kx)%)%G% '%wa"65141d%kwv8%1%qmjk1t) ) # ) ( w l ) v ! v ! ) i1uV109pd

  • 5 Pages Homework 5 Winter 2007
    Homework 5 Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    p( i "(8 s " ' s "(8 s i tt "v s Cd2)0r)u6)74u#@8 0@$6ut$' ( p( ( 8 s i i s i t ( ( vf( ' s s # "t ( ' 8 # " ( eB(y7$duY6uv7nA60C6$ewy$ytBoQue7)y)e08 At # # (v # ( 5 ttv ( ' ( # " s (v v # " (8 (tA stt ( t p s " 4e0w2)0$lwB6$2$uus)4) 0wfhyn$0a$y!0ar8uv$

  • 2 Pages Homework 4 Winter 2007
    Homework 4 Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    n( ( l # " A ( ' mmt@)8776$"t$~7$r$V!m)0m BB mf BBf Cf CB Bf CBf 7BB BBBf BBBf BB BB $ 8 ( ' A ( ' " n " ( 8 # n ~06m~7)"~$~)$70o(0v6m&)Xk h ( # ( n 0mVm 8$)mB@V)VV7i8~7!$V$f$V7Bm24m&XCh ' 9 ( l A 8 ' ( n g ( )m 8 ' ( # ( n ( l ' ( l ( # n # ' ( # $)008~

  • 3 Pages Homework 3 Winter 2007
    Homework 3 Winter 2007

    School: Washington

    Course: Discrete Mathematical Modeling

    6$5$V )~ ) $~ 5) C ! f f$ s )~ )60 s5A f5A6$ 06 $ 06 ~ ~ f$ 6A$) s6 ! $ 06 ~ ~ A$ 0 5 )p 5 P )0 )f~ fpfud`65$0 ~ 5A$)s)$06 ~ ~ ~ f5Cg~ $C 5AH! 06560~ ~ ~ fC$ 506s~ 6$5$ $0) 5 ~ j f5A`6~ o cfw_ o (|cfw_0( ' (y r( ' ( # # " (7 B cfw_ n # ( l cfw_r vr v '(y

  • 7 Pages Homework 3 Winter 2007 Solutions
    Homework 3 Winter 2007 Solutions

    School: Washington

    Course: Discrete Mathematical Modeling

    Math 381 Solutions to HW #3 Greenbaum February 4, 2007 Solutions for HW #3 Problem 1 One way to make a discrete random variable K taking values 1 . . . 6 from a uniform(0,1) variable U is to break the interval [0,1] into sixths and see which sixth K lands

Back to course listings