Highlights
- Pro
Block or Report
Block or report KeremTAN
Contact GitHub support about this user’s behavior. Learn more about reporting abuse.
Report abuse-
-
Learn-OpenGL Public
The aim of this project is to study how 3D computations and linear algebra are implemented in computer science with the OpenGL library.
-
This project has been carried out with the aim of observing and examining the object production performances of creational design patterns.
-
-
LeetcodeChallenge Public
LeetCode is a platform like HackerRank which to solve algorithms. The purpose of this repo is to regularly keep the algorithms solved on the LeetCode platform.
-
Compiler-Lecture Public
The aim of this repository is to keep the applications in the books which I've been studying on about the field of compilers while I trying to improve myself. Since this repository is related to th…
-
Logger Public
A logging class will be designed in this repository that can control the number of log files and the frequency of their occurrence.
-
Java-Spring Public
This repository has basic information about Spring Framework and a sample application made with Spring Boot.
-
CarFactory Public
This is a fictional system software which runs on console. This system is designed to understand the uses of Template Method and Iterator Design Patterns.
-
WellsHellGame Public
This is a demo game running on console. This game is designed to understand the uses of Strategy and Simple Factory Design Patterns.
-
jsoncpp Public
Forked from open-source-parsers/jsoncppA C++ library for interacting with JSON.
-
-
TodoAPP Public
This is an back-end application with is designed NodeJS
-
TanExchangeSystem Public
This project is a toy software under development. Its purpose is to make a riddle for understanding the design patterns (for example, which software principles were violated in the project or which…
-
-
-
-
-
-
-
-
-
-
-
-
-
-
ColoringMapAlgorithm-CSP- Public
Graphical Coloring of Countries with Condition Satisfaction Algorithm.
-
UniformCostSearch-UCS- Public
Calculating the shortest path between two nodes with the Uniform Cost Search algorithm.
-