# Project Report 3

In each case, provide:

Assembly Language source code

A test plan

A Project Report

Note 1: A test plan should include: Normal, Boundary and Error cases

Note 2: Present your final results in the form of report that summarizes your work:

Title

Author

Revision

Introduction: Problem Statement

Method: Design, Pseudo-code(s); place actual pseudo-codes in the Appendix

Solution: Assembly Language Implementations; place actual Assembly Language source codes in the Appendix

Results and Discussion: Test Plan(s),

Snapshots (screen shots) of Running of Test Cases; place Test Plans in the Appendix

Summary and Conclusions

Acknowledgements

References

Appendix:

Pseudo-codes

ASM source codes

Test plans

Test Case runs, screen shots

Project 1.

*) Choose an alphabet or code set with K numbers or letters, A = {A1, A2, ..., AK}, for example, (K=8),

for example: A = {2, 3, 5, 7, 8, 15, 21, 33}.

*) Consider a sequence or data stream of at least N values (K < N < 200), each value is from the code set,

for example: D = 15, 3, 2, 2, 8, 21, 2, 5, 5, 5, 8, 7, 21, 33, 2, 15, 33, 2, 5, 7, 8, 8, 15, 3, 8.

*) Process the sequence to determine or count the number of times each element of the alphabet or code set

occurs in the sequence

*) Let the frequency counts obtained be F = {F1, F2, ..., FK}

*) Construct the "histogram": H = {A1*F1, A2*F2, ..., AK*FK}

*) Construct the "weighted" sum: S = A1*F1 + A2*F2 + AK*FK

*) Construct the "average" or mean: M = S / N, express as M = {Mq, Mr}, Mq = quotient, Mr = remainder

*) Construct a "generating function" using the base or radix B (B=8):

G = 1 + F1*B^1 + F2*B^2 + ... + FK*B^K

*) Display the results:

G, H, F, M, S, D, A, K, N

Project 2:

*) Consider a set of values of N "resistances": R1, R2, ..., RN

*) Compute: R1*R1, R2*R2, ..., RN*RN

*) Compute: R1*R1, R1*R2, ..., R1*RN, R2*R1, R2*R2, ..., R2*RN,...., RN*R1, RN*R2,....,RN*RN

*) Compute: R1/R1, R1/R2, ..., R1/RN, R2/R1, R2/R2, ..., R2/RN,...., RN/R1, RN/R2,....,RN/RN

(for each division (/), express the results as a pair: {quotient and remainder})

*) Compute: R0 = R1 + R2 + ... + RN

*) Compute: R1/R0, R2/R0, ..., RN/R0

*) Compute: S1 = R1, S2 = S1+R2, S3 = R3+S3, ..., SN = RN+S(N-1) = R0

*) Compute: R1/S1, R2/S2, ..., RN/SN

Project 3:

*) Given the number of seconds (of time, T) entered on the keyboard, calculate the number of hours, minutes and

seconds, let 50,000 < T < 10,000,000.

*) Given number of cents (of monetary value, V) entered on the keyboard, calculate the number of:

\$100 bills, \$50 bills, \$20 bills, \$10 bills, \$5 bills, \$1 bills, half dollars, quarters, dimes, nickels,

cents in V. Let 50,000 < V < 10,000,000.

*) Given an NxN "currency conversion" matrix(C), convert various currency values provided as a set of (K)

NxN matrices: V1, ..., VK. For example, Wk[i,j] = C[i,j] * Vk[i,j], k=1,...,K; i,j=1,...,N.

( 6 comentários ) Jamaica, United States

ID do Projeto: #5142806

## 1 freelancer está ofertando em média \$50 para este trabalho

greenvector

Hired by the Employer

\$50 USD in 8 dias
(5 Comentários)
2.4