https://github.com/bluecube246/mini-projects-assignments

https://github.com/bluecube246/mini-projects-assignments

Last synced: 3 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/bluecube246/mini-projects-assignments
• Owner: bluecube246
• Created: 2018-11-09T20:39:41.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2019-01-08T02:19:06.000Z (over 7 years ago)
• Last Synced: 2025-03-23T06:16:26.537Z (over 1 year ago)
• Language: Java
• Size: 486 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
Data Structure Projects


The Data Structure Project is a number of projects that are implemented using a specific data structure topic. Abstract data types, Linked lists, Stacks, Queues, Trees, Hashing, Graph algorithms and more. They consist of hundreds of lines of code. 

Delivery Android App Project


The Android App Project is an android app made from the Delivery Project in the above Data Structure Projects code. 

Project Cancer Classification


The Cancer Cell project is a project done in my data science class. The first part of the project gene data to cluster the data using K-means method and hierarchical clustering methods. The second part of the project is used to build a classifier that will predict if the patient has Type 1 Breast cancer or Type 2 cancer using mRNA data. The classifier used is a linear SVM classifier and the data is reported in a confusion matrix. 

Algorithms

This file contains two programs. The Bandwith Minimizaiton problem is an implementation of a backtracking algorithm The bandwidth problem takes as input a graph G, with n vertices and m edges (ie. pairs of vertices).The goal is to find a permutation of the vertices on the line which minimizes the maximum length of any edge. 


The second program will take in the number of edges number of vertices and edges and print out the connected components of an undirected graph. Breadth first search is the algorithm used to find the list of connected components