1 ( = 80 points) 50 min. LOAD INI I <= 0; J <= 1; LSA <= 1; DONE. COMP Compare M[I] with PREV
|
|
- Felix Horton
- 5 years ago
- Views:
Transcription
1 Spring 203 EE457 Intructor: Gndhi Puvvd Quiz (~ 0%) Dte: 2/22/203, Fridy in THH20 Clcultor nd Epern Verilog Guide re llowed; Time: 09:5AM-:45AM (2 Hour 30 Min) Cloed-book/Cloed-note Exm Totl point: 246 Nme: Student ID: Do NOT write ny ID (tudent ID, SSN,..) Perfect core: 230 / 246 ( = 80 point) 50 min. Stte Digrm nd RTL deign: Here we hve n rry of 4 (note: not 6) 8-bit unigned number nd we need to find the longet equence of cing number (LSA) cnning from M[0] to M[3]. If ll fourteen re in cing order, then LSA hould come out to be 4. If there re not even two number in cing order, then LSA hould come out to be (nd not zero). The mllet equence i -number equence. If ll the number re equl to ech other, then LSA = becue "equl" doe not qulify to be cing. Reet Strt INI I <= 0; J <= ; LSA <= ; Strt for previou M[I] LOAD PREV <= M[I]; I <= I + ; Exmple: I: Sequence: ingle-item equence LSA = 5 Thi i till inpected even though there ren t mny item left in the rry 40 DONE No RTL needed here COMP Compre M[I] with PREV Februry 22, 203 5:23 pm EE457 Quiz - Spring 203 / 7 C Copyright 203 Gndhi Puvvd
2 . Beide I, the itertion counter to cce member of the rry M ( M[I]), there i nother 4-bit counter nmed J to count the number of item in the current cing equence. LSA nd J re initilized to in the INI tte hown bove. 2. You cn ue two comprion unit: n 8-bit comprtor to compre M[I] with PREV (PREV for previou M[I]) nd 4-bit comprtor to compre J (or J+, only one t time) with LSA. We do not tret "compring I with 3 or 4" comprtor, it i comprion with contnt nd it doe not require fullfledged comprion unit. Complete the tte digrm on the previou pge. You cn write generic RTL or Verilog in the COMP tte. In either ce, plee ue either {} or.. to mke it cler the cope of "if" or "ele". Note tht you try to updte LSA when the current longet equence h jut ed or the longet equence i continuing but you cme to the of the rry. Thee two itution my differ in term of whether J w updted lredy or being updted. Do you wnt to check J > LSA or J >= LSA or J+ > LSA? Do you wnt to depoit J or J+ in LSA? You do not need to nwer thee two quetion. Thee quetion re to help you to think. 40. Now we redo the bove deign with the retriction of uing only one 8-bit comprtor to compre M[I] with PREV nd lter (in eprte clock or tte) if needed to compre J (or J+, only one t time we hve only comprtor) with LSA. We pp (conctente) 4 zero on the left of the bove 4-bit item to compre them uing the 8-bit comprion unit. Complete the tte digrm below. Reet Strt INI LOAD I <= 0; Strt J <= ; PREV <= M[I]; LSA <= ; I <= I + ; COMP Stte ASJE tnd for Acing Sequence Jut Ended. Note: It could be equence of jut item! Stte ASCE tnd for Acing Sequence Continuing but reched the End of the 4 element rry. ASJE ASCE DONE DONE No RTL needed here Februry 22, 203 5:23 pm EE457 Quiz - Spring / 7 C Copyright 203 Gndhi Puvvd
3 2 ( = 2 point) 5 min. Adder/Subtrctor deign A -A = A + A + = In 4-bit ytem the bove i true (elect (circle) ll correct nwer nd if you elect, then fill-in the blnk too) () if A i treted n unigned number. The rw C4 = (0//dep on A). (b) if A i treted igned number, The V = (0//dep on A). 2.2 The (negtive / poitive / cn fill the blnk with either) number with lrget mgnitude in 6-bit 2 complement ytem i double in mgnitude compred to the one in 5-bit 2 complement ytem Strnge dder: A i 4-bit igned number (A 3 A 2 A A 0 ) repreented in 2 complement ytem. B i 4-bit unigned number (B 3 B 2 B B 0 ). Deign n dder to produce 5-bit igned um S (S = A + B) (i.e. the 5-bit reult i treted 5-bit number repreented in two complement ytem (S 4 S 3 S 2 S S 0 )). Complete the following three deign. The firt two deign ue n hlf dder nd 4-bit dder. The third deign ue two hlf dder nd 3-bit dder. Do not leve ny pin unlbeled. Connect it to either GND or VDD or lbel it NC (for no connection). Either rgue tht we will not hve ny overflow ince the reult h n extrit or explin briefly why there cn be overflow in pite of the 5th bit nd generte the V bit in ech of the three deign. A lwy fter logic get more point. 3 ( = 38 point) 20 min. Verilog Coding A3 A2 A A0 B3 B2 B B0 C4 b C3 C4 C4 C2 C b C0 S3 S2 S S0 A3 A2 A B3 B2 B C3 C2 b C S3 S2 S A3 A2 A B3 B2 B C3 C2 b C S3 S2 S? 6 3. If two concurrent "ign" ttement hve the me left-hnd-ide item hown on the ide, the lter ignment override the erlier. T / F If two procedurl ignment ttement hve the me left-hnd-ide item hown on the ide, the lter ignment override the erlier. T / F The X nd Y in both the egment of code cn be either reg dt type or wire dt type. T / F ign RESULT_wire = X + Y; ign RESULT_wire = X - Y; Y) RESULT_reg = X + Y; RESULT_reg = X - Y; Februry 22, 203 5:23 pm EE457 Quiz - Spring / 7 C Copyright 203 Gndhi Puvvd
4 Prt of ce ttement, coding tte mchine, i hown in ech of the two code below. Complete the correponding ection of the tte digrm implied by the code.. Digrm #A S S0 S2 S0: if (X) tte <= S0; if (Y) tte <= S; ele tte <= S2; Code #A Digrm #B S S0 S2 S0: if (Y) tte <= S; ele tte <= S2; if (X) tte <= S0; Code #B Three tudent re trying to decribe imple ALU which cn only dd or ubtrct nd produce zero inference beide the reult for n old CISC proceor with 2-bu tructure connecting the reg-file to the ALU. The reult R nd the zero inference Z re to be tored in temporry regiter temp_r nd temp_z o tht they both cn be tken bck nd tored in the detintion regiter nd CCR (Condition Code Regiter lo known Flg Regiter) in ubequent clock. Comment on ech of the three code (right.. wrong.. but.. becue..). Regiter #0 Regiter # Regiter #3 A B ALU temp_r temp_z Student # Student #2 Student #3 clk) if (ub) temp_r <= A - B; ele temp_r <= A + B; if (temp_r == 0) temp_z <= ; ele temp_z <= 0; clk) if (ub) int_r <= A - B; ele int_r <= A + B; if (int_r == 0) temp_z <= ; ele temp_z <= 0; clk) if (ub) int_r = A - B; ele int_r = A + B; if (int_r == 0) temp_z <= ; ele temp_z <= 0; Suppoe the bove deign i modified to ingle-bu tructure hown on the ide. Here temp_r i firt trnferred to the detintion regiter followed by temp_z to the CCR. Do you need to modify your previou comment on ny of the three tudent? A (temp) A B ALU temp_r temp_z Februry 22, 203 5:23 pm EE457 Quiz - Spring / 7 C Copyright 203 Gndhi Puvvd
5 4 ( = 2 point) 0 min. All re byte-ddreble proceor with logicl ddre = 32 bit. Fill-in ll miing info.l 9 up Dt Addre pin D3-D0 A3 - A, BE - BE i860 D63-D0 A3 - A, BE - BE USC_28 D27-D0 A3 - A, BE - BE Min. number of byte-wide bnk Shift in ddre connection to memory ddr pin 2 4. Shown on the ide i the memory interfce to 64KB chip in ytem bed on one of the bove three proceor. How do you figure out which proceor-bed ytem it i. Alo find the ytem ddree correponding to the lowet-ddreed two byte of thi memory chip. The ytem i bed on (80486 / i860 / USC_28) becue. The lowet-ddreed two byte of thi chip mp to the ytem ddree. 5 ( = 24 point) 5 min. A[8:3] A3 A30 A29 A28 A27 A26 A25 A24 A23 A22 A2 A20 A9 64KB A[5:0] D[7:0] WE RD CS BE2 D[23:6] Performnce 2 5. Very much like fewer cientific document cn tke much more time to type compred to mny imple "Thnk you" note, few complex intruction my tke longer time (becue of their higher CPI) compred to other impler intruction even if they re more in number (becue of their lower CPI). A proceor h only three ctegorie of intruction. Given the frequencie of their uge in the dynmic trce of ench mrk nd lo the time pent on them, find CPI_B nd CPI_C below. Hint: Apply rtio! CPI Frequency (%) Time (%) Ctegory A CPI_A = 4 50% 20% Ctegory B CPI_B = 30% 30% Ctegory C CPI_C = 20% 50% If one of the three intruction cn hve it CPI reduced by 2 provided you gree to incree the clock period by 5%, do you hve dequte dt to mke deciion, nd if o would you go for it, nd if you go for it, would you get A or B or C improved, nd wht i the fctor of improvement you chieve in the CPU performnce? Februry 22, 203 5:23 pm EE457 Quiz - Spring / 7 C Copyright 203 Gndhi Puvvd
6 6 ( = 50 point) 25 min. Single-cycle CPU: Reproduced on the next pge i the block digrm from your HW#5 olution with upport for both j (jump) nd jl (jump nd link). However the control ignl tble below i to be completed by you to upport thee two intruction, ddi, nd one more intruction. Intruction RegDt ALUSrc Memtoreg RegWrite MemRed MemWrite Brnch ALUOp ALUop0 Jump Jl Jl_ddi 24 R-formt lw w X X beq X 0 X ddi jump jl jl_ddi Now you need to provide upport for new intruction clled jl_ddi. Thi new jl_ddi produce the jump ddre by dding the 6-bit immedite field to ($r) very much like in ddi intructon except tht we hve word_offet here. The intruction formt i very much identicl to the ddi with the $rt field wted. The link behvior of thi new intruction i me tht of the jl. So it provide link to the ubroutine by depoiting the return ddre t $3". jl_ddi $r, word_offet A row nd column re dded to the bove tble to upport thi new intruction. Crry-out the needed modifiction to the block-digrm on the next pge nd complete the ignl tble bove. 7 ( = 2 point) 0 min. Multi-cycle CPU 6 6 Temporry regiter re needed if informtion i produced in one clock nd conumed in lter clock. However, we could void temporry regiter (for exmple, MDR Memory Dt Regiter) by Temporry regiter h Temp_RegWrite control input o tht the CU cn tell regiter when to write. The exception to thi rule i Februry 22, 203 5:23 pm EE457 Quiz - Spring / 7 C Copyright 203 Gndhi Puvvd
7 26 Q#6 (Single-cycle CPU) PCSource Februry 22, 203 5:23 pm EE457 Quiz - Spring / 7 C Copyright 203 Gndhi Puvvd
Spring 2012 EE457 Instructor: Gandhi Puvvada
Spring 2012 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 2/17/2012, Friday in SLH200 Calculator and Cadence Verilog Guide are allowed; Time: 10:00AM-12:45PM Cloed-book/Cloed-note Exam Total point:
More informationFall 2010 EE457 Instructor: Gandhi Puvvada Date: 10/1/2010, Friday in SGM123 Name:
Fall 2010 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 10/1/2010, Friday in SGM123 Name: Calculator and Cadence Verilog guide are allowed; Cloed-book, Cloed-note, Time: 12:00-2:15PM Total point:
More informationFall 2010 EE457 Instructor: Gandhi Puvvada Date: 10/1/2010, Friday in SGM123 Name:
Fall 2010 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 10/1/2010, Friday in SGM123 Name: Calculator and Cadence Verilog guide are allowed; Cloed-book, Cloed-note, Time: 12:00-2:15PM Total point:
More informationc s ha2 c s Half Adder Figure 2: Full Adder Block Diagram
Adder Tk: Implement 2-it dder uing 1-it full dder nd 1-it hlf dder omponent (Figure 1) tht re onneted together in top-level module. Derie oth omponent in VHDL. Prepre two implementtion where VHDL omponent
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationDescribing Combinational circuits in BSV
Decriing Comintionl circuit in BSV Arvind Computer Science & Artificil Intelligence L. Mchuett Intitute of Technology Ferury 13, 2018 http://cg.cil.mit.edu/6.s084 L03-1 Three imple comintionl circuit NOT
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationECE 468/573 Midterm 1 September 28, 2012
ECE 468/573 Midterm 1 September 28, 2012 Nme:! Purdue emil:! Plese sign the following: I ffirm tht the nswers given on this test re mine nd mine lone. I did not receive help from ny person or mteril (other
More informationCourse Project: Adders, Subtractors, and Multipliers a
In the name Allah Department of Computer Engineering 215 Spring emeter Computer Architecture Coure Intructor: Dr. Mahdi Abbai Coure Project: Adder, Subtractor, and Multiplier a a The purpoe of thi p roject
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationMIPS I/O and Interrupt
MIPS I/O nd Interrupt Review Floting point instructions re crried out on seprte chip clled coprocessor 1 You hve to move dt to/from coprocessor 1 to do most common opertions such s printing, clling functions,
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationMidterm I Solutions CS164, Spring 2006
Midterm I Solutions CS164, Spring 2006 Februry 23, 2006 Plese red ll instructions (including these) crefully. Write your nme, login, SID, nd circle the section time. There re 8 pges in this exm nd 4 questions,
More informationGiving credit where credit is due
JEP 84H Foundtion of omputer tem Proceor rchitecture II: ogic eign r. teve Goddrd goddrd@ce.unl.edu Giving credit where credit i due Mot of lide for thi lecture re ed on lide creted r. rnt, rnegie Mellon
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationCMSC 331 First Midterm Exam
0 00/ 1 20/ 2 05/ 3 15/ 4 15/ 5 15/ 6 20/ 7 30/ 8 30/ 150/ 331 First Midterm Exm 7 October 2003 CMC 331 First Midterm Exm Nme: mple Answers tudent ID#: You will hve seventy-five (75) minutes to complete
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationSubtracting Fractions
Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationFile Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment
File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationBasics of Logic Design Arithmetic Logic Unit (ALU)
Bsics of Logic Design Arithmetic Logic Unit (ALU) CPS 4 Lecture 9 Tody s Lecture Homework #3 Assigned Due Mrch 3 Project Groups ssigned & posted to lckord. Project Specifiction is on We Due April 9 Building
More informationIntroduction to CMOS VLSI Design. Lecture 2: MIPS Processor Example. David Harris. Harvey Mudd College Spring Outline
Introduction to CMOS VLSI Design Lecture 2: MIPS Processor Exmple Dvid Hrris Hrvey Mudd College Spring 24 Outline Design Prtitioning MIPS Processor Exmple Architecture Microrchitecture Logic Design Circuit
More informationExample: 2:1 Multiplexer
Exmple: 2:1 Multiplexer Exmple #1 reg ; lwys @( or or s) egin if (s == 1') egin = ; else egin = ; 1 s B. Bs 114 Exmple: 2:1 Multiplexer Exmple #2 Normlly lwys include egin nd sttements even though they
More informationStack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures
Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationQuestions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?
Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?
More informationGeorge Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables
George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationMid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:
Fll term 2012 KAIST EE209 Progrmming Structures for EE Mid-term exm Thursdy Oct 25, 2012 Student's nme: Student ID: The exm is closed book nd notes. Red the questions crefully nd focus your nswers on wht
More informationFall 2018 Midterm 1 October 11, ˆ You may not ask questions about the exam except for language clarifications.
15-112 Fll 2018 Midterm 1 October 11, 2018 Nme: Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
More informationRepresentation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation
Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed
More informationEECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining
EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more
More information5 Regular 4-Sided Composition
Xilinx-Lv User Guide 5 Regulr 4-Sided Composition This tutoril shows how regulr circuits with 4-sided elements cn be described in Lv. The type of regulr circuits tht re discussed in this tutoril re those
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationHow to Design REST API? Written Date : March 23, 2015
Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly
More informationCPSC 213. Polymorphism. Introduction to Computer Systems. Readings for Next Two Lectures. Back to Procedure Calls
Redings for Next Two Lectures Text CPSC 213 Switch Sttements, Understnding Pointers - 2nd ed: 3.6.7, 3.10-1st ed: 3.6.6, 3.11 Introduction to Computer Systems Unit 1f Dynmic Control Flow Polymorphism nd
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationToday s Lecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Recursive Example. Review: The C / C++ code. Recursive Example (Continued)
Tod s Lecture Bsics of Logic Design: Boolen Alger, Logic Gtes Alvin R. Leeck CPS 4 Lecture 8 Homework #2 Due Ferur 3 Outline Review (sseml recursion) Building the uilding locks Logic Design Truth tles,
More informationFall 2016 Instructor: Gandhi Puvvada. Thursday, 9/22/2016 (A 2H 50M exam) 05:30 PM - 08:20 PM (170 min) in THH101. Student s Last Name:
EE457 Quiz (~0%) Closed-book Closed-notes Exam; No cheat sheets; No cell phones or computers Calculators and Verilog Guides are not needed and hence not allowed. Fall 206 Instructor: Gandhi Puvvada Thursday,
More informationThis Unit: Processor Design. What Is Control? Example: Control for sw. Example: Control for add
This Unit: rocessor Design Appliction O ompiler U ory Firmwre I/O Digitl ircuits Gtes & Trnsistors pth components n timing s n register files ories (RAMs) locking strtegies Mpping n IA to tpth ontrol Exceptions
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More information3 FRACTIONS. Before you start. Objectives
FRATIONS Only one eighth of n iceberg shows bove the surfce of the wter, which leves most of it hidden. The lrgest northern hemisphere iceberg ws encountered ner Bffin Islnd in nd in 1. It ws 1 km long,
More informationCIS 1068 Program Design and Abstraction Spring2015 Midterm Exam 1. Name SOLUTION
CIS 1068 Progrm Design nd Astrction Spring2015 Midterm Exm 1 Nme SOLUTION Pge Points Score 2 15 3 8 4 18 5 10 6 7 7 7 8 14 9 11 10 10 Totl 100 1 P ge 1. Progrm Trces (41 points, 50 minutes) Answer the
More informationLAB L Hardware Building Blocks
LAB L Hrdwre Building Blocks Perform the following groups of tsks: LL1.v 1. In previous l we creted the 2-to-1 mux shown in the left prt of the figure elow nd found tht it cts s n if sttement. c c 0 1
More informationRegister Transfer Level (RTL) Design
CSE4: Components nd Design Techniques for Digitl Systems Register Trnsfer Level (RTL) Design Tjn Simunic Rosing Where we re now Wht we hve covered lst time: Register Trnsfer Level (RTL) design Wht we re
More informationUNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES
UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not
More informationEE457 Lab 4 Part 4 Seven Questions From Previous Midterm Exams and Final Exams ee457_lab4_part4.fm 10/6/04
EE457 Lab 4 Part 4 Seven Questions From Previous Midterm Exams and Final Exams ee457_lab4_part4.fm 10/6/04 1 [Based on Question #7 of Summer 1993 Midterm] Remove TARGET register, add ZERO FF: Please refer
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationDigital Design. Chapter 4: Datapath Components
Digitl Design Chpter 4: Dtpth Components Slides to ccompny the textbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com Copyright
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationCOMPUTER SCIENCE 123. Foundations of Computer Science. 6. Tuples
COMPUTER SCIENCE 123 Foundtions of Computer Science 6. Tuples Summry: This lecture introduces tuples in Hskell. Reference: Thompson Sections 5.1 2 R.L. While, 2000 3 Tuples Most dt comes with structure
More informationCS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
CS DIGITAL LOGIC & STATE MACHINE DESIGN SPRING DUE : April 7, HOMEWOR V READ : Relted portions of Chpters III, IV, VI, VII nd VIII ASSIGNMENT : There re seven questions Solve ll homework nd exm problems
More informationFall 2017 Midterm Exam 1 October 19, You may not use any books, notes, or electronic devices during this exam.
15-112 Fll 2017 Midterm Exm 1 October 19, 2017 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More informationEpson Projector Content Manager Operation Guide
Epson Projector Content Mnger Opertion Guide Contents 2 Introduction to the Epson Projector Content Mnger Softwre 3 Epson Projector Content Mnger Fetures... 4 Setting Up the Softwre for the First Time
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationChapter 4: Datapath Components. Instructor: Dr. Hyunyoung Lee. Copyright Based on slides by Frank Vahid. Frank Vahid
Chpter 4: Dtpth Components Instructor: Dr. Hyunyoung Lee Bsed on slides by Copyright 2 Instructors of courses requiring Vhid's Digitl Design textbook (published by John Wiley nd Sons) hve permission to
More informationEE 457 Midterm Summer 14 Redekopp Name: Closed Book / 105 minutes No CALCULATORS Score: / 100
EE 47 Midterm Summer 4 Redekopp Name: Closed Book / minutes No CALCULATORS Score: /. (7 pts.) Short Answer [Fill in the blanks or select the correct answer] a. If a control signal must be valid during
More informationCS/COE0447: Computer Organization
CS/COE0447: Computer Organization and Assembly Language Datapath and Control Sangyeun Cho Dept. of Computer Science A simple MIPS We will design a simple MIPS processor that supports a small instruction
More informationCS/COE0447: Computer Organization
A simple MIPS CS/COE447: Computer Organization and Assembly Language Datapath and Control Sangyeun Cho Dept. of Computer Science We will design a simple MIPS processor that supports a small instruction
More informationAlphaGo Overview. Overview. Digression: Zero sum, alternating move games. Original AlphaGo approach. Recent AlphaGo Zero approach 10/24/17
AlphGo Overview Ron Prr CompSci 590.2 Duke Univerity Overview Digreion: Zero um, lternting move gme Originl AlphGo pproch Recent AlphGo Zero pproch 1 2 Alternting move, zero-um, 2-plyer gme Ordinry bellmn
More informationProcessor: Multi- Cycle Datapath & Control
Processor: Multi- Cycle Datapath & Control (Based on text: David A. Patterson & John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3 rd Ed., Morgan Kaufmann, 27) COURSE
More informationLecture 8: More Pipelining
Overview Lecture 8: More Pipelining David Black-Schaffer davidbb@tanford.edu EE8 Spring 00 Getting Started with Lab Jut get a ingle pixel calculating at one time Then look into filling your pipeline Multiplier
More informationPARALLEL AND DISTRIBUTED COMPUTING
PARALLEL AND DISTRIBUTED COMPUTING 2009/2010 1 st Semester Teste Jnury 9, 2010 Durtion: 2h00 - No extr mteril llowed. This includes notes, scrtch pper, clcultor, etc. - Give your nswers in the ville spce
More informationLanguages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) *
Pln for Tody nd Beginning Next week Interpreter nd Compiler Structure, or Softwre Architecture Overview of Progrmming Assignments The MeggyJv compiler we will e uilding. Regulr Expressions Finite Stte
More informationTO REGULAR EXPRESSIONS
Suject :- Computer Science Course Nme :- Theory Of Computtion DA TO REGULAR EXPRESSIONS Report Sumitted y:- Ajy Singh Meen 07000505 jysmeen@cse.iit.c.in BASIC DEINITIONS DA:- A finite stte mchine where
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationChapter 5 Solutions: For More Practice
Chapter 5 Solutions: For More Practice 1 Chapter 5 Solutions: For More Practice 5.4 Fetching, reading registers, and writing the destination register takes a total of 300ps for both floating point add/subtract
More informationProcessor (I) - datapath & control. Hwansoo Han
Processor (I) - datapath & control Hwansoo Han Introduction CPU performance factors Instruction count - Determined by ISA and compiler CPI and Cycle time - Determined by CPU hardware We will examine two
More informationLING/C SC/PSYC 438/538. Lecture 21 Sandiway Fong
LING/C SC/PSYC 438/538 Lecture 21 Sndiwy Fong Tody's Topics Homework 8 Review Optionl Homework 9 (mke up on Homework 7) Homework 8 Review Question1: write Prolog regulr grmmr for the following lnguge:
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationSample Midterm Solutions COMS W4115 Programming Languages and Translators Monday, October 12, 2009
Deprtment of Computer cience Columbi University mple Midterm olutions COM W4115 Progrmming Lnguges nd Trnsltors Mondy, October 12, 2009 Closed book, no ids. ch question is worth 20 points. Question 5(c)
More informationComputer Arithmetic Logical, Integer Addition & Subtraction Chapter
Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for
More informationCourse Administration
/4/7 Spring 7 EE 363: Computer Orgniztion Arithmetic for Computers Numer Representtion & ALU Avinsh Kodi Deprtment of Electricl Engineering & Computer Science Ohio University, Athens, Ohio 457 E-mil: kodi@ohio.edu
More information9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association
9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
More informationEE 457 Midterm Summer 14 Redekopp Name: Closed Book / 105 minutes No CALCULATORS Score: / 100
EE 47 Midterm Summer 4 Redekopp Name: Closed Book / minutes No CALCULATORS Score: /. (7 pts.) Short Answer [Fill in the blanks or select the correct answer] a. If a control signal must be valid during
More informationChapter 4. The Processor. Computer Architecture and IC Design Lab
Chapter 4 The Processor Introduction CPU performance factors CPI Clock Cycle Time Instruction count Determined by ISA and compiler CPI and Cycle time Determined by CPU hardware We will examine two MIPS
More informationLecture Overview. Knowledge-based systems in Bioinformatics, 1MB602. Procedural abstraction. The sum procedure. Integration as a procedure
Lecture Overview Knowledge-bsed systems in Bioinformtics, MB6 Scheme lecture Procedurl bstrction Higher order procedures Procedures s rguments Procedures s returned vlues Locl vribles Dt bstrction Compound
More informationDistance-Vector Algorithms for Distributed Shortest Paths on Dynamic Power-Law Networks
Article Ditnce-Vector Algorithm for Ditriuted Shortet Pth on Dynmic Power-Lw Network Mtti D Emidio 1, * nd Dniele Frigioni 2, * 1 Grn So Science Intitute (GSSI), Vile Frnceco Cripi, I 67100 L Aquil, Itly
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More informationSystems Architecture
Systems Architecture Lecture 15: A Simple Implementation of MIPS Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan Some or all figures from Computer Organization and Design: The Hardware/Software
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More informationDeposit a Technical Report in PubRep
Technicl in Lst Updte:19.12.016 Te c h n i c l Technicl s re mjor source of scientific informtion, prepred for institutionl nd wider distribution. They re considered grey literture since they re scientific
More informationProcessor (multi-cycle)
CS359: Computer Architecture Processor (multi-cycle) Yanyan Shen Department of Computer Science and Engineering Five Instruction Steps ) Instruction Fetch ) Instruction Decode and Register Fetch 3) R-type
More informationTHE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY Computer Organization (COMP 2611) Spring Semester, 2014 Final Examination
THE HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY Computer Organization (COMP 2611) Spring Semester, 2014 Final Examination May 23, 2014 Name: Email: Student ID: Lab Section Number: Instructions: 1. This
More informationCompilers Spring 2013 PRACTICE Midterm Exam
Compilers Spring 2013 PRACTICE Midterm Exm This is full length prctice midterm exm. If you wnt to tke it t exm pce, give yourself 7 minutes to tke the entire test. Just like the rel exm, ech question hs
More informationTopic 2: Lexing and Flexing
Topic 2: Lexing nd Flexing COS 320 Compiling Techniques Princeton University Spring 2016 Lennrt Beringer 1 2 The Compiler Lexicl Anlysis Gol: rek strem of ASCII chrcters (source/input) into sequence of
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationSolutions - Homework 3 (Due date: October 27 5:30 pm) Presentation and clarity are very important! Show your procedure!
LCRICAL AN COMPUR NGINRING PARMN, OAKLAN UNIVRSIY C-278: igitl Logic eign Fll 206 Solution - Homework 3 (ue dte: October 27 th @ 5:30 pm) Preenttion nd clrity re very importnt! Show your procedure! PROBLM
More information