{"id":1479,"date":"2021-04-22T13:41:50","date_gmt":"2021-04-22T16:41:50","guid":{"rendered":"http:\/\/web.inf.ufpr.br\/didonet\/?page_id=1479"},"modified":"2021-07-29T18:26:48","modified_gmt":"2021-07-29T21:26:48","slug":"ci1057-ere3-algoritmos-e-estruturas-de-dados-iii","status":"publish","type":"page","link":"https:\/\/web.inf.ufpr.br\/didonet\/ci1057-ere3-algoritmos-e-estruturas-de-dados-iii\/","title":{"rendered":"CI1057 &#8211; ERE3 &#8211; Algoritmos e estruturas de dados III"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\"><span style=\"color: #000000\">Algoritmos e estruturas de dados III<\/span><\/h2>\n\n\n\n<p class=\"subtitle\" id=\"segundo-semestre-de-2010\"><span style=\"color: #000000\"><b>Ensino Remoto Emergencial 3 : ERE 3 2021<br>\n<\/b><\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\">P\u00e1gina com informa\u00e7\u00f5es gerais da disciplina: ementa, datas das provas, bibliografia, exerc\u00edcios, etc.<\/span><\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span style=\"color: #000000\">AVISOS<\/span><\/h3>\n\n\n\n<p><span style=\"color: #000000\"><b>================================<\/b><\/span><\/p>\n\n\n\n<p>=&gt; <a href=\"https:\/\/web.inf.ufpr.br\/didonet\/ci1057_ere3_2021\/\" title=\"CI1057_ERE3_2021\">Resultados dispon\u00edveis.<\/a><\/p>\n\n\n\n<p><span style=\"color: #000000\">=&gt; Especifica\u00e7\u00f5es do <a title=\"CI1057 \u2013 ERE \u2013 Trabalho 01\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/ci1057-ere-trabalho-01\/\">trabalho 1<\/a> e do <a title=\"CI1057 \u2013 ERE \u2013 Trabalho 2\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/ci1057-ere-trabalho-2\/\">trabalho 2<\/a> dispon\u00edveis.<\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\"><br>\n=&gt; Locais dos encontros virtuais: <a href=\"https:\/\/bbb.c3sl.ufpr.br\/b\/mar-d3c-kdz\">https:\/\/bbb.c3sl.ufpr.br\/b\/mar-d3c-kdz&nbsp;<\/a><\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\">=&gt; Est\u00e3o acesss\u00edveis no GitHub um conjunto de <em>Notebooks <\/em>com c\u00f3digos em C++ com implementa\u00e7\u00e3o das estruturas de dados apresentadas na disciplina. <a href=\"https:\/\/github.com\/Marcosddf\/algoritmoseestruturasdedados\">Acess\u00edvel no Github<\/a>.<br>\n<\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\"><b>================================<\/b><\/span><\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span style=\"color: #000000\"><b>MATERIAL DE AULA<\/b><\/span><\/h3>\n\n\n\n<p><a class=\"internal-link\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/exercicios-bst\/\">1 \u2013 Exerc\u00edcios (\u00e1rvores BST, AVL, 2-3-4, B, RB)<\/a><br>\n<a class=\"internal-link\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/exercicios-rbt\/\">2 \u2013 Exerc\u00edcios (BST, AVL, 2-3-4, RB)<\/a><br>\n<a href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/exerciciosthh\/\">3 \u2013 Exerc\u00edcios Trie, Heap, Hash<\/a><\/p>\n\n\n\n<p><a class=\"external-link\" title=\"\" href=\"http:\/\/www.cs.usfca.edu\/~galles\/visualization\/Algorithms.html\" target=\"_self\" rel=\"noopener noreferrer\">&nbsp;Site com simula\u00e7\u00e3o&nbsp;<\/a><span style=\"color: #000000\">de cria\u00e7\u00e3o de diferentes tipos de estruturas de dados (Universidade de S\u00e3o Francisco, EUA)<\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\">Aulas gravadas<\/span><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1622053292630\">TAD dicion\u00e1rio, \u00e1rvores<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1622657931297\">\u00c1rvores &#8211; implementa\u00e7\u00f5es<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1623868129878\">Rota\u00e7\u00e3o, inclus\u00e3o na raiz (BST) e AVL<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1624472722171\">\u00c1rvore 2-3-4<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1625077789668\">\u00c1rvore B<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1625682521147\">\u00c1rvore B+<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1626287318866\">Trie, \u00e1rvore de prefixos<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.3\/0225f3ba2ffc63174da1f83bd402438eb29d7e54-1627496765783\">MergeSort, Huffman, Hashing<\/a><\/li><\/ul>\n\n\n\n<p>Aulas gravadas (durante ERE 2)<\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1611771637709\">TAD Dicion\u00e1rio, \u00e1rvores<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1612376880471\">Implementa\u00e7\u00f5es de \u00e1rvores, \u00e1rvore bin\u00e1ria de busca (defini\u00e7\u00f5es)<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1612981922745\">Rota\u00e7\u00f5es, inclus\u00e3o na raiz e exclus\u00e3o em BST<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1614191297502\">AVL, 2-3-4<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1614795879936\">\u00c1rvore B, B+<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1615400924695\">TRIE\/\u00e1rvore de prefixos<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1616005456522\">Huffman &#8211; ordena\u00e7\u00e3o externa (MergeSort)<\/a><\/li><li><a href=\"https:\/\/bbb.c3sl.ufpr.br\/playback\/presentation\/2.0\/playback.html?meetingId=0225f3ba2ffc63174da1f83bd402438eb29d7e54-1616610446794\"><strong>Hashing<\/strong><\/a><\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Modalidades e meios<\/h3>\n\n\n\n<p><span style=\"color: #000000\"><strong>Atividades s\u00edncronas:<\/strong> aulas por videconfer\u00eancia <a href=\"https:\/\/bbb.c3sl.ufpr.br\/b\/mar-d3c-kdz\">https:\/\/bbb.c3sl.ufpr.br\/b\/mar-d3c-kdz<\/a><\/span><br>\n<span style=\"color: #000000\"><strong>Atividades ass\u00edncronas:<\/strong> textos, listas de exerc\u00edcios e trabalhos. Calend\u00e1rio: <\/span><br>\n<span style=\"color: #000000\">In\u00edcio: 19\/05\/2021 <\/span><br>\n<span style=\"color: #000000\">Fim: 04\/08\/2021<\/span><\/p>\n\n\n\n<p><strong>Aulas todas as quartas feiras, as 15h30.<\/strong><\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Cronograma detalhado:<\/h3>\n\n\n\n<p>19\/05\/2021 Apresenta\u00e7\u00e3o da disciplina. Busca bin\u00e1ria ES<br>\n26\/05\/2021 Tipo abstrato de dados. \u00c1rvores bin\u00e1rias ES\/EX<br>\n02\/06\/2021 Implementa\u00e7\u00e3o de \u00e1rvores bin\u00e1rias ES\/ML \/EX<br>\n09\/06\/2021 \u00c1rvore binaria de busca: ordena\u00e7\u00e3o, inclus\u00e3o, exclus\u00e3o.<br>\n16\/06\/2021 Rota\u00e7\u00f5es, Inclus\u00e3o na raiz, exclus\u00e3o. \u00c1rvore AVL ES\/EX<br>\n23\/06\/2021 \u00c1rvore 2-3-4. Inclus\u00e3o, Exclus\u00e3o ES<br>\n30\/06\/2021 \u00c1rvore B: inclus\u00e3o, ES\/EX<br>\n07\/07\/2021 \u00c1rvore B+, ISAM ES<br>\n14\/07\/2021 Pesquisa digital e Trie<br>\n21\/07\/2021 Ordena\u00e7\u00e3o Externa, Compress\u00e3o de dados ES\/ML\/EX<br>\n28\/07\/2021 Hashing e Endere\u00e7amento aberto ES\/EX<br>\n04\/08\/2021 Exame Final<\/p>\n\n\n\n<p><span style=\"color: #000000\"><strong>Legenda:<\/strong> <\/span><br>\n<span style=\"color: #000000\">ES: Encontro s\u00edncrono (2 horas)<\/span><br>\n<span style=\"color: #000000\">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><br>\n<span style=\"color: #000000\">EX: Disponibiliza\u00e7\u00e3o pelo professor de exerc\u00edcios (tempo necess\u00e1rio para realizar a tarefa: 3 horas)<\/span><br>\n<span style=\"color: #000000\">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>\n\n\n\n<h3 class=\"wp-block-heading\">Avalia\u00e7\u00e3o<\/h3>\n\n\n\n<p><span style=\"color: #000000\">Dois trabalhos e prova final (se necess\u00e1rio)<\/span><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Trabalho 1: 23\/06\/2021&nbsp;<\/span><\/li><li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Trabalho 2: 21\/07\/2021<\/span><\/li><li style=\"font-weight: 400\"><span style=\"font-weight: 400\">Final: 04\/08\/2021<\/span><\/li><\/ul>\n\n\n\n<p><span style=\"color: #000000\"><br>\n<strong>C\u00e1lculo da M\u00e9dia Parcial<\/strong>: t1*0.50&nbsp; + t2*0.50<\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\"><br>\n<\/span><span style=\"color: #000000\"><strong>C\u00e1lculo da m\u00e9dia final:<\/strong><br>\n<\/span><span style=\"color: #000000\">&#8211; igual \u00e0 m\u00e9dia parcial, se esta \u00e9 igual ou superior a 7.0 ou inferior a 4.0,<br>\n<\/span><span style=\"color: #000000\">&#8211; m\u00e9dia aritm\u00e9tica entre a m\u00e9dia parcial e a nota no exame final, caso contr\u00e1rio.<\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\">Ser\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>\n\n\n\n<p><span style=\"color: #000000\"><b>BIBLIOGRAFIA<\/b><\/span><\/p>\n\n\n\n<p><span style=\"color: #000000\">Os 2 primeiros livros ser\u00e3o os mais utilizados durante a disciplina. Os demais tamb\u00e9m possuem material muito bom.<br>\n=&gt; Algoritmos \u2013 Teoria e pr\u00e1tica, Cormen, Leiserson, Rivest, Stein, Rio de Janeiro, Campus, 2002<br>\n<\/span><span style=\"color: #000000\">=&gt; Projeto de algoritmos: com implementa\u00e7\u00f5es em Pascal e C. N\u00edvio Ziviani. S\u00e3o Paulo: Pioneira, 1999<br>\n<\/span><span style=\"color: #000000\">=&gt; Algorithms in C. R. Sedgewick. Addison-Wesley, Reading, Massachusetts, 1998.<br>\n<\/span><span style=\"color: #000000\">=&gt; Estruturas de Dados e seus Algoritmos. J.L. Szwarcfiter, L. Markenzon. LTC-Livros T\u00e9cnicos e Cient\u00edficos, Rio de Janeiro, RJ, 1994.<br>\n<\/span><span style=\"color: #000000\">=&gt;&nbsp; Data Structures and Algorithms. A.V. Aho, J.E. Hopcroft, J.D. Ullman. Addison-Wesley, Reading, Massachusetts, 1983.<br>\n<\/span><span style=\"color: #000000\">=&gt;&nbsp; Algorithms and Data Structures. N. Wirth. Prentice-Hall, 1986 (Tradu\u00e7\u00e3o: Algoritmos e Estruturas de Dados. Prentice-Hall do Brasil Ltda, 1989)<br>\n<\/span><span style=\"color: #000000\">=&gt; Introduction to Algorithms, Cormen, Leiserson, Rivest. MIT Press, Cambridge, Massachusetts, 1996.<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Algoritmos e estruturas de dados III Ensino Remoto Emergencial 3 : ERE 3 2021 P\u00e1gina com informa\u00e7\u00f5es gerais da disciplina: ementa, datas das provas, bibliografia, exerc\u00edcios, etc. AVISOS ================================ =&gt; Resultados dispon\u00edveis. =&gt; Especifica\u00e7\u00f5es do trabalho 1 e do trabalho 2 dispon\u00edveis. =&gt; Locais dos encontros virtuais: https:\/\/bbb.c3sl.ufpr.br\/b\/mar-d3c-kdz&nbsp; =&gt; Est\u00e3o acesss\u00edveis no GitHub um conjunto&hellip;<\/p>\n","protected":false},"author":21,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1479","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/1479","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=1479"}],"version-history":[{"count":12,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/1479\/revisions"}],"predecessor-version":[{"id":1538,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/1479\/revisions\/1538"}],"wp:attachment":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/media?parent=1479"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}