justinmello32

Justin Mello's repositories

CST438-Gradebook-backend-Mello

Language:Java000

CST438-Gradebook-frontend-Mello

Language:JavaScript000

cst370_hw1_2

C++ program that reads two groups of numbers in which each group has several integer numbers without duplicates.

Language:C++000

cst370_hw1_3

This program reads a number of elements in a set and then read the elements of the set. After that, the program should display all possible binary numbers and corresponding subsets one by one.

Language:C++000

cst370_hw2_1

C++ program that reads two timestamps of two events from a user and displays the difference between the two timestamps.

Language:C++000

C++ program that collects the maximum number of apples in boxes. For the problem, you should assume that there are n boxes (= from the box number 0 to box n-1) on a table and they contain a few apples. Your program should determine the maximum number of apples you can collect from the boxes. One constraint in this problem is that if you collect the apples in a box, you should skip at least one box next to the box.

Language:C++000

cst370_hw2_3

C++ that converts a directed graph data from a user into a corresponding adjacency list format. T program should read an input graph data from a user. Then, your program should convert it to the adjacency list format.

Language:C++000

cst370_hw3_1

C++ program which checks if an input string is a palindrome or not.

Language:C++000

cst370_hw3_2

C++ program that reads an input graph data from a user first. Then, it should present a path for the travelling salesman problem (TSP).

Language:C++000

cst370_hw3_3

C++ program that implements the Depth-First Search (DFS) algorithm using a stack and a mark array.

Language:Shell000

cst370_hw4_1

C++ program that reads a number of input values and the values themselves then sorts all negative values.

Language:C++000

cst370_hw4_2

Program in c++ that displays the biggest number in an array with n integer numbers using a divide-and-conquer technique.

Language:C++000

cst370_hw4_3

C++ program that conducts the topological sorting based on the Kahn’s algorithm.

Language:C++000

cst370_hw5_1

C++ program that conducts heap operations.

Language:C++000

cst370_hw5_2

This program displays the performance of three different sorting algorithms (= heap sort, merge sort, and quick sort).

Language:C++000

cst370_hw5_3

C++ program to simulate the operations of linear probing.

Language:C++000

cst370_hw6_1

C++ program to to conduct the radix sort.

Language:C++000

cst370_hw6_2

C++ program to collect maximum number of coins on an n x m board. However, the board has several inaccessible cells in this problem. If you meet an inaccessible cell on the board, you cannot move to the cell because it is not accessible.

Language:C++000