A project for data structures and algorithms
1 Citations•1991•
G. Haggard
Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
A course in discrete structures has become a normal prerequisite for courses in data structures and analysis of algorithms and should reinforce for students the need to use mathematical structures and proof techniques as tools in developing correct and efficient algorithms.
Abstract
A course in discrete structures has become a normal prerequisite for courses in data structures and analysis of algorithms. One of the pedagogical problems to deal with in these advanced courses is how to integrate the material of the discrete structures course. These later courses should reinforce for students the need to use mathematical structures and proof techniques as tools in developing correct and efficient algorithms.