[go: up one dir, main page]
Scribd
Upload
109 views4 pages

Final Quiz 2 4

This document appears to be a 10 question final quiz for an algorithms course. The quiz covers topics like the definition of algorithms, algorithm design techniques, pseudocode, time complexity analysis, and sorting algorithms. It tests students' understanding of key concepts around algorithms through multiple choice questions.

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
109 views4 pages

Final Quiz 2 4

This document appears to be a 10 question final quiz for an algorithms course. The quiz covers topics like the definition of algorithms, algorithm design techniques, pseudocode, time complexity analysis, and sorting algorithms. It tests students' understanding of key concepts around algorithms through multiple choice questions.

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

Algorithms should have explicitly defined set of inputs and outputs

Select one:
True

False

Question 2
Not yet answered

Marked 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

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. Instruction

c. Process

d. Algorithm

Clear my choice

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

Question 4
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

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. Time complexity

b. Process Complexity

c. Step complexity

d. Space complexity

Clear my choice

Question 6
Not yet answered

Marked 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

Clear my choice

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

Question 7
Not yet answered

Marked out of 1.00

Which of the following correctly describes an algorithm?

Select one:
a. All of these

b. Algorithm is being used to determine the most practical kinds of solution to solve a problem.

c. It is an efficient method that can be expressed within finite amount of time and space.

d. An algorithm is a set of steps of operations to solve a problem performing calculation, data processing, and automated reasoning
tasks.

Clear my choice

Question 8
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 9
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. worst-case

b. best-case

c. average-case

d. amortized

Clear my choice

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

Question 10
Not yet answered

Marked out of 1.00

The Average case occurs in linear search algorithmwhen item is the last element in the array.

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=357278&cmid=11811 4/4

You might also like