Fim: 08\/12\/2021<\/span><\/p>\nAulas s\u00edncronas todas as quartas feiras, as 15h30.<\/strong><\/span><\/p>\nCRONOGRAMA DETALHADO:<\/h3>\n
22\/09\/2021 Apresenta\u00e7\u00e3o da disciplina. Busca bin\u00e1ria ES<\/span>
29\/09\/2021 Tipo abstrato de dados. \u00c1rvores bin\u00e1rias ES\/EX<\/span>
06\/10\/2021 Implementa\u00e7\u00e3o de \u00e1rvores bin\u00e1rias ES\/ML \/EX<\/span>
13\/10\/2021 \u00c1rvore binaria de busca: ordena\u00e7\u00e3o, inclus\u00e3o, exclus\u00e3o.<\/span>
20\/10\/2021 Rota\u00e7\u00f5es, Inclus\u00e3o na raiz, exclus\u00e3o. \u00c1rvore AVL ES\/EX<\/span>
27\/10\/2021 \u00c1rvore 2-3-4. Inclus\u00e3o, Exclus\u00e3o ES<\/span>
03\/11\/2021 \u00c1rvore B: inclus\u00e3o, ES\/EX<\/span>
10\/11\/2021 \u00c1rvore B+, ISAM ES<\/span>
17\/11\/2021 Pesquisa digital e Trie<\/span>
24\/11\/2021 Ordena\u00e7\u00e3o Externa, Compress\u00e3o de dados ES\/ML\/EX<\/span>
01\/12\/2021 Hashing e Endere\u00e7amento aberto ES\/EX<\/span>
08\/12\/2021 Exame Final<\/span><\/p>\nLegenda:<\/strong><\/span>
ES: Encontro s\u00edncrono (2 horas)<\/span>
ML: Disponibiliza\u00e7\u00e3o pelo professor de material de leitura (tempo necess\u00e1rio para leitura e estudo complementar ao trabalho pr\u00e1tico: 4 horas)<\/span>
EX: Disponibiliza\u00e7\u00e3o pelo professor de exerc\u00edcios (tempo necess\u00e1rio para realizar a tarefa: 3 horas)<\/span>
TPn: Disponibiliza\u00e7\u00e3o pelo professor de trabalho pr\u00e1tico (tempo necess\u00e1rio para leitura, estudo e implementa\u00e7\u00e3o do trabalho pr\u00e1tico: 9 horas)<\/span><\/p>\nAVALIA\u00c7\u00c3O<\/h3>\n
Dois trabalhos e prova final (se necess\u00e1rio)<\/span><\/p>\n\n- Trabalho 1: 27\/10\/2021\u00a0<\/li>\n
- Trabalho 2: 24\/11\/2021<\/li>\n
- Final: 08\/12\/2021<\/li>\n<\/ul>\n
C\u00e1lculo da M\u00e9dia Parcial<\/strong>: t1*0.50\u00a0 + t2*0.50<\/span><\/p>\n
C\u00e1lculo da m\u00e9dia final:<\/strong><\/span>
\u2013 igual \u00e0 m\u00e9dia parcial, se esta \u00e9 igual ou superior a 7.0 ou inferior a 4.0,<\/span>
\u2013 m\u00e9dia aritm\u00e9tica entre a m\u00e9dia parcial e a nota no exame final, caso contr\u00e1rio.<\/span><\/p>\nSer\u00e1 aprovado o aluno que apresentar freq\u00fc\u00eancia m\u00ednima igual ou superior a 75% das aulas e obtiver m\u00e9dia final igual ou superior a 5.0.<\/span><\/p>\nBIBLIOGRAFIA<\/b><\/span><\/p>\nOs 2 primeiros livros ser\u00e3o os mais utilizados durante a disciplina. Os demais tamb\u00e9m possuem material muito bom.<\/span>
=> Algoritmos \u2013 Teoria e pr\u00e1tica, Cormen, Leiserson, Rivest, Stein, Rio de Janeiro, Campus, 2002<\/span>
=> Projeto de algoritmos: com implementa\u00e7\u00f5es em Pascal e C. N\u00edvio Ziviani. S\u00e3o Paulo: Pioneira, 1999<\/span>
=> Algorithms in C. R. Sedgewick. Addison-Wesley, Reading, Massachusetts, 1998.<\/span>
=> Estruturas de Dados e seus Algoritmos. J.L. Szwarcfiter, L. Markenzon. LTC-Livros T\u00e9cnicos e Cient\u00edficos, Rio de Janeiro, RJ, 1994.<\/span>
=>\u00a0 Data Structures and Algorithms. A.V. Aho, J.E. Hopcroft, J.D. Ullman. Addison-Wesley, Reading, Massachusetts, 1983.<\/span>
=>\u00a0 Algorithms and Data Structures. N. Wirth. Prentice-Hall, 1986 (Tradu\u00e7\u00e3o: Algoritmos e Estruturas de Dados. Prentice-Hall do Brasil Ltda, 1989)<\/span>
=> Introduction to Algorithms, Cormen, Leiserson, Rivest. MIT Press, Cambridge, Massachusetts, 1996.<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":21,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1558","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/1558","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/users\/21"}],"replies":[{"embeddable":true,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/comments?post=1558"}],"version-history":[{"count":16,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/1558\/revisions"}],"predecessor-version":[{"id":1660,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/1558\/revisions\/1660"}],"wp:attachment":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/media?parent=1558"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}