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.
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.
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.
Variables
Expressions
Looping
Branching
Exceptions
Methods / Subroutines / Functions
Classes, Interfaces and Inheritance
Graphical User Interfaces
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.
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.
The student will:
Referencing modules: Names and Things, Midterm
Assessed by: Q04: Java Types
The student will:
Referencing modules: Names and Things, Subroutines, Midterm
Assessed by: Q05: Java operators
The student will:
Referencing modules: Control, Midterm
Assessed by: Q08: Loops, Q22: For-each
The student will:
Referencing modules: Control, Midterm
Assessed by: Q09: Branching
The student will:
Referencing modules: Control, Midterm
Assessed by: Q10: Exceptions
The student will:
Referencing modules: Subroutines
Assessed by: Q11: Static Subroutines, Q12: Parameters, Q13: Write a Function, Q14: Write a Function
The student will:
Referencing modules: Names and Things, Objects and Classes, Introduction to GUI programming, Arrays and ArrayLists
Assessed by: Q06: TextIO class, Q15: Classes and Objects, Q16: Creating Classes, Q17: Classes, Q18: Interfaces, Q23: ArrayList,
The student will:
Referencing modules: Introduction to GUI programming
Assessed by: Q19: Basic GUI classes., Q20: paintComponent, Q21: Java Layout Management,
The student will:
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., H03: Simulate a pair of dice., H04: Processing a file., Q07: Algorithms, Q08: Loops, Q09: Branching, Q10: Exceptions, H05: Simulate a pair of dice, H06: Hexidecimal Addition Quiz, Q11: Static Subroutines, Q12: Parameters, Q13: Write a Function, Q14: Write a Function, Midterm, H07: Two-Dice Pig Game, H08: Addition Quiz with classes., H09: Graphical Pair of Dice, H10: Graphical Two Dice Pig, Q21: Java Layout Management, H11: Arrays and ArrayLists, Q22: For-each, Q24: Searching and Sorting, Final Exam
The student will:
Referencing modules: Midterm, Recursion, 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, Q25: Recursion, Q26: Recursion, Final Exam
The student will:
Referencing modules: Java Environment
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,
The student will:
Referencing modules: Computer Fundamentals, Names and Things, Midterm, Final Exam
Assessed by: Q02: Computer languages, Q03: Syntax vs. Semantics, Midterm, Final Exam
The student will:
Referencing modules: Java Environment
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,
The student will:
Referencing modules: Introduction to ICS 111, Midterm, Final Exam
Assessed by: Q01: Practice Quiz, Midterm, Final Grade Assessment, Final Exam