This page collects together all of the “outcomes” associated with individual modules. Outcomes identify what students will know and be able to do if they master the material.
Students mastering the material in this course will achieve the following student learning outcomes for the ICS undergraduate degree program:
The student will:
Referencing modules: Final Exam, Midterm Exam 1, Simple Sorting Algorithms, Midterm Exam 2, Java Review
The student will:
Referencing modules: Final Exam, OOP and Class Hierarchies, Midterm Exam 1, Simple Sorting Algorithms, Midterm Exam 2
The student will:
Referencing modules: Final Exam, Big-O Notation, Midterm Exam 1, Midterm Exam 2
The student will:
Distinguish between and implement O(n2) sorting algorithms.
Distinguish between and implement O(nlogn) sorting algorithms.
Referencing modules: Final Exam, Midterm Exam 1, Simple Sorting Algorithms, Complex Sorting Algorithms, Midterm Exam 2
The student will:
Use Arrays as the underlying data structure for different ADT implementations.
Explain the trade-offs between an array vs. Linked implementation of the ADTs.
Referencing modules: Final Exam, Midterm Exam 1, Simple Sorting Algorithms, Complex Sorting Algorithms, Midterm Exam 2
The student will:
Develop abstract data types.
Use appropriate data encapsulation and information hiding.
Choose, design and develop appropriate tests for their Java code.
Referencing modules: Simple Sorting Algorithms
The student will:
Understand White and Black box testing.
Choose, design and develop appropriate tests for their Java code.
Referencing modules: Simple Sorting Algorithms
The student will:
Implement two different versions of the List interface.
Explain the trade-offs between the two different implementations.
Referencing modules: Final Exam, Hash Tables, Midterm Exam 1, Midterm Exam 2, Lists
The student will:
Describe the different Java collection classes.
Explain and compare the basics of memory management in different implementations.
Referencing modules: Midterm Exam 1, Midterm Exam 2, Lists
The student will:
Implement several different versions of the Iterator interface.
Implement several different versions of the Iterable interface.
Explain the trade-offs between the different implementations.
Referencing modules: Lists
The student will:
Explain standard interface for a Stack.
Implement two different versions of the Stack interface.
Compare the trade-offs between the two different implementations.
Referencing modules: Final Exam, Stacks, Midterm Exam 2
The student will:
Explain the differences between prefix, infix and postfix notation.
Implement code to process prefix, infix and postfix equations.
Compare the trade-offs between the notations.
Referencing modules: Final Exam, Stacks, Midterm Exam 2
The student will:
Referencing modules: RadGrad
The student will:
Implement several different versions of the Queue interface.
Compare the trade-offs between the two different implementations.
Referencing modules: Queues, Final Exam, Midterm Exam 2
The student will:
Use recursive algorithms to solve different problems.
Write correct recursive Java code to solve different problems.
Referencing modules: Trees, Final Exam, Recursion, Midterm Exam 2
The student will:
Explain the standard structure of a Tree.
Implement binary trees.
Implement binary search trees.
Implement a Heap.
Referencing modules: Trees, Final Exam
The student will:
Explain the differences between pre-order, in-order and post-order traversals.
Implement code to conduct pre-order, in-order and post-order traversals of binary trees.
Referencing modules: Trees, Final Exam
The student will:
Implement two different versions of the Hash Map interface, open addressing and chaining.
Explain the trade-offs between the two different implementations.
Referencing modules: Final Exam, Hash Tables
The student will:
Explain and implement the binary and linear search algorithms.
Compare, contrast and implement pre-order, in-order, and post-order binary tree traversal.
Referencing modules: Final Exam
The student will:
Referencing modules: Welcome to ICS 211