CHEM 131 Midterm: Exam 1A No Solutions

• School: University of Maryland
• Department: Chemistry and Biochemistry
• Course: CHEM 131
• Professor: All

Document Summary

Problem 1: (15 points) design a turing machine that increments (i. e. adds 1) a binary number. The binary number is located to the right of the tape head"s starting position and is surrounded by blanks as shown below: b. Describe your turing machine by lling in the state transition table below. Note that in the operations column, only the symbols b, 0, 1, l, r, and h are allowed that is, you cannot simultaneously write a symbol to the tape and move the tape head left or right. You may not need to use the full table, but be sure to comment those states that you do use. End of number found, go to state s2. Extend number by one bit, go to state s4. Problem 2: the hypothetical crzy processor has 8-bit registers and instructions, and can there- fore address only 256 bytes of memory. Nonetheless, it implements a virtual memory and caching.