Lab 4 - F(n+1)/F(n) definition. However for both...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Engineering 7: Prof. Alexandre Bayen Introduction to Programming for Engineers Spring 2011 Lab 4: Recursion Date Assigned: 5:00pm, Friday – Feb 25. Date Due: 5:00pm, Friday – March 4. Problem 1: Do Problem 6.2 in the Reader Clarifications : You may assume that x is a row vector. The output variable, y , must be a row vector also. Problem 2: Do Problem 6.4 in the Reader. Clarifications : You may assume that n and k are 1x1 integer doubles. Problem 3: Do Problem 6.5 in the Reader. Clarifications : You may assume that cost and paid are scalars, and that paid cost . The output variable, change , must be a column vector as shown in the test case. Problem 4: Do Problem 6.6 in the Reader. Clarifications : You should use the continued fraction approximation for the Golden ratio, not the G(n) =
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: F(n+1)/F(n) definition. However for both definitions, G(1) = 1. Problem 5: Do Problem 6.7 in the Reader. Clarifications : You may assume that a and b are 1x1 integer doubles. Problem 6: Do Problem 6.8 in the Reader. Clarifications : You may assume that m is a strictly positive integer. The output variable, row , must be a row vector. Problem 7: Do Problem 6.9 in the Reader. Deliverables: Submit the following m-files onto bSpace. Be sure that the functions are named exactly as specified, including spelling and case. myChebyshevPoly1.m (watch out for the name) myNChooseK.m myChange.m myGoldenRatio.m myGCD.m myPascalRow.m mySpiralOnes.m...
View Full Document

This note was uploaded on 09/07/2011 for the course ENGIN 7 taught by Professor Horowitz during the Spring '08 term at University of California, Berkeley.

Ask a homework question - tutors are online