Skip to content

ukaemma2/monty

Repository files navigation

0x19. C - Stacks, Queues - LIFO, FIFO

C GROUP PROJECT ALGORITHM DATA STRUCTURE

AUTHORS:

UKAH EMMANUEL OGBONNA

Emmanuel Oluyege

TASKS:

0. push, pall

  • Implement the push and pall opcodes.

1. pint

  • Implement the pint opcode.

2. pop

  • Implement the pop opcode

3. swap

  • Implement the swap opcode.

4. add

  • Implement the add opcode.

5. nop

  • Implement the nop opcode.

ADVANCED TASKS:

6. sub

  • Implement the sub opcode.

7. div

  • Implement the div opcode.

8. mul

  • Implement the mul opcode.

9. mod

  • Implement the mod opcode.

10. comments

  • Every good language comes with the capability of commenting. When the first non-space character of a line is #, treat this line as a comment (don’t do anything).

11. pchar

  • Implement the pchar opcode.

12. pstr

  • Implement the pstr opcode.

13. rotl

  • Implement the rotl opcode.

14. rotr

  • Implement the rotr opcode.

15. stack, queue

  • Implement the stack and queue opcodes.

16. Brainf*ck

  • Write a Brainf*ck script that prints School, followed by a new line.

17. Add two digits

  • Add two digits given by the user.

Read the two digits from stdin, add them, and print the result The total of the two digits with be one digit-long (<10)

18. Multiplication

  • Multiply two digits given by the user.

Read the two digits from stdin, multiply them, and print the result The result of the multiplication will be one digit-long (<10)

19. Multiplication level up

  • Multiply two digits given by the user.

About

0x19. C - Stacks, Queues - LIFO, FIFO

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published