0% found this document useful (0 votes)
192 views3 pages

Final Quiz 2 - Attempt Review

The document is a review of a student's attempts on a final quiz covering algorithms. It shows the student scored 6 out of 10 overall (60%). It provides the questions asked on the quiz, whether the student answered correctly or incorrectly, and the score received for each question. It aims to help the student identify areas of weakness on algorithms and concepts tested in the quiz.

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
0% found this document useful (0 votes)
192 views3 pages

Final Quiz 2 - Attempt Review

The document is a review of a student's attempts on a final quiz covering algorithms. It shows the student scored 6 out of 10 overall (60%). It provides the questions asked on the quiz, whether the student answered correctly or incorrectly, and the score received for each question. It aims to help the student identify areas of weakness on algorithms and concepts tested in the quiz.

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/ 3

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:04 PM


State Finished
Completed on Wednesday, 9 June 2021, 12:05 PM
Time taken 54 secs
Grade 6.00 out of 10.00 (60%)

Question 1
Incorrect

Mark 0.00 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
Correct

Mark 1.00 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. An algorithm is a set of steps of operations to solve a problem performing calculation, data processing, and automated reasoning
tasks.

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

Question 3
Correct

Mark 1.00 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

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

Question 4
Correct

Mark 1.00 out of 1.00

To measure the efficiency of the algorithm, the space and time efficiency are the important factors

Select one:
True 

False

Question 5
Correct

Mark 1.00 out of 1.00

Algorithms should have explicitly defined set of inputs and outputs

Select one:
True 

False

Question 6
Correct

Mark 1.00 out of 1.00

The same algorithm can be represented in several different ways.

Select one:
True 

False

Question 7
Incorrect

Mark 0.00 out of 1.00

Best-case is the maximum number of steps taken on any instance of size of a variable.

Select one:
True 

False

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

Question 8
Incorrect

Mark 0.00 out of 1.00

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

Select one:
a. Process

b. Algorithm 

c. Instruction

d. Pseudocode

Question 9
Correct

Mark 1.00 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. average-case 

b. amortized

c. worst-case

d. best-case

Question 10
Incorrect

Mark 0.00 out of 1.00

Which of the following is the first step in solving computational problems?

Select one:
a. Specification of an Algorithm 

b. Designing an Algorithm

c. Development of a model

d. Problem definition

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

Jump to...

https://trimestral.amaesonline.com/2033/mod/quiz/review.php?attempt=357191&cmid=11811 3/3

You might also like