CS 622 Discrete Math and Algorithms for Computing
This course introduces a comprehensive study of discrete mathematics, data structures, and algorithms. Students study how algorithm design, selection, and implementation have on the efficiency and effectiveness of programs. Students learn the efficiency of algorithms focusing primarily on searches and sorts. Students study data structures such as lists, stacks, queues, and trees. Students also study the mathematical bases of the data structures and algorithms. As a result of this course, students will be able to select and implement effective data structures and algorithms in their programs.