Foundations of Computing 1

Course Description

Introduces students to both data structures and formalisms used in computer science, such as the asymptotic behavior of algorithms. Data structures and formalisms are used to both describe and evaluate those data structures simultaneously. By the end of the two-semester sequence of which this course is the first part, each student will have a solid foundation in conceptual and formal models, efficiency, and levels of abstraction as used in the field of computer science.

Outcomes

Course Outcomes are measurable achievements to be accomplished by the completion of the course. These outcomes are evaluated as part of our ABET accreditation process.

• Define and use the basic operations of sets, functions, and relations.
• Define and demonstrate the basic properties of trees and graphs.
• Use the elementary graph and tree algorithms including traversals and searches.
• Describe assertions in propositional logic form.
• Describe simple circuits, I/O, and satisfiability using Boolean logic.
• Use combinatorics and conditional probability in solving real-world problems.
• Demonstrate a solid foundation in conceptual and formal models by describing loop structures in summation and/or product notation.
• Demonstrate an introductory knowledge of finite state machines.

Assessments