A logic programming environment for teaching mathematical concepts of computer science
SIGCSE '93 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
Our curriculum has become math-phobic!
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Discrete Structures, Logic and Computability
Discrete Structures, Logic and Computability
Panel: is there too much math in the computer science curriculum?
Journal of Computing Sciences in Colleges
Communications of the ACM - Why CS students need math
Status report on the SIGCSE committee on the implementation of a discrete mathematics course
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Status report on the SIGCSE committee on the implementation of a discrete mathematics course
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Using market basket analysis to integrate and motivate topics in discrete structures
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Increasing engagement in automata theory with JFLAP
Proceedings of the 40th ACM technical symposium on Computer science education
grep Pocket Reference
Teaching discrete structures: a systematic review of the literature
Proceedings of the 42nd ACM technical symposium on Computer science education
| Hi-index | 0.00 |
The "2007 SIGCSE Report On the Implementation of a Discrete Mathematics Course" recommends relocating some discrete structures topic areas to other courses, for the sake of coherency. Our implementation of the one semester course also relocates topics, but additionally features a focus on a significant computer science problem: regular language acceptors. This problem-directed course model promises superior coherency, motivation, and integration with computing.