cs151_fq09_q3_sol - CS 151 Quiz 3 Name : , (Last Name)...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 151 Quiz 3 Name : , (Last Name) (First Name) Student ID : Signature : Instructions: Please verify that your paper contains 7 pages including this cover. Write down your Student ID on the top of each page of this quiz. This exam is closed book. No notes or other materials are permitted. Total credits of this midterm are 40 points. To receive credit you must show your work clearly. No regrades will be entertained it you use a. pencil. NQ’S”?F3!\3:‘ Calculators are NOT allowed. Qt: [Combinational component usage] [5 points] Design a circuit that outputs the average of four 8-bit inputs representing positive binary numbers. You can use only the following components 1. Three 8 bit adders 2. One 2 bit shifter HlNT: a division by 2 is equivalent to a right shift by one place. Assume the numbers are small enough such that Carry out of all adders are alvvays zero A 4. C “t 02: Two’s complement number [5 points] (a) Convert the following 25 complement number into decimal "l “l 100000 a: lea; 1.35mi} l; 00:;06QQ ;‘ {Outlaw I w “l w 3000:” v :1; l Q3: [Counter usage] [15 points] Design a counter that generates the following sequence repeatedly: 3969991291591892192493..... Use only one 3-bit binary counter and some or all of components listed below: a) 1 bit Shifter b) 4 bit Adder c) 5 bit Adder [3w “W16, , W53 C3511“ $1?va m. . . 1 . is m; Q’Fo f ” " V ‘fi i, a v” _ ~n ti, . _ l w ' l {A 113% w ‘” Q? “5' fix: :3 LA; 345149, A lfi‘iflcffl‘ix ‘a W.th Ev we 1 r I .s \ “ W4 . . , s a} i a <b|ank page1> Q4: [Registers] [15 points] Design inside the Black Box below to implement a 4bit register with the functionality specified in the following table. (A = a3a2a1ao is the output of the register.) NOTE: Specify the select lines of each multiplexer as well as the inputs. You can use the following components if needed: Adder, Comparator, Logic gates st MMWMW m Wuwmwwgfw W L._,,_._m. NMWMMW. <blank page2> <blank page 3> ...
View Full Document

This note was uploaded on 05/27/2010 for the course ELE 225 taught by Professor Amrnady during the Spring '10 term at American University in Cairo.

Page1 / 7

cs151_fq09_q3_sol - CS 151 Quiz 3 Name : , (Last Name)...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online