6/9/2021 Final Quiz 2: Attempt review
Home / My courses /
UGRD-MATH6330-2033T /
Week 13: Final Quiz /
Final Quiz 2
Started on Wednesday, 9 June 2021, 12:05 PM
State Finished
Completed on Wednesday, 9 June 2021, 12:07 PM
Time taken 2 mins 10 secs
Grade 2.00 out of 10.00 (20%)
Question 1
Incorrect
Mark 0.00 out of 1.00
In the analysis of algorithm, this is minimum number of steps taken on any instance of size a.
Select one:
a. worst-case
b. amortized
c. average-case
d. best-case
Question 2
Incorrect
Mark 0.00 out of 1.00
In the analysis of algorithm, this is maximum number of steps taken on any instance of size a.
Select one:
a. best-case
b. average-case
c. worst-case
d. amortized
Question 3
Correct
Mark 1.00 out of 1.00
There exists a minimization problem such that (i) assuming P = NP, there is no polynomial-time 1-approximation algorithm for the problem;
and (ii) for any constant ǫ > 0, there is a polynomial-time (1 + ǫ)-approximation algorithm for the problem.
Select one:
True
False
https://trimestral.amaesonline.com/2033/mod/quiz/review.php?attempt=357199&cmid=11811 1/4
6/9/2021 Final Quiz 2: Attempt review
Question 4
Incorrect
Mark 0.00 out of 1.00
Sequential algorithm is an algorithm which can be executed a piece at a time on many different processing devices, and then combined
together again at the end to get the correct result.
Select one:
True
False
Question 5
Incorrect
Mark 0.00 out of 1.00
In the analysis of algorithm, this refers to the number of steps to be taken in an algorithm.
Select one:
a. Step complexity
b. Time complexity
c. Space complexity
d. Process Complexity
Question 6
Correct
Mark 1.00 out of 1.00
An algorithm design technique is a general approach to solving problems algorithmically that is applicable to a variety of problems from
different areas of computing.
Select one:
True
False
https://trimestral.amaesonline.com/2033/mod/quiz/review.php?attempt=357199&cmid=11811 2/4
6/9/2021 Final Quiz 2: Attempt review
Question 7
Incorrect
Mark 0.00 out of 1.00
This is defined as the high level descriptions of instruction which is intended for human reading.
Select one:
a. Process
b. Pseudocode
c. Instruction
d. Algorithm
Question 8
Incorrect
Mark 0.00 out of 1.00
Which of the following statements about algorithm is INCORRECT?
Select one:
a. Algorithms are well-ordered with unambiguous operations
b. Algorithms must have a unique name
c. Algorithms can run for infinitely
d. Algorithms should have explicitly defined set of inputs and outputs
Question 9
Incorrect
Mark 0.00 out of 1.00
The Average case occurs in linear search algorithmwhen item is the last element in the array.
Select one:
True
False
https://trimestral.amaesonline.com/2033/mod/quiz/review.php?attempt=357199&cmid=11811 3/4
6/9/2021 Final Quiz 2: Attempt review
Question 10
Incorrect
Mark 0.00 out of 1.00
In the analysis of algorithm, this refers to the volume of memory.
Select one:
a. Step complexity
b. Time complexity
c. Space complexity
d. Process Complexity
◄ W12: Lesson 9 - Application of Algorithms in Programming Languages - Video Lecture
Jump to...
https://trimestral.amaesonline.com/2033/mod/quiz/review.php?attempt=357199&cmid=11811 4/4
