CS 151 Midterm. Instructions: Student ID. (Last Name) (First Name) Signature

Similar documents
CS 151 Midterm. (Last Name) (First Name)

CS 151 Quiz 4. Instructions: Student ID. (Last Name) (First Name) Signature

CS 151 Final. Q1 Q2 Q3 Q4 Q5 Total Credit Score. Instructions: Student ID. (Last Name) (First Name) Signature

CS 151 Final. (Last Name) (First Name)

CS 151 Midterm. Instructions: Student ID. (Last Name) (First Name) Signature

CS303 LOGIC DESIGN FINAL EXAM

EPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013

Sequential Logic Implementation. Mealy vs. Moore Machines. Specifying Outputs for a Mealy Machine. Specifying Outputs for a Moore Machine

York University AS/AK/ITEC INTRODUCTION TO DATA STRUCTURES. Midterm Sample I. Examiner: S. Chen Duration: One Hour and 30 Minutes

Student Number: UTORid: Question 0. [1 mark] Read and follow all instructions on this page, and fill in all fields.

CS 351 Exam 2, Fall 2012

COS 226 Fall 2015 Midterm Exam pts.; 60 minutes; 8 Qs; 15 pgs :00 p.m. Name:

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

Prerequisite Quiz January 23, 2007 CS252 Computer Architecture and Engineering

ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014

CSE 123: Computer Networks Fall Quarter, 2013 MIDTERM EXAM

Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK

EECS 270 Midterm Exam

The LC3's micro-coded controller ("useq") is nothing more than a finite-state machine (FSM). It has these inputs:

Midterm Exam. CS169 Fall November 17, 2009 LOGIN: NAME: SID: Problem Max Points Points TOTAL 100

University of Florida EEL 4744 Summer 2014 Dr. Eric M. Schwartz Department of Electrical & Computer Engineering 1 July Oct-14 6:41 PM

ENEL Digital Circuits Midterm Examination

Final Exam Solution Sunday, December 15, 10:05-12:05 PM

CSE140L: Components and Design Techniques for Digital Systems Lab. FSMs. Instructor: Mohsen Imani. Slides from Tajana Simunic Rosing

Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil

CS 320 Midterm Exam Solution

Problem Points Your Points Total 80

Midterm I - Solution CS164, Spring 2014

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences. Spring 2010 May 10, 2010

General FSM design procedure

General FSM design procedure

MA 113 Calculus I Fall 2015 Exam 2 Tuesday, 20 October Multiple Choice Answers. Question

University of Toronto Department of Electrical and Computer Engineering. Midterm Examination. ECE 345 Algorithms and Data Structures Fall 2012

IMPORTANT: Circle the last two letters of your class account:

Perfect Student CS 343 Final Exam May 19, 2011 Student ID: 9999 Exam ID: 9636 Instructions Use pencil, if you have one. For multiple choice

CSci530 Final Exam. Fall 2011

CS164: Midterm Exam 2

CS 140: Operating Systems and Systems Programming Midterm Exam

Note: Closed book no notes or other material allowed, no calculators or other electronic devices.

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

CSE 120 Principles of Computer Operating Systems Fall Quarter, 2001 Midterm Exam. Instructor: Geoffrey M. Voelker

EECS489 Computer Networks, Take-home Makeup Midterm (Winter 2007) due in class Wednesday 3/28

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

Department of Electrical Engineering and Computer Sciences Spring 2001 Instructor: Dan Garcia CS 3 Midterm #2. Personal Information

York University. AP/ITEC Section M INTRODUCTION TO DATA STRUCTURES Winter Midterm Test

Instructor: Ashley Taylor Spring 2018 May 10, Midterm Exam NAME (LAST, FIRST): Problem TOTAL

Prerequisite Quiz September 3, 2003 CS252 Computer Architecture and Engineering

UNIVERSITY OF CONNECTICUT. ECE 3411 Microprocessor Application Lab: Fall Quiz III

CSE 123: Computer Networks Fall Quarter, 2017 MIDTERM EXAM

CMPSCI 453 Instructor V. Arun Fall Midterm 11/07/2007

The University of Alabama in Huntsville ECE Department CPE Midterm Exam February 26, 2003

EE251: Tuesday December 4

CPSC 121: Models of Computation

CMSC 131A, Midterm 1 (Practice) Fall 2017

Storage Elements & Sequential Circuits

CS 140 Midterm Examination Winter Quarter, 2012

Discrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1

Course Text. Course Description. Course Objectives. StraighterLine Introduction to Programming in C++

CS 320 Midterm Exam. Fall 2018

ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010

Keyboard Input to Seven Segment Display

CS 2630 Computer Organization. Meeting 13: Faster arithmetic and more operations Brandon Myers University of Iowa

Note that there are questions printed on both sides of each page!

Student Name: University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science

Federal Urdu University of Arts, Science and Technology, Islamabad VLSI SYSTEM DESIGN. Prepared By: Engr. Yousaf Hameed.

CS2100 COMPUTER ORGANISATION

14-740: Fundamentals of Computer and Telecommunication Networks

Laboratory Pipeline MIPS CPU Design (2): 16-bits version

Sign here to give permission for your test to be returned in class, where others might see your score:

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AN:p ENGINEERING. ECE241F - Digital Syst~ms Final Examination

CSci530 Final Exam. Fall 2014

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

CSCI 466 Midterm Networks Fall 2011

Mealy and Moore examples


The VHDL Hardware Description Language

I 3 I 2. ! Language of logic design " Logic optimization, state, timing, CAD tools

CS157a Fall 2018 Sec3 Home Page/Syllabus

(the bubble footer is automatically inserted in this space)

ECE : Fundamentals of Wireless Networking - Spring 2007

problem maximum score 1 8pts 2 6pts 3 10pts 4 15pts 5 12pts 6 10pts 7 24pts 8 16pts 9 19pts Total 120pts

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) UNIT-I

University of California, Berkeley College of Engineering

ECE 461 Internetworking Fall Quiz 1

University of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012

CSCI 466 Midterm Networks Fall 2011

Fundamentals of Programming Session 1

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

CS 374 Fall 2014 Homework 2 Due Tuesday, September 16, 2014 at noon

CMSC 131A, Midterm 1 (Practice) SOLUTION. Fall 2017

SECTION A. (i) The Boolean function in sum of products form where K-map is given below (figure) is:

1.204 Quiz 1. Spring Name. Exam guidelines:

Register Transfer Level in Verilog: Part I

Midterm I (Solutions) CS164, Spring 2002

ECE 545 Fall 2014 Midterm Exam

Put your initials on the top of every page, in case the pages become separated.

Design of Digital Circuits ( L) ETH Zürich, Spring 2017

Syllabus COSC-051-x - Computer Science I Fall Office Hours: Daily hours will be entered on Course calendar (or by appointment)

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

EE457. Note: Parts of the solutions are extracted from the solutions manual accompanying the text book.

Transcription:

CS 151 Midterm Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 11 pages including this cover. 2. Write down your Student-Id on the top of each page of this quiz. 3. This exam is closed book. No notes or other materials are permitted. 4. Total credits of this midterm are 50 points. 5. To receive credit you must show your work clearly. 6. No re-grades will be entertained if you use a pencil. 7. Calculators are NOT allowed. CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 1

Q1: Memory hierarchy [10 points] Design a 64K*32-bit RAM using 16K*16-bit RAM modules shown below. 16K*16-bit RAM Module Use a minimum number of the following logic components in your design (no other components may be used for this design): 1) Priority Encoder 2) Decoder 3) Multiplexer CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 2

<This page is intentionally left blank> CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 3

Q2: Design of a Traffic Light Controller [40 points] Consider the intersection of Campus and California shown below and consider only the two Traffic Lights (TL) on Campus and California as shown below. Furthermore, assume that traffic on Campus and California are one-way. Design a digital system that controls the two traffic lights at this intersection with the goal of minimizing congestion by balancing the traffic load. The basic idea is to give more time for cars passing through the road with a higher traffic load. To determine the traffic load, assume that a sensor on each road registers a pulse when it senses a car passing through that intersection. Assume further that cars pass the intersection ONLY when the traffic light is green, and we count the number of the cars that pass through the intersection. California TL California TLCampus Campus Campus-California Intersection We estimate the traffic load on each road using the rate at which cars pass through intersection. That is, Rate(TL) = The number of cars passing through the intersection (while the traffic light is green) divided by number of cycles for that period. Based on the comparative traffic loads, the TLs are in one of the following modes: a) Campus High Mode, where Rate(TL Campus ) >= 2*Rate(TL California ): TL Campus is Green for 64 cycles, followed by Yellow for 8 cycles and Red for 40 cycles; concurrently, TL California is Red for 72 cycles, Yellow for 8 cycles and Green for 32 cycles. b) California High Mode, where Rate(TL California ) >= 2*Rate(TL Campus ): TL California is Green for 64 cycles, followed by Yellow for 8 cycles and Red for 40 cycles; concurrently, TL Campus is Red for 72 cycles, Yellow for 8 cycles and Green for 32 cycles. c) Comparable Load Mode, where we assume that the rates are comparable: TL California and TL Campus are Green for 32 cycles, Yellow for 8 cycles and Red for 40 cycles. (Obviously when TL Campus is green or yellow, TL California is red and vice versa.) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 4

NOTE: To prevent traffic on any road from being stuck at Red indefinitely, make the following assumption: the traffic mode of the intersection is determined after each intersection has had a Green light once. For instance, if we start with TL Campus = Green we will check for the traffic mode of the intersection only after TL Campus cycles through Yellow and Red, and TL California cycles through Green,Yellow, Red. After both streets have allowed cars to pass through, we will check for the traffic load to determine the next Load Mode for the intersection. Assume the initial condition: TL Campus = Green, TL California = Red and Rate(TL California ) = Rate(TL Campus ). (We are in Comparable Load Mode) i. Draw a template of the FSM and datapath. (5 points) (Hint: You just need to show the external inputs and outputs of the system to the controller and datapath shown below. You will design the interface between the datapath and the controller later in this question) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 5

ii. Design the High-Level State Machine for this traffic light system. (10 points) (Hint: In your state machine you have 3 different modes and each state in each mode in your state machine shows the status of your traffic lights) (If necessary, clearly state any reasonable assumptions you might make for this part.) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 6

iii. Draw the state action table for this controller. (5 points) (A table indicating in each state what actions should be taken.) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 7

iv. Design the datapath using components. (10 points) Use the following block to get the rate on each road. This block gives Rate(TL) = number of cars passed/number of clock cycles while Enable=1. (Hint: You should first store Rate(TL) and then use it.) Car Detect Enable clock Rate Generator Rate(TL) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 8

<This page is intentionally left blank> CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 9

v. Controller interface: draw the signals between Controller and the Datapath. (5 points) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 10

vi. Annotate the state diagram with control signals for each state. (5 points) (You need not design the FSM controller using Flip Flops and Logic; simply indicate which control signals should be activated in each state for correct operation of the design.) CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 11

CS 151 Digital Logic Design, Fall Quarter 2006, Midterm Page 12