Physics 5—Scientific  Computing

Assignments

# Chapters Quizzes Programming Assignments 1 1/31 - 2/6    1 and 2 Chapter 1 Quiz Chapter 2 Quiz Write the Hello World program to establish your ability to use an IDE write a program you can compile and run and save it in a safe place.  Do the add two numbers exercise #1 on page 74. 2 2/7 - 2/13 3 Chapter 3 Quiz Page 77 #1-5 Page 157 #15 - Math Tutor P 157 #17 Amortization payment 3 2/14 - 2/20 3 Chapter 3 Quiz Page 158 #19  Pizzas Page 158 #20  Angle Calculator Page 159 #25  Word Game 4 2/21 - 2/27 4 Chapter 4 Quiz Page 238 #9 Math Tutor Improvement Page 240 #16 Spectral Analysis Page 241 #18 The Speed of Sound 5 2/28 - 3/6 5 Chapter 4 Quiz The Serendipity problems, part 4, Page 244 6 3/7 - 3/13   5 Chapter 5 Quiz Bin Packing Project (100 points - 25 points per heuristic) Page 294 #7: Pennies for Pay Page 294 #8: Math Tutor 7 3/14 - 3/20 5 Chapter 5 Quiz The Collatz Conjecture (90 points - 15 points per question) 8 3/21 - 3/27 6 Chapter 6 Quiz Page 366 #5, #6 9 3/28 - 4/2 6 Chapter 6 Quiz Get Caught Up!! 10 4/3 - 4/12 7 Chapter 7 Quiz Euler's Method for Solving 1st order ODE's Babylonian Algorithm 11 4/13 - 4/19 7 Chapter 7 Quiz Generate a random 3X3 matrix in a 2-dimensional array and compute its square Bundle the Babylonian algorithm for computing square roots together with the quadratic formula to write a program where the user enters the coefficients a, b and c for a quadratic equation and the program computes the solutions, consider the three cases for the discriminant being positive, negative and zero separately. 12 4/20 - 4/26 7 Chapter 7 Quiz Implement Euclid's algorithm for the greatest common divisor of two natural numbers as a recursive function and use it to approximate the probability that two randomly selected natural numbers are relatively prime. Do the tic-tac-toe exercise P450-17 13 4/27 -5/2 7   Write a program to allow a chess player to move a knight around a chess board with the goal of trying to find a "knight's tour" of the board.  Implement the board as an 8x8 array of booleans, where the value is 0 if the square hasn't been visited and 1 after it has.  Allow the user to choose the initial position and then only legal positions thereafter.  Tell the user if they are stuck (no more legal moves.) Investigate iterates of the logistic formula:                       xn+1 = a*xn(1 - xn) for x0 = 0.5 and values of parameter a between 3.1 and 3.7 Use a vector of doubles to hold as many iterates as you might need and then search backwards through the iterates with a function that will find a cycle of repeated values, if there is one. Generate a table of values of a in one column and the periodicity (cycle length) of the iterates in another. 14 5/3 - 5/9     Test 7 15 5/10 - 5/16     Final Exam