2. (Truth table to circuit) Create a truth table for a 4-bit input where the output will be a 1, if it the bit pattern is divisible by 3, and/or 5. Assume that ABCD represent the most significant to least significant bits of a binary pattern. A sample is shown below. Generate the gate-level logic circuit, using the implementation algorithm we discussed in lecture. Use Logisim to create the circuit. The truth table is the only deliverable that will be in the written submission. A B C D Z (Output) 0 0 1 1 1
Added by Clifford P.
Close
Step 1
To check if a number is divisible by 3, we can use a 2-bit counter. The counter will have 3 states: 0, 1, and 2. If the counter is in state 0 or 3, the number is divisible by 3. To check if a number is divisible by 5, we can use a 3-bit counter. The counter will Show more…
Show all steps
Your feedback will help us improve your experience
Ct Turner and 65 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Design a combinational circuit that accepts a 2-bit number (AB) and generates a 5-bit binary number output (S4, S3, S2, S1, S0) equal to the cube of the input signals. a) Draw the truth table. (20 points) b) Derive the Boolean expression of each output signal in POS Form. (50 points, 10 points for each KMap) c) Draw the logic diagram of the circuit. Label all lines. (30 points)
Madhur L.
Adi S.
Design a combinational logic circuit which will add two 4-bit binary numbers.
Sri K.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD