UWMilwaukee

1
UW-Milwaukee

• Core Programming Curriculum

2
Prerequisites

• Math competency at the 105 level
• Some computer background preferred

3
Programming Sequence

• Optional (Unix basic machine architecture)
• CS140 Introduction to the Comp Sci Labs (1cr)
• CS150 Survey of Computer Science (3cr)
• Required (C)
• CS201 Introductory Computer Programming (3cr)
• CS251 Intermediate Computer Programming (4cr)
• CS351 Programming Data Structures (4cr)

4
Additional Courses

• CS315 Introduction to Computer Organization and
  Assembly Language Programming
• (CS201, Calc I)
• CS317 Discrete Information Structures
• (CS201, Calc I)
• CS431 Programming Languages Concepts
• (CS351)

5
CS 201

• Course is taught in C
• Only the C subset is really used
• Basic I/O
• Arithmetic/Logic statements
• Conditionals
• Functions
• Itetteration
• Arrays and Structs

6
CS201 cont.

• Taught as large lecture / small lab course
• Three four (40 80 student) lectures
• Eight twelve (15 20 student) labs
• Assessment
• Weekly quizzes, lab exercises and programming
  projects
• Three examinations
• Retention is in the 85 range

7
CS251

• Course is taught in C
• Topics
• Multiple file projects / Advanced compilation
• System tools
• Documentation / Debugging / Testing
• Class structure / design
• Abstract Data Types
• Standard Template Library

8
CS351

• Course is taught in C
• Topics
• Class inheritance and virtual functions
• Stack, Queues, and Lists
• Trees (representations and searching)
• Sorting and Hashing
• Graphs (representations and searching)

9
Texts

• CS201
• Friedman and Koffman. Problem solving,
  Abstraction, and design using C. Fourth
  edition.
• CS251
• Walter Savitch, Problem Solving with C, The
  Object of Programming. fifth edition.
• CS351
• Michael Main and Walter Savitch. Data Structures
  and Other Objects Using C. Second Edition

10
Testing

• Tests are designed to evaluate
• Knowledge of the language (syntax / semantics)
• Ability to follow run code
• Ability to solve problems (write code)
• Ability to model problems (data structures)
• Tests are written examinations given under
  regular class time constraints

11
New Ideas

• The development of a Pre-Major
• Only students with adequate preparation and
  aptitude should make it to the Major standing
• Forces students to take our courses in the
  roughly the logical order in which we designed
  them to be taken
• Frees upper division courses from having to
  excessively review or repeat topics which are
  covered elsewhere
• Allows department to have more control over GPA
  requirement

12
New Courses

• Looking at adding both Databases and Networking
  to the required Major list of courses
• Looking into developing both service and
  mid-level courses in the areas of Data / Network
  Security Web Development
• Campus needs are also being investigated