1 / 9

ELEC1700 Computer Engineering 1 Week 7 Wednesday lecture Revision for Quiz 2 Semester 1, 2013

ELEC1700 Computer Engineering 1 Week 7 Wednesday lecture Revision for Quiz 2 Semester 1, 2013. Quiz 2. When? Scheduled lecture on Wednesday 1 May , 3:00–4:00pm = week 8 = next week Start time: 3:10pm Finish time: 3:50pm Where? MCTH lecture theatre What does it cover?

josiah
Download Presentation

ELEC1700 Computer Engineering 1 Week 7 Wednesday lecture Revision for Quiz 2 Semester 1, 2013

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ELEC1700Computer Engineering 1Week 7 Wednesday lectureRevision for Quiz 2 Semester 1, 2013

  2. Quiz 2 When? Scheduled lecture on Wednesday 1 May, 3:00–4:00pm = week 8 = next week Start time: 3:10pm Finish time: 3:50pm Where? MCTH lecture theatre What does it cover? material presented in weeks 4–6 What is it worth? counts for 10% of your final grade in ELEC1700

  3. Instructions to Candidates • Time allowed: Forty (40) minutes • This is a Closed Book Examination • No notes or textbook • Answer ALL questions • Calculators are permitted • Total number of marks = 40 • Rough working may be done on the reverse side of each page

  4. Quiz format • 5 “short” multiple choice questions (1 mark each)5 • 5 “long” multiple choice questions (3 marks each) 15 • 4 longer questions (5 marks each) 20 Total 40

  5. Consider the Boolean function X defined by the truth table below. Derive: • Standard sum of products (SOP) expression for X (= sum of minterms) • Standard product of sums (POS) expression for X (= product of maxterms)

  6. Use a Karnaugh map to simplify the Boolean function X defined by the truth table below into minimum SOP form.

  7. The diagram below shows the operation of a hexadecimal-to-7-segment decoder. Use a Karnaugh map to simplify the Boolean expression for segment a. Assume that inputs not shown in the table below never occur (i.e. we don’t care what segments are illuminated in such cases)

  8. (a) Sketch the logic circuit corresponding to the following Boolean function: • (b) Write down the truth table for the logic expression in part (a)

  9. (a) Simplify the expression • (b) Use the result from part (a) to derive a minimal sum of products (SOP) expression for Z in the circuit below A Z B C

More Related