IF672 Algoritmos e Estruturas de Dados

Mini-Prova 4 - Perodo 2010/1

15 de junho de 2010

1.

D um pseudo-cdigo usando a Estratgia Guloso para o problema Cobertura por

Vrtices (G = V, E). Inclua inicializao de variveis e indique claramente as sadas.

______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________
______________________________________________________________________________________________

2.

D a tabela de Programao Dinmica que represente a soluo Pseudo-polinomial

para o Problema da Mochila 0-1 (ou seja, sem repetio ou fracionamento de itens),
com a seguinte entrada (ITEM = (ordem, peso, valor) ):

ITENS: [ (1, 2, 3);

(2, 3, 4); (3, 4, 5); (4, 1, 6) ]

PESO LIMITE = 9