This is an introductory project for algorithm analysis. Both programs are prefaced with an algorithm design block.

LockerDoors.java deals with the classic "Locker Doors" math puzzle.

AnagramsCheck.java tests if two strings (input by user) are anagrams.

Two programs: Vowels.java and AverageGrades.java.
Both programs were design to implement a simple yet practical recursive computational approach for their respective tasks.

Vowels.java computes all vowels within a given word or phrase

AverageGrades.java computes the average grade of any size class.

This is a "the basics" of object creation, declaration, and user prompted manipulation.
The algorithm is applied to a quiz creation scenario.

A comparison of targeted search speeds between linear and binary search algorithms.

Non-head/tail node implementation of linked list

This version of linked list has most of the standard functionalities that come with Java's inherent LinkedList libary.

Comes with the classic "check if palindrome" and "reverse string" test cases.
Run either the TestMyStack, CheckPalindrome, or ReverseString for demonstration.

Standard queue rebuild with a radix sort demo.

Binary sort tree with additional duplicate removal test class.

Standard heap application with additional priority queue heap class.

Hashes keys from an array of 50 keys.
First three hash function options initially start with the division method. Collisions are resolved via linear or quadratic probing, or double hashing. Final hash function starts with folding method for initial probe, then double hashes using relative primes for collision resolution.

User customizable matrix (n * n) where n is no greater than 5 and no less than 1.
Provides reachability matrix, in degree, out degree, self loops, cycles of length 'n', paths of 1 edge, paths of 1 to 'n' edges, and cycles of length 1 to 'n'.

Takes two prime numbers (hard coded in the program), and generates two keys; one public, and one private. The public key (PR) is utilized for plain text encryption, while the private key (PU) is utilized for decryption.
User is prompted for plaintext only.

Two-round Feistel Cipher.

User is prompted for plaintext and a 4-bit binary key. This iterration only works in 2 rounds and offers encryption/decryption.

Basic TCP client/server localized connection program.
The client sends a message to the server. The server sends the message back to the client but reversed. Both Programs need to be running at the same time, and the server must be booted first in order for the client to connect.