57
edits
Changes
no edit summary
====Sudoku Puzzle Solver by - Gurpreet Singh====
Is it a program that solves Sudoku puzzles(9X9) using Bruteforce algorithm. The user can either pass a Sudoku files as an input or enter the values manually. Moreover, the file or the manual entry must strictly have 9 rows and 9 columns in them. Last but not the least, all the cells must be separated by a space and the cells that needs to be solved must have 0 in them as their value.
----
==== Simple Artificial Neural Network by - SukhbeerSingh====
=====Introduction=====
The total execution time of the program is around 3 minutes. The profiling results spot displayPrediction as the function with maximum execution time. However, thats because it displays a matrix using the naive O(n2) for-loop. train() is the next function with the maximum time. This is the hotspot for the program. If this function is made to be the kernel and the functions that it calls as device functions, the program would fasten by a good proportion.
----
==== Sorting Algorithms - Merge Sort - Edgar Giang====
=====Intro=====
=== Assignment 2 ===
We decided to choose the neural network code to paralellize. The reason being it gives us a good learning opportunity and more importantly that we can potentially speed up the execution time of the program by using CUDA.
=== Assignment 3 ===
