Scribd
Upload
209 views4 pages

Final Quiz 2 3

The document is a 10 question quiz about algorithms. It covers topics like randomized algorithms, analysis of algorithms, pseudocode, and approximation algorithms. Some key points are: - If a randomized algorithm solves a decision problem in time t with 50% probability, there is an algorithm that does it in time Θ(t) with 99% probability. - The time complexity of an algorithm measures the running time as a function of the input size n. - Pseudocode is a high level description of an algorithm intended for human reading.

Uploaded by

Erick Garcia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
209 views4 pages

Final Quiz 2 3

The document is a 10 question quiz about algorithms. It covers topics like randomized algorithms, analysis of algorithms, pseudocode, and approximation algorithms. Some key points are: - If a randomized algorithm solves a decision problem in time t with 50% probability, there is an algorithm that does it in time Θ(t) with 99% probability. - The time complexity of an algorithm measures the running time as a function of the input size n. - Pseudocode is a high level description of an algorithm intended for human reading.

Uploaded by

Erick Garcia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

6/9/2021 Final Quiz 2

Home / My courses /
UGRD-MATH6330-2033T /
Week 13: Final Quiz /
Final Quiz 2

Question 1
Not yet answered

Marked out of 1.00

If there is a randomized algorithm that solves a decision problem in time t and outputs the correct answer with probability 0.5, then there is
a randomized algorithm for the problem that runs in time Θ(t) and outputs the correct answer with probability at least 0.99.

Select one:
True

False

Question 2
Not yet answered

Marked out of 1.00

The complexity of sorting algorithm measures the running time as a function of the number n of items to be sorter.

Select one:
True

False

Question 3
Not yet answered

Marked out of 1.00

This is defined as the high level descriptions of instruction which is intended for human reading.

Select one:
a. Pseudocode

b. Process

c. Algorithm

d. Instruction

Clear my choice

https://trimestral.amaesonline.com/2033/mod/quiz/attempt.php?attempt=357237&cmid=11811 1/4
6/9/2021 Final Quiz 2

Question 4
Not yet answered

Marked 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. average-case

b. amortized

c. best-case

d. worst-case

Clear my choice

Question 5
Not yet answered

Marked 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. Process Complexity

b. Time complexity

c. Step complexity

d. Space complexity

Clear my choice

Question 6
Not yet answered

Marked out of 1.00

The same algorithm can be represented in several different ways.

Select one:
True

False

https://trimestral.amaesonline.com/2033/mod/quiz/attempt.php?attempt=357237&cmid=11811 2/4
6/9/2021 Final Quiz 2

Question 7
Not yet answered

Marked out of 1.00

In the analysis of algorithm, this is the number of steps taken on any instance of size a.

Select one:
a. amortized

b. worst-case

c. best-case

d. average-case

Clear my choice

Question 8
Not yet answered

Marked out of 1.00

Which of the following statements about algorithm is INCORRECT?

Select one:
a. Algorithms should have explicitly defined set of inputs and outputs

b. Algorithms can run for infinitely

c. Algorithms must have a unique name

d. Algorithms are well-ordered with unambiguous operations

Clear my choice

Question 9
Not yet answered

Marked out of 1.00

This is an informal and human readable description of an algorithm leaving many granular details of it.

Select one:
a. Algorithm

b. Instruction

c. Process

d. Pseudocode

Clear my choice

https://trimestral.amaesonline.com/2033/mod/quiz/attempt.php?attempt=357237&cmid=11811 3/4
6/9/2021 Final Quiz 2

Question 10
Not yet answered

Marked 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

◄ W12: Lesson 9 - Application of Algorithms in Programming Languages - Video Lecture

Jump to...

https://trimestral.amaesonline.com/2033/mod/quiz/attempt.php?attempt=357237&cmid=11811 4/4

You might also like