Introduction to the ideas of abstraction of procedures and data. Implementation and 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. This course is taught using the C programming language. NOTE: Credit will not be given for both CMPE 1023 and CS 1023.
Prerequisite: CMPE 1003 or CS 1003. |