Kyle Duncan (KDunc11)

KDunc11

Geek Repo

Company:SubHQ

Location:Spokane, WA

Github PK Tool:Github PK Tool

Kyle Duncan's repositories

active_storage_validations

Do it like => validates :photos, attached: true, content_type: ['image/png', 'image/jpg', 'image/jpeg'], size: { less_than: 500.kilobytes }, limit: { min: 1, max: 3 }, aspect_ratio: :landscape, dimension: { width: { in: 800..1600 }

Language:RubyLicense:MITStargazers:0Issues:0Issues:0

alchemist

A scientific conversion library.

Language:RubyStargazers:0Issues:0Issues:0

Binary_Tree

Write a cross-reference program that constructs a binary search tree with all words included from a text file and records the verse numbers on which these words were used. These verse numbers should be stored on linked lists associated with the nodes of the tree. After the input file has been processed, print in alphabetical order all words of the text file along with the corresponding list of numbers of the verses in which the words occur. Verse numbers appear to be either at the beginning of a line, or within a line, but preceded by a space.

Language:C++Stargazers:0Issues:1Issues:0

DecisionTree_Cpp

ID3 Decision Tree created in C++, Machine Learning course project

Language:C++Stargazers:0Issues:1Issues:0
Language:C#Stargazers:0Issues:0Issues:0

Delimiter_Matching

A data structures course project that utilizes a custom stack data structutre and single linked list along with a delimiter matching algorithm to check C++ code for mismatching delimiters.

Language:C++Stargazers:0Issues:1Issues:0
Language:JavaScriptStargazers:0Issues:0Issues:0

faker

A library for generating fake data such as names, addresses, and phone numbers.

Language:RubyLicense:MITStargazers:0Issues:0Issues:0

GitHub-Jobs-API

Followed Web Dev Simplified's tutorial on making a GitHub Jobs API application, made a few tweaks here and there.

Language:JavaScriptStargazers:0Issues:0Issues:0

Heap_Sort

A data structures course project that performs either a max or min heap sort using input from command line arguments.

Language:C++Stargazers:0Issues:1Issues:0
Language:RubyStargazers:0Issues:0Issues:0

ICMP_Pinger

Python ICMP pinger lab from Networks class.

Language:PythonStargazers:0Issues:0Issues:0

Linked_List

A project from a data structures course utilizing linked list with templates. The project uses a linked list of flights and passengers to mimic which passengers are on which flight and how many passengers are on a flight.

Language:C++Stargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:0Issues:0
Language:PythonLicense:GPL-3.0Stargazers:0Issues:0Issues:0

OS-Testing

Operating system started by following a guide by Nick Blundell.

Language:AssemblyLicense:MITStargazers:0Issues:1Issues:0

ReadersWritersProblem

An implementation of the Readers Writers problem in C# from an operating systems course project.

Language:C#License:MITStargazers:0Issues:0Issues:0

Recursion_N_x_N_Board

An n × n square consists of black and white cells arranged in a certain way. The problem is to determine the number of white areas and the number of white cells in each area. For example, a regular 8 × 8 chessboard has 32 one-cell white areas. Write a program that, for a given n × n square, outputs the number of white areas and their sizes. Use an (n + 2) × (n + 2) array with properly marked cells. Two additional rows and columns constitute a frame of black cells surrounding the entered square to simplify your implementation. Traverse the square row by row and, for the first unvisited cell encountered, invoke a function that processes one area. Don't think of a checker board, think of a raster with values g and t. g = grassland, t = forested. Identify forested pockets (stands) in the grassland, giving each forest stand a unique numeric identifier. You'll take an "ASCII grid" as input. The program can display the input grid, the output grid and export the output grid as an ASCII grid.

Language:C++Stargazers:0Issues:0Issues:0

RemotePiServer

Set up a Raspberry Pi to serve as a remote server.

Language:ShellStargazers:0Issues:0Issues:0

Track_Meet_Scoring

Write a program that you can use to score a track event. Let our base class have basic information about an EventParticipant like name, age, gender and team. There will be 2 derived classes that inherit from EventParticipant. FieldParticipant will have a distance (assume we're measuring in metric). TrackParticipant will have a time. Don't worry about events with a stage start. You'll want to provide a driver that will allow you to enter a series of participants and their marks for a single event. Your driver may need to specify whether the event is a field or track event (so you know what derived class you'll be using). As the data's entered, each EventParticipant is entered onto an array (assume no more than 100 participants). Assume the participants are in no particular order. Your driver will also need to give you the ability to sort the results by either name or mark (time or distance). Score the event so 1st place gets 3 points, 2nd place gets 2 points and 3rd place gets 1 point.

Language:C++Stargazers:0Issues:1Issues:0

UDP_Pinger

UDP client - server pinger lab from Networks course.

Language:PythonStargazers:0Issues:0Issues:0

ui

A library of JavaScript UI components, includes the best lightbox - Fancybox5

License:NOASSERTIONStargazers:0Issues:0Issues:0