1. CS1Q Applets Mark II James McMahon

2. Previous Prototypes Binary Converter Binary Converter Karnaugh Maps Karnaugh Maps Multiple Choice Questions Tutorial Multiple Choice Questions Tutorial Logic Circuits Logic Circuits

3. Previous Prototypes Binary Converter Multiple Choice Questions Karnaugh Maps Logic Circuits

4. New Designs Binary Converter Binary Converter Karnaugh Maps Karnaugh Maps Multiple Choice Questions Tutorial Multiple Choice Questions Tutorial Logic Circuits Logic Circuits

5. New Designs Binary Converter Binary Converter Karnaugh Maps Karnaugh Maps Multiple Choice Questions Tutorial Multiple Choice Questions Tutorial Logic Circuits Logic Circuits Plus Plus Multiple Choice Questions Generator Multiple Choice Questions Generator

6. Basic Features Standardisation of the UI with all applets having… Hint Features Hint Features On-line Help On-line Help Score Keeper + Anti-Cheat Measures Score Keeper + Anti-Cheat Measures Reveal Answer Reveal Answer Submit Answer Submit Answer

7. Binary Converter New Layout New Hint Feature Intuitive to use

8. Karnaugh Map Build a Simplifying term out of min-terms Hint Feature aids understanding Algorithm for checking answer terms mimics human method

9. Minimisation Algorithm Uses a 26 entry look up table Uses a 26 entry look up table Each entry contains a min-term item and the Karnaugh Map it represents Each entry contains a min-term item and the Karnaugh Map it represents Entries are ordered so that the smallest min-terms (the largest coverings of the map) are first Entries are ordered so that the smallest min-terms (the largest coverings of the map) are first i.e. x = i.e. x = 1 1 0 0 and smallest last (i.e. xyz) and smallest last (i.e. xyz)

10. Minimisation Algorithm II First take each of the locations in the question Karnaugh Map First take each of the locations in the question Karnaugh Map Then match every entry in the Look-Up table to that location Then match every entry in the Look-Up table to that location Eventually building up 8 sub-lists containing entries Eventually building up 8 sub-lists containing entries E.g. E.g. 1 1 0 0 L1 = 1 1 1 1 1 1 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

11. Minimisation Algorithm III Once you have the 8 sub-lists built - re-order them based upon the number of entries in each Once you have the 8 sub-lists built - re-order them based upon the number of entries in each Next taking the first entry of each sub-list; start to build up the question Karnaugh map Next taking the first entry of each sub-list; start to build up the question Karnaugh map Once you have built the question map using the sub- lists entries – you can read off the min-term values Once you have built the question map using the sub- lists entries – you can read off the min-term values Then you have a minimal term for that Karnaugh Map Then you have a minimal term for that Karnaugh Map (most of the time) (most of the time)

12. Multiple Choice Questions Multiple Questionsets HTML question files Hint Feature (50-50…) Customisable solution pages Variable Question Formats

13. Question Generator Supports creation of applets set up files Ensures correctness of those files Simplifies deployment of Multiple Choice Questions applet

14. Logic Circuits Improved Hint Format Multiple Circuit Layouts Easily Extensible Wide range of questions gives good practice

15. Circuit Layouts Easy Circuits Medium Circuits

16. Evaluations Generally better than the prototypes Generally better than the prototypes Much improved interfaces Much improved interfaces Better support options (off-line Question Generator) Better support options (off-line Question Generator) Hint features in particular improve students understanding Hint features in particular improve students understanding Some small bugs found (K-Map…) Some small bugs found (K-Map…) No major problems No major problems

17. Questions?     