nerdylicious Goto Github PK
Name: Irish J Medina
Type: User
Name: Irish J Medina
Type: User
An implementation of the Advanced Encryption Standard.
A program used to decode ciphertext that was encoded using the Affine Cipher.
A Perl Catalyst MVC Tutorial that implements an Allele Database.
A simulation of the ALOHA protocol using SimPy and SciPy.
Server side support platform for Peace Corps mobile applications.
An object oriented project in Java that simulates an assembly factory line.
An assembly program that calculates the GCD of two numbers.
An assembly program that performs a linear search on a unsorted array.
A binary search implementation in C++.
Implementation of the Producer-Consumer or Bounded-Buffer problem in C which is a classic synchronization problem. Here, multiple producers and consumers (threads) insert and remove items from a shared buffer (queue) of finite size.
A shell implementation which provides the option of defining shell variables.
A shell implementation which provides the option of defining shell variables.
A shell implementation which provides the option where the up and down arrow keys may be used to scroll through the command history.
Using the Capitol Words API to get the top words spoken by the United States Congress.
Share files using a client-server architecture.
A client-server implementation of a messenger.
A client-server implementation of a messenger. If the current server is down, the IP address of an alternative server with the lightest load will be provided from an available pool of servers.
A client-server implementation of a messenger. If the current server is down, the IP address of an alternative server will be provided in round robin fashion from an available pool of servers.
A collection of data structure/ADT implementations in C++. Includes binary trees, dictionaries, deque, doubly-linked lists, graphs (using an adjacency list), hash tables. Some implementations make use of the stack or queue ADT.
Implementation of Dijkstra's algorithm in C++ which finds the shortest path from a start node to every other node in a weighted graph.
A collection of solutions (fibonacci, counting steps) using dynamic programming in C++.
C++ implementation to compare two floating point numbers.
FTP client-server program written in C.
Breadth-first search and depth-first search implementations in C++. Implementations of depth-first search include using an implicit stack (via recursion) and an explicit stack.
Paint a boolean grid using breadth-first and depth-first search.
Comparing the running times of a binary heap and a binomial heap.
An algorithm to calculate the index of coincidence.
An implementation of the Lempel-Ziv-Welch compression algorithm.
Discussion and resources page for both iOS and Android development strands
The Miller-Rabin primality test is an algorithm that determines whether a given number is prime.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.