| |
Student Learning Outcomes |
Student Learning Outcomes (SLO) is a means to determine what students know, think, feel or do as a result of a given learning experience.
Learn more about SLO.
• Mathematics
- 50
- 51
- 51A
- 51B
- 61
- 71
- 71A
- 71B
- 71X
- 96
- 100
- 110
- 110H
- 120
- 130
- 140
- 150
- 160
- 180
- 181
- 210
- 280
- 285
•
• Computer Science
- 110
- 140
- 145
- 150
- 170
- 190
- 210
- 220
- 230
•
Computer Science
CSCI 110
- Students will be able to use and differentiate between basic concepts of computer hardware and software.
- Students will be able to use data representation for the fundamental data types and perform conversions between binary-hexadecimal-decimal representations.
- Students will be able to read, understand and trace the execution of programs written in C language.
- For a given algorithm students will be able to write the C code using a modular approach.
CSCI 140
- Students will be able to analyze problems and design algorithms in pseudo code.
- Students will be able to read, understand and trace the execution of programs written in C++ language.
- Students will be able to use given classes and virtual functions in a class hierarchy to create new derived classes and the code that uses them.
- For a given algorithm students will be able to write modular C++ code using classes in an OOP approach.
CSCI 145
- Students will be able to analyze problems and design appropriate algorithms.
- Students will be able to code provided algorithms using Java language.
- Students will be able to provide code for a Java class given objects’ attributes and behaviors.
- Students will be able to use existing Java classes to perform required tasks.
CSCI 150
- Students will be able to manipulate data at the bit and byte levels.
- Students will be able to identify the components of a computer and the organization of those components.
- Students will be able to describe disk storage systems and file systems.
- Students will be able to use assembly language instructions to write small programs.
CSCI 170
- Students will be able do basic UNIX OS administration tasks, including account management.
- Students will be able to use the Unix file system
- Students will be able to perform basic UNIX networking tasks including setting up a LAN using NIS
- Students will be able to use Unix programming tools: compilers, Make utility, debugger, profiler, version control.
- Students will be able to read-understand-write short scripts in a Unix shell.
CSCI 190
- Students will be able to use truth table for propositional calculus.
- Students will be able to use math induction and recursive definitions and algorithms.
- Students will be able to understand the terminology of finite graphs and trees and use the basic algorithms for traversal, shortest path, graph coloring.
- Students will be able to use basic counting techniques, combinatorics concepts and binomial coefficients.
CSCI 210
- Students will be able to use Boolean algebra for algebraic simplification.
- Students will be able to use truth tables, maps, and tabular reduction methods in combinational network design.
- Students will be able to use state tables and diagrams in sequential network design.
- Students will be able to differentiate between combinational and sequential logic networks.
CSCI 220
- Students will be able to analyze problems and select the appropriate data structure.
- Students will be able to estimate running time given an algorithm.
- Students will be able to implement and use linear data structures including sets, stacks, queues, and lists.
- Students will be able to implement and use trees including binary tree, binary search trees, and heaps.
CSCI 230
- Students will be able to implement efficient searching techniques including hash tables and skip lists.
- Students will be able to implement and analyze running time for various sorting algorithms.
- Students will be able to represent graphs and implement well-known graph algorithms.
- Students will be able to differentiate the costs between memory access and disk access.
| |
| |