njalexander93 Goto Github PK

bouldercharitysearch

A website that creates a stronger network of nonprofits and volunteers with the purpose of connecting and increasing charitable activity within the city of Boulder

cachingamatrix-coursera

Repository for Programming Assignment 2 for R Programming on Coursera

catastrophicevents-coursera

cleaningdata-coursera

clustering_spam_filter

communicationnetwork-csci2270

This program simulates a communications network using a doubley linked list. Each node in the network represents a city. In this program, the user is able to build an initial network, print the network path, transmit a message from coas-to-coast-to-coast, add or delete a city, and completely clear the network.

coursera-mlops-c2-lab3-probability-simulations

Week 1 Lab 2 for the DevOps, DataOps, MLOps Coursera Course in the MLOps | Machine Learning Operations Specialization

coursera-mlops-foundations-lab-1-cicd

Week 1 Lab for the DevOps, DataOps, MLOps Coursera Course in the MLOps | Machine Learning Operations Specialization

coursera-mlops-foundations-lab-2-poker-simulator

Week 2 Lab 1 for the DevOps, DataOps, MLOps Coursera Course in the MLOps | Machine Learning Operations Specialization

finalprojectalgorithms-csci3104

Algorithms used in the final project of Algorithms (CSCI3104) at the University of Colorado, Boulder

harpredictionproject-coursera

mvsamileage-coursera

Using regression analysis to determine whether or not a manual transmission has better gas mileage than an automatic transmission.

nextfitmalloc-csci2400

A simple memory allocator based on implicit free lists using next fit placement and boundary tag coalescing.

nikolaijalexander.com

This repository contains the source code for my resume website. The website can be found at https://www.nikolaijalexander.com/

onlinemovieservice-csci2270

This program simulates an inventory database for an online movie service. The movies are stored in a binary search tree by the first letter of their title. Each BST node then points to a Linked List where the information is stored for each movie sharing the same first letter. A main menu is presented when opening the program - this main menu allows the user to find the information on a movie (IMBD rank, title, release year, and quantity), rent a movie, print the entire inventory, delete a movie, and count the number of movies in the database.

plottingdata-coursera

Plotting Assignment 1 for Exploratory Data Analysis

reproducibleresearch-coursera

Peer Assessment 1 for Reproducible Research

shelllab-csci2400

A simple Unix shell program that supports job control

ufcfightprediction

Using machine learning to predict the outcome of a UFC fight

unityprojects

A repo for all of the projects found in the book.

vitcvstoothgrowth-coursera

Measuring the influence of Vitamin C and tooth growth, by measuring the dosage and type of consumption.

web3-wave-portal-smartcontract

A buildspace wave portal built on the blockchain using Solidity and Ethereum Smart Contracts.

web3-wave-portal-website

GitHub starter project link: https://github.com/buildspace/waveportal-starter-project

wow__classic_auctionhouse_analysis

Analyzing the behavior of the World of Warcraft Classic Auction House

zombiegraph-csci2270

This program simulates a network of cities in the United States during a zombie apocolypse. Zombies have knocked over communication towers and taken control of roads and bridges. The program reads a text file determined in the line argument containing an adjacency matrix, and builds a graph, connecting each city. If the weight between two cities is -1, then there is no direct path. However, a path can be found by navigating through available cities. In part 2 of the project, we use a Depth First Seach algorithm to separate the cities into districts by their available paths - two cities with no path to eachother are in different districts. We then use a Breath First Search algorithm to find the shortest path between cities from one city to another, and Dijkstra's algorithm to find the shortest weighted path between two cities.