Spring 2024 - CS401 - 1
Spring 2024 - CS401 - 1
You should concern the recommended books to clarify your concepts as handouts are not sufficient.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc. will not be accepted.
Topics covered: Data Declaration and Direct Addressing, Indirect Addressing, Branching,
Unconditional jumps and relative addressing
NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load
shedding or internet malfunctioning). Hence refrain from uploading assignment in the last hour of the
deadline. It is recommended to upload your solution file at least two days before its closing date.
If you find any mistake or confusion in the assignment (Question statement), please contact your
instructor before the deadline. After the deadline, no queries will be entertained in this regard.
You are required to write an assembly language program to perform the following tasks:
a) Store the numeric part of your VUID in an array of numbers in memory.
b) Find the largest numeric digit of your VUID and store it in memory.
c) Subtract each numeric digit of your VUID from the largest digit (found in part b) and store it in a
2nd array.
d) Sort and store updated VUID in ascending order in a 3rd array.
Note: You must use your own VUID. For example, if your VUID is BC230412545, the numeric part will
be 230412545.
Submission details:
Sample screenshot:
“Best of luck”