Carlos's Projects
Program that allows to search for an item in a bell shaped array.
This program parses a file containing DNA information, namely a large codon sequence and proceeds to register the occurrences of each codon. After completion, the function then return a list containing an overview of the total presence of codons in the sequence parsed; this information can be used by biologists to perform different kinds of statistical analysis.
The following files depict two programs that parse files and obtain a desired amount of dates, both programs make use of Unix pipes and input and output commands.
Simple c program that generates the mathematical numbers pi and e up to a desired number of significant digits using only the sum of the infinite Taylor series as the method of generation.
The following program is a proof of concept of the functionalities provided by C Forks which allow the creation of child processes.
The following C program simulates a game of stud poker, where hands are dealt to a desired amount of players at random and then each hand is evaluated and ranked according to the stud poker rules.
A simple program written in C that converts temperature from Celsius to Fahrenheit.
The following program contains the method"disjoint" this method works with lists of comparable items. The method "disjoint" determines if two given lists have common elements and outputs true or false if they are disjoint or not disjoint respectively.
The following java file contains a method that allows to calculate a desired term in in the fibonacci sequence, in log n time complexity
The following java program allows to simulate the Huffman algorithm that allows to compress character files.
The following java file contains a method that allows to determine if a given number is present in an matrix of primitive integer numbers
This program contains a method named leader that determines if a number is present more than half of the time in an array of numbers.
The following function provides a solution to the Nth queen problem in Java
following program contains the method "difference", this method is an algorithm that works with lists of comparable items. The method "difference" computes the set-theoretic difference (which is also known as the relative complement), between the two lists and saves the result into a third list provided through the method signature.
Simple program that serves as proof of concept of the singleton design pattern and how it can be circled around by using Reflection
Simple app for poly hacks
Simple web application written in nodes which serves to manage a MySQL database, front end written using Bootstrap , back end server written in Nodejs.
Proof of concept, showing the ease of using Java JPA annotations and Reflection to browse through annotated code, Testing annotated methods using JUnit.
Simple Spring app
Simple web view for IOS made in Swift.
This is a simple swift playground which shows in simple terms the concept of the Strategy Design Pattern