CprE 281: Digital Logic
|
|
- Norah McDaniel
- 5 years ago
- Views:
Transcription
1 CprE 281: Digital Logic Instructor: Alexander Stoytchev
2 Intro to Verilog CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
3 Administrative Stuff HW3 is due on Monday Sep 4p
4 Administrative Stuff HW4 is out It is due on Monday Sep 4pm. Please write clearly on the first page (in BLOCK CAPITAL letters) the following three things: Your First and Last Name Your Student ID Number Your Lab Section Letter Also, please Staple your pages
5 Administrative Stuff TA Office Hours: 11:00am-1:00pm on Wednesdays (Jinyuan Jia) Location: TLA (Coover Hall - first floor) 9:50am-11:50am on Thursday (Siyuan Lu) Location: TLA (Coover Hall - first floor)
6 Midterm Exam #1 Administrative Stuff When: Friday Sep 23. Where: This classroom What: Chapter 1 and Chapter 2 plus number systems The exam will be open book and open notes (you can bring up to 3 pages of handwritten notes). More details to follow.
7 Quick Review
8 NAND followed by NOT = AND x 1 x x 1 2 x x 1 2 x 1 x x 1 2 x 2 x 2 x 1 x 2 f f x 1 x 2 f
9 DeMorgan s Theorem
10 DeMorgan s Theorem x y x y = x y x y x + y
11 Sum-Of-Products x 1 x 2 x 3 x 4
12 Sum-Of-Products AND x 1 x 2 OR x 3 x 4 AND
13 Sum-Of-Products AND x 1 x 2 OR x 3 x 4 AND x 1 x x 1 2 x x 1 2 x 2 + x x 1 x x x 3 x 4 x x 3 4 x x 3 4
14 Sum-Of-Products AND x 1 x 2 OR x 3 x 4 AND AND x 1 x 2 x x 1 2 x x OR x x 1 x x x 3 x x 3 4 x x 3 4 x 4 AND
15 Sum-Of-Products AND x 1 x 2 OR x 3 x 4 AND x 1 x x 1 2 x x 1 2 x 2 + x x 1 x x x 3 x 4 x x 3 4 x x 3 4
16 Sum-Of-Products AND x 1 x 2 OR x 3 x 4 AND x 1 x x 1 2 x x 1 2 NAND x 2 + x x 1 x x x 3 x x 3 4 x x 3 4 x 4
17 Sum-Of-Products AND x 1 x 2 OR x 3 x 4 AND x 1 x x 1 2 x 2 + x x 1 x x x 3 x x 3 4 x 4
18 Sum-Of-Products x 1 x 2 x 3 x 4 x 5 x 1 x 2 x 3 x 4 x 5 x 1 x 2 x 3 x 4 x 5
19 2-1 Multiplexer (Definition) Has two inputs: x 1 and x 2 Also has another input line s If s=0, then the output is equal to x 1 If s=1, then the output is equal to x 2
20 Graphical Symbol for a 2-1 Multiplexer s x 1 x f [ Figure 2.33c from the textbook ]
21 Let s Derive the SOP form s x 1 x 2 s x 1 x 2 s x 1 x 2 s x 1 x 2 f (s, x 1, x 2 ) = s x 1 x 2 + s x 1 x 2 + s x 1 x 2 + s x 1 x 2
22 Let s simplify this expression f (s, x 1, x 2 ) = s x 1 x 2 + s x 1 x 2 + s x 1 x 2 + s x 1 x 2 f (s, x 1, x 2 ) = s x 1 (x 2 + x 2 ) + s (x 1 +x 1 )x 2 f (s, x 1, x 2 ) = s x 1 + s x 2
23 Circuit for 2-1 Multiplexer x 1 s s x 2 f x 1 x f (b) Circuit (c) Graphical symbol [ Figure 2.33b-c from the textbook ]
24 Analogy: Railroad Switch
25 Analogy: Railroad Switch x 1 x 2 select f
26 Analogy: Railroad Switch x 1 x 2 select f This is not a perfect analogy because the trains can go in either direction, while the multiplexer would only allow them to go from top to bottom.
27 More Compact Truth-Table Representation s x 1 x 2 f (s, x 1, x 2 ) (a) Truth table s 0 1 f (s, x 1, x 2 ) x 1 x 2 [ Figure 2.33 from the textbook ]
28 4-1 Multiplexer (Definition) Has four inputs: w 0, w 1, w 2, w 3 Also has two select lines: s 1 and s 0 If s 1 =0 and s 0 =0, then the output f is equal to w 0 If s 1 =0 and s 0 =1, then the output f is equal to w 1 If s 1 =1 and s 0 =0, then the output f is equal to w 2 If s 1 =1 and s 0 =1, then the output f is equal to w 3 We ll talk more about this when we get to chapter 4, but here is a quick preview.
29 Graphical Symbol and Truth Table [ Figure 4.2a-b from the textbook ]
30 The long-form truth table [
31 4-1 Multiplexer (SOP circuit) [ Figure 4.2c from the textbook ]
32 Using three 2-to-1 multiplexers to build one 4-to-1 multiplexer s 1 s 0 w 0 w f w 2 w [ Figure 4.3 from the textbook ]
33 Analogy: Railroad Switches
34 Analogy: Railroad Switches w 0 w 1 w 2 w 3 s 1 f
35 Analogy: Railroad Switches w 0 w 1 w 2 w 3 s 0 these two switches are controlled together s 1 f
36 Using three 2-to-1 multiplexers to build one 4-to-1 multiplexer
37 Using three 2-to-1 multiplexers to build one 4-to-1 multiplexer w 0 s 1 s 0 w 1 w 2 f w 3
38 That is different from the SOP form of the 4-1 multiplexer shown below, which uses less gates
39 16-1 Multiplexer s 0 s 1 w 0 w 3 w 4 s 2 s 3 w 7 f w 8 w 11 w 12 w 15 [ Figure 4.4 from the textbook ]
40 [
41 7-Segment Display Example
42 Display of numbers [ Figure 2.34 from the textbook ]
43 Display of numbers
44 Display of numbers a = s 0 c = s 1 e = s 0 g = s 1 s 0 b = 1 d = s 0 f = s 1 s 0
45 Intro to Verilog
46 Created in 1983/1984 History Verilog-95 (IEEE standard ) Verilog 2001 (IEEE Standard ) Verilog 2005 (IEEE Standard ) SystemVerilog SystemVerilog 2009 (IEEE Standard ).
47 HDL Hardware Description Language Verilog HDL VHDL
48 Verilog HDL!= VHDL These are two different Languages! Verilog is closer to C VHDL is closer to Ada
49 [ Figure 2.35 from the textbook ]
50 Hello World in Verilog [
51 The Three Basic Logic Gates x x x 1 x x 1 x 2 2 x 1 x x 1 + x 2 2 NOT gate AND gate OR gate [ Figure 2.8 from the textbook ]
52 How to specify a NOT gate in Verilog x x NOT gate
53 How to specify a NOT gate in Verilog we ll use the letter y for the output x y NOT gate
54 How to specify a NOT gate in Verilog x y not (y, x) NOT gate Verilog code
55 How to specify an AND gate in Verilog x 1 f= x x 1 x 2 2 and (f, x1, x2) AND gate Verilog code
56 How to specify an OR gate in Verilog x 1 f= x x 1 + x 2 2 or (f, x1, x2) OR gate Verilog code
57 2-1 Multiplexer [ Figure 2.36 from the textbook ]
58 Verilog Code for a 2-1 Multiplexer [ Figure 2.36 from the textbook ] [ Figure 2.37 from the textbook ]
59 Verilog Code for a 2-1 Multiplexer [ Figure 2.36 from the textbook ] [ Figure 2.40 from the textbook ]
60 Verilog Code for a 2-1 Multiplexer [ Figure 2.36 from the textbook ] [ Figure 2.42 from the textbook ]
61 Verilog Code for a 2-1 Multiplexer [ Figure 2.36 from the textbook ] [ Figure 2.43 from the textbook ]
62 Another Example
63 Let s Write the Code for This Circuit [ Figure 2.39 from the textbook ]
64 Let s Write the Code for This Circuit module example2 (x1, x2, x3, x4, f, g, h); input x1, x2, x3, x4; output f, g, h; endmodule and (z1, x1, x3); and (z2, x2, x4); or (g, z1, z2); or (z3, x1, ~x3); or (z4, ~x2, x4); and (h, z3, z4); or (f, g, h); [ Figure 2.39 from the textbook ] [ Figure 2.38 from the textbook ]
65 Let s Write the Code for This Circuit module example4 (x1, x2, x3, x4, f, g, h); input x1, x2, x3, x4; output f, g, h; endmodule assign g = (x1 & x3) (x2 & x4); assign h = (x1 ~x3) & (~x2 x4); assign f = g h; [ Figure 2.39 from the textbook ] [ Figure 2.41 from the textbook ]
66 Yet Another Example
67 A logic circuit with two modules [ Figure 2.44 from the textbook ]
68 The adder module [ Figure 2.12 from the textbook ]
69 The adder module [ Figure 2.45 from the textbook ]
70 The display module a = s 0 c = s 1 e = s 0 g = s 1 s 0 b = 1 d = s 0 f = s 1 s 0
71 The display module a = s 0 b = 1 c = s 1 d = s 0 e = s 0 f = s 1 s 0 g = s 1 s 0 [ Figure 2.46 from the textbook ]
72 Putting it all together
73 Questions?
74 THE END
CprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Intro to Verilog CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Minimization CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Binary Numbers CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationCENG 241 Digital Design 1
CENG 241 Digital Design 1 Lecture 5 Amirali Baniasadi amirali@ece.uvic.ca This Lecture Lab Review of last lecture: Gate-Level Minimization Continue Chapter 3:XOR functions, Hardware Description Language
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Floating Point Numbers CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
More informationLast Name Student Number. Last Name Student Number
University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Examination ECE 241F - Digital Systems Wednesday October 13, 2004, 6:00pm [5]
More informationMidterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil
Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final
More informationMore Examples Using Functions and Command-Line Arguments in C++ CS 16: Solving Problems with Computers I Lecture #6
More Examples Using Functions and Command-Line Arguments in C++ CS 16: Solving Problems with Computers I Lecture #6 Ziad Matni Dept. of Computer Science, UCSB Administrative CHANGED T.A. OFFICE/OPEN LAB
More informationAnnouncements. Chapter 2 - Part 1 1
Announcements If you haven t shown the grader your proof of prerequisite, please do so by 11:59 pm on 09/05/2018 (Wednesday). I will drop students that do not show us the prerequisite proof after this
More informationSummary. Boolean Addition
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
More informationDigital Integrated Circuits
Digital Integrated Circuits Introduction to the course Jaeyong Chung SoC Laboratory Incheon National University Course Information Schedule (EPC6055001) Mon 6:55pm - 8:40pm (SI433), Tue 7:50pm - 9:35pm
More informationQUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
More informationAnatomy of a Method. HW3 is due Today. September 15, Midterm 1. Quick review of last lecture. Encapsulation. Encapsulation
Anatomy of a Method September 15, 2006 HW3 is due Today ComS 207: Programming I (in Java) Iowa State University, FALL 2006 Instructor: Alexander Stoytchev Midterm 1 Next Tuesday Sep 19 @ 6:30 7:45pm. Location:
More informationEECE 321: Computer Organization
EECE 321: Computer Organization Mohammad M. Mansour Dept. of Electrical and Compute Engineering American University of Beirut Lecture 1: Introduction Administrative Instructor Dr. Mohammad M. Mansour,
More informationECE 156A - Syllabus. Description
ECE 156A - Syllabus Lecture 0 ECE 156A 1 Description Introduction to HDL (Hardware Description Language) basic elements, HDL simulation concepts, HDL concurrent statements with examples and applications,
More informationMany ways to build logic out of MOSFETs
Many ways to build logic out of MOSFETs pass transistor logic (most similar to the first switch logic we saw) static CMOS logic (what we saw last time) dynamic CMOS logic Clock=0 precharges X through the
More informationCS 2630 Computer Organization. Meeting 13: Faster arithmetic and more operations Brandon Myers University of Iowa
CS 2630 Computer Organization Meeting 13: Faster arithmetic and more operations Brandon Myers University of Iowa Where we are going Compiler Instruction set architecture (e.g., MIPS) translating source
More information1 ( 10 points) 6 min.
ee201_midterm2_sp2010.fm Spring 2010 EE201L Instructor: Gandhi Puvvada Midterm Exam 2 (20%) Date: April 30, 2010, Friday Open-Book Open-Notes Exam Time: 4-6:20PM SGM101 Name: Notes and handouts in ring
More informationFundamentals of Digital System Design ECE 3700, CPSC 3700
Fundamentals of Digital System Design ECE 3700, CPSC 3700 Instructor: Priyank Kalla (kalla@ece.utah.edu) 4 Credits Tue, Thu 1:25-1:45pm, WEB 1230 Office Hours: Tue, Thu: 2:30-4pm, or by appointment Office:
More informationHardware Description Languages (HDLs) Verilog
Hardware Description Languages (HDLs) Verilog Material from Mano & Ciletti book By Kurtulus KULLU Ankara University What are HDLs? A Hardware Description Language resembles a programming language specifically
More informationIntroduction to Verilog. Mitch Trope EECS 240 Spring 2004
Introduction to Verilog Mitch Trope mtrope@ittc.ku.edu EECS 240 Spring 2004 Overview What is Verilog? Verilog History Max+Plus II Schematic entry Verilog entry System Design Using Verilog: Sum of Products
More informationA3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum
LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling LAB OBJECTIVES 1. Practice designing more combinational logic circuits 2. More experience with equations and the use of K-maps and Boolean
More informationKING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT
KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT COE 202: Digital Logic Design Term 162 (Spring 2017) Instructor: Dr. Abdulaziz Barnawi Class time: U.T.R.: 11:00-11:50AM Class
More informationEncapsulation. Administrative Stuff. September 12, Writing Classes. Quick review of last lecture. Classes. Classes and Objects
Administrative Stuff September 12, 2007 HW3 is due on Friday No new HW will be out this week Next Tuesday we will have Midterm 1: Sep 18 @ 6:30 7:45pm. Location: Curtiss Hall 127 (classroom) On Monday
More informationECE 241F Digital Systems
ECE 241F Digital Systems Fall 2016 J. Anderson, P. Chow Basic Information Instructors and Lecture Information Section L101 L102 L103 Instructor Jason Anderson Paul Chow Jason Anderson Office EA 314 EA
More informationEE324: Microcontrollers and Interfacing. Office Hours: Mon, Wed, to 11.30am. Microcontrollers and Interfacing
EE324: Microcontrollers and Interfacing Instructor s Name: Mohammad Jahangir Ikram Office No. & Email: 9-317A jikram@lums.edu.pk Office Hours: Mon, Wed, 10.00 to 11.30am Category: Junior TA for the Course:
More informationENEL 353: Digital Circuits Midterm Examination
NAME: SECTION: L01: Norm Bartley, ST 143 L02: Steve Norman, ST 145 When you start the test, please repeat your name and section, and add your U of C ID number at the bottom of the last page. Instructions:
More informationLAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling
LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling LAB OBJECTIVES 1. Practice designing more combinational logic circuits 2. More experience with equations and the use of K-maps and Boolean
More informationALLIANCE FRANCAISE DE CHANDIGARH DELF A1: MONDAY 8 DECEMBRE 2014 INSTRUCTIONS
DELF A1: MONDAY 8 DECEMBRE 2014 1. All candidates must reach the Alliance Française, Sector 36A, Chandigarh, by 07.15 am sharp. Please bring a photo ID proof in original.. 2. The exam will begin with Production
More informationESET 349 Microcontroller Architecture, Fall 2018
ESET 349 Microcontroller Architecture, Fall 2018 Syllabus Contact Information: Professor: Dr. Byul Hur Office: 008 Fermier Telephone: (979) 845-5195 FAX: E-mail: byulmail@tamu.edu Web: rftestgroup.tamu.edu
More informationVerilog Lab. Two s Complement Add/Sub Unit. TA: Xin-Yu Shi
Verilog Lab. Two s Complement Add/Sub Unit TA: Xin-Yu Shi genius@access.ee.ntu.edu.tw Introduction In previous lecture, what you have learned : Complete representation for binary negative number Arithmetic
More informationIntroduction to Computer Systems
Introduction to Computer Systems Syllabus Web Page http://www.cs.northwestern.edu/~pdinda/icsclass Instructor Peter A. Dinda 1890 Maple Avenue, Room 338 847-467-7859 pdinda@cs.northwestern.edu Office hours:
More informationCSE140 L. Instructor: Thomas Y. P. Lee January 18,2006. CSE140L Course Info
CSE4 L Instructor: Thomas Y. P. Lee January 8,26 CSE4L Course Info Lectures Wedesday :-:2AM, HSS33 Lab Assignment egins TA s JinHua Liu (jhliu@cs.ucsd.edu) Contact TAs if you re still looking for a lab
More informationEECS 270 Midterm Exam
EECS 270 Midterm Exam Fall 2009 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: NOTES: Problem # Points 1 /11 2 /4
More informationBawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra
More informationUNIT II - COMBINATIONAL LOGIC Part A 2 Marks. 1. Define Combinational circuit A combinational circuit consist of logic gates whose outputs at anytime are determined directly from the present combination
More information(ii) Simplify and implement the following SOP function using NOR gates:
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EE6301 DIGITAL LOGIC CIRCUITS UNIT I NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES PART A 1. How can an OR gate be
More informationMore on Arrays CS 16: Solving Problems with Computers I Lecture #13
More on Arrays CS 16: Solving Problems with Computers I Lecture #13 Ziad Matni Dept. of Computer Science, UCSB Announcements Homework #12 due today No homework assigned today!! Lab #7 is due on Monday,
More informationECE 2300 Digital Logic & Computer Organization. More Sequential Logic Verilog
ECE 2300 Digital Logic & Computer Organization Spring 2018 More Sequential Logic Verilog Lecture 7: 1 Announcements HW3 will be posted tonight Prelim 1 Thursday March 1, in class Coverage: Lectures 1~7
More informationChapter 3. Gate-Level Minimization. Outlines
Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level
More informationMODULE 5 - COMBINATIONAL LOGIC
Introduction to Digital Electronics Module 5: Combinational Logic 1 MODULE 5 - COMBINATIONAL LOGIC OVERVIEW: For any given combination of input binary bits or variables, the logic will have a specific
More informationDigital Circuits ECS 371
Digital Circuits ECS 37 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 7 Office Hours: KD 36-7 Monday 9:-:3, :3-3:3 Tuesday :3-:3 Announcement HW2 posted on the course web site Chapter 4: Write down
More informationIntroduction to Scientific Computing with C++ Introduction Textbook Assignments Lab Accounts and Software HELLO ADD INTS MANDEL Conclusion
Introduction http://people.sc.fsu.edu/ jburkardt/isc/week01/ lecture 01.pdf... ISC3313: Introduction to Scientific Computing with C++ Summer Semester 2011... John Burkardt Department of Scientific Computing
More informationMarshall University MTH 100 Syllabus
Marshall University MTH 100 Syllabus Course Title/Number Preparation for College Mathematics A MTH 100 Semester/Year Spring 2016 Section/CRN 208 / 3975 Days/Time TR 12:30 1:45 PM Location SH 621 Instructor
More informationCS Introduction to Programming Fall 2016
CS 1113-300 Introduction to Programming Fall 2016 Exam 3 Review - Part 2 (Python) Friday, December 2 nd, 2016 Ahmed Ibrahim 1 / 26 Course Evaluation Please take a few minutes to submit your course evaluation
More informationIntroduction to Computer Systems
Introduction to Computer Systems Web Page http://pdinda.org/ics Syllabus See the web page for more information. Class discussions are on Piazza We will make only minimal use of Canvas (grade reports, perhaps
More informationLab 3: Standard Combinational Components
Lab 3: Standard Combinational Components Purpose In this lab you will implement several combinational circuits on the DE1 development board to test and verify their operations. Introduction Using a high-level
More informationBoolean Logic CS.352.F12
Boolean Logic CS.352.F12 Boolean Algebra Boolean Algebra Mathematical system used to manipulate logic equations. Boolean: deals with binary values (True/False, yes/no, on/off, 1/0) Algebra: set of operations
More informationWELCOME TO. ENGR 303 Introduction to Logic Design. Hello my name is Dr. Chuck Brown
Chapter 1 WELCOME TO Introduction to Logic Design Hello my name is Dr. Chuck Brown Please sign in and then find a seat. The person next to you will be your lab partner for the course so choose wisely and
More informationProgramming with Arrays Intro to Pointers CS 16: Solving Problems with Computers I Lecture #11
Programming with Arrays Intro to Pointers CS 16: Solving Problems with Computers I Lecture #11 Ziad Matni Dept. of Computer Science, UCSB Thursday, 5/17 in this classroom Starts at 2:00 PM **SHARP** Please
More informationObjectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure
Objectives: 1. Design procedure. 2. undamental circuits. 1. Design procedure Design procedure has five steps: o Specification. o ormulation. o Optimization. o Technology mapping. o Verification. Specification:
More informationUniversity of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering
University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering Final Examination ECE 241F - Digital Systems Examiners: S. Brown,
More information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationDate Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 09 MULTIPLEXERS OBJECTIVES: To experimentally verify the proper operation of a multiplexer.
More informationInstitute of Engineering & Management
Course:CS493- Computer Architecture Lab PROGRAMME: COMPUTERSCIENCE&ENGINEERING DEGREE:B. TECH COURSE: Computer Architecture Lab SEMESTER: 4 CREDITS: 2 COURSECODE: CS493 COURSE TYPE: Practical COURSE AREA/DOMAIN:
More informationMULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR
STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR SECOND SEMESTER FINAL EXAMINATION, 2013/2014 SESSION ITC2223 COMPUTER ORGANIZATION & ARCHITECTURE DSEW-E-F 1/13 18 FEBRUARY
More informationCS 111: Programming Fundamentals II
CS 111: Programming Fundamentals II Summer 2016 Home Syllabus Schedule Exams Project Meeting Times: 111-001: Lectures: 10:50 am - 12:15 pm Mon, Tue, Wed HB 112 Labs: 10:50 am - 12:15 pm Thu, HB 206, 207
More informationE40M. An Introduction to Making: What is EE?
E40M An Introduction to Making: What is EE? Jim Plummer Stanford University plummer@stanford.edu Chuan-Zheng Lee Stanford University czlee@stanford.edu Roger Howe Stanford University rthowe@stanford.edu
More informationCS 151 Midterm. (Last Name) (First Name)
CS 151 Midterm Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 13 pages including this cover. 2. Write down your Student-Id on the top
More informationFPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 1
FPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 1 Anurag Dwivedi Digital Design : Bottom Up Approach Basic Block - Gates Digital Design : Bottom Up Approach Gates -> Flip Flops Digital
More informationA3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum
LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling LAB OBJECTIVES 1. Practice designing more combinational logic circuits 2. More experience with equations and the use of K-maps and Boolean
More informationESET 369 Embedded Systems Software, Fall 2017
ESET 369 Embedded Systems Software, Fall 2017 Syllabus Contact Information: Professor: Dr. Byul Hur Office: Fermier 008A Telephone: (979) 845-5195 FAX: E-mail: byulmail@tamu.edu Web: rftestgroup.tamu.edu
More informationLecture 27: Learning from relational data
Lecture 27: Learning from relational data STATS 202: Data mining and analysis December 2, 2017 1 / 12 Announcements Kaggle deadline is this Thursday (Dec 7) at 4pm. If you haven t already, make a submission
More informationOverview of the Class
Overview of the Class Copyright 2015, Pedro C. Diniz, all rights reserved. Students enrolled in the Compilers class at the University of Southern California (USC) have explicit permission to make copies
More informationVerilog Lab. 2 s Complement Add/Sub Unit
Verilog Lab. 2 s Complement Add/Sub Unit TA: Chihhao Chao chihhao@access.ee.ntu.edu.tw Lecture note ver.1 by Chih-hao Chao Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao Introduction In
More informationCSci 4211: Introduction to Computer Networks. Time: Monday and Wednesday 2:30 to 3:45 pm Location: Smith Hall 231 Fall 2018, 3 Credits
CSci 4211: Introduction to Computer Networks Time: Monday and Wednesday 2:30 to 3:45 pm Location: Smith Hall 231 Fall 2018, 3 Credits 1 Instructor David Hung-Chang Du Email: du@cs.umn.edu Office: Keller
More informationFigure 1: Verilog used to generate divider
Abstract Compared to other arithmetic operations, division is not simple or quick in hardware. Division typically requires significantly more hardware to implement when compared to other arithmetic operations.
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN
SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN SUBJECT: CSE 2.1.6 DIGITAL LOGIC DESIGN CLASS: 2/4 B.Tech., I SEMESTER, A.Y.2017-18 INSTRUCTOR: Sri A.M.K.KANNA
More informationTopics. FPGA Design EECE 277. Interconnect and Logic Elements Part 2. Laboratory Assignment #1 Save Everything!!! Guest Lecture
FPGA Design EECE 277 Interconnect and Logic Elements Part 2 Dr. William H. Robinson February 4, 2005 http://eecs.vanderbilt.edu/courses/eece277/ Topics The sky is falling. I must go and tell the King.
More informationEECE.2160: ECE Application Programming Spring 2017
Course Meetings Section 201: MWF 8-8:50, Ball 314 Section 202: MWF 12-12:50, Kitson 305 Course Website Main page: http://mjgeiger.github.io/eece2160/sp17/ Schedule: http://mjgeiger.github.io/eece2160/sp17/schedule.htm
More informationCS 3270 Mobile Development for Android Syllabus
General Information Semester: Fall 2016 Textbook: Required: Android 6 for Programmers An App-Driven Approach, 3e, Deitel, Deitel and Wald, Prentice Hall, 978-0-13-428936-6. This book is also available
More informationWeb Design Final Exam Study Guide
We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with web design final exam
More informationUNCA CSCI 255 Exam 1 Spring February, This is a closed book and closed notes exam. It is to be turned in by 1:45 PM.
UNCA CSCI 255 Exam 1 Spring 2017 27 February, 2017 This is a closed book and closed notes exam. It is to be turned in by 1:45 PM. Communication with anyone other than the instructor is not allowed during
More informationDisability Resources and Educational Services (DRES)
Disability Resources and Educational Services (DRES) Figure 1- Image of the instructor Log In - Find User Screen Student Access and Accommodation System (SAAS 2.0) Faculty Step-By-Step Procedures INTRODUCTION
More informationCprE 488 Embedded Systems Design. Exam 2 Review
CprE 488 Embedded Systems Design Exam 2 Review Joseph Zambreno Electrical and Computer Engineering Iowa State University www.ece.iastate.edu/~zambreno rcl.ece.iastate.edu This is the end. My only friend,
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Comp 541 Digital Logic and Computer Design Prof. Montek Singh Fall 2016 Lab #1: Getting Started Issued Wed. 8/24/16; Due Wed. 8/31/16 (11:59pm) This lab
More informationECE 448 FPGA and ASIC Design with VHDL. Spring 2018
ECE 448 FPGA and ASIC Design with VHDL Spring 2018 Kris Gaj Research and teaching interests: reconfigurable computing cryptography computer arithmetic network security Contact: The Engineering Building,
More informationIntro. to Computer Network
Intro. to Computer Network Thu. 9:10am-12:10pm, in CSIE 102 Instructor: Cheng-Fu Chou Email:ccf@csie.ntu.edu.tw Office hours: by appointments TAs: 劉庠宏 : jimmychad[at]gmail.com; R501 沈昱辰 : lawlietdo[at]gmail.com;
More informationCSc 2310 Principles of Programming (Java) Jyoti Islam
CSc 2310 Principles of Programming (Java) Jyoti Islam Are you in the right class??? Check the CRN of your registration Instructor Jyoti Islam PhD Student, concentration: Machine Learning 4+ years of Industry
More informationFinal Exam Solution Sunday, December 15, 10:05-12:05 PM
Last (family) name: First (given) name: Student I.D. #: Circle section: Kim Hu Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/CS 352 Digital System Fundamentals
More informationCSC 101: Lab #5 Boolean Logic Practice Due Date: 5:00pm, day after lab session
Name: Email Username: Lab Date and Time: CSC 101: Lab #5 Boolean Logic Practice Due Date: 5:00pm, day after lab session Lab Report: Answer the questions within this document as you encounter them. Also,
More informationCS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Junaid Khalid and Pradip Vallathol Midterm Examination 2 In Class (50 minutes) Friday, October
More informationStudent Number: UTORid: Question 0. [1 mark] Read and follow all instructions on this page, and fill in all fields.
CSC 258H1 Y 2016 Midterm Test Duration 1 hour and 50 minutes Aids allowed: none Student Number: UTORid: Last Name: First Name: Question 0. [1 mark] Read and follow all instructions on this page, and fill
More informationEPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013
EPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013 Print Here Student ID Signature This is a closed book exam. The exam is to be completed in one-hundred ten (110) minutes. Don t use scratch
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More informationAIMS FREQUENTLY ASKED QUESTIONS: STUDENTS
AIMS FREQUENTLY ASKED QUESTIONS: STUDENTS CONTENTS Login Difficulties- Timed Out... 2 What it Looks Like... 2 What s Actually Happening... 2 Solution... 2 Login Difficulties - Expired... 3 What It Looks
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Comp 541 Digital Logic and Computer Design Spring 2016 Lab #1: Getting Started Issued Wed. 1/13/16; Due Wed. 1/20/16 (11:59pm) This lab assignment consists
More informationCSE303 Logic Design II Laboratory 01
CSE303 Logic Design II Laboratory 01 # Student ID Student Name Grade (10) 1 Instructor signature 2 3 4 5 Delivery Date -1 / 15 - Experiment 01 (Half adder) Objectives In the first experiment, a half adder
More informationBoolean Algebra & Digital Logic
Boolean Algebra & Digital Logic Boolean algebra was developed by the Englishman George Boole, who published the basic principles in the 1854 treatise An Investigation of the Laws of Thought on Which to
More informationIntroduction to Information Technology ITP 101x (4 Units)
Objective Concepts Introduction to Information Technology ITP 101x (4 Units) Upon completing this course, students will: - Understand the fundamentals of information technology - Learn core concepts of
More informationTutorial on VHDL and Verilog Applications
Second LACCEI International Latin American and Caribbean Conference for Engineering and Technology (LACCEI 2004) Challenges and Opportunities for Engineering Education, Research and Development 2-4 June
More informationCSC 111 Introduction to Computer Science (Section C)
CSC 111 Introduction to Computer Science (Section C) Course Description: (4h) Lecture and laboratory. Rigorous introduction to the process of algorithmic problem solving and programming in a modern programming
More informationProgrammable logic technology
Programmable logic technology This worksheet and all related files are licensed under the Creative Commons Attribution License, version 1.0. To view a copy of this license, visit http://creativecommons.org/licenses/by/1.0/,
More informationEngin 100 (section 250), Winter 2015, Technical Lecture 3 Page 1 of 5. Use pencil!
Engin 100 (section 250), Winter 2015, Technical Lecture 3 Page 1 of 5 Use pencil! Last time Introduced basic logic and some terms including bus, word, register and combinational logic. Talked about schematic
More informationEE 4755 Digital Design Using Hardware Description Languages
EE 4755 Digital Design Using Hardware Description Languages Midterm Exam Review When / Where Monday, 16 October 2017, 9:30-10:20 CDT 225 Tureaud Hall (Here) Conditions Closed Book, Closed Notes Bring one
More informationTesting & Verification of Digital Circuits ECE/CS 5745/6745. Hardware Verification using Symbolic Computation
Testing & Verification of Digital Circuits ECE/CS 5745/6745 Hardware Verification using Symbolic Computation Instructor: Priyank Kalla (kalla@ece.utah.edu) 3 Credits Mon, Wed 1:25-2:45pm, WEB 2250 Office
More informationOverloading Functions & Command Line Use in C++ CS 16: Solving Problems with Computers I Lecture #6
Overloading Functions & Command Line Use in C++ CS 16: Solving Problems with Computers I Lecture #6 Ziad Matni Dept. of Computer Science, UCSB A reminder about Labs Announcements Please make sure you READ
More informationRochester Institute of Technology Golisano College of Computing and Information Sciences Department of Information Sciences and Technologies
Rochester Institute of Technology Golisano College of Computing and Information Sciences Department of Information Sciences and Technologies 4002-360.01 ~ Introduction to Database & Data Modeling ~ Spring
More informationIntroduction to Databases
Introduction to Databases Syllabus Web Page http://www.cs.northwestern.edu/~pdinda/db (Note: may change with reorganization of ECE/CS) Instructor Peter A. Dinda Technological Institute L463 847-467-7859
More informationDeveloping Web Applications and Services Course Syllabus Fall 2015
44-563 Developing Web Applications and Services Course Syllabus Fall 2015 Instructor For Sections 01, 04 & 05: Tanmay Bhowmik, Ph.D. Email: bhowmik@nwmissouri.edu Phone: 660-562-1103 Office: Colden Hall
More information