Learning Outcomes

This page presents course-level and module-level outcomes. Outcomes identify what students will know and be able to do if they master the material.

Articulated Student Learning Outcomes

Use an appropriate programming environment to design, code, compile, run and debug computer programs.
Demonstrate basic problem solving skills: analyzing problems, modeling a problem as a system of objects, creating algorithms, and implementing models and algorithms in an object-oriented computer language (classes, objects, methods with parameters, abstract classes, interfaces, inheritance and polymorphism).
Illustrate basic programming concepts such as program flow and syntax of a high-level general purpose language.
Demonstrate working with primitive data types, strings and arrays.

Course Specific Student Learning Outcomes

Understand the goals, structures, and procedures for learning in ICS 111.
Understand the fundamentals how a computer works.
To learn how to take a problem, figure out the algorithm to solve it, the write the code.
To learn basics of programming with a modern programming language, Java.
Understand how to install and use a good Java development environment.
To learn how to produce robust programs in Java using exception handling and extensive program testing.

BS Program Student Outcomes

An ability to apply mathematical foundations, algorithmic principles, and computer science theory to the modeling and design of computer-based systems.
An ability to define the computing requirements of a problem and to design appropriate solutions based on established design principles and with an understanding of the tradeoffs involved in design choices.
An ability to use sound development principles to implement computer-based and software systems of varying complexity, and to evaluate such systems.
An ability to use current techniques, skills, and tools necessary for computing practice.

SO: Apply mathematical foundations

ABET

Demonstrate an ability to apply mathematical foundations, algorithmic principles, and computer science theory to the modeling and design of computer-based systems.

Referencing modules: Final Exam

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., H03: Simulate a pair of dice., H04: Processing a file., H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, Midterm, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists, Final Exam

SO: Define Computing Requirements

ABET

Demonstrate an ability to define the computing requirements of a problem and to design appropriate solutions based on established design principles and with an understanding of the tradeoffs involved in design choices.

Referencing modules: Final Exam

SO: Use Sound Development Principles

ABET

Demonstrate an ability to use sound development principles to implement computer-based and software systems of varying complexity, and to evaluate such systems.

Referencing modules: Final Exam

SLO: Problem Solving

Articulated

Demonstrate basic problem solving skills: analyzing problems, modeling a problem as a system of objects, creating algorithms, and implementing models and algorithms in an object-oriented computer language (classes, objects, methods with parameters, abstract classes, interfaces, inheritance and polymorphism).

The student will:

Be able to deconstruct problems into models, to develop algorithms, and to implement the models and algorithms in program code.

Referencing modules: Final Exam

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., H03: Simulate a pair of dice., H04: Processing a file., Q07: Algorithms, H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, Midterm, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists, Final Exam

SLO: Program Flow and Syntax

Articulated

Illustrate basic programming concepts such as program flow and syntax of a high-level general purpose language.

The student will:

Demonstrate how the computer steps through the program code, following the execution through methods, conditions and loops.
Follow a coding style while developing their code.
Properly document their code.

Referencing modules: Final Exam

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., H03: Simulate a pair of dice., H04: Processing a file., H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, Q11: Static Subroutines, Q12: Parameters, Midterm, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists, Final Exam

SLO: Relationships and Languages

Articulated

Identify relationships between computer systems programming and programming languages.

The student will:

Understand the hardware (binary numbers, character encoding, Boolean logic) and basic computer system architecture concepts.
Understand system software and virtual machine concepts.
Describe the concepts of program compilation and translation to machine code.

Referencing modules: Final Exam

Assessed by: Q02: Computer languages, Q03: Syntax vs. Semantics, Midterm, Final Exam

SLO: Primitive Data Types

Articulated

Demonstrate working with primitive data types, strings and arrays.

The student will:

Be able to develop simple data structures in object oriented form.
Understand primitive types
- Know their accuracy and memory requirements
- Be able to declare and initialize variables
- Demonstrate knowledge of integral arithmetic including mod
- Explain casting and differentiate between implicit and explicit casting.
Use Strings
Use Arrays

Referencing modules: Final Exam

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., Q04: Java Types, H03: Simulate a pair of dice., H04: Processing a file., H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, Midterm, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists, Final Exam

Translate a problem to code

To learn how to take a problem, figure out the algorithm to solve it, the write the code.

The student will:

Be able to deconstruct problems to develop algorithms and eventually program code.

Referencing modules: Names and Things, Control, Subroutines, Midterm, Objects and Classes, Introduction to GUI programming, Arrays and ArrayLists, Recursion, Final Exam

Understand Java

To learn basics of programming with a modern programming language, Java.

The student will:

Design, develop and test Java programs using classes, methods, conditionals, loops, etc.
Be able to develop simple data structures in object oriented form.

Referencing modules: Names and Things, Control, Subroutines, Midterm, Objects and Classes, Introduction to GUI programming, Arrays and ArrayLists, Recursion, Final Exam

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., Q04: Java Types, Q05: Java operators, Q06: TextIO class, H03: Simulate a pair of dice., H04: Processing a file., H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, Q11: Static Subroutines, Q12: Parameters, Midterm, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., Q15: Classes and Objects, H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists, Final Exam

Program in Java

To learn how to produce robust programs in Java using exception handling and extensive program testing.

The student will:

Develop substantial Java programs, when appropriate reusing previously created classes, writing programs requiring three or more classes.

Referencing modules: Names and Things, Control, Subroutines, Objects and Classes, Introduction to GUI programming, Arrays and ArrayLists, Recursion

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., H03: Simulate a pair of dice., H04: Processing a file., H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists,

Understand the fundamentals of computers

Understand the fundamentals how a computer works.

The student will:

Understand the fetch - decode - execute cycle.
Know and be able to describe the difference between Machine Language and High-level Programming Languages.
Know the difference between compiled and interpreted code.

Referencing modules: Computer Fundamentals, Midterm, Final Exam

Assessed by: Q02: Computer languages, Midterm, Final Exam

Employ a good Java development environment

Understand how to install and use a good Java development environment.

The student will:

Install the Java Development Kit on their laptop/computer.
Install an IDE on their laptop/computer.
Demonstrate developing a simple Java application.

Referencing modules: Java Environment, Names and Things, Control, Subroutines, Objects and Classes, Introduction to GUI programming, Arrays and ArrayLists, Recursion

Assessed by: H01: Simulate different types of dice., H02: Calculate Change., H03: Simulate a pair of dice., H04: Processing a file., H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, H11: Arrays and ArrayLists,

Understand course structure

Understand the goals, structures, and procedures for learning in ICS 111.

The student will:

Know the flow of the course.
Know how the grades will be calculated.
Know where to get information about the course.

Referencing modules: Introduction to ICS 111

Assessed by: Q01: Practice Quiz, Final Grade Assessment