Quickcheck
This homework assignment is composed of three problems. All team members should work on all parts.
Make all of your edits in the files Sat.hs
, Queue.hs
and
AVL.hs
.
Problem - A SAT solver
See Sat
This problem gives you more experience with quickcheck. You might want to review the QuickCheck
lecture notes before you begin.
Problem - Queues
See Queue
This problem also concerns QuickCheck. It is similar in format to the next problem, but
you do not need to read the RedBlack
module before beginning the problem.
Problem - AVL trees
See AVL
This problem is based on balanced binary search trees. You might want to review the RedBlack
lecture notes before you begin.