Preprogrammed Voice Messages Incident Message Leader Activate DPS 1 Fire Temporal horn continuous-no voice message None 2 Tornado Tornado warning, take shelter Slow whoop Y 3 Active shooter Active Shooter, Police Responding, Stay in Place Attention Attention Y 4 General Alert WMU Alert, Check WMU homepage Attention Attention Y 5 This is a test This is a test of the emergency system Attention Attention Y 6 Test of fire alarm This is a test of the fire alarm Attention Attention Y 7 Test of active shooter This is a test of the active shooter alert 8 Test of tornado message This is a test of the tornado warning 9 Test of WMU Alert message This is a test of the WMU alert 10 All Clear test Testing has ended 11 All clear fire Fire emergency has ended 12 All clear general alert WMU alert has ended 13 All clear weather Tornado warning has ended 14 All clear active shooter Active shooter emergency has ended Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Attention Activat e Local Y Y Y Y Y Y Y Y Y Y Y Y Y
View full slide show

While Loop Sentinel Template (User Input): get input value while (input != end condition){ statements to be repeated get input value } User User Input Input Example: Example: ArrayList ArrayList guesses guesses == new new ArrayList(); ArrayList(); Scanner Scanner ss == new new Scanner(System.in); Scanner(System.in); String String guess guess == s.nextLine(); s.nextLine(); while while (!guess.equals(“quit”) (!guess.equals(“quit”) guesses.add(guess); guesses.add(guess); guess guess == s.nextLine(); s.nextLine(); }} // // get get input input value value && && !guess.equals(“exit”)){ !guess.equals(“exit”)){ // // add add line line to to array array list list // // get get input input value value Copyright © 2012 Pearson Education, Inc.
View full slide show

# include < iostream > // For cout and cin # include < string > // For string objects # include "Bag.h" // For ADT bag using namespace std; int main () { string clubs [] = {"Joker", "Ace", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King"}; // Create our bag to hold cards. Bag < string > grabBag; // Place six cards in the bag. grabBag.add (clubs [1]); grabBag.add (clubs [2]); grabBag.add (clubs [4]); grabBag.add (clubs [8]); grabBag.add (clubs [10]); grabBag.add (clubs [12]); // Get friends guess and check it. int guess = 0; while (!grabBag.isEmpty ()) { cout << "What is your guess?" << "(1 for Ace to 13 for King):"; cin >> guess; // Is card in the bag? if (grabBag.contains (clubs [guess])) { // Good guess remove card from the bag. cout << "You get the card!\n"; grabBag.remove (clubs [guess]); } else { cout << "Sorry, card was not in the bag.\n"; } // end if } // end while cout << "No more cards in the bag. Game over!\n"; return 0; } ; // end main
View full slide show

Figure 6.40 (continued) Assembly Language 0000 120003 BR 0003 0006 0009 000C 000F 0010 0013 0015 0017 0019 001B 001E 0021 0024 0027 002A 002D 0030 0033 ; ;******* main() guess: .EQUATE 580002 main: SUBSP 490034 STRO 330000 DECI CB0000 LDWX 0B ASLX 130013 BR 001B guessJT: .ADDRSS 0021 .ADDRSS 0027 .ADDRSS 002D .ADDRSS 490049 case0: STRO 120030 BR 490054 case1: STRO 120030 BR 49005B case2: STRO 120030 BR 490065 case3: STRO 500002 endCase: ADDSP 00 STOP main 0 2,i msgIn,d guess,s guess,s guessJT,x case0 case1 case2 case3 msg0,d endCase msg1,d endCase msg2,d endCase msg3,d 2,i ;local variable #2d ;push #guess ;printf("Pick a number 0..3: ") ;scanf("%d", &guess) ;switch (guess) ;two bytes per address ;printf("Not close\n") ;break ;printf("Close\n") ;break ;printf("Right on\n") ;break ;printf("Too high\n") ;pop #guess Copyright © 2017 by Jones & Bartlett Learning, LLC an Ascend Learning Company
View full slide show

Two questions:  What happens to the capacity reserved for the high paying segment, when the high paying segment starts paying about the low paying segment? – How much does the high paying segment value quick service?  We never consider the distribution of the demand for low paying segment when computing the reserved capacity for the high paying segment. Can this be correct, why? 12 utdallas.edu/~metin
View full slide show

Guess&Check Demo  Make a Time Guess, tGuess  Calc VGuess = V(tGuess)  Calc % Full for the Guess   V  t  109  108 1  e  t 100  rt Guess%   Vinit 109  Calc Difference del Goal%  Guess%  Guess AGAIN Engineering/Math/Physics 25: Computational Methods 9 Bruce Mayer, PE [email protected] • ENGR-25_HW-01_Solution.ppt
View full slide show

Functional Information Systems ctd. “Front-end” (Customer Interface) Systems • • these are important because? it’s easiest to answer this by contrasting an effective system with some common negative comments (and experiences) – – – – “I’m sorry, the system won’t let me do that” “I’m sorry, the system has no record of that” “I’m sorry, you don’t appear to be registered” “I’m sorry, the system is down and I can’t help you” – some of these responses may be due to “back-end” problems as we shall see later in the course, but some are because of front-end inadequacies www.infotech.monash.edu.au 20
View full slide show

Looping Statements Read in square Set guess to square/4 Set epsilon to 1 WHILE (epsilon > 0.001) Calculate new guess Set epsilon to abs(square - guess * guess) Write out square and the guess 26
View full slide show

Note that the random number is generate once outside the do loop while the user guess is prompted when you look back for JavaScript guess number game another try. I choose a do loop since I always

GUESS GAME

want to do the loop at least once.
View full slide show

All possible tables Truth Truth Guess Milk Tea Milk 1 . 4 4 Tea . . 8 Total 4 4 Milk Tea Total Milk 0 . 4 Tea . . Total 4 4 Guess Truth Guess Truth Total Milk Tea Milk 2 . 4 4 Tea . . 4 8 Total 4 4 8 Truth Milk Tea Total Milk 3 . 4 Tea . . Total 4 4 Guess Milk Tea Total Milk 4 . 4 4 Tea . . 4 8 Total 4 4 8 Guess Total
View full slide show

EXAMPLE Player 1 Player 2 x is chosen, please provide a guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess STOP! x = 37 1 3 10 28 76 Performance Ratio 118 / 37 = 3.189189
View full slide show

EXAMPLE Player 1 Player 2 x is chosen, please provide a guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess STOP! x=5 1 2 3 4 23 Performance Ratio (1+2+3+4+23) / 5 = 6.6
View full slide show

EXAMPLE Player 1 Player 2 x is chosen, please provide a guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess STOP! x = 48  = 0.419 exp() = 1 exp(+1) = 4 exp(+2) = 11 exp(+3) =30 exp(+4) = 83 Performance Ratio 129 / 48 = 2.6875
View full slide show

EXAMPLE Player 1 Player 2 x is chosen, please provide a guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess Smaller than x, next guess STOP! x = 63  = 0.866 exp() = 2 exp(+1) = 6 exp(+2) = 17 exp(+3) =47 exp(+4) = 129 Performance Ratio 201 / 63 = 3.190476
View full slide show

Substitution examples  T(n) = 2T(n/2) + kn, T(1)=c’ (e.g., merge sort)    T(n) = 2T(n/2) + k, T(1)=c’ (e.g., D&C search)    Guess T(n) <= c.nlgn does not work Guess T(n) <= c.nlgn +dn works for d>=c’, c>=k Guess T(n) <= cn does not work Guess T(n) <= cn-d works for d>=k, c>=d+c’ T(n) = 2T(√n) + k.lg n  Change variable first Must prove the exact form guessed; otherwise revise your guess
View full slide show

To understand the universe, scientists use the “Scientific Method” 1. Observe - Observe something. Write down the observations and make sure that other people can repeat them on their own. 2. Guess - Make a guess about how that something happens. The guess has to be in the form of an explanation that can be used in other contexts. The guess must help to make predictions about other observations. 3. Test and Criticize - Observe similar things to see if the guess (the explanation) is correct or needs to be modified. 4. Repeat - until you get it right.
View full slide show

The Power of the First Guess • The first guess (an earlier 6 or 12 hour forecast) is the model’s initial impression of the atmosphere’s current condition. • The first guess is innocent until proven guilty. • The first guess is most easily modified in datarich areas (i.e., CONUS) • The first guess is least easily modified in data poor areas (i.e. oceans, etc…)
View full slide show

Looping Statements Read in square Set guess to square/4 Set epsilon to 1 WHILE (epsilon > 0.001) Calculate new guess Set epsilon to abs(square - guess * guess) Write out square and the guess 26
View full slide show