Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/nicolasgasco/42_cursus
All the projects done while being a student of 42Urduliz, Bilbao.
https://github.com/nicolasgasco/42_cursus
2d 3d 42 42cursus 42projects 42urduliz algorithms asm c cpp docker docker-compose nasm-assembly nestjs react typescript-react unix virtualization
Last synced: about 4 hours ago
JSON representation
All the projects done while being a student of 42Urduliz, Bilbao.
- Host: GitHub
- URL: https://github.com/nicolasgasco/42_cursus
- Owner: nicolasgasco
- Created: 2021-05-24T17:31:52.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2024-10-15T21:20:13.000Z (about 1 month ago)
- Last Synced: 2024-10-17T09:04:27.021Z (29 days ago)
- Topics: 2d, 3d, 42, 42cursus, 42projects, 42urduliz, algorithms, asm, c, cpp, docker, docker-compose, nasm-assembly, nestjs, react, typescript-react, unix, virtualization
- Language: C++
- Homepage: https://multilayer-perceptron-visualizer.vercel.app
- Size: 145 MB
- Stars: 29
- Watchers: 2
- Forks: 6
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 42 Cursus
---
⚠️ Don't copy from this repository. I'm not that good and it's against the spirit of 42. Ask your classmates for help. I only created this repository to keep track of my progress. ⚠️---
## Outer Core
The _Outer Core_ (elective module) projects I completed after completing the _Common Core_ at 42Urduliz in Bilbao, Spain.|Name|Language|End date|Description|Estimated effort (h)|Validated|
|----|--------|--------|-----------|----------|---------|
|**[multilayer_perceptron](https://github.com/nicolasgasco/42_cursus/tree/master/27_multilayer_perceptron)**|Python|-| Use a neuronal network to predict whether a cancer is malignant or benign.|98|❌|
|**[dslr](https://github.com/nicolasgasco/42_cursus/tree/master/26_dslr)**|Python|July 2024| Create an Harry Potter Sorting Hat algorithm implementing a linear classification model.|98|✅|
|**[ft_linear_regression](https://github.com/nicolasgasco/42_cursus/tree/master/25_ft_linear_regression)**|Python|June 2024| Predict the price of a car by using a linear function train with a gradient descent algorithm.|70|✅|
|**[piscine_data_science](https://github.com/nicolasgasco/42_cursus/tree/master/24_piscine_data_science)**|Python|March 2024| Data Science fundamentals.|35|❌|
|**[piscine_python_data_science](https://github.com/nicolasgasco/42_cursus/tree/master/23_piscine_python)**|Python|March 2024| Python fundamentals for Data Science.|35|❌|
|**[ft_libasm](https://github.com/nicolasgasco/42_cursus/tree/master/22_libasm)**|x86_64 assembly|February 2024| Create a small library of x86_64 NASM functions.|70|❌|## Common Core
The _Common Core_ (compulsory module) projects I completed while being a student at 42Urduliz campus in Bilbao, Spain.|Name|Language|End date|Description|Estimated effort (h)|
|----|--------|--------|-----------|----------|
|**[ft_transcendence 🕹️🌐](https://github.com/iker-gonzalez/ft_transcendence)**|NestJs + TypeScript React|December 2023| Create an oline multiplayer Pong game with chat functionality.|275|
|**[webserv 🌐](https://github.com/nicolasgasco/42_webserv)**|C++/Python/HTML+CSS|June 2023| Write your own HTTP server than can be tested with an actual browser|175|
|**[~~ft_containers~~](https://github.com/nicolasgasco/42_cursus/tree/master/18_ft_containers)**|~~C++~~|Removed from Cursus|~~Reimplement `vector`, `map`, and `stack` containers from the STL.~~|~~210~~|
|**[inception 🐳](https://github.com/nicolasgasco/42_cursus/tree/master/17_inception)**|Docker|November 2022|Set up a small infrastructure composed of different services under specific rules using Docker.|210|
|**[cpp_modules](https://github.com/nicolasgasco/42_cursus/tree/master/15_cpp_modules)**|C++|June 2023|10 "mini" projects to learn the basics of C++ (98 standard 👴) with a strong focus on OOP|~10 days|
|**[cube3D 🕹️](https://github.com/nicolasgasco/42_cub3d/tree/44910b304e52fb3db0bb541efd611a30d0dd54e1)**|C|August 2022|Wolfenstein-inspired minigame using raycasting to fake a tridimensional view. Group project done in a [separate repository](https://github.com/nicolasgasco/42_cub3d) with [@isolinis](https://github.com/isolinis)|280|
|**[net_practice](https://github.com/nicolasgasco/42_cursus/tree/master/12_net_practice)**|Unix|April 2022|Configure small-scale networks to learn how networking and subnetting work|50|
|**[minishell](https://github.com/nicolasgasco/42_minishell/tree/f35fe8834f99547ef71ac62f8b087f9a125796ae)**|C|February 2022|Recreate a small Bash-inspired shell for UNIX. Group project done [in a separate repository](https://github.com/nicolasgasco/42_minishell) with [@adelcor](https://github.com/adelcor)|210|
|**[philosophers](https://github.com/nicolasgasco/42_cursus/tree/master/10_philosophers)**|C|December 2021|42's take on the classic [Dining philosophers problem](https://en.wikipedia.org/wiki/Dining_philosophers_problem) using threads and mutexes.|70|
|**[push_swap](https://github.com/nicolasgasco/42_cursus/tree/master/08_push_swap)**|C|November 2021|Given an array of random integers, two stacks, and a limited set of moves (e.g. rotate entire stack up or down), write to the console the smallest number of instructions required to sort the array.|60|
|**[minitalk](https://github.com/nicolasgasco/42_cursus/tree/master/07_minitalk)**|C|October 2021|Code a small data exchange program using UNIX signals (`SIGUSR1` and `SIGUSR2`) and bitwise operations. A string is passed as parameter to the client, converted into binary, and sent to the server in form of signals (either `0` or `1`), where the string is reconstructed and outputted.|50|
|**[so_long 🕹️](https://github.com/nicolasgasco/42_cursus/tree/master/05_so_long)**|C|October 2021|Create a small 2D game using the miniLibX API. Goal of the game is leaving the map in the shortest amount of moves after collecting all objects.|60|
|**[ft_printf](https://github.com/nicolasgasco/42_cursus/tree/master/04_ft_printf)**|C|September 2021|Reproduce basic functioning of `prinft` function (flags implemented: `%c`, `%s`, `%i`, `%d`, `%u`, `%x`, `%X`, `%p`, `%%`)|70|
|**[get_next_line](https://github.com/nicolasgasco/42_cursus/tree/master/03_get_next_line)**|C|August 2021|Write a function which returns a line read from a file descriptor (bonus: multiple file descriptors without losing the reading thread on each of them)|70|
|**[born2beroot](https://github.com/nicolasgasco/42_cursus/tree/master/02_born2beroot)**|Unix|August 2021|Create a virtual machine under specific instructions. Setting a minimal Debian server implementing strict rules, e.g. strong password policy, UFW firewall, SSH, etc. In the repo there's only a Bash script that had to be broadcasted to all users every 10 minutes using crontab and wall|40|
|**[libft](https://github.com/nicolasgasco/42_cursus/tree/master/01_libft)**|C|July 2021|Re-code useful C functions like `split` or `join` using only `malloc`, `free`, and `write`|70|