This is an old revision of the document!


MARIE - MinMax swap - A study about assembly

  • Soft Deadline: 19.01.2024, 23:59
  • Hard Deadline: 19.01.2024, 23:59
  • Publish date: 07.01.2024
  • Last update: 08.01.2024, 12:00
  • History:
    • 07.01.2024, 22:00
      • Publish the assignment - detailed

Objectives

Description and requirements

Implementation

Notes

Additional details

  • In the project recourses you can find example for array manipulation and swap functions; put them into the simulation for a better understanding
  • The project archive that you shall upload (zip compression type) must include in it's root only:
    • the MARIE .mas or .txt file which contain the assembly code
    • a README file, which shall contain at least:
      • your name and group;
      • general presentation of your solution;
      • description of any complex coding parts that you consider additional explanation is needed and they are too long to be an inline comment;

This assignment is an individual assignment; using any code from external sources can be considered as plagiarism and can lead to voiding the accumulated points!

Grading

  • +10.0 pts.: Correct implementation with passing stimuli from the keyboard
  • -1.0 pts.: the absence of the README file;
  • -1.0 pts.: bad coding style (chaotic indentation, irregular spacing, strange naming for variables, etc.);
  • -0.2 pts.: other generic implementation issues (/issue);
  • -0.1 pts.: useless code comments.

Even if you do not finish the assignment, you can receive up to 25% of the grade if you properly explain your idea in the README file. Your code must pass the compilation and run.

Recourses

Appendix

ac-is/teme-ie/course_project_assembly.1704658104.txt.gz · Last modified: 2024/01/07 22:08 by ionut.pascal
CC Attribution-Share Alike 3.0 Unported
www.chimeric.de Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0