Recurrence Relation - Discrete Math - Quiz, Exercises of Discrete Mathematics

Main points of this past exam are: Recurrence Relation, Relation, Initial Conditions, Number, Consecutive Zeroes, Initial Conditions, Ternary Strings

Typology: Exercises

2012/2013

Uploaded on 03/31/2013

parthivi
parthivi 🇮🇳

4.1

(8)

85 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Prof. S. Brick Discrete Math; Quiz 7 Math 267
Fall ’02 section 1
0. Print your name:
1. Find a recurrence relation with initial conditions for the number of ways a person can
climb nstairs if he can take either one stair or two stairs at a time
2. Find a recurrence relation with initial conditions for the number of ternary strings that
do not contain two consecutive zeroes.
3. A candy vending machine accepts nickels, dimes, and quarters (the dollar slot is broken).
Give a recurrence relation with initial conditions for the number of ways of depositing n
cents, where the order of the coins matters.

Partial preview of the text

Download Recurrence Relation - Discrete Math - Quiz and more Exercises Discrete Mathematics in PDF only on Docsity!

Prof. S. Brick Discrete Math; Quiz 7 Math 267

Fall ’02 section 1

  1. Print your name:
  2. Find a recurrence relation with initial conditions for the number of ways a person can climb n stairs if he can take either one stair or two stairs at a time
  3. Find a recurrence relation with initial conditions for the number of ternary strings that do not contain two consecutive zeroes.
  4. A candy vending machine accepts nickels, dimes, and quarters (the dollar slot is broken). Give a recurrence relation with initial conditions for the number of ways of depositing n cents, where the order of the coins matters.