Intended for Science, Applied Science, and Engineering Students. Introductions to the ideas of abstraction of procedures and data. Handling of the fundamental data types: lists, stacks, queues, and graphs. Basic concepts of discrete mathematics, elements of combinatorics, aspects of complexity and recursion and algorithm development, including estimation of program resource utilization. NOTE: This course may not be taken for credit by CS students.