SmallScale

Small-scale code, nothing for production use; all is written by me for various personal or school projects; All code is open source, as in free air just give credit. If it is wrong, doesn't compile, causes spontaneous combustion, etc. it's not on me. Miscellaneous code written in C, Java and PHP. Refer to this readme for each program / script description. Refer to each file for logic, credits or any additional information.

Programmer Beware: I always comment code, sometimes.

UCF COP - Computer Science

AssignmentOne.c The goal of this assignment is to write an application that reads in a data file and stores the data as a linked list.

AssignmentTwo.c This assignment provides more practical experience parsing data files and creating a linked list and builds upon it with recursion and writing a data file.

AssignmentThree.c This assignment's primary goal is to find all permutations of given string.

AssignmentFour.c This assignment provides a platform for BST operations, Data Structures.

UCF CIS - Computer Security

BaseConvert.c Numeric base converter supporting binary, decimal, octal and hexidecimal. Written in C.

PrimitiveRoot.php Function that finds if a is primitive root of p

hillcipher.java Java CLI program, encrypts plaintext file based on key file, with hill cipher. hillcipher.java

phi.c Euler's Totient / Phi written in C

Just for fun

Factorial.java Factorial Function by both Iteration and Recursion .. ohh my lawd

2014_UCF_LPC_fact: Factorial Products

UCF Local Programming Contest — August 30, 2014
Filename: fact
Difficulty Level: Hard

Factorial is just a game of multiplications. Formally, it can be defined as a recurrence relation:
Fact (0) = 1
Fact (n) = n * Fact(n-1), for all integers n > 0
This problem is all about multiplications, more and more multiplications. It is a game of multiplications of factorials.

The Problem:
You will be given three lists of numbers: A, B and C. You have to take the factorials of all the numbers in each list and multiply them to get ProFact(A), ProFact(B), ProFact(C). Then report which product is the largest.

For example, consider the lists A = {2, 4, 7}, B = {0, 1, 9} and C = {2, 3, 5, 5}. Then,
ProFact(A) = 2! * 4! * 7! = 241, 920
ProFact(B) = 0! * 1! * 9! = 362, 880
ProFact(C) = 2! * 3! * 5! * 5! = 172,800
So, the largest product for this example is ProFact(B).

The Input:
The first input line contains a positive integer, n, indicating the number of test cases. Each test case consists of four input lines. The first line consists of three positive integers providing, respectively, the size for the lists A, B and C. The last three lines contain, respectively, the elements (non-negative integers) in lists A, B and C. All the values in the input file will be less than 2,501.

The Output:
For each test case, output “Case #t: h” in a line, where t is the case number (starting with 1) and h is the list name with the highest product. If two or three lists are tied for the highest product, print “TIE”. Follow the format illustrated in Sample Output. Assume that, if the pairwise product values differ, then the relative difference of these products will differ by at least 0.01% of the largest product.

Sample Input:
3
3 3 4
2 4 7
0 1 9
2 3 5 5
2 2 2
2 3
3 2
2 2
3 3 3
1 3 5
2 4 6
1 4 7

Sample Output:
Case #1: B
Case #2: TIE
Case #3: C

VisualCron

Accepts multiple CronJobs as input, outputs CronJob schedule predictions for a One Month period. Written in PHP.

* * * * *
| | | | | 
| | | | | 
| | | | +---- Day of the Week   (range: 0-6, 0 for Sunday)
| | | +------ Month of the Year (range: 1-12)
| | +-------- Day of the Month  (range: 1-31)
| +---------- Hour              (range: 0-23)
+------------ Minute            (range: 0-59)
NOTE: Does not accept multi-space commands in cronjob.
	DO NOT:  * * * * * /usr/bin/php5 /var/www/script.php
	DO:	 * * * * * /var/www/script.php
NOTE: Due to the number of iterations required at this time, there is a 
      good chance that this script will run past max_execution_time. 
      The example given below took 89 seconds on a tuned quad-core 
      production server. The set_time_limit below is set to kill execution
      at 5 minutes.


Visual Cron Job
2015 Joseph Orlando

Input data

VisualCron::AddCron('*/11 * * * * <RunThisCommand>');
VisualCron::AddCron('*/7 * * * * <RunThisCommand>');

Output Data

VisualCron::ViewCron(); // Outputs:
0: 01/01/2015 12:07AM: */7 * * * * <RunThisCommand>
1: 01/01/2015 12:11AM: */11 * * * * <RunThisCommand>
... Etc.