A few helpful webapps

Here's an overview of the functionality of this site. Please send all bugs and suggestions for improvement to sandeep.kumar@tamu.edu. Here are some simple-minded webapps relating to Discrete Math/Data Structures that you can try out.

Discrete Math

Propositional Logic Evaluator.
Propositional logic formula to CNF.
Resolution over a set of (disjunctive) clauses. This one's quite a bit flaky!
9x9 Sudoku puzzle solver using Z3. Find Sudoku puzzels at https://www.nytimes.com/puzzles/sudoku.
Extended GCD algorithm.
Multiplication & exponentiation tables for Z_m.
Chinese Remaindering illustration.
Greedy coin change demo.
RSA demo.
Greedy interval scheduling instance generator.
Some thoughts on permutations and combinations.

Practice Problems: You'll need your TAMU credentials to access them. Many of you have complained in previous semesters that no matter how well-intentioned, practice problems without accompanying solutions are worthless. I would disagree of course 😀. However, I now have many problems with hints and several with full solutions. I don't always have the time to cover many examples in lectures, so these problems should fill that gap. There's a toggle on many problems. Try the problem first before looking at the hint/solution. Or peek at the hint briefly after wrestling with it for a bit, and then try it again.

Data Structures

Quicksort partitioning algorithm a la CLRS22. The pivot is the rightmost element of the subarray that needs to be partitioned.
View in-order, pre-order, post-order traversal on randon binary trees. This can help sharpen your understanding of various traversals in a binary tree.
View & mutate RB trees.
View & mutate Heaps.
View Dijkstra's shortest path algorithm.
View Jarnik's minimal spanning tree algorithm.