sampleex03

sampleex03 - a call on hold by pressing #. 3 Question 3 (5...

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

View Full Document Right Arrow Icon
Exam 03 04/19/2007 SE3306 Mathematical Foundations of SE Name : WebCT ID : Instructions : Read through the whole exam first and plan your time. The exam is worth 25 points, with each question valued as indicated. Closed book : Reference to notes, the text or other material is not permitted . Time : You have one hour and fifteen minutes to complete all questions. Write all your answers on this paper. 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Question 1 (5 points) Construct a Finite State Machine (FSM) that accepts a string over the alphabet Σ = { a, b, c, . . . , x, y, z, 0 , 1 , . . . , 8 , 9 } , separates digits from letters and prints the reverse of them. For example, if the input string is “a1b2c3d4” the two outputs should be integer number 4321 and the string “dcba”. 2
Background image of page 2
Question 2 (5 points) Construct a statechart to model a simple cell phone. The phone can only receive calls by pressing a green button when the phone is ringing; terminate a call by pressing the red button; make a call by entering a sequence of digits followed by the green button; and put
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

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

Unformatted text preview: a call on hold by pressing #. 3 Question 3 (5 points) Given the Petri Net below, represent the state of the Petri Net when firing the following sequence of transitions: e1 e4 e3 e5 e1 e2 e1 e3. b1 b2 b3 b5 b4 e1 e2 e4 e3 e5 4 Question 4 (5 points) (a) Define and give an example of an Euler Circuit. Is there a criterion to determine if such circuit exists? If so, what is the criterion? (b) Define and give an example of a Hamilton Circuit. Is there a criterion to determine if such circuit exists? If so, what is the criterion? 5 Question 5 (5 points) Given the graph G below: use Dijkstras algorithm to find the shortest path. Clearly show each iteration of the algorithm. use either Prims or Kruskals algorithm to find the minimum spanning tree. Clearly show each iteration of the algorithm. a b c d e f g h i j k l 1 1 1 8 8 2 2 3 3 3 4 4 5 7 6 7 3 2 1 5 6...
View Full Document

Page1 / 6

sampleex03 - a call on hold by pressing #. 3 Question 3 (5...

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

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