hmwk_2_sol - Discrete Structures Aug 30 2011 Assignment 2:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Structures Aug 30 2011 Assignment 2: Due at beginning of class Mon, Sept 12 Prof. Hopcroft *******Note: this is the first homework that will be subject to the style guide on the website. Points will be deducted for homeworks not following the guidelines.******** 1 Regular Expressions Write a regular expression for the set of all strings of 0’s and 1’s that have two blocks of 1’s. A sample string your regular expression should represent: 000000111111000111000 1.1 Answer +4 for correct notation and regular expression, +2 for each correct element of the regular expression, - 1 for extra 0’s and 1’s in an otherwise correct solution. { 0*11*00*11*0* } 2 Recurrence Relation Find a close form solution for the following recurrence equations: (Also, show that you checked the first four values of your solution) Saved for next week. 3 Induction +5 for correct base case, +5 for assuming g ( n ) is true in a correct way, +5 for manipulating g ( n + 1) , and +5 for overall correctness Prove by induction that g ( n ) = 2 n 4 + 2 n 2 + 4 is divisible by 4 for all n 1. Proof. Base Case
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/11/2011 for the course CS 2800 at Cornell University (Engineering School).

Page1 / 3

hmwk_2_sol - Discrete Structures Aug 30 2011 Assignment 2:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online