This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CMSC330 Spring 2009 Midterm #1 Name Discussion Time (circle one): 9am 10am Do not start this exam until you are told to do so! Instructions You have 50 minutes for to take this midterm. This exam has a total of 100 points, so allocate 30 seconds for each point. This is a closed book exam. No notes or other aids are allowed. If you have a question, please raise your hand and wait for the instructor. Answer essay questions concisely using 2-3 sentences. Longer answers are not necessary and a penalty may be applied. In order to be eligible for partial credit, show all of your work and clearly indicate your answers. Write neatly. Credit cannot be given for illegible answers. Problem Score 1 REs & finite automata /8 2 RE to NFA /12 3 NFA to DFA /16 4 DFA minimization /16 5 Programming languages /6 6 Ruby features /12 7 Ruby programming /30 Extra credit /10 Total /100 1. (8 pts) Regular expressions and finite automata a. (4 pts) Explain what we are referring to when we say regular expressions and finite automata are equivalent. finite automata are equivalent....
View Full Document
- Fall '08