Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 52 views

    Final Quiz 2 - Attempt Review 4

    Uploaded by

    Erick Garcia
    This document summarizes a student's attempt at a final quiz on algorithms. The student answered 7 out of 10 questions correctly and received an overall grade of 8 out of 10 or 80%. The quiz covered topics like the definition of algorithms, algorithm design techniques, analysis of algorithm complexity measures like time and space complexity, and analysis of best, worst, and average case complexities for different algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Final Quiz 2 - Attempt Review 4

    Uploaded by

    Erick Garcia
    52 views4 pages
    This document summarizes a student's attempt at a final quiz on algorithms. The student answered 7 out of 10 questions correctly and received an overall grade of 8 out of 10 or 80%. The quiz covered topics like the definition of algorithms, algorithm design techniques, analysis of algorithm complexity measures like time and space complexity, and analysis of best, worst, and average case complexities for different algorithms.

    Original Description:

    numerical methods final quiz 2

    Original Title

    Final Quiz 2_ Attempt Review 4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes a student's attempt at a final quiz on algorithms. The student answered 7 out of 10 questions correctly and received an overall grade of 8 out of 10 or 80%. The quiz covered topics like the definition of algorithms, algorithm design techniques, analysis of algorithm complexity measures like time and space complexity, and analysis of best, worst, and average case complexities for different algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    52 views4 pages

    Final Quiz 2 - Attempt Review 4

    Uploaded by

    Erick Garcia
    This document summarizes a student's attempt at a final quiz on algorithms. The student answered 7 out of 10 questions correctly and received an overall grade of 8 out of 10 or 80%. The quiz covered topics like the definition of algorithms, algorithm design techniques, analysis of algorithm complexity measures like time and space complexity, and analysis of best, worst, and average case complexities for different algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

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


    State Finished
    Completed on Wednesday, 9 June 2021, 12:21 PM
    Time taken 2 mins 44 secs
    Grade 8.00 out of 10.00 (80%)

    Question 1
    Correct

    Mark 1.00 out of 1.00

    Algorithms should have explicitly defined set of inputs and outputs

    Select one:
    True 

    False

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

    Question 3
    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. Pseudocode

    b. Instruction 

    c. Process

    d. Algorithm

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

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

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

    b. Process Complexity 

    c. Step complexity

    d. Space complexity

    Question 6
    Correct

    Mark 1.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

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

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

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

    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. worst-case

    b. best-case

    c. average-case 

    d. amortized

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

    Question 10
    Correct

    Mark 1.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 

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

    Jump to...

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

    You might also like