Rocket Science: When playing your favorite space simulator game, you launch your most recent attempt at a rocket from sea level. The problem is that your graphics card drivers were corrupted and the only thing you could see was the velocity and time read outs and you recorded them in the table below:
Time (s) Velocity (m/s)
0 0
20 139
40 298
60 433
80 685
100 1026
120 1279
140 1373
160 1490
180 1634
200 1800
220 1986
240 2191
260 2417
280 2651
300 2915
320 2303
340 3516
360 3860
380 4216
400 4630
420 5092
440 5612
460 6184
480 6760
500 7327
520 7581
Numerical Integration
Using Simpsons rule and Trapezoid Rule determine the rockets approximate location at times:
o 120 s
o 240 s
o 360 s
o 520 s
• Display each result (8 total) using fprintf, display or something similar
• Comment on which estimates you have think is more accurate.
Numerical Differentiation
• Using first order forward, backwards and central differencing generate plots of the acceleration of the rocket over the entire launch for a time step of 40s and a time step of 20s.
o Display Results on 2 plots with 3 curves each (20s, 40s for plots) (forward, backwards and central differencing for curves).

Your task this week is to write a very simple spam classifier in python. it will classify messages as either spam (unwanted) or ham (wanted). the program will have a set of spam_words, words that are known to appear in spam messages. that set is included in the template file spam. pypreview the document. you will also define a spam threshold which reflects the allowed percentage of spam words in the message. you'll compute a 'spam indicator', which is the ratio of spam words to the total number of unique words in the message. if the spam indicator exceeds the spam threshold, the message is classified as spam. otherwise it is classified as ham. we'll assume that the spam threshold is a constant and has a value of 0.10. your program will prompt the user for a message and then will print the corresponding spam indicator with two decimal digits and the corresponding classification (spam or ham). the program will be case insensitive. the spam words are detected whether they are in lower case or upper case or mixed case. each word, spam or not, is counted once (even if it appears multiple times in the message.) the program will remove punctuation from the message before identifying the words and computing the spam indicator. for example '! ' must be identified as the spam word 'now'.

1. ask the user how many questions are in the quiz. 2. ask the user to enter the key (that is, the correct answers). there should be one answer for each question in the quiz, and each answer should be an integer. e. g., 34 7 13 100 81 3 9 10 321 12 might be the key for a 10-question quiz. you will need to store the key in an array. 3. ask the user to enter the answers for the quiz to be graded. there needs to be one answer for each question. note that these answers do not need to be stored; each answer can simply be compared to the key as it is entered. 4. when the user has entered all of the answers to be graded, print the number correct and the percent correct. 5. add a loop so that the user can grade any number of quizzes with a single key. after the results have been printed for each quiz, ask "grade another quiz? (y/n)." note: you only have one array (the key). you are not creating a new key for each set of quiz answers.

Which of the statements below describe the guidelines for the use of text in presentation programs? a. do not use numbered lists. b. fonts should be appropriate for your audience. c. limit the number of fonts you use to three or four. d. only use bulleted lists for sales promotions. e. select font sizes that are appropriate for your delivery method. f. use font colors that work well with your background. select all that apply