zainab946

Final-Lab

Calculator

Math-library-in-Assembly-Nasm-16-bit-

Modified-Josephus-Problem-in-c-

Problem Description:During the Jewish revolt against Rome, Josephus and 39 of his companions were hiding in a cave from the Romans. With defeat looming, they decided, like the rebels at Masada, that they would rather die than become Roman slaves. They made the decision to form a circle. One man was assigned as number one, and they proceeded to kill every second man clockwise... According to the account, Josephus was an expert mathematician, so he immediately figured out where he should sit in order to be the last to leave. But when the moment came, instead of murdering himself, he sided with the Romans.

Travelling-salesman-problem-in-Assembly-Language

Travelling salesman problem implemented in Assembly Language using NASM 16 bit ,output shown using video memory. Implemented for 2 paths from a node for now, working to generalize it more and for multiple paths.

zainab946.github.io

zainab946/zainab946.github.io

zainab946/Math-library-in-Assembly-Nasm-16-bit-

zainab946/Modified-Josephus-Problem-in-c-

Problem Description:During the Jewish revolt against Rome, Josephus and 39 of his companions were hiding in a cave from the Romans. With defeat looming, they decided, like the rebels at Masada, that they would rather die than become Roman slaves. They made the decision to form a circle. One man was assigned as number one, and they proceeded to kill every second man clockwise... According to the account, Josephus was an expert mathematician, so he immediately figured out where he should sit in order to be the last to leave. But when the moment came, instead of murdering himself, he sided with the Romans.

zainab946/Travelling-salesman-problem-in-Assembly-Language

Travelling salesman problem implemented in Assembly Language using NASM 16 bit ,output shown using video memory. Implemented for 2 paths from a node for now, working to generalize it more and for multiple paths.

zainab946/Final-Lab

Calculator