michaelkulinich Goto Github PK

androidapp-project1

bst

cars

cmake-examples

Useful CMake Examples

compiler_construction

coronavirus

cpsc350-gameoflife

The game of Life was designed in the 1970s by the mathematician J.H. Conway. The game gained popularity after appearing in a Scientific American article, and took the computing world by storm. The game is a simulation that models the life cycle of bacteria, providing entertainment wrapped up in what some would call mathematical elegance. (For some history on the game, as well as the rise of computing in general, I highly recommend the book Hackers, by S. Levy.)

cpsc350-linkedlist

cpsc392parlettpelleriti

cudatastructures

CPSC 350 Data Structures and Algorithms - Chapman Universities

fall2019-helloworld

fancontrol

garmin_datascience_project

generalstack

highperformancecomputing

hw2_gameoflife

hw3-usingstack

hw4-registrarsimulation

Imagine that the registrar’s office has approached you with the following issues. At certain times during the day students arrive in large numbers. If there are not enough windows open, the average student wait times are too long, and they receive many complaints. On the other hand, if they open too many windows, their staff will be idle for most of the time, and they will be wasting money. They want you to program a simulation that will allow them to calculate metrics on student wait times and window idle times given a specific traffic flow of students.

hw5_databasebst

In this assignment, you will push your C++ skills to the limit by implementing a simple database system using binary search trees. Though the end product will be a far cry from Oracle or MySQL, your DB will allow the user to insert, delete, and query data. The data itself will be persistent (stored on disk), so that you may process it over several sessions. The DB itself will contain data that would be commonly found in a university’s computer system. In our case, this information consists of student and faculty records. The information for each will be stored in its own tree (or “table” in DB terminology). Though I will provide you with a general outline of the program, many of the implementation details will be up to you. In the same spirit, I will give you a point in the right direction as far as some of the C++ techniques go, but it will also be your responsibility to research the techniques in more detail.

hw6-sorting

We’ve learned several sorting algorithms, as well as which algorithms are “asymptotically” better than others. But though it is important to know that, on paper, a O(n2 ) algorithm runs slower than a O(n lg n) algorithm, it is also important to realize just how drastically these algorithmic choices can effect your program’s performance at run time. To drive this point home, the (simple) assignment for this week is to implement 4 sorting algorithms and time them on large input.

michaelkulinich.github.io

ml_assignment1

ml_assignment2

ml_assignment3

ml_assignment4

ml_assignment5

netflixgenrepredictor

numbers

os.assignment1

os_assignement1