Computer Science University of Tulsa                                 Last updated Nov. 1, 2008

Mapping Course Content to Program Outcomes 1-5

 

Courses

Program Outcome 1

Program Outcome 2

Program Outcome 3

Program Outcome 4

Program Outcome 5

 

Graduating seniors will have an understanding of the fundamental concepts of computer science including algorithms and data structures

Graduating seniors will have an understanding of the fundamental principles of discrete mathematics 

 

Graduating seniors  will have an understanding of the modern computer systems

Graduating seniors will have an understanding of the fundamental principles of programming languages

Graduating seniors will be proficient in an object oriented programming language

CS 2001

Computing and Eng. Ethics

 

 

 

 

 

CS 2003

Intro Data

structures Algorithms

1.Fundamentals

   of data  structures

2. Applications

   of  data  structures

3.Fundamentals

   of Algorithm

   Analysis

 

 

1.  Fundamentals of Object Oriented programming concepts

1. Program

   documentation

2.  Modularity

3.  Use of objects

4.  Proper Indentation

5.  Best use of Constructs

6.  Program  correctness

CS 2033

Computer Architecture, Organization and Assembler

 

 

1.  Knowledge of

     Programming

     Systems

2.  System design

     Principles

3.  Architecture

     Principles

4.  Theory

 

 

CS 2123

Data Structures

1.Fundamentals

  of Data structures

2. Algorithm

    Analysis

3.Applications

  of Algorithms

4.Game Theory

   Fundamentals

5.Proofs  (Theory)

 

 

1. Object Oriented Support:

   Abstraction, Polymorphism, Inheritance, Interfaces, etc.

 

1. Object Oriented Support:

   Abstraction, Polymorphism, Inheritance, Interfaces, etc.

 3.  Algorithm Implementation.

4.  Program Correctness

5.  Program Readability including documentation.

CS 3003

Comparative Programming Languages

 

 

 

1. Language

    terms and

    definitions

2.  Fundamental

     concepts of 

     languages

3. Language

     applications

4.  Language

    design issues

 

CS 3013

Discrete Math

1 Fundamentals

 of Graph Algorithms

2. Applications

    of Graph Theory

1. Set Theory

    Fundamentals

2. Understanding

     Permutations,

    Combinations

    and Counting

3. Use

    Mathematical

    Inductive   proof

4. Fundamentals

    of Graph Theory

5. Applications

    of Graph Theory

6. Fundamentals

    of Truth/Logic

 

 

 

CS 3053

Operating

Systems

1.  Various algorithms associated with Operating Systems

 

 
1. Computer
    Architecture
2. Process
    Management
3 .Memory  
    Management
4 .File Systems

 

 

1. Object Oriented Support:

   Abstraction, Polymorphism, Inheritance, Interfaces, etc.

2. Individual Development of a large program: Modularity

3.  Systems Integration of user’s code.

4.  Scalability test

5.  Program Readability

CS 4013

Compilers

 

 

 

1.  Language theory to practice: Algorithm Implementation.

 

1. Object Oriented Support:

   Abstraction, Polymorphism, Inheritance, Interfaces, etc.

2. Individual Development of a very large program: Modularity

3.  Language theory to practice: Algorithm Implementation.

4.  Program Readability

5.  Program Correctness

 

CS 4163

Database Systems

1. Applications of data structures to modeling of data

 

 

1. Understand the relational Data Model

2. Model data using Entry-Relational Diagram

3.  Model data using relational normalization theory

4.  Set up database using a modern DBMS

5. Query a database using a modern DBMS

 

 

CS 4503 Senior Projects 1

 

 

 

 

 

CS 4513 Senior Projects 2

 

 

 

 

1. Object Oriented Support:

   Abstraction, Polymorphism, Inheritance, Interfaces, etc.

2. Group Development of a very large program: Modularity

3.  Program Readability

4.  Program Correctness