{"id":62,"date":"2017-06-22T16:59:27","date_gmt":"2017-06-22T19:59:27","guid":{"rendered":"http:\/\/web.inf.ufpr.br\/didonet2\/?page_id=62"},"modified":"2017-07-05T18:10:53","modified_gmt":"2017-07-05T21:10:53","slug":"ci057-2017-1","status":"publish","type":"page","link":"https:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/ci057-2017-1\/","title":{"rendered":"CI057 2017 1"},"content":{"rendered":"<div id=\"content-core\">\n<div id=\"parent-fieldname-text-6aa07d9263594f6d89069d1e6c7683bb\" class=\"\">\n<p>Algoritmos e estruturas de dados III &#8211; turma B<\/p>\n<p id=\"segundo-semestre-de-2010\" class=\"subtitle\"><b>Primeiro Semestre de 2017<\/b><\/p>\n<p>P\u00e1gina com informa\u00e7\u00f5es gerais da disciplina: ementa, datas das provas, bibliografia, exerc\u00edcios, etc.<\/p>\n<h3>Avisos<\/h3>\n<p><b>================================<\/b><\/p>\n<ul>\n<li><span style=\"font-size: 14pt\"><strong>Resultado final dispon\u00edvel <\/strong><\/span><a class=\"internal-link\" title=\"\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/ci057-2017-1\/resultados-ci057-2017-1\/\"><strong><span style=\"font-size: 14pt;color: #0000ff\"><strong>neste link<\/strong><\/span><\/strong><\/a><\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<ul>\n<li>Resultado do trabalho e da prova 2 dispon\u00edvel <a class=\"internal-link\" title=\"\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/ci057-2017-1\/resultados-ci057-2017-1\/\"><strong>neste link<\/strong><\/a><\/li>\n<li>12.05 : Alteradas as datas de entrega da prova (para dia 09\/06) e do trabalho (para dia 14\/06), ver abaixo.<\/li>\n<li>Exerc\u00edcios: entregar, individualmente e \u00e0 m\u00e3o, at\u00e9 dia 19\/05, no hor\u00e1rio da aula. Valor na nota = 10,0\n<ul>\n<li>Prova: 3, 4<\/li>\n<li>Lista 1: 11, 12<\/li>\n<li>Lista 2: 4, 7, 8, 12<\/li>\n<\/ul>\n<\/li>\n<li>Resultado da prova 1 dispon\u00edvel <a class=\"internal-link\" title=\"\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/ci057-2017-1\/resultados-ci057-2017-1\/\"><strong>neste link<\/strong><\/a><\/li>\n<li>Especifica\u00e7\u00e3o do trabalho <a class=\"internal-link\" title=\"\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/ci057-2017-1\/trabalho-ci057-2017-1\/\">dispon\u00edvel neste link<\/a>.<\/li>\n<li>No dia 15\/03 (quarta) n\u00e3o haver\u00e1 aula.<\/li>\n<\/ul>\n<p><b>================================<\/b><\/p>\n<h3><b>Material de aula <\/b><\/h3>\n<ul>\n<li><a class=\"internal-link\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/exercicios-bst\/\">1 &#8211; Exerc\u00edcios (\u00e1rvores BST, AVL, 2-3-4, B, RB)<\/a><\/li>\n<li><a class=\"internal-link\" href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/exercicios-rbt\/\">2 &#8211; Exerc\u00edcios (BST, AVL, 2-3-4, RB)<\/a><\/li>\n<li><a href=\"http:\/\/web.inf.ufpr.br\/didonet\/teaching-disciplinas\/exerciciosthh\/\">3 &#8211; Exerc\u00edcios Trie, Heap, Hash<\/a><\/li>\n<\/ul>\n<p><a class=\"external-link\" title=\"\" href=\"http:\/\/www.cs.usfca.edu\/%7Egalles\/visualization\/Algorithms.html\" target=\"_self\">\u00a0Site com simula\u00e7\u00e3o <\/a>de cria\u00e7\u00e3o de diferentes tipos de estruturas de dados (Universidade de S\u00e3o Francisco, EUA)<\/p>\n<p><b>Hor\u00e1rio <\/b><\/p>\n<ul>\n<li style=\"list-style-type: none\">\n<ul>\n<li><b>Quartas<\/b>: 15:30h &#8211; sala &#8211; PA 01<\/li>\n<\/ul>\n<ul>\n<li><b>Sextas<\/b>: 15:30h &#8211; sala &#8211; PA 01<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<p><b>Datas<\/b><b><br \/>\n<\/b><\/p>\n<ul>\n<li style=\"list-style-type: none\">\n<ul>\n<li><b>Trabalho\u00a01: 09<\/b>.jun.2017<strong> (alterado para dia 14\/06)<\/strong><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<ul>\n<li style=\"list-style-type: none\">\n<ul>\n<li><b>Prova 1 <\/b>: 26.abril.2017<\/li>\n<\/ul>\n<ul>\n<li><b>Prova 2 <\/b>: 21.junho.2017 <strong>(alterado para dia 09\/06)<\/strong><\/li>\n<\/ul>\n<ul>\n<li><b>Final <\/b>: 05.julho.2017<\/li>\n<\/ul>\n<ul>\n<li><b>Segunda chamada e reaproveitamento<\/b>:\u00a0 05.julho.2017<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<h3><b>Avalia\u00e7\u00e3o<\/b><\/h3>\n<ul>\n<li>Duas provas e 1 trabalho (ver datas acima).<\/li>\n<li>C\u00e1lculo da M\u00e9dia Parcial: trabalho*0.30+\u00a0 prova1*0.35 + prova2*0.35<\/li>\n<li>C\u00e1lculo da m\u00e9dia final:\n<ul>\n<li>igual \u00e0 m\u00e9dia parcial, se esta \u00e9 igual ou superior a 7.0 ou inferior a 4.0,<\/li>\n<li>m\u00e9dia aritm\u00e9tica entre a m\u00e9dia parcial e a nota no exame final, caso contr\u00e1rio.<\/li>\n<li>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.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<h3><b>Bibliografia<\/b><\/h3>\n<ul>\n<li>Algoritmos &#8211; Teoria e pr\u00e1tica, Cormen, Leiserson, Rivest, Stein, Rio de Janeiro, Campus, 2002<\/li>\n<li>Projeto de algoritmos: com implementa\u00e7\u00f5es em Pascal e C. N\u00edvio Ziviani. S\u00e3o Paulo: Pioneira, 1999<\/li>\n<li>Algorithms in C. R. Sedgewick. Addison-Wesley, Reading, Massachusetts, 1998.<\/li>\n<li>Estruturas de Dados e seus Algoritmos. J.L. Szwarcfiter, L. Markenzon. LTC-Livros T\u00e9cnicos e Cient\u00edficos, Rio de Janeiro, RJ, 1994.<\/li>\n<li>Data Structures and Algorithms. A.V. Aho, J.E. Hopcroft, J.D. Ullman. Addison-Wesley, Reading, Massachusetts, 1983.<\/li>\n<li>Algorithms and Data Structures. N. Wirth. Prentice-Hall, 1986 (Tradu\u00e7\u00e3o: Algoritmos e Estruturas de Dados. Prentice-Hall do Brasil Ltda, 1989)<\/li>\n<li>Introduction to Algorithms, Cormen, Leiserson, Rivest. MIT Press, Cambridge, Massachusetts, 1996.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Algoritmos e estruturas de dados III &#8211; turma B Primeiro Semestre de 2017 P\u00e1gina com informa\u00e7\u00f5es gerais da disciplina: ementa, datas das provas, bibliografia, exerc\u00edcios, etc. Avisos ================================ Resultado final dispon\u00edvel neste link &nbsp; Resultado do trabalho e da prova 2 dispon\u00edvel neste link 12.05 : Alteradas as datas de entrega da prova (para dia&hellip;<\/p>\n","protected":false},"author":21,"featured_media":0,"parent":31,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-62","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/62","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=62"}],"version-history":[{"count":15,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/62\/revisions"}],"predecessor-version":[{"id":211,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/62\/revisions\/211"}],"up":[{"embeddable":true,"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/pages\/31"}],"wp:attachment":[{"href":"https:\/\/web.inf.ufpr.br\/didonet\/wp-json\/wp\/v2\/media?parent=62"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}