edvujic Goto Github PK

elevator-simulation-multithreading

The Elevator Simulation Project demonstrates the workings of a multi-elevator system in a building using Java. It showcases concurrency principles by managing elevator movement and passenger interactions, offering insights into real-world elevator operations.

gold-hunter-game

Gold Collection Game: Players race to gather gold on a dynamic mxn-sized board, each with distinct traits shaping their strategy.

hacker-rank-cpp-solutions

HackerRank is a place where programmers from all over the world come together to solve problems in a wide range of Computer Science domains such as algorithms, machine learning, or artificial intelligence, as well as to practice different programming paradigms like functional programming. Here are my solutions on tackling the C++ course assignments.

hackerrank-linux-shell-assignments

Hackerrank Solutions to Linux Shell Problems

incu2022

kodluyoruz-cs50-mysolutions

Introduction to Computer Science (CS50x) as given by Prof. David J. Malan at Harvard University. Here are my takes on trying to conquer the weekly tasks.

lz77-deflate-compression

DEFLATE combines the LZ77 algorithm and Huffman Coding to achieve high compression ratios. This project is designed to be a straightforward and practical resource for anyone looking to understand or utilize DEFLATE compression in their applications.

math-foundation-for-robots-homeworks

maze-q-learning-game

In this initiative, we integrate the principles of Reinforcement Learning with the robust Q Learning Algorithm to craft a solution that directs an autonomous agent through a labyrinthine maze. The aim is to optimize the agent's pathfinding abilities, allowing it to reach its target with precision and intelligence.

mobile-queries-for-taxis

project added

neetcodesolutions

point-manipulation-and-error-detection

This project provides tools for analyzing collections of 3D point data, enabling the identification of key spatial features such as closest point pairs and bounding volumes. It offers an interactive user experience to perform calculations and extract meaningful insights from point cloud datasets.

prolabii-travelling-salesman

The aim of Traveling Salesman Problem is to help a salesman to find the shortest route for a round trip by visiting every city only once. As this problem is a impossible to solve in polynomial time, it is classified as NP (Non-Polynomial problem). The problem in this project is identified by applying Travelling Salesman Problem. It can be used as an example for a shipping company to create its transport network with the lowest cost and can also be used for internet network traffic protocol problems. It is aimed to solve a problem with understanding the data structures and models, using graph structures and algorithm logic by the project doer. NOTE: This is not the real TSP, this is a version in which the visited node (city) can be visited again.

simple-java-maven-app

For an introductory tutorial on how to use Jenkins to build a simple Java application with Maven.

webex-js-sdk

JavaScript SDK for Webex