Certificate of Achievement (credit: usually 18 or more units) Computer Programming: Java
Stage 4
Data Analysis
| Data Shared With |
|
|---|---|
| Data Sharing Methods |
|
| Data Summary | Our advisory committee reviewed all of our certificates |
| Data Analysis | This certificate is still appropriate for students to get jobs |
| Next Steps Planned | No options chosen |
| Learning Outcomes | ALL |
Tentative Future Assessment Plans
| Assessment Term | Spring 2014 |
|---|---|
| Assessment Activities | Analysis and discussion of assessment data and next steps |
| Assessment Details | Review again next advisory committee meeting |
ILO Alignment and Assessment Plans
| I.A. Use reason and creativity... | A. Analyze a problem and interpret technical specifications to create and program appropriate algorithmic solutions that include the use of control structures, parameters and return values. B. Design and implement abstract data types using classes, encapsulation, inheritance and polymorphism C. Write Java code for client (interface) and implementation levels for array-based and linked data structures. D. Compare and contrast algorithms for efficiency. E. Predict the results of code using the data structures stacks, queues, trees, graphs, heaps, hash tables and priority queues with associated algorithms such as insertion, deletion, retrieval, search, and traversal. F. Write Unix commands to manipulate files, directories, their contents and their permissions. G. Write and implement Java programs that handle exceptions and events and use multithreading, collections and generics. H. Write multiple table database queries in SQL. |
|---|---|
| I.B. Apply diverse viewpoints... | A. Analyze a problem and interpret technical specifications to create and program appropriate algorithmic solutions that include the use of control structures, parameters and return values. B. Design and implement abstract data types using classes, encapsulation, inheritance and polymorphism C. Write Java code for client (interface) and implementation levels for array-based and linked data structures. D. Compare and contrast algorithms for efficiency. E. Predict the results of code using the data structures stacks, queues, trees, graphs, heaps, hash tables and priority queues with associated algorithms such as insertion, deletion, retrieval, search, and traversal. F. Write Unix commands to manipulate files, directories, their contents and their permissions. G. Write and implement Java programs that handle exceptions and events and use multithreading, collections and generics. H. Write multiple table database queries in SQL. |
| I.C. Locate, retrieve, and evaluate information... | A. Analyze a problem and interpret technical specifications to create and program appropriate algorithmic solutions that include the use of control structures, parameters and return values. B. Design and implement abstract data types using classes, encapsulation, inheritance and polymorphism C. Write Java code for client (interface) and implementation levels for array-based and linked data structures. D. Compare and contrast algorithms for efficiency. E. Predict the results of code using the data structures stacks, queues, trees, graphs, heaps, hash tables and priority queues with associated algorithms such as insertion, deletion, retrieval, search, and traversal. F. Write Unix commands to manipulate files, directories, their contents and their permissions. G. Write and implement Java programs that handle exceptions and events and use multithreading, collections and generics. H. Write multiple table database queries in SQL. |
| Fall 2013 ILO Assessment Plans | We don't currently plan to be conducting any program-level SLO assessments in Fall (as indicated earlier) |
SLO Details Storage Location
- ELECTRONIC COPY - In my electronic filing system (hard drive or web server)
- ELECTRONIC COPY - On a department web server or shared document system