BSI-UFRPE - 14343 -Computing Fundamentals II

por Jones Albuquerque

schedule and slides and ...

 
   https://academic.oup.com/plms/article-abstract/s2-42/1/230/1491926?redirectedFrom=fulltext
   https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf

• Scores

SCORES & REPOSITORIES

     2020-1 (soon)

• Join us

     Social Network
     WhatsApp Group: https://chat.whatsapp.com/IwadpGHm5wIBQFpX96E1jz 

     What else?

• Textbooks

      Official Contents (portuguese)

UNIDADE I: Grafos

1. Problemas Clássicos. 2. Algoritmos em Grafos 3. Estruturas de dados como casos particulares de Grafos

UNIDADE II: Problemas Computacionais

1. Decisão. 2. Busca. 3. Otimização.  4. Grafos e outras estruturas de dados como casos particulares de Grafos

UNIDADE III: Análise Combinatória

1. Problemas Clássicos 2. Algoritmos Ótimos 3. Problemas em Grafos e outras estruturas de dados como casos particulares de Grafos

UNIDADE IIV: Metaheurísticas

1. Problemas Clássicos 2. Algoritmos ótimos versus heurísticas 3.Implementações em Grafos

     Textbooks

• https://www.cambridge.org/core/books/complex-networks/28CD0DEDDE059235DD889655727A2BBA#fndtn-information

• 1. CORMEN, Thomas H. Algoritmos: teoria e prática. Rio de Janeiro: Campus, 2002. xvii, 916p. ISBN 8535209263.
  2. MANBER, Udi. Introduction to algorithms: a creative approach. Reading, Mass.: Addison Wesley, c 1989. xiv, 478 p. ISBN 0201120372.
  3. BOAVENTURA NETTO, Paulo Oswaldo. Grafos: teoria, modelos, algoritmos. 4. ed. rev. ampl. São Paulo, SP: Edgard Blücher, 2006. xiv, 313 p. ISBN 8521203918.
  
  Complementary books
  1. JUNGNICKEL, Dieter. Graphs, networks and algorithms. 4. ed. New York: Springer, 2013. xv (Algorithms and computation in mathematics v.5). ISBN 9783642322778.
  2. DROZDEK, Adam. Estrutura de dados e algoritmos em C++. São Paulo: Cengage Learning, 2008. xviii, 579 p. ISBN 8522102593.
  3. ZIVIANI, Nivio. Projeto de algoritmos: com implementações em Java e C++. São Paulo: Thomson Learning, 2007. xx, 621 p. ISBN 8522105251.
  4. FORBELLONE, André Luiz Villar; EBERSPÄCHER, Henri Frederico. Lógica de programação: a construção de algoritmos e estrutura de dados. 3. ed. São Paulo: Prentice-Hall, 2005. xii, 218 p. ISBN 8534611246.
  5. SEDGEWICK, Robert; FLAJOLET, Philippe. An introduction to the analysis of algorithms. Reading, Mass.: Addison-Wesley, 1996. xv, 492 p. ISBN 020140009X.

• Class schedule

"PLE" PANDEMIC
A.C. EDITION using COURSERA

You have to do one of these options:

1.  TO DO these (5+6) weeks courses: 
   Introduction to Graph Theory at the University of California San Diego (https://www.coursera.org/learn/graphs)
   AND 
   Algorithms, Part II at Princeton University (https://www.coursera.org/learn/algorithms-part2)
   
   
2. TO DO this 9 weeks course:
     Analysis of Algorithms at Princeton University (https://www.coursera.org/learn/analysis-of-algorithms)

OBS.: if you need to improve your programming skills: Algorithmic Toolbox at the University of California San Diego (https://www.coursera.org/learn/algorithmic-toolbox)

and schedule an interview with the professor to validate your knowledge. You have to present your certificate and the exercises you did in a Google Drive link.

TIP: Como usar a câmera do cellular para traduções em tempo real - https://olhardigital.com.br/dicas_e_tutoriais/noticia/como-fazer-traducoes-com-a-camera-do-celular-usando-o-google-tradutor/87889

Doing this, you will have 100% of the score! Enjoy!


B.C. EDITION
 

class	date	topic	homework
4	05.mar.2020	KoeningsbergBridge - Problem http://mathworld.wolfram.com/KoenigsbergBridgeProblem.html	How to solve this problem? SCORE 1 - Put your solution on your GitHub for the discipline and put your github link on whatsapp group
8	11.mar.2020		https://jonesalbuquerque.blogspot.com/2019/03/o-que-e-excelencia.html
12	12.mar.2020	On Computable Numbers by Alan Turing: https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf Seven Konigsberg Bridges - Solution https://www.phymath.com/Physics%20Articles/2018/Konigsberg/Konigsberg%20bridges.php Applications: https://www.sciencedirect.com/topics/neuroscience/graph-theory	How to solve this problem? Eulerian path on Graphs! SCORE 2 - Formalize your solution using the Part IV - Graph Algorithms - Chapters 23 to 27 of Thomas Cormen´s book: http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/toc.htm Put your solution on your GitHub, DEADLINE: 18.mar.2020 23:59:59
16	19.mar.2020	SCORE 3 - Discussion and evaluation about the solutions
20
24
28
32
36
40
44
48
52
56
60
64
68
72
76
78
80	31.jul.2020	"Ultimo DIA para entrega FINAL" by http://www.ufrpe.br/sites/www.ufrpe.br/files/CALEND%C3%81RIO%20ACAD%C3%8AMICO%20UFRPE%202020_0.pdf

• 
  SCORES

1VA: SCORES 1-5 individual activities. 

2VA: SCORES 6-12 individual actvities. 

The last activity will be on the lastest day for SIG@UFRPE (Final scores).
                      extra bonus: when you do excepcional tasks