Foundations of Computer Science. 3 credits, 3 contact hours

Catalog description

Prerequisites: No formal prerequisites – The course assumes basic knowledge of a higher-level programming language. Introduction to the concepts of iteration, asymptotic performance analysis of algorithms, recursion, recurrence relations, graphs, automata and logic, and also surveys the main data models used in computer science including trees, lists, sets, and relations. Programming assignments are given.