đŸ·ïž LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →
Log in
HomeTextbook Notes300,000US110,000

CS 17700 Chapter Notes - Chapter 3: Empty String, Empty Spaces, Code Injection

57 views4 pages
turquoisegnat633
30 Dec 2017
School
Purdue University
Department
Computer Sciences
Course
CS 17700
Professor
Gary Mc Fall

For unlimited access to Textbook Notes, a Class+ subscription is required.

Document Summary

(cid:401)e(cid:452)ie(cid:453) the (cid:306)e8tu(cid:401)es 8nd limit8tions o(cid:306) nume(cid:401)i(cid:268) d8t8 t(cid:459)pes in p(cid:459)thon. Compute(cid:401)s onl(cid:459) sto(cid:401)e 8nd 8(cid:268)(cid:268)ess d8t8 in (cid:267)in8(cid:401)(cid:459) (cid:563)(cid:268)on(cid:452)e(cid:401)ted into (cid:267)in8(cid:401)(cid:459) 8nd de(cid:268)im8l l8te(cid:401)(cid:564) Fill in the (cid:267)in8(cid:401)(cid:459) in the (cid:267)o(cid:458)es, sm8llest to l8(cid:401)(cid:307)est, (cid:306)ill empt(cid:459) sp8(cid:268)es (cid:453)ith ze(cid:401)os. De(cid:268)im8l (cid:487)(cid:488)(cid:494) (cid:489)(cid:488) (cid:492)(cid:490) (cid:488) (cid:487)(cid:492) (cid:494) (cid:490) (cid:487) Bi8n8(cid:401)(cid:459) (cid:486) (cid:487) (cid:486) (cid:487) (cid:487) (cid:486) (cid:487) (cid:487) (cid:563)(cid:486) * (cid:487)(cid:488)(cid:494)(cid:564) + (cid:563)(cid:487)* (cid:492)(cid:490)(cid:564) + (cid:563)(cid:486)*(cid:489)(cid:488)(cid:564) + (cid:563)(cid:487)(cid:492)* (cid:487)(cid:564) + (cid:563)(cid:487)* (cid:494)(cid:564)+ (cid:563)(cid:486)*(cid:490)(cid:564)+ (cid:563)(cid:488)*(cid:487)(cid:564) + (cid:563)(cid:487)*(cid:487)(cid:564) = (cid:495)(cid:487) Pl8(cid:268)e the num(cid:267)e(cid:401) in (cid:267)et(cid:453)een the 8pp(cid:401)op(cid:401)i8te (cid:452)8lues (cid:563)(cid:488)(cid:490) is (cid:267)et(cid:453)een (cid:489)(cid:488) & (cid:487)(cid:492)(cid:564) (cid:488). Put 8 ze(cid:401)o on the l8(cid:401)(cid:307)e(cid:401) num(cid:267)e(cid:401) (cid:563)(cid:489)(cid:488)(cid:564) 8nd su(cid:267)t(cid:401)8(cid:268)t the sm8lle(cid:401) num(cid:267)e(cid:401) (cid:306)(cid:401)om (cid:459)ou(cid:401) (cid:452)8lue (cid:563)(cid:488)(cid:490)-(cid:487)(cid:492) = (cid:494)(cid:564) I(cid:306) (cid:459)ou h8(cid:452)e 8 num(cid:267)e(cid:401) (cid:307)(cid:401)e8te(cid:401) th8n ze(cid:401)o pl8(cid:268)e 8 (cid:487) in the (cid:267)in8(cid:401)(cid:459) (cid:267)o(cid:458) I(cid:306) (cid:459)ou(cid:401) num(cid:267)e(cid:401) is ze(cid:401)o pl8(cid:268)e 8 ze(cid:401)o in the (cid:267)o(cid:458) 8nd 8ll the (cid:401)em8inin(cid:307) (cid:267)o(cid:458)es (cid:563)(cid:453)o(cid:401)kin(cid:307) le(cid:306)t to (cid:401)i(cid:307)ht(cid:564) (cid:489).

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Computer Science 1011A/B Lecture Notes - Lecture 2: Binary Number
skykoala577
IST 195 Lecture Notes - Lecture 9: Universal Coded Character Set, Emoji, Terabyte
peachwombat395
IT 2101 Lecture Notes - Lecture 5: Sound, 01011001, Computer Monitor
magentamole361

Related Questions

1.Create a list that contains 10 successive integers starting with the value in the variable start. For example, if start is 7, the resulting list should be [7, 8, 9, 10, 11, 12, 13, 14, 15, 16]. Store the list in a variable named my_list. Assume that the value of start has already been set.
 
2.Create a list that is made up of the first half of the elements of a list called original_list. Store the new list in a variable called half_list. Assume that the original list has already been initialized and contains an even number of elements.
 
 
3. Write a predicate function called same_ends that accepts a list of integers and an integer (n) as arguments. Return True if the first n numbers in the list are the same as the last n numbers in the list, and False otherwise. For example, if the list was [1, 2, 3, 4, 99, 1, 2, 3, 4], the function would return True if n is 4 and False if n is 3. Assume that n is between 1 and the length of the list, inclusive.
 
4.Write a function called highest_values that accepts as arguments a list of numeric values and a single integer (n). The function should return a list made up of the largest n values from the argument list in order from lowest to highest. For example, if the argument list is [46, 82, 25, 61, 70, 33, 54] and n is 3, the return value should be [61, 70, 82]. Assume that the argument list contains at least n elements.
 
5.Assume that a list of integers stored in a variable named original contains exactly two elements that are zero. Write code that creates a separate list that contains the elements from original that are between the two zeros. Do not include the zeros in the new list. Store the list in a variable named between_zeros.
 
6. Write a function called price_range that accepts a list of floating-point numbers representing prices as an argument and returns the the difference between the highest price and the lowest price. Do NOT use the built-in functions max or min in your solution. Assume that all prices are positive values and that none of them exceed 10,000.00.
 
7. Write a function called count_vowels that accepts a string argument that represents a word and returns the number of vowels that are in the word. The vowels are A, E, I, O, and U (ignore the 'sometimes Y' rule). Count both uppercase and lowercase vowels.
 
8.
Assume that the variable table holds a two-dimensional list of integers. Write code that computes the sum of all elements in the table, assigning the result to the variable table_sum.

Â