SDEV 220 - Elementary Data Structures

Credits: 5
A continuation of SDEV 219 emphasizing concepts of data abstraction and encapsulation. Topics include inheritance, interfaces, generics, collections, and the implementation of linked lists and binary search trees. Previously IT 220.

Prerequisite: SDEV 219 with a grade of 2.0 or higher; or instructor’s permission.

Course Outcomes:
Students who successfully complete this class will be able to:

Create a class that is derived from another class, inheriting fields and methods from the superclass, and overriding methods in the subclass.
Demonstrate the concept of polymorphism by defining unique behaviors in subclasses of a class while sharing some of the same functionality of the parent class.
Define, implement, and use an interface.
Invoke and instantiate a generic type.
Use essential classes such as exceptions and basic I/O.
Implement and manipulate elementary data structures: linked lists, stacks, and queues.
Implement a binary search tree data structure and its recursive operations.

Program Outcomes

Develop stable, robust, secure, and efficient code following best practices in database design and software construction.
Solve data-related problems using a programming language.

College-wide Outcomes

Quantitative and Symbolic Reasoning - Quantitative Reasoning encompasses abilities necessary for a student to become literate in today’s technological world. Quantitative reasoning begins with basic skills and extends to problem solving.