Pinned Repositories
Deterministic-Finite-Automaton
This is a programming assignment from NJIT to build a DFA that will validate a set of predetermined website addresses
Explorer-Stats
An application that displays the statistics of a disk/directory. Displays directory and associated statistics, along with all sub directories and their statistics (recursively). Also displays the different file types and the number of each file type as well as the total space used.
File-Attribute-Editor
C# Program that allows you to edit a Windows file's attribute metadata such as the creation time/date, archive and read-only attributes, etc.
KnightsTour
This is a basic Java program demonstrating the "Knight's Tour". The Knight's Tour problem is to find a single path starting from any position on a chessboard where a knight chess piece will visit all squares without visiting any single square more than once. My implementation uses Warnsdorf's Rule in order to solve the problem.
PingPongTest
Prints the numbers from 1 to 100. But for multiples of three prints “Ping” instead of the number and for the multiples of five prints “Pong”. For numbers which are multiples of both three and five print “PingPong".
ZachGrossi's Repositories
ZachGrossi/File-Attribute-Editor
C# Program that allows you to edit a Windows file's attribute metadata such as the creation time/date, archive and read-only attributes, etc.
ZachGrossi/Deterministic-Finite-Automaton
This is a programming assignment from NJIT to build a DFA that will validate a set of predetermined website addresses
ZachGrossi/Explorer-Stats
An application that displays the statistics of a disk/directory. Displays directory and associated statistics, along with all sub directories and their statistics (recursively). Also displays the different file types and the number of each file type as well as the total space used.
ZachGrossi/KnightsTour
This is a basic Java program demonstrating the "Knight's Tour". The Knight's Tour problem is to find a single path starting from any position on a chessboard where a knight chess piece will visit all squares without visiting any single square more than once. My implementation uses Warnsdorf's Rule in order to solve the problem.
ZachGrossi/PingPongTest
Prints the numbers from 1 to 100. But for multiples of three prints “Ping” instead of the number and for the multiples of five prints “Pong”. For numbers which are multiples of both three and five print “PingPong".