How We Hire Writers

custom writing

All applicants go through a series of tests that check their level of English and knowledge of formatting styles. The applicant is also required to present a sample of writing to the Evaluation Department. If you wish to find out more about the procedure, check out the whole process.

How We Ensure Quality

Our Quality Control Department checks every single order for formatting, style, word usage, and authenticity. This lets us deliver certified assignment assistance that has no Internet rivals.

PROJECT1

To be completed in C++

Part I
4 bit counter

Create a 4 bit down counter that counts down from 9 to zero and then count 10. 11, 12 and then back to 9. You will design the logic of the circuit and also a chip level diagram. Your circuit will have a 4 bit output. It will be a finite state machine:

Any input to your circuit other than zero through nine (0000 1001) ten, eleven and twelve(10101100), should reset the output to nine (1001). Your tasks are to document the following. Create a state transition diagram for your finite state machine based counter (do not forget transitions to state nine from unused states)
1.    Specify the truth table (assuming D Flip Flops).
2.    Derive necessary Boolean equations (using kmaps)
3.    Draw gate-level logic diagram (logic gate symbols).
_______________________________________________________________________________________________________
Part II
2 bit integer division circuit

Design and implement a 2-bit integer division circuit. The circuit has four inputs A1, A0, B1, B0 and five outputs Q1, Q0, R1, R0, E. The values on A1, A0 and B1, B0 are treated as unsigned binary integer number A and B respectively:

The circuit should generate the quotient Q and remainder R of the division A/B on lines Q1, Q0 and R1, R0 respectively. If division by zero is attempted, line E is set ‘1’ (else E is ‘0’) and the values on lines Q1, Q0, R1, R0 are considered invalid. Your tasks are to document the following.
1.    Specify the truth table.
2.    Derive necessary Boolean equations (using kmaps)
3.    Draw gate-level logic diagram (logic gate symbols).

Attached document contains diagrams.

You can leave a response, or trackback from your own site.

Leave a Reply

Powered by WordPress | Designed by: Premium WordPress Themes | Thanks to Themes Gallery, Bromoney and Wordpress Themes