Question: Do not use the Irvine libraries / procedures for the programs in this assignment. There is a template for writing programs without using Irvine that
Do not use the Irvine librariesprocedures for the programs in this assignment. There is a
template for writing programs without using Irvine that you may use if you wish.
Pts Write a program using bit MASM x Assembly Language that accomplishes the
following:
a Initialize Variables in the data section of your program for varA, varB, varC, varD, and Result.
b In the code section your program should compute the following:
Result VarBVarD
Pts Write a program using bit MASM Assembly Language that generates the
first values of the Fibonacci Sequence starting from as described by the following
formula:
FibFibFibFibFib
Save the sequence sequentially in memory starting at a defined location.
Do not use magic numbers. Name and initialize variables in the data section of your programs.
Submit your source code asm files to the assignment dropbox by the due date. Submit a
separate asm file for each program.
Build and debug your code using Visual Studio
Submit your source code asm file to the assignment dropbox by the due date. Do not submit
Word or PDF files containing your code. Do not submit your sln project file.
Comment Requirements:
There must be a preamble block of comments at the beginning of the program that includes at
least the following information:
Your name
Course number, section, and title
Program title
Date
There must be a block of comments before the main procedure of your program, as well as
before each additional procedure if applicable that describes the inputs, outputs, memory usage,
register usage, and functional description of the procedure.
The program must also contain nonsyntax based individual line comments for each line that
make the functional goals and processes of the program selfdocumenting. These comments
should be placed in line with each instruction.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
