The state diagram below is for a state machine that detects what sequence? [seq] What is the minimum number of flops necessary to implement this machine? [minFlops]  

You have been asked to create a FSM for a ticket machine for a bus with the following specifications: The cost of a bus ticket is 35¢. The machine only accepts quarters (25¢) and/or dimes (10¢), but only one coin at a time. Whenever at least 35¢ has been deposited, the machine will provide a ticket, the balance returns to 0¢, and then it is the next customer’s turn. The machine does not provide change. If someone pays more than the required 35¢, the next person does not get the extra as credit towards the ticket – the bus company gets to keep the extra money. Check all of the states you would use:

Given you have the number 101, but don’t know its base or format (unsigned, 2’s comp, sign mag, …): Its value would be greatest if its base was: [base] Its decimal value could be 257 : [as_hex] Its decimal value could be -1 : [smag] It could be in octal representation: [octal] Its decimal value cannot be 101 : [dec]

A multiplexer with 16 data input signals requires a total of how many input signals?

Which of the following are true for an ALU?

For the ALU shown choose the func[1:0] required to perform the specified operation: ALUout = A & B  (bitwise AND) [AND] ALUout = A + B  [ADD] ALUout = NOT(A)  [NOTA] ALUout = A | B  (bitwise OR) [OR]

Complete a LC-3 instruction to zero R3 [1][2][3]  

Use the dropdown to select the proper signal for each SigN connection shown in the diagram Sig1 = [sig1]    Sig2 = [sig2] Sig3 = [sig3] 

Suppose we are working with 16-bit machine with an ISA where 2’s comp immediate values are encoded in 6-bits. The most negative value the immediate value can be is: [neg] The most positive value the immediate value can be is: [pos] The technique used to create 16-bit operands from these 6-bit values is: [meth]

Choose item(s) that represent ways in which the registers of a register file are used.