Testing for battery, the voltage regulator, the ATmega mircochip, and ICE programmer. I used a simple led blinker to insure that the components are working properly.

Clock System running on a 8hz crystal. The device sets time using a keypad to set a work the clock. The clock can also switch between milltary to standard time.

Music player running on a simple single speaker system. The Notes a fequencies of each note was manually configured into the device and a simple nursery songs were inputed to create a music box. The box can pause/play, select songs, and set tone/tempo.

voltmeter that measures up to 5V.

A lock system that managers accounts.

Two implmentation of MPI communications. The first implementation is a calcuation of pixel histagram for a image. The second implementation is of a histagram implementation of words of text.

Two different implementation of threads in c++. The dining philosopher problem and an edge detection algorithm for image processing

This is a siumlated operating system. The resources include Printers, Writers/Readers, Disks, Managers, and the Users. The program will use threads to represent each running resource. Users will be represented by a list of instructions. The program runs in parallel with hazard handling so that processes do not overwrite one another.

Single cycle processor that can run simple mips commands. The processor is implemented by 6 parts: Pc counter/instruction Memory, Registers, ALU, Data Memory, and control module. The pc counter/ Instuction Memory simply stores memory and keeps track of the current instruction. The registers are the mips registers, simply an array of registers. The ALU implements the basic functions, such as load, store, add etc. The Data memory is the final memory stored used when user Loads. The control module manages different Instruction types, I type, R type, J type. The control module required a Karnaugh map to provide efficent parsing of the instruction type.

Piped cycle processor that can run simple mips commands. The processor is implemented by 7 parts plus inbetween registers: Pc counter/instruction Memory, Registers, ALU, Data Memory, control module, and Hazard handler. The processor uses the same logic as the single cycle processor, but provides a register in between stages to allow for pipeline. The pipline saves registers need and provides them for the next instruction. This cuts the processing time to the longest path each pipe. The main issues that arises is the hazards that is created by the pipeline, hence the need for a hazard handler module. The hazard check the next instruction and compares the instruction in the memory stage to see if it causes a hazard. The hazard will produce a NOP if hazard is detected.

Created a network representation using a edge map. Generated random graphs based off Erdos-Renyi random graph generationg algorithm. The algorithm picks a random number between 0 and 1. Its will pick the probability of which a node will be added. The probability is calculated using the equation Log(1-r)/log(1-p). The algorithm works by pulling the networks median to around Erdos number to be around 5. Lastly, efficent functions to generate diameter, cluster coefficent and degree was implemented.

Created algorithms to efficiently pack in bins. These include greedy algorthims such as First fit and next fit. The algorithms were implemented efficently usng a zip tree. The zip tree was able to handle best fit by store the biggest remaining value. This allowed the search of the best fit to run in O(log(N)) time. The efficency was calculated using the average waste which is the possible space - filled space. We also considered sorting and then packing the bins. This allowed the fitting algorithms to perform exceptionally well.

Created a algorithms to efficiently sort. A variety of algorithms were coded up such as insertion, merge, shell, and hybrid sort. The algorithms were measured using just the starting time and ending time. They were also test on true randomly generated lists of number, via a radix sort. radix sort sorted the a array of random numbers given a random index, by using their indies. The results concluded that hybrid sort and shell sort did expectional well.

Based on the snake controls a game object/ player can only go left or right. They are constantly going forward and the object's goal is to collect fruits. The player is just a white dot and the fruits are red dots. The AI uses MLAgents on Unity to run tests and MLAgents uses Tensorflow to control the AI. I trained the AI using a exponent fruit reward system, but also implemented a punishment when it hits the wall. I went through more than 10hrs or seprate training for the AI, varying the hidden nodes and expanding the learning rate. The best Average score I gotten was about 80 which is around only 8 berries collected within 5000 steps. The score was average, but wasn't what I was expecting. The training took 1hr and around 3,000,000 trials.