VildanHakanaj

article-slug

Just a little helper type working with slugs.

base_apperal_coming_soon

BinarySearchTree

Booking_system

This is the project for the internship at Trent University. I was asked to build a booking system and inventory for the Media studies department.

Calendar-Scheduler

This is a calendar scheduler is build in java and uses SQL to keep track of users schedules

CollectionOfDesigns

In this repo i will be storing all of the designs that i will build. Most of the design are taken from websites like https://collectui.com/ | https://www.behance.net/ etc. A full list of links to websites where i get the designs will be posted in the readme file along with credit to the designer.

HuffmanCoding

In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding and/or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".[1] The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols. Huffman's method can be efficiently implemented, finding a code in time linear to the number of input weights if these weights are sorted.[2] However, although optimal among methods encoding symbols separately, Huffman coding is not always optimal among all compression methods.

php-lorem

A simple package that helps you generate Lorem Ipsum

php-options

A simple way to interact with a php options array

VildanHakanaj/HuffmanCoding

In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding and/or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".[1] The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols. Huffman's method can be efficiently implemented, finding a code in time linear to the number of input weights if these weights are sorted.[2] However, although optimal among methods encoding symbols separately, Huffman coding is not always optimal among all compression methods.

VildanHakanaj/article-slug

Just a little helper type working with slugs.

VildanHakanaj/base_apperal_coming_soon

VildanHakanaj/BinarySearchTree

VildanHakanaj/Booking_system

This is the project for the internship at Trent University. I was asked to build a booking system and inventory for the Media studies department.

VildanHakanaj/Calendar-Scheduler

This is a calendar scheduler is build in java and uses SQL to keep track of users schedules

VildanHakanaj/CollectionOfDesigns

In this repo i will be storing all of the designs that i will build. Most of the design are taken from websites like https://collectui.com/ | https://www.behance.net/ etc. A full list of links to websites where i get the designs will be posted in the readme file along with credit to the designer.

VildanHakanaj/frontendmentor

This is a collection of front end mentor challenges.

VildanHakanaj/github-user-search-app

GitHub user search app

VildanHakanaj/GrahpAlgorithm

Representation of a subways system using graph algorithms.

VildanHakanaj/php-lorem

A simple package that helps you generate Lorem Ipsum

VildanHakanaj/php-options

A simple way to interact with a php options array

VildanHakanaj/ProcessSimulator

This Simulation captures how a CPU works.

VildanHakanaj/SchedulerSimulator

This program will simulate how the cpu schedulers work. It captures 4 different algorithms. 1. First Come First Serve. 2. Shortest Job First. 3. Shortest Job First With Premption. 4. Round Robin.

VildanHakanaj/Distribution

Assignments and labs for operating systems

VildanHakanaj/Distribution-

This Is writen in c# its show graphs for different distribution like poisson, normal etc. generates different random numbers and uses the distribution to show the graphs

VildanHakanaj/dotfiles

VildanHakanaj/full-stack-challenge

Testing the fork

VildanHakanaj/laravel-sluggable

An opinionated package to create slugs for Eloquent models

VildanHakanaj/NFT-preview-card-component

NFT preview card component

VildanHakanaj/Paging

This program will simulate a paging algorithm using Least Recent Used and Random algorithms.

VildanHakanaj/password-generator-app

VildanHakanaj/PortfolioWebsite

This is my personal portfolio website

VildanHakanaj/static-job-listing

VildanHakanaj/VildanHakanaj

Config files for my GitHub profile.

VildanHakanaj/WordBeater

This is a simple game called word beater. The user has to type in the word displayed on screen before the time runs out. This project was mimicked from Traversy Media Youtube Channel