COMPE 260
Data Structures and Object-Oriented Programming

Catalog Description

Data structures using object-oriented programming. Disciplined approach to design, coding, and testing using OOP. Teach use and implementation of data abstractions using data structures. Arrays, linked lists, stacks, queues, trees. Sorting, searching, recursive algorithms.

Credits: 3

Class Schedule: The class meets for two lectures a week, each lecture consisting of one hour and 15 minute session.

Prerequisites: COMPE 160 and Math 245.

Course Objectives          

  1. Introduce the data structures and algorithms using object-oriented concepts. Disciplined approach to design, coding, and testing using OOP. Abstract collections, sorting and searching, and recursion.
  2. Algorithm analysis – Big O notation.
  3. Analyze problems into abstract collections using data structures
  4. Write   documentation on the problem-solving tasks in the software artifact.
  5. Employ   abstract design concepts, data structures, and algorithms to solve problems.
  6. Perform   design and coding of data structures and algorithms
  7. Design modular and abstract classes and functions to apply data structures and algorithms.

Textbooks and References :

ADTs, Data Structures and Problem Solving with C++, by Larry Nyhoff                      

Topics Covered               

  1. Introduction to Software Design
  2. Introduction to Data Structures
  3. Data Structures and Abstract Data Types
  4.  Arrays
  5. Stacks
  6. Queues
  7. Classes
  8. Recursion, Algorithms
  9. Lists
  10. Binary Trees
  11. Sorting and Searching
  12. Polymorphism and Inheritance
  13. Graphs

Prepared by: Dr. Mahasweta Sarkar
Date of Preparation: 2/2/09