Top/public/assessment/2021-2022/Outcomes/1
For evaluators
Catalog
Courses
Course coords
Courses offered
Personnel
ABET assessment
Library resources
Curricular issues
Course portfolios
Student transcripts
Dept. meetings
Assessment
    Data & results
    Responsibilities
    Forms
Videos
Site map / help

Outcome 1 for 2021-2022

Outcome 1 is: Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions.

The following abilities support outcome 1

  • 1a: Elementary algorithm analysis. Given an algorithm to solve a computational problem, it is important to analyze and figure out as to how good it is. While there are different complexity measures, we will be focusing here on the ability of students to determine the worst case complexity of an algorithm/program.

  • 1b: Graphs as models. Directed and undirected graphs are a versatile formalism for creating mathematical models of a variety of computational problems.

    Students are expected to develop an ability to apply concepts of graphs as modeling tools in software design.

  • 1c: Computational problem solving. Problem solving is the ability to apply knowledge to solve computational problems. It includes the ability to design and improve a system based on a quantitative and qualitative assessment of the system's functionality, usability and performance.

  • 1d: Proof checking. A proof is an argument justifying the correctness of a statement, typically a mathematical statement. In several areas of computer science, the ability to reason properly and develop proofs play a large role. Hence, we test the ability of students to develop simple proofs.

  • 1e: Recursion. Recursion is a problem solving technique where the solution to a computational problem depends on the solutions to smaller instances of the same problem.