Scribd Logo
Fazer o upload

Bem-vindo(a) ao Scribd!

  • Assignment 03

    Enviado por

    strwind2
    27 visualizações1 página
    This document provides instructions for two questions from an algorithm analysis assignment. Question 1 asks the student to: (1) write pseudocode for a decrease-and-conquer algorithm to solve a problem involving glass moves, (2) set up and solve a recurrence relation for the number of glass moves made, (3) write pseudocode for a brute-force algorithm for the same problem and determine its efficiency class, and (4) compare the decrease-and-conquer algorithm to the brute-force algorithm. Question 2 provides a reference to a problem from the textbook exercises but does not include details about the question.

    Descrição original:

    Direitos autorais

    © Attribution Non-Commercial (BY-NC)

    Formatos disponíveis

    PDF, TXT ou leia online no Scribd

    Você considera este documento útil?

    Este conteúdo é inapropriado?

    Denunciar este documento
    This document provides instructions for two questions from an algorithm analysis assignment. Question 1 asks the student to: (1) write pseudocode for a decrease-and-conquer algorithm to solve a problem involving glass moves, (2) set up and solve a recurrence relation for the number of glass moves made, (3) write pseudocode for a brute-force algorithm for the same problem and determine its efficiency class, and (4) compare the decrease-and-conquer algorithm to the brute-force algorithm. Question 2 provides a reference to a problem from the textbook exercises but does not include details about the question.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    27 visualizações1 página

    Assignment 03

    Enviado por

    strwind2
    This document provides instructions for two questions from an algorithm analysis assignment. Question 1 asks the student to: (1) write pseudocode for a decrease-and-conquer algorithm to solve a problem involving glass moves, (2) set up and solve a recurrence relation for the number of glass moves made, (3) write pseudocode for a brute-force algorithm for the same problem and determine its efficiency class, and (4) compare the decrease-and-conquer algorithm to the brute-force algorithm. Question 2 provides a reference to a problem from the textbook exercises but does not include details about the question.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    de 1

    451 Algorithm Analysis Assignment #3 The questions are from the textbook.

    "Introduction to the Design and Analysis of Algorithms, Anany Levitin, Addison Wesley; 2nd edition, 2006"

    Q1 ) 50 pts. Exercises 5.1 Question No: 2 Page 163 For the problem explained in this question: i) Write a pseudocode for the decrease-and-conquer algorithm for this problem. ii) Set up and solve a recurrence for the number of glass moves made by your algorithm iii) Write a pseudocode for the brute-force algorithm for this problem? Find the efficiency class. iv) How does this algorithm compare with the brute-force algorithm for this problem?

    Q2) 50 pts. Exercises 5.5

    Question No: 3

    Page 187

    Você também pode gostar