Log in
HomeClass Notes1,200,000US530,000

CIS 111 Lecture Notes - Lecture 4: Syntactic Sugar, While Loop, Iterator

56 views2 pages
School
University of Oregon
Department
Computer and Information Science
Course
CIS 111
Professor
Little

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

Chpt 5 (loops), Chpt 12 (Strings), Chpt 15 (Math.random), Chpts 21-23 (DOM) (Wk 4)
• In Class This Week
o Chpt 5: Loops
o Chpt 12-13: Strings
o Chpt 5: Do While Loop
• Function + loop + if
o Example: Count primes
var countPrimes(n){
var count=0;
//generate and test
for(var i-1; i<=n;++i){
if(isPrime(i)){
++count;
}}
return count;
};
• Math.Random
o Returns a pseudo-random # in the range [0 to 1] which you can then scale to your
desired range
Math.random()=>.7259735443837176
//return a random number between 1 and 10
Math.floor((Math.random() * 10) + 1);
//return a random number between 1 and 6
Math.floor((Math.random() *6) + 1);
//return 0 (tails) or 1 (heads)
var flipCoin=function(){
return Math.floor((Math.random() *2));
};
alert(flipCoin());
alert(flipCoin());
//return 0 (tails) or 1 (heads)
var flipCoin=function(){
return Math.floor((Math.random() *2));
};
var flipCount=0, coin = 0; //1. Init loop control variable
//flip coin until heads
while(coin !=1){
coin=flipCoin(); //2. Update
++flipCount;
}
alert(“Heads in ” + flipCount + “ flips.”);
Unlock document

This preview shows half of the first page of the document.
Unlock all 2 pages and 3 million more documents.

Already have an account? Log in

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

PROG 10082 Chapter Notes - Chapter 4: Parament, Character Class, Primitive Data Type
brownbear920
C S 314
Final Exam
Study Guide
C S 314 Midterm: Spring_2017_E1
turquoisegnu128
COSC 111
Final Exam
Study Guide
COSC 111 Final: COSC 111 Final Exam 2016
turquoisegnu128

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.