ECE20B Final Exam, 200 Point Exam Closed Book, Closed Notes, Calculators Not Allowed June 12th, Name
|
|
- Patrick Johns
- 6 years ago
- Views:
Transcription
1 C20B Final xam, 200 Point xam Closed Book, Closed Notes, Calculators Not llowed June 2th, 2003 Name Guidelines: Please remember to write your name on your bluebook, and when finished, to staple your solutions and exam sheets together.. Please use your own paper or examination book. Number your problems clearly. You must turn in the exam sheets as well as your answers. You must use ink. Please do not write in the following box. This will be used by the graders to record their scores. Prob Score Prob Score Prob Score (5 points) Be sure to read this problem all the way through before starting it. Implement a sequence recognizer with a single input X, and a single output Z. The output will be if the last four inputs are 0, and will be 0 otherwise. We will, however, use a circuit design that is different from the oneusedinclass.inournewdesign,thefour-typeflip-flops in your circuit will be used to store the last 4 values of X. For example, if the last 4 X inputs were 0, then the 4 flip-flops would store,, 0, and, respectively. ssuming that the initial values of all flip-flops are 0, and that only -type flip-flops and elementary gates (N, OR, NOT) may be used, then draw the circuit. Note that a state table or diagram is not needed to do this problem. 6. (20 points total) For this problem assume that you are given the algorithmic state chart shown in Figure 6. (a) (0 points) Complete the manual simulation shown in Figure 6B. ach column represents a clock cycle. (b) (5 points) Calculate the Boolean expressions for (t+), B(t+), and C(t+) assuming one-hot (one flip-flop per state) encoding. (c) (5 points) Implement (draw) the circuit using -type flip-flops. 7. (25 points total) We wish to design a 2-bit counter with the following inputs X Y function 0 hold count up 0 x set count to 0 (clear) (a) (5 points) enoting the state variables as Q and Q 0, fill in the state table shown in Figure 7a. In your state table include the settings for the J-K flip-flops (see part b of this problem. (b) (0 points) erive the Boolean expressions for J Q, K Q, J Q0,andK Q0 using dense encoding and J-K flip-flops. 8. (5 points total) ssume that you are given a memory chip of size 256K 64. (a) (2 points) How many words of data may be stored in the chip? (b) (2 points) What is the word length (in bits and in bytes) for the chip? (c) (2 points) How many address lines are required for the chip? (d) (2 points) How many data input lines (and output lines) are there? (e) (2 points) what is the purpose of the chip select pin?
2 (f) (5 points) ssume that the memory cells are arranged in a square so that two-dimensional coincident decoding is used within the chip. s in the textbook, you may assume that memory cells corresponding to a single word are contained in one row. How many of the address lines are assigned to the row decoder, and how many are assigned to the column decoder? Be sure to justify your answer. 9. (20 points) Now assume that you are given four memory chips of size 28K 32 (see Figure 9). ssume that each chip has input pins corresponding to data-in (T IN) and address (RS),asingle read-not write pin (R/W ), and a single chip-select pin (CS). ach chip also has a set of data-out pins (T OUT). Using the 4 chips and a single -to-2 decoder, show how you would construct an effective memory chip of size 256K (5 points) Implement (draw) the 3-input odd function F = X Y Z using only NOR gates (no other gate types, including inverters). The NOR gates can have two, three, or four inputs. It is possible to complete this problem with a total of only NOR gates.. (0 points total) ssume that you are given the two 8-bit numbers = and B = (a) (5 points) Calculate B assuming that both numbers are unsigned integers. Use the 2scomplement method to calculate the solution (show work). What are the values of and B in decimal? (b) (5 points) Calculate B assuming that both numbers are signed integers and in 2s-complement form. Be sure to show your work. What are the values of and B in decimal? 2. (4 points) Show how you would construct a 4-to-6 decoder (with enable) from five 2-to-4 decoders (see Figure 2a). For the 4-to-6 decoder label the inputs 0,, 2, 3, and, and the outputs 0 through 5 such that they satisfy the (simplified) truth table shown in Figure 2b. 2
3 Figure 6 Figure 6B Z 0 Y X Y STT Z 0 X Z B Z C X 0 0 Y Figure 7 next Q Q 0 X Y Q Q 0 J K J K
4 Figure 9 28K x 32 -to-2 ecoder ecoder Truth Table input data lines address lines chip select read / not write T RS CS R / W output data lines X K x 32 RM chip -to-2 decoder with enable Figure 2a 2-to-4 ecoder X X to-4 decoder with enable Figure 2b Simplified truth table for 4-to-6 decoder with enable LIN OUT (hot; i.e., set to ) X X X X (none)
5 C20B, Spring Final xam lab questions.. (7 pts. total) For the ideal operational amplifier in Figure answer the following questions: +V power V - - V out V + + -V power Figure. a) (4 points) How would you connect two resistors R and R 2 to the op-amp such that it will function as an inverting amplifier? (raw the diagram). b) (3 points) How will you choose the above resistors to create a voltage inverter (output voltage is equal and opposite to the input voltage)? c) (4 points) How would you connect two resistors R and R 2 to the op-amp such that it will output +V power when input voltage V in is greater than threshold voltage V t, and -V power when it is smaller? (raw the diagram). d) (3 points) Write down an expression for the threshold voltage V t of the above comparator as a function of R, R 2 and V power. e) (3 points) Write down an expression for V + and V - that represents the virtual short assumption. Final xam lab questions C20B /4
6 2. (7 pts. total) For a circuit similar to the robot restart circuit (Figure 2) complete the timing diagram. Clearly mark the minimum and maximum voltages at each panel. t the bottom panel show the output when the reset button is closed. R2 R B C C2 C Reset R3 B C (Reset closed) Figure 2. Final xam lab questions C20B 2/4
7 3. (8 pts. total) For the enter key detector circuit studied in lab (Figure 3) answer the following questions: R7 =.8 kω Clock Input C H NTR R0 = 5 k Ω R9 = 00 k Ω C Q B _ C Q F G C7 = 6800 pf Teach Pendant R5 = 5 k Ω Figure 3. a) (6 points) Write down a Boolean expression for the output H as a function of the inputs B,, F and the clock input C. b) (2 points) Complete the timing diagram in the Figure 4 below when the teach pendant is attached. Both flip-flops are positive edge triggered. (Hint, don t forget about C7 and R7 when drawing the output H) C B F G H Figure 4. Final xam lab questions C20B 3/4
8 4. (4 pts. total) Memory system & programming of the robot: a) (2 points) Suppose instructions in our robot are stored on a chip with 4 input memory lines and 9 address lines from the counter. What is the total size of the program (number of instructions) that can be stored on the chip? (a) 28 (b) 256 (c) 52 (d) 024 (e) 2048 b) (2 points) What is the total size (number of bits stored) of the memory for the above chip? (a) 28 (b) 256 (c) 52 (d) 024 (e) 2048 c) (2 point) How many combinations of input instructions are possible at a single memory address for the above chip? (a) 4 (b) 8 (c) 6 (d) 32 (e) 64 d) (2 points) stimate what clock rate you will use to let the single complete program for the above robot with 4 input memory lines and 9 address lines (all connected to counter) run for 256s? (a) 0.25Hz (b) 0.5Hz (c) Hz (d) 2Hz (e) 4Hz e) (2 points) How will the length of a single step by the robot (forward movement) be changed if you double the clock frequency? (a) will increase 2 times (b) will stay the same (c) will decrease 2 times f) (2 points) How will the angle of a single step by the robot (left/right turn) be changed if you halve the clock frequency? (a) will increase 2 times (b) will stay the same (c) will decrease 2 times g) (2 points) escribe how would you program the robot to repeat all the instructions already stored in memory? How would you program the pause command? Final xam lab questions C20B 4/4
Department of Electrical Engineering and Computer Sciences University of California, Berkeley. Final Exam Solutions
Electrical Engineering 42/00 Summer 202 Instructor: Tony Dear Department of Electrical Engineering and omputer Sciences University of alifornia, Berkeley Final Exam Solutions. Diodes Have apacitance?!?!
More informationDepartment of Electrical Engineering and Computer Sciences University of California, Berkeley. Final Exam: Friday, August 10, 2012
Electrical Engineering 42/00 Summer 202 Instructor: Tony Dear Department of Electrical Engineering and Computer Sciences University of California, Berkeley Final Exam: Friday, August 0, 202 Last Name:
More informationDigital Electronics Final Examination. Part A
Digital Electronics Final Examination Part A Spring 2009 Student Name: Date: Class Period: Total Points: /50 Converted Score: /40 Page 1 of 13 Directions: This is a CLOSED BOOK/CLOSED NOTES exam. Select
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
More informationENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)
ENGR4 Test A Fall 5 ENGR4 Fall 5 Test A Name Section Question (5 points) Question (5 points) Question (5 points) Question 4 (5 points) Total ( points): Please do not write on the crib sheets. On all questions:
More informationPAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:
EKURHULENI TECH COLLEGE. No. 3 Mogale Square, Krugersdorp. Website: www. ekurhulenitech.co.za Email: info@ekurhulenitech.co.za TEL: 011 040 7343 CELL: 073 770 3028/060 715 4529 PAST EXAM PAPER & MEMO N3
More informationSchedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.
Schedule Date Day Class No. Dec Mon 25 Final Review 2 Dec Tue 3 Dec Wed 26 Final Review Title Chapters HW Due date Lab Due date LAB 8 Exam 4 Dec Thu 5 Dec Fri Recitation HW 6 Dec Sat 7 Dec Sun 8 Dec Mon
More informationQuiz 2 Solutions Room 10 Evans Hall, 2:10pm Tuesday April 2 (Open Katz only, Calculators OK, 1hr 20mins)
UNIVERSITY OF CALIFORNIA AT BERKELEY ERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO SANTA BARBARA SANTA CRUZ Department of Electrical Engineering and Computer Sciences Quiz 2 Solutions
More information11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of
EE 2449 Experiment 11 Jack Levine and Nancy Warter-Perez CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 11 SEQUENTIAL CIRCUITS
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationEE 209 Spiral 1 Exam Solutions Name:
EE 29 Spiral Exam Solutions Name:.) Answer the following questions as True or False a.) A 4-to- multiplexer requires at least 4 select lines: true / false b.) An 8-to- mux and no other logic can be used
More informationUniversity of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014
Page 1/12 Exam 1 May the Schwartz Instructions: be with you! Turn off all cell phones and other noise making devices and put away all electronics Show all work on the front of the test papers Box each
More informationBER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO
UN IVERSIT Y O F CA LIFO RNI A AT BERKELEY BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO SAN TA BARBA RA S AN TA CRUZ De p a r tm en t of Ele ctr i ca l En gin e e rin g a
More informationDigital Electronics. Part A
Digital Electronics Final Examination Part A Winter 2004-05 Student Name: Date: lass Period: Total Points: Multiple hoice Directions: Select the letter of the response which best completes the item or
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
More informationUniversity of Florida EEL 3701 Summer 2015 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Tuesday, 30 June 2015
University of Florida EEL 3701 Summer 2015 Dr Eric M Schwartz Page 1/13 Exam 1 May the Schwartz be with you! Instructions: Turn off all cell phones and other noise making devices Show all work on the front
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationShift Register Counters
Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationUNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
More informationECE Circuit Theory. Final Examination. December 5, 2008
ECE 212 H1F Pg 1 of 12 ECE 212 - Circuit Theory Final Examination December 5, 2008 1. Policy: closed book, calculators allowed. Show all work. 2. Work in the provided space. 3. The exam has 3 problems
More information04. What is the Mod number of the counter circuit shown below? Assume initially reset.
. Which of the following is the state diagram for the Meale machine shown below. 4. What is the Mod number of the counter circuit shown below? Assume initiall reset. input CLK D output D D a. b. / / /
More informationENGR4300 Fall 2005 Test 3S. Name solution. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)
ENGR400 Test S Fall 005 ENGR400 Fall 005 Test S Name solution Section uestion (5 points) uestion (5 points) uestion (5 points) uestion 4 (5 points) Total (00 points): Please do not write on the crib sheets.
More informationUniversity of Minnesota Department of Electrical and Computer Engineering
University of Minnesota Department of Electrical and Computer Engineering EE2301 Fall 2008 Introduction to Digital System Design L. L. Kinney Final Eam (Closed Book) Solutions Please enter your name, ID
More informationComputers also need devices capable of Storing data and information Performing mathematical operations on such data
Sequential Machines Introduction Logic devices examined so far Combinational Output function of input only Output valid as long as input true Change input change output Computers also need devices capable
More informationEET 310 Flip-Flops 11/17/2011 1
EET 310 Flip-Flops 11/17/2011 1 FF s and some Definitions Clock Input: FF s are controlled by a trigger or Clock signal. All FF s have a clock input. If a device which attempts to do a FF s task does not
More informationChapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
More informationRead this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University epartment of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Spring Semester, 27
More informationEGR224 F 18 Assignment #4
EGR224 F 18 Assignment #4 ------------------------------------------------------------------------------------------------------------- Due Date: Friday (Section 10), October 19, by 5 pm (slide it under
More informationQuiz 2 Room 10 Evans Hall, 2:10pm Tuesday April 2 (Open Katz only, Calculators OK, 1hr 20mins)
Your Name: NIVERSITY OF CALIFORNIA AT BERKELEY RKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO Department of Electrical Engineering and Computer Sciences SANTA BARBARA SANTA CRUZ CS 150
More informationCHAPTER 7. Exercises 17/ / /2 2 0
CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2
More informationExam for Physics 4051, October 31, 2008
Exam for Physics 45, October, 8 5 points - closed book - calculators allowed - show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following
More informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic
ENGG 1203 Tutorial_9 - Review Boolean Algebra 1. Combinational & Sequential Logic 2. Computer Systems 3. Electronic Circuits 4. Signals, Systems, and Control Remark : Multiple Choice Questions : ** Check
More informationEE 209 Logic Cumulative Exam Name:
EE 209 Logic Cumulative Exam Name: 1.) Answer the following questions as True or False a.) A 4-to-1 multiplexer requires at least 4 select lines: true / false b.) An 8-to-1 mux and no other logi can be
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationDigital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.
Digital Circuits 1. Inputs & Outputs are quantized at two levels. 2. inary arithmetic, only digits are 0 & 1. Position indicates power of 2. 11001 = 2 4 + 2 3 + 0 + 0 +2 0 16 + 8 + 0 + 0 + 1 = 25 Digital
More informationLatches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
More informationComputer Science Final Examination Friday December 14 th 2001
Computer Science 03 60 265 Final Examination Friday December 14 th 2001 Dr. Robert D. Kent and Dr. Alioune Ngom Last Name: First Name: Student Number: INSTRUCTIONS EXAM DURATION IS 3 HOURs. CALCULATORS,
More informationSequential Circuit Analysis
Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll
More informationENGR-4300 Fall 2008 Test 3. Name SOLUTION. Section 1(MR 8:00) 2(TF 2:00) (circle one) Question I (20 points) Question II (15 points)
ENGR-4300 Fall 008 Test 3 Name SOLUTION Section (MR 8:00) (TF :00) (circle one) Question I (0 points) Question II (5 points) Question III (0 points) Question I (0 points) Question (5 points) Total (00
More informationWritten exam for IE1204/5 Digital Design with solutions Thursday 29/
Written exam for IE4/5 Digital Design with solutions Thursday 9/ 5 9.-. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 8-794487 Exam text does not have to be returned when
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS151/251A V. Stojanovic, J. Wawrzynek Fall 2015 10/13/15 Midterm Exam Name: ID
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
More information3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter. Lab 3. Lab 3 Gate Timing. Lab 3 Steps in designing a State Machine. Timing diagram of a DFF
ENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter Timing diagram of a DFF Lab 3 Gate Timing difference timing for difference kind of gate, cost dependence (1) Setup Time = t2-t1 (2) Propagation
More informationEECS 270 Midterm 2 Exam Answer Key Winter 2017
EES 270 Midterm 2 Exam nswer Key Winter 2017 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. NOTES: 1. This part of the exam
More informationIntroduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison
Introduction to Computer Engineering CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison Chapter 3 Digital Logic Structures Slides based on set prepared by
More informationUNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017
UNIVERSITY OF BOLTON TW35 SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER 2-2016/2017 INTERMEDIATE DIGITAL ELECTRONICS AND COMMUNICATIONS MODULE NO: EEE5002
More informationPlease read carefully. Good luck & Go Gators!!!
Page 1/12 Exam 1 May the Schwartz be with you! Instructions: Turn off all cell phones and other noise making devices and put away all electronics Show all work on the front of the test papers Box each
More informationECE 201 Fall 2009 Final Exam
ECE 01 Fall 009 Final Exam December 16, 009 Division 0101: Tan (11:30am) Division 001: Clark (7:30 am) Division 0301: Elliott (1:30 pm) Instructions 1. DO NOT START UNTIL TOLD TO DO SO.. Write your Name,
More informationRead this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University epartment of omputer and Information Sciences SI 25 (Tarnoff) omputer Organization TEST 2 for Fall Semester, 28 Read
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More informationCS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON Prof. Mark D. Hill & Prof. Mikko Lipasti TAs Sanghamitra Roy, Eric Hill, Samuel Javner, Natalie
More informationDE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
More informationTime Allowed 3:00 hrs. April, pages
IGITAL ESIGN COEN 32 Prof. r. A. J. Al-Khalili Time Allowed 3: hrs. April, 998 2 pages Answer All uestions No materials are allowed uestion a) esign a half subtractor b) esign a full subtractor c) Using
More informationSequential Circuit Design
Sequential Circuit esign esign Procedure. Specification 2. Formulation Obtain a state diagram or state table 3. State Assignment Assign binary codes to the states 4. Flip-Flop Input Equation etermination
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationCS61C : Machine Structures
CS 61C L15 Blocks (1) inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks Outline CL Blocks Latches & Flip Flops A Closer Look 2005-07-14 Andy Carle CS
More informationECE 2210 Final given: Spring 15 p1
ECE 2 Final given: Spring 15 Closed Book, Closed notes except preprinted yellow sheet, Calculators OK. Show all work to receive credit. Circle answers, show units, and round off reasonably 1. (15 pts)
More informationKing Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page of COE 22: Digital Logic Design (3--3) Term (Fall 22) Final Exam Sunday January
More informationA B D 1 Y D 2 D 3. Truth table for 4 to 1 MUX: A B Y 0 0 D D D D 3
. What is a multiplexer? esign a 4 to multiplexer using logic gates. Write the truth table and explain its working principle. Answer: is a circuit with many inputs but only one output. esigning of 4 to
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks 2005-07-14 CS 61C L15 Blocks (1) Andy Carle Outline CL Blocks Latches & Flip Flops A Closer Look CS
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts
More informationCMPE12 - Notes chapter 1. Digital Logic. (Textbook Chapter 3)
CMPE12 - Notes chapter 1 Digital Logic (Textbook Chapter 3) Transistor: Building Block of Computers Microprocessors contain TONS of transistors Intel Montecito (2005): 1.72 billion Intel Pentium 4 (2000):
More informationCOEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University
1 OEN 312 DIGIAL SYSEMS DESIGN - LEURE NOES oncordia University hapter 6: Registers and ounters NOE: For more examples and detailed description of the material in the lecture notes, please refer to the
More informationEECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009
Signature: EECS 312: Digital Integrated Circuits Final Exam Solutions 23 April 2009 Robert Dick Show your work. Derivations are required for credit; end results are insufficient. Closed book. You may use
More informationLecture 14 Finite state machines
Lecture 14 Finite state machines Finite state machines are the foundation of nearly all digital computation. The state diagram captures the desired system behavior A formulaic process turns this diagram
More informationDifferent encodings generate different circuits
FSM State Encoding Different encodings generate different circuits no easy way to find best encoding with fewest logic gates or shortest propagation delay. Binary encoding: K states need log 2 K bits i.e.,
More informationDigital Signal 2 N Most Significant Bit (MSB) Least. Bit (LSB)
1 Digital Signal Binary or two stages: 0 (Low voltage 0-3 V) 1 (High voltage 4-5 V) Binary digit is called bit. Group of bits is called word. 8-bit group is called byte. For N-bit base-2 number = 2 N levels
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationThe course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab.
Circuits Lab Names: Objectives Learn how circuits work, different properties of circuits, and how to derive truth tables, circuits from functions and simply circuits using Boolean circuit equivalence..
More informationDigital Electronic Meters
Digital Electronic Meters EIE 240 Electrical and Electronic Measurement May 1, 2015 1 Digital Signal Binary or two stages: 0 (Low voltage 0-3 V) 1 (High voltage 4-5 V) Binary digit is called bit. Group
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER
SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL
More informationThe University of Michigan Department of Electrical Engineering and Computer Science. EECS 270 Fall Practice Final Exam.
The University of Michigan Department of Electrical Engineering and Computer Science EECS 270 Fall 2003 Practice Final Exam Name: UM ID: For all questions, show all work that leads to your answer. Problem
More informationMemory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
More informationFor smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS5 J. Wawrzynek Spring 22 2/22/2. [2 pts] Short Answers. Midterm Exam I a) [2 pts]
More informationWritten exam with solutions IE1204/5 Digital Design Friday 13/
Written eam with solutions IE204/5 Digital Design Friday / 207 08.00-2.00 General Information Eaminer: Ingo Sander. Teacher: Kista, William Sandqvist tel 08-7904487 Teacher: Valhallavägen, Ahmed Hemani
More informationELEN Electronique numérique
ELEN0040 - Electronique numérique Patricia ROUSSEAUX Année académique 2014-2015 CHAPITRE 3 Combinational Logic Circuits ELEN0040 3-4 1 Combinational Functional Blocks 1.1 Rudimentary Functions 1.2 Functions
More informationEECE 2510 Circuits and Signals, Biomedical Applications Final Exam Section 3. Name:
EECE 2510 Circuits and Signals, Biomedical Applications Final Exam Section 3 Instructions: Closed book, closed notes; Computers and cell phones are not allowed Scientific calculators are allowed Complete
More informationDr. S. Shirani COE2DI4 Midterm Test #2 Nov. 9, 2010
Dr. S. Shirani COE2DI4 Midterm Test #2 Nov. 9, 2010 Instructions: This examination paper includes 11 pages and 20 multiple-choice questions starting on page 3. You are responsible for ensuring that your
More informationINTEGRATED CIRCUITS. For a complete data sheet, please also download:
INTEGRATED CIRCUITS DATA SEET For a complete data sheet, please also download: The IC0 74C/CT/CU/CMOS ogic Family Specifications The IC0 74C/CT/CU/CMOS ogic Package Information The IC0 74C/CT/CU/CMOS ogic
More informationNAME SID EE42/100 Spring 2013 Final Exam 1
NAME SID EE42/100 Spring 2013 Final Exam 1 1. Short answer questions a. There are approximately 36x10 50 nucleons (protons and neutrons) in the earth. If we wanted to give each one a unique n-bit address,
More informationRead this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University Department of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Spring Semester,
More informationS.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques
S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12] Q.1(a) (i) Derive AND gate and OR gate
More informationOhm s Law and Electronic Circuits
Production Ohm s Law and Electronic Circuits Page 1 - Cyber Security Class ELECTRICAL CIRCUITS All you need to be an inventor is a good imagination and a pile of junk. -Thomas Edison Page 2 - Cyber Security
More informationWritten reexam with solutions for IE1204/5 Digital Design Monday 14/
Written reexam with solutions for IE204/5 Digital Design Monday 4/3 206 4.-8. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 08-7904487 Exam text does not have to be returned
More informationLecture 17: Designing Sequential Systems Using Flip Flops
EE210: Switching Systems Lecture 17: Designing Sequential Systems Using Flip Flops Prof. YingLi Tian April 11, 2019 Department of Electrical Engineering The City College of New York The City University
More informationUNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences. Professor Oldham Fall 1999
UNIVERSITY OF CLIFORNI College of Engineering Department of Electrical Engineering and Computer Sciences Professor Oldham Fall 1999 EECS 40 FINL EXM 13 December 1999 Name: Last, First Student ID: T: Kusuma
More informationPhysics 1252 Exam #3A
Physics 1252 xam #3A nstructions: This is a closed-book, closed-notes exam. You are allowed to use a clean print-out of your formula sheet, any scientific calculator, and a ruler. Do not write on your
More informationor 0101 Machine
Synchronous State Graph or Synchronous State Graph or Detector Design a state graph for a machine with: One input X, one output Z. Z= after receiving the complete sequence or Overlapped sequences are detected.
More informationChapter 7. Sequential Circuits Registers, Counters, RAM
Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage
More informationCh 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
More informationDigital Design through Arduino
1 Digital Design through Arduino G V V Sharma Contents 1 Display Control through Hardware 1 1.1 Components......... 1 1.2 Powering the Display.... 1 1.3 Controlling the Display... 2 2 Display Control through
More informationCMPE12 - Notes chapter 2. Digital Logic. (Textbook Chapters and 2.1)"
CMPE12 - Notes chapter 2 Digital Logic (Textbook Chapters 3.1-3.5 and 2.1)" Truth table" The most basic representation of a logic function." Brute force representation listing the output for all possible
More information