mbmelgo Goto Github PK

followers: 0.0 following: 0.0 repos: 21.0 gists: 0.0

Name: Mark Melgo

Type: User

Location: Cebu, Philippines

Mark Melgo's Projects

MP1 BC's URM Tracer Intro: Binibining Comsci is studying abstract machines and in particular is interested in learning more about URM's. In order to help Binibining Comsci in her quest for dominance in the Comsci world, we need to create a URM tracer. A URM is an abstract model of a computer as discussed in class. Our program reads a input file (ie, mp1.in) and performs the URM instructions as specified. For each line of our input, the program will display the current state of the URM on our output file (ie, mp1.out). The first line of input in the input file contains the initial state of our URM up to 10 indices (not so unlimited, eh?). The succeeding lines are the instructions that Binibining Comsci wants to test our URM with.

cmsc141_mp2

Binibining Comsci Problems (Deterministic Finite Automata) Intro: Once upon a time, Binibining Comsci was taking her pet lion, her pet rabbit, and a carrot back to her farm. She came to a river, and had to get all three possessions (lion, rabbit, carrot) across the east bank. Because of the nature of the river, she could only carry one possession across at a time. This means that she had to leave the other two possessions on the shore while she carried the one across. The problem is that, the lion would eat the rabbit if unattended, and the rabbit would eat the carrot if unattended. The lion could be left with the carrot safely, of course. What sequence would the man need to take his possessions across, in order not to have any of them eaten?