CS 475 Midterm: CS 475 Alabama Fall2017 Exam1 2Solutions
Document Summary
Choose any set of problems that adds up to 100 or more points. Cs 475 recommended problems are 1, 2, 3, 4. Cs 575 recommended problems are 3, 4, 5, 6. You may substitute different problems if you wish, or work more problems if you have time. However, it is better to solve fewer problems correctly than to do more problems incorrectly: write all the strings of length at most 4 that are accepted by this finite-state machine. [17 points for cs 475] [8. 5 points for cs 575] ((ab+ | c)(d | e+f))+ ((gh+ | j)(k | m+n))+ cdjk cdcdjk cdghmn cdjmn cdjkjk cefjmn cdghk cdjmmn cefghk cefjk cdghhk abdjmn abdjk ceefjk abdghk abbdjk abefjk. Say that a password is strong if it contains at least one character from each of these categories: U = {uppercase letters}, l = {lowercase letters}, d = {digits}, and p = {punctuation symbols}: draw a deterministic finite-state machine that accepts strong passwords.
