Quiz 1 Questions and Answers 100% Solved

Quiz 1

Using the Euclid's algorithm, you are going to calculate the greatest common divisor
(gcd) of gcd (4, 6). Determine the values of the first step of gcd (4, 6) as below. Select
the correct numbers for A and B.
gcd (4, 6) = gcd(A, B) - answergcd(6,4)

A: 6
B: 4

Using the Euclid's algorithm, you are going to calculate the greatest common divisor
(gcd) of gcd (56, 40). Determine the values of the first step of gcd (56, 40) as below.
Select the correct numbers for A and B.
gcd (56, 40) = gcd(A, B) - answergcd(40, 16)

A: 40
B: 16

O(n*logn) is considered the fastest one for comparison-based sorting. - answer true

A sorting algorithm is said to be _____________ if the algorithm preserves the relative
order of any two or more equal elements in its input. - answerstable

For CST370, we use AWS Educate for homework programming. Also, it provides
automatic run of a few test cases. - answertrue

6. Select the main purpose of the following pseudocode.

- find a sum
- find a min
- find an average
- find a max
- none of these - answernone of these

Select the main purpose of the following pseudocode.

Find a min
Search a value
Find a max
None of these.
Sort values - answerFind a max