1 / 16

Computer Organization Lecture 2

Computer Organization Lecture 2. Expectations/Rumors Prerequisites Syllabus, Policies. Expectations. Respectful, friendly, helpful, fun Fair grading/exams/no surprises Accessible office hours, helpful outside of class

hamish-walls
Download Presentation

Computer Organization Lecture 2

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. Computer OrganizationLecture 2 Expectations/Rumors Prerequisites Syllabus, Policies University of Portland School of Engineering

  2. Expectations • Respectful, friendly, helpful, fun • Fair grading/exams/no surprises • Accessible office hours, helpful outside of class • Clearly explain material, willing to clarify, lots of relevant examples, challenge/push, engaging University of Portland School of Engineering

  3. Rumors • Uses powerpoint, boring, waste of time • Challenging/confusing/difficult class • Tests are hard, final project difficult • Not a likable guy, will take us to pain, an animal University of Portland School of Engineering

  4. Back to Prerequisites University of Portland School of Engineering

  5. Prerequisites • Combinational logic • Truth tables, K-maps • SOP, POS • Sequential logic • Flip-flops • State diagram, next state decoder • MSI devices: MUX, decoder, adder University of Portland School of Engineering

  6. 11 01 10 00 Reset What is the next state table? Grey code counter Transitions occur only on a clock edge University of Portland School of Engineering

  7. What is the next state table? University of Portland School of Engineering

  8. Finite state machine University of Portland School of Engineering

  9. Find NSD truth tables? Q0 Q0 0 1 0 1 Q1 Q1 0 1 0 1 0 0 1 1 2 2 3 3 D1 = D0 = University of Portland School of Engineering

  10. Find NSD logic? University of Portland School of Engineering

  11. It works !! Circuit counts when Reset not asserted University of Portland School of Engineering

  12. Syllabus, Policies University of Portland School of Engineering

  13. University of Portland School of Engineering

  14. What is the next state table? University of Portland School of Engineering

  15. D0 = Q1 Find NSD truth tables? Q0 Q0 0 1 0 1 Q1 Q1 0 1 0 1 0 0 1 1 2 2 3 3 D1 = Qo University of Portland School of Engineering

  16. Find NSD logic? University of Portland School of Engineering

More Related