Question

1 Approved Answer

Posted on Sep 26, 2024

8085 microprocessors microprocessors Given: At address 7047h (or choose another address), there is a number which tells how many primes have been found so far.

8085 microprocessors image text in transcribed

microprocessors

Given: At address 7047h (or choose another address), there is a number which tells how many primes have been found so far. (Initiallal value - 1) At address 7050h (or choose another address), the list of primes begins. The first address will be the next address will be the 2nd prime, the next the 3rd, etc. Instructions: 1) Evaluate the integers greater than 2, to assess if they are prime 2) If the evaluated integer is prime, add it to the list of primes. 3) Continue until the designated number of primes is found, (For startup purposes, find the first 5 primes. The final check of your program will be to find all primes less than 255.) You are allowed (and encouraged) to discuss this challenge amongst yourselves, or ask me questions. You will have to explain your code (so comment it) * NOTE: The addresses you use can be different than those in the instructions 8085 Simulator - CA\Userstamung Downloads\AM division 21spasm File Edit Tools Settings Simulation Subroutine View Load Sample Program Help Editor Assembler Registers Memory B085 Assembly language Editor Registers: Devices Assembler .org 7000 Disassembler SI 7 0 D O Register Accumulator Register Register Register Register Register Register Memory(M) Value 00 00 00 00 00 00 DOODOO 5 5 4 3 2. 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 D O 0 0 end DO 00 0 . Resister Flag Resister Value 00 S O Z 0 AC O 0 P. D CY 0 0 Type Stack Pointer(SP) Memory Pointer (HU) Program Status Word(PSW) Program Counter(PC) Clock Cycle Counter Instruction Counter Value 0000 0000 0000 7000 0 0 SOD SID TRAP R75 R65 INTR 0 R55 0 For SIM instruction SoD SDE O 0 R75 MSE M75 M65 M5.5 0 0 0 0 0 0 For RIM instruction SID 175 16 5 15.5 0 0 0 0 IE D M75 M5 M55 0 0 0 Autocorrect Assemble No. Converter Tool Hexadecimal 0 Decimal Binary 0 Generate a list of prime numbers Given: At address 704Fh (or choose another address), there is a number which tells how many primes have been found so far. (Initialial value = 1) At address 7050h (or choose another address), the list of primes begins. The first address will be 2, the next address will be the 2nd prime, the next the 3rd, etc. Instructions: 1) Evaluate the integers greater than 2, to assess if they are prime. 2) If the evaluated integer is prime, add it to the list of primes. 3) Continue until the designated number of primes is found. (For startup purposes, find the first 5 primes. The final check of your program will be to find all primes less than 255.) You are allowed (and encouraged) to discuss this challenge amongst yourselves, or ask me questions. You will have to explain your code (50 comment it). * NOTE: The addresses you use can be different than those in the instructions Given: At address 7047h (or choose another address), there is a number which tells how many primes have been found so far. (Initiallal value - 1) At address 7050h (or choose another address), the list of primes begins. The first address will be the next address will be the 2nd prime, the next the 3rd, etc. Instructions: 1) Evaluate the integers greater than 2, to assess if they are prime 2) If the evaluated integer is prime, add it to the list of primes. 3) Continue until the designated number of primes is found, (For startup purposes, find the first 5 primes. The final check of your program will be to find all primes less than 255.) You are allowed (and encouraged) to discuss this challenge amongst yourselves, or ask me questions. You will have to explain your code (so comment it) * NOTE: The addresses you use can be different than those in the instructions 8085 Simulator - CA\Userstamung Downloads\AM division 21spasm File Edit Tools Settings Simulation Subroutine View Load Sample Program Help Editor Assembler Registers Memory B085 Assembly language Editor Registers: Devices Assembler .org 7000 Disassembler SI 7 0 D O Register Accumulator Register Register Register Register Register Register Memory(M) Value 00 00 00 00 00 00 DOODOO 5 5 4 3 2. 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 D O 0 0 end DO 00 0 . Resister Flag Resister Value 00 S O Z 0 AC O 0 P. D CY 0 0 Type Stack Pointer(SP) Memory Pointer (HU) Program Status Word(PSW) Program Counter(PC) Clock Cycle Counter Instruction Counter Value 0000 0000 0000 7000 0 0 SOD SID TRAP R75 R65 INTR 0 R55 0 For SIM instruction SoD SDE O 0 R75 MSE M75 M65 M5.5 0 0 0 0 0 0 For RIM instruction SID 175 16 5 15.5 0 0 0 0 IE D M75 M5 M55 0 0 0 Autocorrect Assemble No. Converter Tool Hexadecimal 0 Decimal Binary 0 Generate a list of prime numbers Given: At address 704Fh (or choose another address), there is a number which tells how many primes have been found so far. (Initialial value = 1) At address 7050h (or choose another address), the list of primes begins. The first address will be 2, the next address will be the 2nd prime, the next the 3rd, etc. Instructions: 1) Evaluate the integers greater than 2, to assess if they are prime. 2) If the evaluated integer is prime, add it to the list of primes. 3) Continue until the designated number of primes is found. (For startup purposes, find the first 5 primes. The final check of your program will be to find all primes less than 255.) You are allowed (and encouraged) to discuss this challenge amongst yourselves, or ask me questions. You will have to explain your code (50 comment it). * NOTE: The addresses you use can be different than those in the instructions