CSCI 250 Spring 2013
Discrete Structures
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook

Policies
Advice
College
    Policies

Notes
Programs
Tutorials

Others

Admin

Homework 9

Details

SectionProblemNotes
5.16Look at the solutions to similar problems (e.g. #5, #7)
20Don't make this one harder than it is. It is fairly straightforward.
50
5.312Recall that f0=0 and f1=1. This one should not be too difficult if you use the correct proof technique.
18
24aThe empty string (λ) is a palindrome.
38