le-mountassir/Minishell

Stars
1
Language
C
Created almost 3 years ago
Updated almost 2 years ago

le-mountassir/Minishell

le-mountassir

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Minishell is the project that will allow us to travel through time back when communicating with a computer was possible only by using 1/0 switches, it was really irritating so in this project, we will create our own piece of software that will allow us to communicate with a computer using interactive lines of commands in a language close to the human language. the project is basically about building your own Shell from scratch

Linux-server-Monitoring-script

this is a small shell script that will display some very useful information about your Linux server

Covid-19-data-for-Discord-Bots

a code that u can copy and paste to ur discord-bot to get Covid-19 daily data (embeds included)

ft_printf

In this project, we will recode the famous printf function using variadic arguments with some of the functions that we made in the first project Libft.

mountassir-007

Get_Next_Line

the idea of the project is that u need to create a function that reads one line from a file descriptor each time u call it until it reaches the EOF using static vars so u can preserve their previous value and start from where u finished in the next call.

problemset

problem-solving without using predefined functions

So_Long

the idea of the game is that u need to collect all the collectibles on the map before escaping, and while you are trying to escape u need to avoid any contact with the enemy patrols or you'll lose the game.

MiniTalk

The purpose of this project is to code a data exchange program in the form of a client and server using only 2 UNIX signals (SIGUSR1 & SIGUSR2) to communicate between, in this project u will learn how to use handle system signals using signal(), sigaction() and kill()...

Push_Swap

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

ENIGMA

Scherbius's enigma improved using C

The_Ultimate_Libft

Libft is my first school project, it's basically a C-library with highly useful functions, feel free to contribute and add ur own functions.

tt_transcendence

The-Dining-Philosophers-Problem

The Dining Philosopher Problem states that N philosophers seated around a circular table with one chopstick between each pair of philosophers. There is one chopstick between each philosopher. A philosopher may eat if he can pick up the two chopsticks adjacent to him. One chopstick may be picked up by any one of its adjacent followers but not both.