Dale - Computer Science Illuminated 302

Dale - Computer Science Illuminated 302 - useful collection...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Abstract Data Types and Algorithms Computer science is sometimes defined as the study of algorithms and their efficient implementation in a computer. The focus of this chapter is the definition of useful abstract objects for modeling information in a program and the algorithms that manipulate these objects. Just as a roll-top desk organizes data into cubby- holes, there are logical structures appropriate for representing different types of data in a program. We first look at the concept of an abstract data type (ADT), look at two distinct types of implementations, and then discuss a
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: useful collection of ADTs from the logical point of view. That is, we examine the operations on these objects at the logical level; we do not implement them in code. One of the abstract structures that we discuss in this chapter is the list . We develop algorithms for manipulating items in a list. Once these algorithms exist we can use them in any problem involving items in a list. Thus, the final implementation language is immaterial: We can stop the algorithm decomposition at the stage of manipulating the items in a list. 275 Chapter 9...
View Full Document

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online