WSQ13 – Exam2

This blog post it’s a little late. But that doesn’t mean I didn’t do it on time. LOL The answers to the Exam 2 are all on my GitHub account. All of them are the same of some of the past quizzes. So, enjoy them. Question 1 – LINK Question 2 – LINK Question 3 … More WSQ13 – Exam2

Quiz 6

In this quiz, you needed to create a program which give you de Greatest Common Divisor between 2 numbers that you’ll provide. This is possible using Euclid’s algorithm. Just by following the Euclid’s algorithm, you can built the code and it really works. But one of the thing that I add is, that if the numbers … More Quiz 6