CS 240-241 ASSESSMENT COORDINATION MEETING

April 23, 2009

MINUTES

Present: Soroka, Srinivas, Tang

Moderator: Soroka

TEXT

We decided to continue with:

Michael Main,
Data Structures and Other Objects Using Java.
Third Edition.
Boston: Pearson Addison-Wesley, 2006.
isbn 0-321-37525-4

All instructors rely heavily on their own notes for guiding the course, but none of us has developed a proto-text for the course.

COURSE OUTCOMES

For CS 241, Course Outcome 8 will be changed to “B-trees and other generalized tree structures.”

Recursion in CS 240 involves linked lists. Recursion in CS 241 involves trees and graphs.

For sorting, Srinivas teaches selection sort, heap sort, merge sort, and quicksort. He asks the students to run benchmarks to test the speeds of these algorithms.

PROGRAM OUTCOMES

We are using the College of Science mastery levels:

I Students are introduced to the outcome.

D Students have the opportunity to further develop the outcome.

M Students can demonstrate mastery at the exit level.

A Evidence is collected and evaluated for program-level assessment.

Here’s how CS 240-241 support our Program Outcomes:

CS 240-241 / Program Outcome
D,A / (a) An ability to apply knowledge of computing and mathematics appropriate to the discipline.
I,A / (b) An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution.
D,A / (c) An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs.
(d) An ability to function effectively on teams to accomplish a common goal.
(e) An understanding of professional, ethical, legal, security and social issues and responsibilities.
(f) An ability to communicate effectively with a range of audiences.
(g) An ability to analyze the local and global impact of computing on individuals, organizations, and society.
I / (h) Recognition of the need for and an ability to engage in continuing professional development.
D,A / (i) An ability to use current techniques, skills, and tools necessary for computing practice.
I,A / (j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices.
D,A / (k) An ability to apply design and development principles in the construction of software systems of varying complexity.

OTHER DISCUSSION

241 is the appropriate place in the curriculum to introduce trees and graphs. Trees and graphs are not appropriate for CS 130 because the students can only learn definitions and practice toy problems; they are not yet able to appreciate how trees and graphs are implemented in software and how algorithms are programmed.

Srinivas and Soroka are impressed by the coverage of CS 240-241 material in Wikipedia. Often, Wikipedia presents a better discussion than the textbook. Students should be encouraged to explore CS 240-241 topics in Wikipedia.

C:\1\cf\assessment\website\minutes\minutes_240-241_090423.doc 1 / 2