{"id":16662248,"url":"https://github.com/arademaker/ed-2018.t2","last_synced_at":"2026-04-06T03:34:27.407Z","repository":{"id":66932301,"uuid":"136247406","full_name":"arademaker/ED-2018.T2","owner":"arademaker","description":"ED Course FGV/EMAp","archived":false,"fork":false,"pushed_at":"2018-06-12T21:31:55.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-19T14:48:40.165Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Racket","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/arademaker.png","metadata":{"files":{"readme":"README.org","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-06-05T23:50:43.000Z","updated_at":"2018-06-12T21:31:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"4d76a2a7-2a28-4310-85b5-cac922905b32","html_url":"https://github.com/arademaker/ED-2018.T2","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arademaker%2FED-2018.T2","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arademaker%2FED-2018.T2/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arademaker%2FED-2018.T2/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/arademaker%2FED-2018.T2/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/arademaker","download_url":"https://codeload.github.com/arademaker/ED-2018.T2/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243300891,"owners_count":20269260,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-12T10:37:24.213Z","updated_at":"2025-12-29T03:58:01.569Z","avatar_url":"https://github.com/arademaker.png","language":"Racket","funding_links":[],"categories":[],"sub_categories":[],"readme":"# -*- mode:org -*-\n#+TITLE: Algorithms and Data Structures @ EMAp/FGV\n\n- instructor :: Alexandre Rademaker\n\nthe course is mostly based on DPV (see references below). Code will be\nimplemented in [[https://racket-lang.org][Racket]].\n\n* references\n** books\n- DPV :: S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani,\n         Algorithms. 2006. [[http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf][url]]\n- KT :: J. Kleinberg and E. Tardos, Algorithm Design. 2005. [[https://www.pearsonhighered.com/program/Kleinberg-Algorithm-Design/PGM319216.html][url]]\n\n- SICP :: H. Abelson, G. J. Sussman, J. Sussman. Structure and\n          Interpretation of Computer Programs. 1996. [[https://mitpress.mit.edu/sites/default/files/sicp/index.html][url]]\n\n** Racket\n\n[[https://docs.racket-lang.org/getting-started/index.html][the Racket quickstart]]\n\nfollowing the Racket website advice in the link above, pick the\nreferences you want to study from how confortable you are learning a\nnew programming language, and how much time you have to devote to it.\n\ntry to get up to speed with Racket in the first couple of weeks -- you\nwill probably be much busier later on.\n\nif you already know a lisp language, check out this [[http://hyperpolyglot.org/lisp][sheet]].\n\n* plan\n| week | topic                           | contents                                                                                               |\n|------+---------------------------------+--------------------------------------------------------------------------------------------------------|\n|    1 | Introduction and Big O notation | Fibonacci examples, recursions, complexity, arrays versus linked lists, data structures and algorithms |\n|    2 | the Racket programming language | Programming pearls, SICP, stable matching                                                              |\n|    3 | Divide and conquer              |                                                                                                        |\n|    4 | Graphs                          |                                                                                                        |\n|    5 | Graphs                          |                                                                                                        |\n|    6 | A1                              |                                                                                                        |\n|    7 | Greedy algorithms               |                                                                                                        |\n|    8 | Dynamic programming             |                                                                                                        |\n|    9 | Linear programming              |                                                                                                        |\n|   10 | NP and its reductions           |                                                                                                        |\n|   11 | Coping with NP                  |                                                                                                        |\n|   12 | Quantum computing               |                                                                                                        |\n|   13 | A2                              |                                                                                                        |\n\n*note*: the plan is under development, expect more details soon.\n\n* grading\nthe grade is composed of class exercises (30%), and two major\nevaluations (35% each).\n\n** exercises\ncheck the exercises directory.\n\n** P1\ndetails to come.\n\n** P2\ndetails to come.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farademaker%2Fed-2018.t2","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Farademaker%2Fed-2018.t2","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Farademaker%2Fed-2018.t2/lists"}