1. Data Structures, Algorithms, & Applications
Sartaj Sahni

2. What The Course Is About
Data structures is concerned with the representation and manipulation of data.
All programs manipulate data.
So, all programs represent data in some way.
Data manipulation requires an algorithm.
Data: Streets in a city. Mapquest.
Manipulation: Do something with the data. Add a new street. Close a street. Make a street one way. Find route from your home to nearest gas station. Input/output data.
Data representation: simple variables…int, float
array variables… int [], float []
Others to be studied in this course.
Algorithm…sequence of steps that results in the performance of a specific task (find nearest gas station to home).

3. What The Course Is About
Algorithm design methods needed to develop programs that do the data manipulation.
The study of data structures and algorithms is fundamental to Computer Science.
What we do in this course will be used in most of the follow-up courses you will take. Essential to become expert in what we do this semester. Else, you will be handicapped in later courses.

4. Prerequisites Java Asymptotic Complexity
Big Oh, Theta, and Omega notations
Java review … Chapter 1
Performance Analysis … Chapter 2
Asymptotic complexity … Chapter 3

5. Source Codes Read download and use instructions.
Must have Java 1.2 or higher.
See ProgramIndex.htm, AllNames.html and other html files produced by Javadoc for Java codes.

6. Grades
25% for assignments
25% for each test

7. Organization of Text Three parts Part I … Chapters 1-4, Background
Part 2 … Chapters 5-17, Data Structures
Part 3 … Chapters 18-22, Algorithms
Each chapter … concepts + applications