Problem III (Memory) 1. Using a graphic explain the following memory technology: mask-programmed ROM, PROM, EPROM, EEPROM, EEPROM, FLAS, RAM, SRAM, DRAM (9 pts) 2. Sketch the internal design of a 8 x 3 ROM with the following: value 2 is stored at address 1, value 5 store at address 5, value 1 store at address 0 and value 0 stored at all remaining addresses. (2 pts) 3. Compose 1kx8 ROM's into an 8kx8 ROM (2 pts) 4. Show how to use a 1kx8 ROM to implement a 512x6 ROM (2 pts) Problem IV (Arithmetic) 1. Use the shift and add algorithm to perform the following multiplications • 15x66 (2 pts) • (-55) x (-35) (3 pts) • 40 x (-16) (3 pts) 2. Use the restoring algorithm to perform the following divisions • 58/13 (3 pts) • 85/27 (3 pts)
Added by Rebecca R.
Close
Step 1
Problem III (Memory): Show more…
Show all steps
Your feedback will help us improve your experience
Nick Collins and 65 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Problem 4 (30 marks) Use the following code fragment: Loop: LD x1,0(x2) ;load x1 from address 0+x2 ADDI x1,x1,1 ;x1=x1+1 SD x1, 0(x2) ;store R1 at address 0+R2 ADDI x2,x2,4 ;x2=x2+4 SUB x4,x3,x2 ;x4=x3-x2 BNEZ x4, Loop ;branch to Loop if x4!=0 Assume that the initial value of x3 is x2 + 396. Further assume that the branch addresses are calculated during the ID phase and branch prediction is handled as designated in the tables 2.1 of the appendix. a. (3 pts) Data hazards are caused by data dependences in the code. List all of the data dependences in the code above. Record the register, source instruction, and destination instruction; for example, there is a data dependency for register R1 from the LW to the ADDI. b. (6 pts) Show the timing of this instruction sequence for the 5-stage RISC pipeline without any forwarding or bypassing hardware but assuming that a register read and a write in the same clock cycle "forwards" through the register file. Assume that the branch is handled by flushing the pipeline. If all memory references take 1 cycle, how many cycles does this loop take to execute?
Akash M.
Problem 5: Microcontroller/Microprocessor Memory Ranges and the Program Counter [20 points] Assume a 32-bit address and a 32-bit wide memory On-Chip Flash Memory's starting address is 0x0000.0000 and the last word is accessed at memory location 0x0003.FFFF. a) Why has this on-chip flash memory been included i.e. what type of information is stored in this memory? b) What is the size of this on-chip Memory in KB? Please show your computations because simply writing the answer will earn no points. c) You are told that the next 524032 KB of memory are reserved. What is the next available memory location? Please show your work. d) You are to place 32 KB of SRAM at the next available 1KB boundary address after this reserved space. Please provide the starting address of this 32 KB SRAM. Show your work.
Adi S.
Part B: Super Simple CPU (SSCPU) (30 Marks) 1. We have two numbers: one stored at location X in memory, the other at location Y. Write an assembler program to check if the two numbers are equal. If they are different, display 1 in the output area; display 0 otherwise. 2. Assume the following SSCPU program and given that 2 is the input. Keep columns for the instruction number (or label), its corresponding opcode mnemonic and operand in decimal, the accumulator value after the instruction executes, and the value of the data N and p after the instruction executes: 0 LDI 3 1 STO p 2 INP 3 STO N TOP JZR BYE //Top refers to address 4 5 LOD p 6 ADD p 7 STO p 8 LOD N 9 SUB ONE 10 STO N 11 JMP TOP BYE STP ONE DAT 1 N DAT p DAT
Supreeta N.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD