Computer Programming                                                        Name -

Bit-String Flicking Worksheet #4

  1. Find all bit strings, abcde, that satisfy the following equation.

    (LSHIFT-1 abcde ) XOR (RCIRC-2 ( RSHIFT-3 abcde )) = 10110

    2. List all possible solutions with each one written in parentheses. If no solution exits, write "None":

     

     

     

     

  2. Find all bit strings abcd that satisfy

    3. RCIRC-2 abcd AND LSHIFT-1 abcd = 0110

    List all possible solutions with each one written in parentheses. If no solution exits, write "None":

     

     

     

     

     

  3. Find all bit strings abcd that satisfy

    4. (RSHIFT-2 (LCIRC-3 abcd AND abcd )) OR NOT (abcd) = 1001

    List all possible solutions with each one written in parentheses. If no solution exits, write "None":

     

     

     

     

     

  4. Find all bit strings abc that satisfy

    5. NOT (NOT (NOT (NOT (NOT (NOT abc))))) = 011

    List all possible solutions with each one written in parentheses. If no solution exits, write "None":

     

     

     

     

     

  5. Find all bit strings abcdef that satisfy

    6. RCIRC-5 (LCIRC-4 (RCIRC-3 (LCIRC-2 abcde ))) = 01010

    List all possible solutions with each one written in parentheses. If no solution exits, write "None":

     

     

     

     

  6. Find all bit strings abcde that satisfy

( abcde OR RSHIFT-3 abcde) XOR NOT (00001) AND RCIRC-2 (abcde) = 01101

List all possible solutions with each one written in parentheses. If no solution exits, write "None":