algorithms_and_data_structures

KO | EN

gitlite — search

#javascript #python #hacktoberfest #ai #llm #golang #macos #nodejs #java #kubernetes #security #openai #ios #open-source

algorithms_and_data_structures

(★ 14)

No description available.

algorithms_and_data_structures 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Algorithms and Data Structures

## Content

* [Description](#description)
* [Learning Outcomes](#learning-outcomes)
* [Assignments](#assignments)
* [Contacts](#contacts)
* [Delivery of the Learning Module](#delivery-of-the-learning-module)
* [Schedule](#schedule)
* [Requirements](#requirements)
* [Resources](#resources)
  + [Textbooks](#textbooks)
  + [Documents](#documents)
  + [Videos](#videos)
  + [How to get help](#how-to-get-help)
* [Folder Structure](#folder-structure)
* [Acknowledgement](#acknowledgement)

## Description

An understanding of algorithms and data structures will aid the implementation of data science or machine learning methods in practice. Machine learning emphasizes prediction, scalability, and autonomy. Understanding algorithms and data structures is essential to the latter two aims of ML. Participants will be able to describe how algorithms will perform when scaled or find practical methods for computers to solve problems autonomously. Industry often requires knowledge of algorithms and data structures and the ability to communicate the solving process. This module will provide the knowledge and terminology necessary to succeed in these situations.

The module will introduce participants to terminology to discuss algorithms. This includes Big-O notation, time and space complexity. The next section will explore array-based data structures, searching, and sorting. Participants should be able to justify algorithm or data structure choices based on time and space complexity analysis. Then, participants will be introduced to recursion. We will solve problems using recursion and implement data structures that are best understood from a recursive perspective. Participants will justify their design choices. The last portion of the module will be dedicated to solving optimization problems quickly. Participants will be introduced to a variety of techniques to solve problems and identify when and how a solution can be optimized.

## Learning Outcomes

By the end of the module, participants will be able to:

1. Assess options and choices around fundamental algorithms and data structures using Big-O notation.
2. Use recursive functions.
3. Select appropriate data structures.
4. Translate a client-led problem into an optimization problem.
5. Identify why code is running slowly to improve its performance.

## Contacts

**Questions can be submitted to the _#mlf1-help_ channel on Slack**

* Technical Facilitator: **{Fred Song}**. Messages to the Technical Facilitator can be sent on Slack.
* Learning Support Staff: **{Tiyani and E.Fantinatti}**. Messages to the Learning Support Staff can be sent on Slack.

## Delivery of the Learning Module

This module will include live learning sessions and optional, asynchronous work periods. During live learning sessions, the Technical Facilitator will introduce and explain key concepts and demonstrate core skills. Learning is facilitated during this time. Before and after each live learning session, the instructional team will be available for questions related to the core concepts of the module. The Technical Facilitator will introduce concepts through a collaborative live coding session using the Python notebooks found under `/01_materials/slides`. The Technical Facilitator will also upload live coding files to this repository for participants to revisit under `./04_this_cohort/live_code`.

Optional work periods are to be used to seek help from peers, the Learning Support team, and to work through the homework and assignments in the learning module, with access to live help. Content is not facilitated, but rather this time should be driven by participants. We encourage participants to come to these work periods with questions and problems to work through.
 
Participants are encouraged to engage actively during the learning module. The key to developing the core skills in each learning module is through practice. The more participants engage in coding along with the instructional team, and applying the skills in each module, the more likely it is that these skills will solidify.

## Schedule

| Live Learning Session | Topic                                   | Resources                                             |
| --------------------- | --------------------------------------- | ----------------------------------------------------- |
| 1                     | Motivation and Big-O Notation           | [Slides](./01_materials/slides/1_motivation_big_o.ipynb) |
| 2                     | Data Structures, Sorting, and Searching | [Slides](./01_materials/slides/2_ds_search_sort.ipynb)   |
| 3                     | Recursion                               | [Slides](./01_materials/slides/3_recursion.ipynb)        |
| 4                     | Recursive Data Structures               | [Slides](./01_materials/slides/4_recursive_ds.ipynb)     |
| 5                     | Slow Code                               | [Slides](./01_materials/slides/5_slow_code.ipynb)        |
| 6                     | Case Study                              | -                                                     |

## Requirements

* Participants are expected to have completed Shell, Git, and Python learning modules.
* Participants are encouraged to ask questions, and collaborate with others to enhance learning.
* Participants must have a computer and an internet connection to participate in online activities.
* Participants must not use generative AI such as ChatGPT to generate code in order to complete assignments. It should be used as a supportive tool to seek out answers to questions you may have.
* We expect participants to have completed the instructions mentioned in the [onboarding repo](https://github.com/UofT-DSI/onboarding/blob/main/environment_setup/README.md).
* We encourage participants to default to having their camera on at all times, and turning the camera off only as needed. This will greatly enhance the learning experience for all participants and provides real-time feedback for the instructional team.
* Participants must have VSCode installed with the following extensions:
  * [Jupyter](https://marketplace.visualstudio.com/items?itemName=ms-toolsai.jupyter)
  * [Python](https://marketplace.visualstudio.com/items?itemName=ms-python.python)

## Assignments

Participants should review the [Assignment Submission Guide](https://github.com/UofT-DSI/onboarding/blob/main/onboarding_documents/submissions.md) for instructions on how to complete assignments in this module.

| Assessment                                                  | Description         | Due Date                        |
| ----------------------------------------------------------- | ------------------- | ------------------------------- |
| [Assignment 1](./02_activities/assignments/assignment_1.ipynb) | DSA coding practice | Monday, June 22 2026 (11:59pm) |
| [Assignment 2](./02_activities/assignments/assignment_2.ipynb) | Mock interview      | Monday, June 29 2026 (11:59pm) |

## Resources

Feel free to use the following as resources:

### Concept Map

![data_structures_and_algorithms_concept_map.png](https://github.com/UofT-DSI/algorithms_and_data_structures/blob/main/data_structures_and_algorithms_concept_map.png)

### Textbooks

The course content, slides, and recommended problems follow these two textbooks. They are freely available online after a quick Google search.

* Bhargava, A. Y. (2016). *Grokking algorithms: An illustrated guide for programmers and other curious people.* Manning. ([link](https://www.manning.com/books/grokking-algorithms-second-edition))
  * This textbook is easy to understand and very accessible. We will go deeper than this text.
* Cormen, T. H. (Ed.). (2009). *Introduction to algorithms (3rd ed).* MIT Press.
  * We won't cover the majority of this textbook. Many topics are too advanced and it goes into a lot of detail.

### Documents

- [Big O Cheatsheet](https://www.bigocheatsheet.com/)
- [Sorting Cheatsheet](https://www.interviewcake.com/sorting-algorithm-cheat-sheet)
- [Visual Go - Graph Traversal](https://visualgo.net/en/dfsbfs?slide=2)
- [Codecademy Explanation](https://www.codecademy.com/article/tree-traversal)

### Videos

- [15 Sorting Algorithms in 6 minutes](https://www.youtube.com/watch?v=kPRA0W1kECg) (Warning: This video could cause seizures for people with photosensitive epilepsy)
- [Big O Notation](https://www.youtube.com/watch?v=g2o22C3CRfU)
- [Breadth-first Search in 4 minutes](https://www.youtube.com/watch?v=HZ5YTanv5QE)
- [Depth-first Search in 4 minutes](https://www.youtube.com/watch?v=Urx87-NMm6c)
- [Nearest Neighbour Algorithm](https://www.youtube.com/watch?v=zPgsNsOfxQ8)
- [K-d Trees](https://www.youtube.com/watch?v=Glp7THUpGow)
- [Sorting Playlist](https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl)

### How to Get Help

#### 1. Gather information about your problem

- Copy and paste your error message
- Copy and paste the code that caused the error, and the last few commands leading up to the error
- Write down what you are trying to accomplish with your code. Include both the specific action, and the bigger picture and context
- (optional) Take a screenshot of your entire workspace

#### 2. Try searching the web for your error message

- Sometimes, the error has common solutions that can be easy to find!
  - This will be faster than waiting for an answer
- If none of the solutions apply, consider asking a Generative AI tool
  - Paste your code, the error message, and a description of your overall goals

#### 3. Try asking in your cohort's Slack help channel

- Since we're all working through the same material, there's a good chance one of your peers has encountered the same error, or has already solved it
- Try searching in the DSI Microcredentials Slack help channel for whether a similar query has been posted
- If the question has not yet been answered, post your question!
  - Describe your overall goals, the context, and the specific details of what you were trying to accomplish
  - Make sure to **copy and paste** your code, your error message
  - Copying and pasting helps:
    1. Your peers and teaching team quickly try out your code
    2. Others to find your question in the future

#### Great resources on how to ask good technical questions that get useful answers

- [Asking for Help - The Odin Project](https://www.theodinproject.com/lessons/foundations-asking-for-help)
- [How do I ask a good question? - Stack Overflow](https://stackoverflow.com/help/how-to-ask)
- [The XY problem: A question pitfall that won&#39;t get useful answers](https://xyproblem.info/)
- [How to create a minimal reproducible example](https://stackoverflow.com/help/minimal-reproducible-example)

<hr>

## Folder Structure

```markdown
.
├── .github
├── 01_materials
├── 02_activities
├── 03_instructional_team
├── 04_this_cohort
├── .gitignore
├── LICENSE
├── SETUP.md
├── pyproject.toml
└── README.md
```

* **.github**: Contains issue templates and pull request templates for the repository.
* **materials**: Module slides and interactive notebooks (.ipynb files) used during learning sessions.
* **activities**: Contains graded assignments, exercises, and homework to practice concepts covered in the learning module.
* **instructional_team**: Resources for the instructional team.
* **this_cohort**: Additional materials and resources for the current cohort.
* **.gitignore**: Files to exclude from this folder, specified by the Technical Facilitator
* **LICENSE**: The license for this repository.
* **SETUP.md**: Contains the steps required to set up this repo for the module.
* **pyproject.toml**: Tells Python which packages this repo needs to run.
* **README.md**: This file.

algorithms_and_data_structures

algorithms_and_data_structures 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

algorithms_and_data_structures

algorithms_and_data_structures 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README