One and a half hours. Section A is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

Similar documents
One and a half hours. Section A is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

One and a half hours. Section A is COMPULSORY

Two hours - online EXAM PAPER MUST NOT BE REMOVED FROM THE EXAM ROOM UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

COMP12111 Fundamentals of Computer Engineering Paul Nutter Vasilis Pavlidis Comments

EPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013

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

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

CPU ARCHITECTURE. QUESTION 1 Explain how the width of the data bus and system clock speed affect the performance of a computer system.

Finite-State Machine (FSM) Design

1. INTRODUCTION TO MICROPROCESSOR AND MICROCOMPUTER ARCHITECTURE:

Digital Design & Computer Architecture (E85) D. Money Harris Fall 2007

EE 3170 Microcontroller Applications

NADAR SARASWATHI COLLEGE OF ENGINEERING AND TECHNOLOGY Vadapudupatti, Theni

ECE 2300 Digital Logic & Computer Organization. More Sequential Logic Verilog

2015 Paper E2.1: Digital Electronics II

Dec Hex Bin ORG ; ZERO. Introduction To Computing

CS 31: Intro to Systems Digital Logic. Kevin Webb Swarthmore College February 3, 2015

Outline. EECS Components and Design Techniques for Digital Systems. Lec 11 Putting it all together Where are we now?

ARM 64-bit Register File

END-TERM EXAMINATION

FPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 1

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

C A R L E T O N U N I V E R S I T Y. FINAL EXAMINATION April Duration: 3 Hours No. of Students: 108

Chapter 4. MARIE: An Introduction to a Simple Computer. Chapter 4 Objectives. 4.1 Introduction. 4.2 CPU Basics

Computer Systems. Binary Representation. Binary Representation. Logical Computation: Boolean Algebra

General FSM design procedure

General FSM design procedure

ECE 574: Modeling and Synthesis of Digital Systems using Verilog and VHDL. Fall 2017 Final Exam (6.00 to 8.30pm) Verilog SOLUTIONS

ENGN3213 Digital Systems and Microprocessors Course Overview with MU0

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

problem maximum score 1 10pts 2 8pts 3 10pts 4 12pts 5 7pts 6 7pts 7 7pts 8 17pts 9 22pts total 100pts

Three-box Model: These three boxes need interconnecting (usually done by wiring known as a bus. 1. Processor CPU e.g. Pentium 4 2.

Digital Design with FPGAs. By Neeraj Kulkarni

CS 31: Intro to Systems Digital Logic. Kevin Webb Swarthmore College February 2, 2016

Lecture 15: System Modeling and Verilog

RealDigital. Problem Set #7 S1 S2 S3 Y Z X Y + Y Z X Z

1. Prove that if you have tri-state buffers and inverters, you can build any combinational logic circuit. [4]

1 MALP ( ) Unit-1. (1) Draw and explain the internal architecture of 8085.

Lecture Objectives. Introduction to Computing Chapter 0. Topics. Numbering Systems 04/09/2017

Digital Circuit Design and Language. Datapath Design. Chang, Ik Joon Kyunghee University

EE 231 Fall EE 231 Homework 8 Due October 20, 2010

Two hours. Please note that an OMR Sheet is attached for use with Section A: full instructions for their use are given in Section A

R-type Instructions. Experiment Introduction. 4.2 Instruction Set Architecture Types of Instructions

We r e going to play Final (exam) Jeopardy! "Answers:" "Questions:" - 1 -

COSC 243. Computer Architecture 1. COSC 243 (Computer Architecture) Lecture 6 - Computer Architecture 1 1

( input = α output = λ move = L )

Sequential Circuits. inputs Comb FFs. Outputs. Comb CLK. Sequential logic examples. ! Another way to understand setup/hold/propagation time

Scheme G. Sample Test Paper-I

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

BUILDING BLOCKS OF A BASIC MICROPROCESSOR. Part 1 PowerPoint Format of Lecture 3 of Book

QUESTION BANK. EE 6502 / Microprocessor and Microcontroller. Unit I Processor. PART-A (2-Marks)

2. List the five interrupt pins available in INTR, TRAP, RST 7.5, RST 6.5, RST 5.5.

ECE 2300 Digital Logic & Computer Organization. More Finite State Machines

Laboratory Exercise 3 Davide Rossi DEI University of Bologna AA

CSE 140L Final Exam. Prof. Tajana Simunic Rosing. Spring 2008

Microprocessor Architecture

CHAPTER 5 : Introduction to Intel 8085 Microprocessor Hardware BENG 2223 MICROPROCESSOR TECHNOLOGY

Chapter 5: Computer Systems Organization. Invitation to Computer Science, C++ Version, Third Edition

Chapter 5: Computer Systems Organization

CS303 LOGIC DESIGN FINAL EXAM

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

(a) What is the denary equivalent of the hexadecimal number A7?

ECE UMass, Amherst. Verilog tutorial

Verilog Fundamentals. Shubham Singh. Junior Undergrad. Electrical Engineering

Chapter 4. MARIE: An Introduction to a Simple Computer

COA. Prepared By: Dhaval R. Patel Page 1. Q.1 Define MBR.

Hours / 100 Marks Seat No.

Introduction to Digital Logic Missouri S&T University CPE 2210 Registers

There are four registers involved in the fetch cycle: MAR, MBR, PC, and IR.

MICROPROCESSOR B.Tech. th ECE

1. Internal Architecture of 8085 Microprocessor

QUESTION BANK UNIT-I. 4. With a neat diagram explain Von Neumann computer architecture

Graduate Institute of Electronics Engineering, NTU. Lecturer: Chihhao Chao Date:

PART B. 3. Minimize the following function using K-map and also verify through tabulation method. F (A, B, C, D) = +d (0, 3, 6, 10).

Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012

Sequential Logic Design

ECE 551 Digital System Design and Synthesis. Instructor: Kewal K. Saluja. Midterm Exam

Chapter 10. case studies in sequential logic design

EECS 151/251A: SRPING 2017 MIDTERM 1

University of Toronto Mississauga. Flip to the back cover and write down your name and student number.

Control & Execution. Finite State Machines for Control. MIPS Execution. Comp 411. L14 Control & Execution 1

Chapter 2 Logic Gates and Introduction to Computer Architecture

General FSM design procedure

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL

COMPUTER ARCHITECTURE AND ORGANIZATION Register Transfer and Micro-operations 1. Introduction A digital system is an interconnection of digital

Computers and Microprocessors. Lecture 34 PHYS3360/AEP3630

Verilog introduction. Embedded and Ambient Systems Lab

Lecture 1: Introduction Course arrangements Recap of basic digital design concepts EDA tool demonstration

Lecture1: introduction. Outline: History overview Central processing unite Register set Special purpose address registers Datapath Control unit

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

FSM-based Digital Design using Veriiog HDL

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL

Chapter 3 - Top Level View of Computer Function

EECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function.

CSCB58 - Lab 3. Prelab /3 Part I (in-lab) /2 Part II (in-lab) /2 TOTAL /8

Computer Systems Organization

Basic Processing Unit: Some Fundamental Concepts, Execution of a. Complete Instruction, Multiple Bus Organization, Hard-wired Control,

CSE 140L Final Exam. Prof. Tajana Simunic Rosing. Spring 2008

Digital Logic Design: a rigorous approach c

Luleå University of Technology Kurskod SMD152 Datum Skrivtid

Transcription:

COMP 12111 One and a half hours Section A is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Fundamentals of Computer Engineering Date: Monday 23rd January 2017 Time: 09:45-11:15 Answer BOTH Questions in Section A and ONE Question from Section B Use a SEPARATE answerbook for each SECTION. This is a CLOSED book examination The use of electronic calculators is permitted provided they are not programmable and do not store text [PTO]

Section A COMPULSORY Please Answer BOTH Question 1 and Question 2 1. Answer any 5 parts of this question. Each part is worth 2 marks. a) What are the four possible states used for simulating a single bit binary signal? b) What is DeMorgan s theorem? State it and then use it to derive an alternative expression of the XOR function. that enables its implementation using 3 NAND gates. Sketch a schematic of the NAND gate implementation. You may assume that inverted signals and are made available. c) When are blocking and non-blocking assignments used in Verilog? What symbols are used for each? What is the difference between blocking and nonblocking assignments in Verilog? Is it possible to mix blocking and nonblocking assignments in the same always block? d) What is abstraction with respect to digital design? What does it help with? Provide an example of the use of abstraction in a design. e) When should you use type wire and when type reg for variables in Verilog assignments? f) Sketch an equivalent schematic representation of the logical function described by the Verilog module given in Figure 1. module acircuit (input A, B, C, output Q); wire avariable; assign avariable = A&~B; assign Q = C avariable; endmodule Figure 1 Page 2 of 7

g) What is a register used for? What is a register constructed from? Sketch a schematic of a typical 2-bit register with clock and clock-enable control inputs, clearly indicating the inputs and outputs. h) Do signals change state instantaneously in digital circuits? Please define the terms set-up time, hold time and propagation delay with respect to synchronous circuits. Figure 2 depicts the behaviour of a D-type flip-flop where Clk is the clock input, D is the data input and Q is the output. Copy the waveforms shown in Figure 2 in to your answerbook and illustrate set-up time, hold time and propagation delay on your sketch. Figure 2 [PTO] Page 3 of 7

2. Answer any 5 parts of this question. Each part is worth 2 marks. a) Discuss the difference between von Neumann and Harvard architectures. State one advantage and one disadvantage of the Harvard architecture compared to the von Neumann architecture. b) What is meant by volatile memory? Give an example. c) Draw the symbol for the tri-state buffer. Briefly discuss its operation. d) What is DMA and why is it used? e) Figure 3 shows a simple combinatorial circuit to be used as part of an RTL design. For the technology used the gates with output inversion have a delay of 2ns, and the gates with no output inversion have a delay of 3ns. Determine the critical path of the circuit. What would be the maximum clock frequency that the RTL system can be operated at? Figure 3 f) The design of an embedded processor has a 16-bit address bus and a 16-bit data bus. Due to cost limitations the maximum memory size allowed is 16K and the memory chips chosen are a single byte wide and can support 4,096 memory locations. How many of the 16 bits of the address bus are used to address the memory? How many memory chips will be required to implement the required memory? g) The three box model of a computer consists of the processor, memory and input/output. It also has a system bus to connect these components together. Briefly explain what the system bus is. Why do we need an interface circuit between the system bus and the external peripheral? h) You are part of he design team for the latest games console. You are required to arrive at the design for the head for the optical drive and must choose a laser and objectives lens to satisfy the specifications. Identify a choice for laser wavelength and objective lens numerical aperture from the list below to maximise the storage capacity of the disk. Explain your answer. Laser Wavelength: 405nm, 532nm, 640nm Objective lens numerical aperture: 0.6, 0.7, 0.85 Page 4 of 7

Section B Please answer ONE Question from Questions 3 and 4 3. a) You are required to design a Finite State Machine (FSM) to capture the behaviour of a vending machine. The vending machine dispenses your favourite soft drink that cost 20 pence. The vending machine accepts only 10 pence coins and should wait until all the coins are entered before the soft drink is dispensed. The vending machine does not give change. The required FSM has the following input and output: Input: Output: coin_10p it goes high when a 10 pence coin has been entered; it is 0 otherwise. dispense it should go high once two 10 pence coins have been entered; it should be 0 otherwise. From this specification we can identify that the design will require 3 states, as illustrated in the incomplete state transition diagram in Figure 4. Sketch a completed state transition diagram for this FSM that illustrates ALL the state transitions and the condition of the input, coin_10p, determining the transitions. Make sure you also indicate the state where the output, dispense, should be taken high. (6 marks) Figure 4 [PTO] Page 5 of 7

b) How many bits are required in the state code to be able to represent all the states in the FSM? (1 mark) c) Assign unique state codes to each state in your completed state transition diagram from part a). (1 mark) d) Produce a state transition table indicating the current state, the input, the next state and the output. (4 marks) e) The price of the soft drink is increased to 30p and the vending machine altered to also accept 20 pence coins in addition to 10 pence coins. The vending machine should dispense a drink by taking the output dispense high whenever the correct amount has been entered. If too much has been entered then the vending machine should dispense the drink and give change by taking an additional new output, change, high. An additional new input is provided, coin_20p, that goes high when a 20 pence coin has been entered; it is 0 otherwise. Due to the design change the FSM needs changing to capture the additional functionality reflecting the higher cost, that 20p and 10p coins are now accepted for payment, and that change is given. Produce a new state transition diagram for the FSM of the updated vending machine, introducing new states where required. Please note: the inputs coin_10p and coin_20p are mutually exclusive. (8 marks) Page 6 of 7

4. a) In the design of a processor what is the purpose of the control block? b) Discuss which status flags are provided in the design of MU0. Where are they used in the general operation of MU0? Give examples where appropriate. (3 marks) c) Figure 5 shows a design for the datapath of MU0. i) Discuss the function of these registers Acc, PC and IR. (3 marks) ii) What are the four operations provided by the MU0 ALU. d) In the datapath shown in Figure 5 seven buses in the MU0 datapath are highlighted and labelled. Discuss what information is present on each of these buses for the following: i) during an instruction fetch (3 mark) ii) during the execute state of an LDA instruction (4 mark) iii) during the execute state of a branch instruction. (3 mark) Figure 5 END OF EXAMINATION Page 7 of 7