quiz1-soln-fall09

quiz1-soln-fall09 - 4(8 pts Begin converting the following...

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

View Full Document Right Arrow Icon
CMSC330 Fall 2009 Quiz #1 Solution & Grading Key 1. (4 pts) What is the output (if any) of the following Ruby program? Write FAIL if code does not execute. a = [1,2,3 ] a[4] = 5 a.each{ |x| puts “#{x}” } Answer: 1 2 3 # 2 points for sequence 1 2 3 5 # 2 points for gap (or nil) between 3& 5 5 2. (4 pts) Is it true that every DFA is a NFA? Explain your answer. Yes, since a DFA is simply a NFA without e-transitions or multiple edges from a state with the same label. # 2 points for answering yes # 2 points for understanding DFA is a simplified NFA 3. (4 pts) Write a DFA that accepts the language 1(00|1)*. You do not need to use the algorithms described in class. Many possible DFAs. For instance the following DFA works. 0 1 0 1 4 pts for correct answer 3 pts for 75% of the answer (e.g., 1 minor mistake, like not accepting 1) 2 pts for 50% of the answer (e.g., 1 major mistake or 2-3 minor ones, like not having a back edge) 1 pts for 25% of the answer (e.g., far off, but there's some insight there, like it accepts 1 or 100)
Background image of page 1

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

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

Unformatted text preview: 4. (8 pts) Begin converting the following NFA into a DFA by applying the subset construction algorithm discussed in class. You do not need to produce the entire DFA. Create at least 2 DFA states (starting state & additional state) and the transition (with label) connecting them. Be sure to list the NFA states represented by each DFA state. ε 1 3 ε a ε ε b 4 5 2 ε ε 6 Answer Either of the two following DFA is correct. May contain additional transitions. 1,2,3 2,3, 5,6 a 1,2,3 1,2,3, 4,6 b # 8 points for correct answer # partial credit # 2 points for starting state of DFA corresponding to 1,2,3 # 2 points for 2 nd state of DFA corresponding to 2,3,5,6 (for -> a) # OR for 2 nd state of DFA corresponding to 1,2,3,4,6 (for -> b) # 2 points for correctly labeled transition # 2 points for realizing state containing 6 is final state...
View Full Document

This note was uploaded on 01/13/2012 for the course CMSC 330 taught by Professor Staff during the Fall '08 term at Maryland.

Page1 / 2

quiz1-soln-fall09 - 4(8 pts Begin converting the following...

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