section4.3_cot3100_sp08

section4.3_cot3100_sp08 - 4. Some recursive formulae may...

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

View Full Document Right Arrow Icon
COT 3100: Practice Problems from section 4.3 1. Study the recursive definition of Fibonacci numbers. 2. Use this definition to derive a lower bound on the value of the n^th Fibonacci number (see example 6 on page 297). 3. Try to derive a recursive definition for the length of a string (example 9 on page 301) and a recursive test of the well-formedness of an expression (see example 11).
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4. Some recursive formulae may not be valid. You should do problems 3 and 5 from section (4.3) to see whether you understand how to determine the validity of a recursive definition. 5. Solve problems 9,10,11,13,15 from section 4.3. 6. Solve problems 23, 25, 27 from section 4.3....
View Full Document

This note was uploaded on 01/22/2012 for the course COT 3100 taught by Professor Staff during the Spring '08 term at University of Florida.

Ask a homework question - tutors are online