CS2013-final-report

Data Abstraction and Data Structures, Miami University
Oxford OH
Gerald C. Gannod
gannodg@miamioh.edu
http://cs-comm.lib.muohio.edu/collections/show/3
Knowledge Areas that contain topics and learning outcomes covered in the course
Knowledge Area
Total Hours of Coverage
Software Development Fundamentals (SDF) 12 – core tier 1
Algorithms and Complexity (AL) 2 – core tier 1, 1 – core tier 2
Social Issues and Professional Practice (SP) 1 – core tier 1
Where does the course fit in your curriculum
The Data Abstraction and Data Structures course is numbered 274 in our program and thus it is expected that
students take this course in the second year of the program. Typically, students take this course in the first semester
of the Fall semester. The course is required and has two prerequisites (CS 2 and the discrete structures course).
What is covered in the course
This course is being used as an exemplar of how we incorporate communication outcomes into the core curriculum.
As such, the course description looks very much like other courses for data structures and the real difference is in the
execution of the course and how the communication skills are integrated into the assignments.
Course Description:
Abstract data types and their implementation as data structures using object-oriented programming. Use of objectoriented
principles in the selection and analysis of various ADT implementations. Sequential and linked storage
representations: lists, stacks, queues, and tables. Nonlinear data structures: trees and graphs. Recursion, sorting,
searching, and algorithm complexity.
• Apply appropriate data structures and abstract data types (ADT) such as bags, lists, stacks, queues, trees,
tables, and graphs in problem solving.
• Apply object-oriented principles of polymorphism, inheritance, and generic programming when
implementing ADTs for data structures.
• Create alternative representations of ADTs either from implementation or the standard libraries.
• Apply recursion as a problem solving technique.
• Determine appropriate ADTs and data structures for various sorting and searching algorithms.
• Determine time and space requirements of common sorting and searching algorithms.
Communication Assignments:
Examples of communication assignments for this course can be found at this site: http://cscomm.lib.muohio.edu/collections/show/3.
The assignments incorporate the use of workplace scenarios that provide
context for a programming assignment. Students are required to exercise communication skills in the reading and
writing of technical documentation in support of the technical products including the creation of test case
specifications and API documentation.
What is the format of the course
The course is taught using the flipped / inverted classroom model. In particular, the students view videos online
prior to coming to class, and then work on programming assignments in class. For the communication outcomes,
many of the learning activities are either performed in class as preparation for programming tasks, or as a
- 400 -