Does the mountain of other math videos and exercises on the site not already provide that? I'm pretty sure they cover enough. They cover through Calculus and maybe more. Which do you feel is missing?
Usually a basic discrete math course covers: naive set theory, formal logic, functions (khan covers under calc), relations, permutations and combinations (covered by khan),and graph theory. Additionally you'll usually do a lot of proofs with these since an understanding of how to do a proof is essential to being able to study algorithms. Calculus and the like are actually the dual of 'Discrete math', which could be referred to as 'Continuous math'
While I'm sure it's possible that the plethora of other math videos and exercises on the site do provide the background that CS students would need, it'd be nice if perhaps they were cross-categorized so that people could know which topics go best with each other.
