Assessment Overview (Reminder)

There will be three assessments for this course. These assessments are intended to check your current mastery of the topics covered in the course so far. They will be completed in class and graded pass/fail. You may retake Assessment 1 and Assessment 2 up to two times. You may retake Assessment 3 once (it is scheduled closer to the end of the semester). Scheduling for reattempts for individual assessments will be determined during the semester based on demand.

Assessment 2 Topics

Assessment 2 will be closed book with 10 questions that are either short answer or multiple choice. Important equations needed for the questions will be provided. You will have 30 minutes in class to work on it. 7/10 correct will be considered passing and will receive full points. The following tasks will be considered in scope for the Assessment (this is a subset of the work you’ve completed in class so far):

• Lecture 10 (Intro. to State Machines)
  • discuss whether a behavior of an embedded system is time ordered or data processing
  • create a state diagram for a simple state machine
  • write and test basic state machine code in RIMS
• Lecture 11 (State Machines II and Intro. to Lab 3)
  • Identify the difference between a mealy and moore state machine
  • Create a state diagram for an arbitrary state machine, including:
    • listing inputs and outputs and what they each correspond to
    • listing states and state actions
    • listing transitions between states
• Lecture 12 (Synchronous State Machines)
  • Choose the appropriate period for a synchronous state machine
  • Implement a state machine without including waiting transitions
• Lecture 13 (Concurrent Synchronous State Machines)
  • Define the terms (concurrent) asynchronous and (concurrent) synchronous state machines
  • Enumerate best practices for building systems using concurrent synchronous state machines