Data Science Student at National School of Computer Science and Applied Mathematics of Grenoble. Currently looking for an end of studies internship.
Made with:
During my last internship, I Worked on implementing an asset monitoring solution for Greenstruxure's microgrids.
Made with:
Projet "Genie Logiciel" project for Ensimag. Java implementation of a compiler for a hypothetical language supporting object-oriented paradigms (mostly a Java subset). Programming in Java and ANTLR language. Use of Trello, agile method for the project management and vscode and netbeans as working environments.
Made with:
With a classemate, we have programmed a video player using the threads of the POSIX THREAD LIBRARY. The solution combines several of these problems and respecting some constraints. The synchronizations was realized with monitors
Made with:
I have Implemented, with my classemate a a command interpreter, quite similar to shell unix. It supports : files redirections, background processes , and multiple pipes.
Made with:
With my classemate, we implemented a dynamic memory allocator, very similar to the similar to the implementation of malloc() in Linux (GNU libc). It uses in particular the same global management (small, medium and large size), similar thresholds and thresholds and similar algorithms (Buddy algorithms). The allocator can be used instead of the of the "real" malloc() for all processes, in simple cases. For testring we used : googletest library.
Made with:
In this project, we (within a team of 3) worked on the realization of the Gange application in order to put on sale the products of this company. We did all the work : from the analysis of the problem, to the design of the database and its translation into relational, and then the implementation of the application in JAVA using the graphical library Swing, giving a particular attention to the functionalities.
Made with:
Poo projects within a group, where we implemented conway's game life, schelling segregation model, boids model.
Made with:
Implementation of a program that finds the connected subgraphs of a given graph.