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

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 255
MATH 132
Others

Admin

Homework 16

Comments

  • Exercises taken from Discrete Mathematics and its Applications, Seventh Edition unless otherwise noted.
  • You must show all of your work for each problem!
  • Points will be deducted if you do not show all of your work.
  • Each problem is generally worth 10 points. Problems with multiple parts may be assigned more points if there are enough parts or each part is significant enough.
  • The Review Questions are always related to the section that will be discussed on the assignment due date.

Details

SectionProblemNotes
1.362bClearly justify your answer.
5.120Don't make this one harder than it is. It is fairly straightforward.
5.38abFor b: recursive definitions do not always have to be based on the immediately preceding term.
12Recall that f0=0 and f1=1. This one should not be too difficult if you use the correct proof technique.
24aThe empty string (λ) is a palindrome.
38
Review Question1On page 439