Week 08 - 100 Days of Code
This is my eighth week doing the #100DaysOfCode challenge. I’ve gone over half the 100 days and feel like I’ve improved a lot as a developer in many ways.
If you want to read about what I did last week, see here: “Week 07 - 100 Days of Code” .
Day 50 - I read “VIM and Python – A Match Made in Heaven”.
Day 51 - I learned about Sweet Alert 2 of JavaScript.
Day 52 - I taught a little Python and Pandas to my sister-in-law.
Day 53 - I studied: Computer Theory (“Languages and Grammar” and “Regular Grammar”) and Design and Analysis of Algorithms (“Algorithms”, “Elementary Operations” and “Growth Order”) and I did my homework of the English course.
Day 54 - I studied a bit about Django Templates, but I still want to understand more about it.
Day 55 - I studied about Clique, an NP-hard problem.
Day 56 - I studied about Clique again, an NP-hard problem. And I had two University’s works to do and they are gave me hard work.
Content links:
- VIM and Python – A Match Made in Heaven: https://realpython.com/vim-and-python-a-match-made-in-heaven/
- Sweet Alert 2: https://sweetalert2.github.io/
- validate a field before ajax request: https://github.com/sweetalert2/sweetalert2/issues/118
- Migration from SweetAlert to SweetAlert2: https://github.com/sweetalert2/sweetalert2/wiki/Migration-from-SweetAlert-to-SweetAlert2
- Computer Theory: MENEZES, Paulo B. Linguagens Formais e Autômatos. 6a Ed. Porto Alegre: Bookman, 2010.
- Design and Analysis of Algorithms: Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C., 2009. Introduction to algorithms. MIT press.
- Dynamic data in templates: https://tutorial.djangogirls.org/en/dynamic_data_in_templates/
- Django templates: https://tutorial.djangogirls.org/en/django_templates/
- Django Templates: https://djangobook.com/django-templates/
- Clique: https://pt.wikipedia.org/wiki/Clique
- Problema do clique: https://pt.wikipedia.org/wiki/Problema_do_clique
- Estruturas de vizinhança e procura local no problema da clique máxima: Cavique, L., Rego, C. and Themido, I., 2002. Estruturas de vizinhança e procura local no problema da clique máxima. Investigação Operacional, 22, pp.1-18.