# Class Exercise 1A.

## Presentation on theme: "Class Exercise 1A."— Presentation transcript:

Class Exercise 1A

Rules If you believe that you know a correct answer, please raise your hand I will select one or more students (independently whether an answer given by the first student is correct or incorrect) Please, identify yourself by first name and give an answer Correct answer = bonus point 8

Problem 1 List all 2-input logic gates that you can recall.

Problem 2 How many 2-input logic functions can be theoretically defined (whether they make sense or not)?

Problem 3 List all 1-input logic gates.

Problem 4 What is a minimum set of gates that can be used to implement all logic functions?

Problem 5 List four ways of expressing logic functions.

Problem 6 What are the De Morgan’s Laws? Write their equations and draw their schematic representation.

Problem 7 How many select inputs does an 8-to-1 MUX have? How many select inputs does an n-to-1

Problem 7 How many outputs does a decoder with two data inputs have? n data inputs have?

Problem 8 Show how to implement a decoder that recognizes the following 4 ranges of a 16-bit address A, and generates the corresponding enable signals e0,e1,e2,e3: For A in: Assert C000-CFFF: e0 D000-DFFF: e1 E000-EFFF: e2 F000-FFFF: e3

Problem 9 How many inputs does an encoder with two data outputs have? n data outputs have?

Problem 10 What is a difference between encoder and priority encoder?

Problem 11 Show how to implement Priority Encoder using multiplexers and a minimum number of logic gates

Problem 13 Show how to implement Full Adder using 8-to-1 multiplexers only

Problem 14 Show how to implement Full Adder using 4-to-1 multiplexers and inverters only

Problem 15 What is the width of an output of a 4x4 unsigned multiplier? a 4x4 signed multiplier? a NxN unsigned multiplier?

Problem 16 What is the width of an output of a 4x8 unsigned multiplier? a 4x8 signed multiplier? a NxM unsigned multiplier?

Problem 17 Give an example of binary inputs to an unsigned 4x4 multiplier and a signed 4x4 multiplier that produce different results.

Problem 18 Explain how to perform the following operations Z = X+Y mod 24 Z = X*Y mod 24 using a 4-bit adder with carry in (cin) and carry out (cout), and a 4x4 multiplier, respectively, where X, Y, and Z are 4-bit variables.

Problem 19 Explain how to perform the following operation using simple arithmetic and logic circuits: Y = (X*(2X + 1)) mod 24, where X and Y are 4-bit variables.

Problem 20 Explain using simple diagrams (based on medium-scale logic components) how to efficiently perform the following operations in hardware using combinational logic only A. C = A <<< 3 B. C = A <<< B, where A, B, and C are 8-bit variables.

Problem 21 What is a size of a memory with a 4-bit address input and an 8-bit data output? an m-bit address input and an n-bit data output?

Problem 22 Show how to implement Full Adder using ROM (diagram + contents of ROM)

Problem 23 Show how to implement a 3x3 squarer, implementing equation y = x2, using ROM (diagram + contents of ROM).

Problem 24 Explain how to perform the following operation using a single-port ROM only: Y = (X*(2X + 1)) mod 28, where X and Y are 8-bit variables. Show the implementation as a ROM, including the width of the address input and the width of the data output, as well as the contents of memory locations with addresses 0, 1, 8 and 16.

Problem 25 What is a function of a tri-state buffer?