Assignments for Algorithms 2 (Robert Sedgewick and Kevin Wayne , Princeton)
1st Aug 2020 to 7th Sept 2020
Specs : https://coursera.cs.princeton.edu/algs4/assignments/wordnet/specification.php
Grade : 91 %
Todo(s) : Implement lock step (one pass) BFS
Specs : https://coursera.cs.princeton.edu/algs4/assignments/seam/specification.php
Grade : 85 %
Todo(s) :
1. Throwing Exceptions
2. Failed all the memory cases. Need to optimize
3. Clear out Checkstyle warnings
4. Remove commented code blocks.
Specs : https://coursera.cs.princeton.edu/algs4/assignments/baseball/specification.php
Grade : 100 %
Todo(s) : NA
Specs : https://coursera.cs.princeton.edu/algs4/assignments/boggle/specification.php
Grade : 100 %
Todo(s) : NA
Comment : The important part was to override the R-way Trie to a 26 way trie to save memory and check for prefix before going deep in DFS. Created TSET.java which is overriden version of TrieSET with R = 26 (A-Z)
Specs : https://coursera.cs.princeton.edu/algs4/assignments/burrows/specification.php
Grade : 86 %
Todo(s) : Code Optimization.
Comment : Use counting sort instead of HashMap and don't use Arrays.sort and StringBuilder(design violation).