yosephahmed Goto Github PK

assignment-0

bank-of-react

batch-1-photos

Batch 1 Graduation Photos

class_demo

TTP Residency Day 1 Lab Demo

console-haven

Simple final project for CSC 225.

contact_card

csc-211-class-project

The User Interface portion of a class project in my class, done by the UI team.

csc225-task-8

datacleaning

In Bb you will find a dataset from the UCI Machine Learning Repository on whether a patient has heart disease. You will clean the data and then apply a decision tree to the data.

dreambotscripts

Scripts that automate various tasks in the popular MMORPG Runescape

drunkwalker

This is one of my lab assignments for my CSC330 class. It is particularly interesting because I had to leverage from various collections in order to accomplish the task of modeling random or "drunken" behavior.

github-slideshow

A robot powered training repository :robot:

halloween-store

This project is a Halloween store that I built strictly using HTML and Bootstrap v4.6 for styling purposes.

hospitalrun-frontend

Frontend for HospitalRun

html-restaurant

This is code for a CSC 225 homework submission

learnreactjs_firsthour

https://www.youtube.com/watch?time_continue=1&v=DLX62G4lc44&feature=emb_title

learnreactjs_secondhour

Code from second hour of YouTube LearnReactJS tutorial

learnreactjs_todo_app

https://www.youtube.com/watch?time_continue=1&v=DLX62G4lc44&feature=emb_title

markdown-portfolio

median-image-filtering

CSC382 Analysis of Algorithms Final Project

playing-with-redux

posterior-chain

A starting point for the backend of an application involving Node, Express, and PostgreSQL

react-redux-bank

Educational workshop that goes through the steps of setting up a mock bank web app using React, Redux, and React-Redux.

react_redux_bank_app

restaurant-front-end

reviewing-a-pull-request

riemmansum

This is a Java project I was working on that implements the functionality behind Riemman's Midpoint rule for calculating area under the curve.

sorting-algorithm-performance

Programming Assignment: You need to implement insertion sort and merge sort (increasing or decreasing order) algorithms and measure the performance of these two algorithms in terms of number of steps and CPU running time.

sorting-algorithm-performance-v2

sorting-algorithm-performance-v3

In this lab, you will implement Quick Sort and Randomized Quicksort algorithm for the same inputs. For each algorithm, and for each n = 100, 200, 300, 400, 500, 1000, 4000, 10000, measure its running time and number of steps when the input is (1) already sort, i.e. n, n-1, …, 3, 2,1; (2) reversely sorted 1, 2, 3, … n; (3) random permutation of 1, 2, …, n; (4) 50 instances of n random numbers generated in the range of [1..n]. Note: (1) You may have to repeat the algorithm many times, each time you need to initialize the array. (2) Your running time should exclude the time for initialization. (3) All measurement should be done in a single run, i.e. you do not need to run once for n=100, another time for n=200, etc What to turn in: (1) Well documented source code in C++ (2) Report the number of steps and the CPU running time in a table (Add this result in your previous table). (3) Plot the running time of the algorithm results (Add this result in your previous plot). Due on 11/17/2020