LAB 3 INSTRUCTIONS

.pdf

School

University of British Columbia *

*We aren’t endorsed by this school

Course

491

Subject

Computer Science

Date

Apr 3, 2024

Type

pdf

Pages

2

Uploaded by HighnessLapwing1662

Report
Computer Science 1050: Lab 3 You may collaborate with others if you wish, but must submit your own work. If we can tell that you have simply copied your work, it will be treated as a violation of academic integrity. Labs are an opportunity to learn the material. They are marked on effort, not correctness. Your submitted file name should include your Full Name and the current activity, e.g. ChrisSchmidtLab1.docx . Your submitted file must include the following at the top. Full Name, Student Id, Current Activity (Lab 1, Lab 2, Assignment 1…). You must submit a pdf file or a docx file. You will be penalized up to 20% for not following these instructions. When you are asked to show your work, you can either type out all of the steps in the document or do it by hand. This can be done on paper or handwritten on a device. Some questions will require the work to be done by hand. If you do it by hand, you must take a picture of it with your phone and include it in the submitted document. It must be clear which questions you are answering. If your answers are disorganized or difficult to understand for any reason, you may not receive credit for them. All circuits must be hand-drawn. The rest of the questions can be handwritten or typed into your document. Gates and Circuits / Boolean Expressions / Truth Tables 1. For the following circuit: a. Write the Boolean expression b. Apply the rules of Boolean algebra to reduce the expression to its simplest form (simplest defined as requiring the fewest gates to implement). Label each step with the appropriate boolean algebra property/law. c. Draw the circuit for the simplified expression
2. Given the following truth-table, where W is the output. a. What is the Boolean expression? b. Simplify your answer from part (a) as much as possible (aim for the smallest number of gates you can achieve). Label each step with the appropriate boolean algebra property/law. c. Draw the circuit for the simplified expression. 3. Given the following circuit… A B C a. Analyze the behavior of the above circuit with a truth table. Create a column for every gate excluding NOT gates. b. What is the equivalent Boolean expression as read directly from the truth table? Submit your completed lab to Brightspace. Due date set in Brightspace. No late submissions accepted. A B C W 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 0
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help