Description
This course covers fundamental topics in data structures and discrete mathematics. The topics are presented in an integrated manner that provides the discrete math foundations for data structures and computing applications of discrete mathematics concepts. Topics covered include stacks,queues,linked lists,trees,algorithms for searching and sorting, finite state automata, and concepts of computability and decidability. Topics from discrete math include sets and various types of relations (functions, graphs, trees, lattices), recursion and inductive proofs, Boolean logic, relational algebra, predicate calculus, series and limits, and asymptotic behavior of searching and sorting algorithms. Programming exercises are assigned throughout the course.
Prerequisites: MATH 154 completed with a grade of "C" or better,
(3 Credits)