Data structures such as lists, stacks, queues, and trees. An introduction to recursive programming. Sorting and searching. Prerequesites: CSC 170, MPG 4, and one of MAT 122, MAT 145, or MAT 171.
| Instructor: | James Moen | |
| Email: | moen@augsburg.edu | |
| Phone: | 612 330-1142 | |
| Office: | Sverdrup 203F | |
| Office Hours:     | 1:30-2:30 PM Monday, Wednesday   4:30-5:30 PM Thursday   | |
| Classroom: | Sverdrup 204 | |
| Classroom Hours: | 8:00 AM to 12:00 PM Saturday | |
| Laboratory: | Sverdrup 204 | |
| Laboratory Hours: | 1:00-2:30 PM Saturday |
I'm often in my office at other times during the day, not just during my regular office hours. You may visit my office (almost) any time I am there. You may also send email at any time. After the Spring Day term is over on April 28, I will be in my office much less often, and I will hold office hours by appointment only.
Nell Dale, Daniel T. Joyce, & Chip Weems. Object-Oriented Data Structures Using Java. Jones and Bartlett Publishers, Sudbury, Massachusetts. 2002. (ISBN 0-7637-1079-2)
I'll assign homework at the end of every class. It will be due at the beginning of the following class. You may be able to finish your homework during the scheduled laboratory time, but if not, you must finish it outside of class. All homework submissions are final. I hand out answers to homework after it's turned in, so I can't accept late assignments. Sorry.
Each homework assignment will involve writing a program in the programming language Java. You must turn in a listing of your program, and a copy of the actual output printed by your program. Your programs will be graded both on correctness (are they free of errors?) and on style (are they easy to understand?).
If you turn in homework by email, you must attach it as an ordinary text file. Please don't use proprietary file formats (like Microsoft Word). My computer can't read them.
There will be two examinations in this course: a one-hour midterm and a two-hour final. Examinations will be ``open book,'' so you will be able to use your textbook and your class notes to help you answer questions. See the schedule for (approximate) dates.
I'll assign points for each homework assignment and examination. Your final grade will be based on the number of points you get during the term. About 60% of your grade will be determined by homework, and about 40% will be determined by examinations.
Students are expected to be familiar with Augsburg College's policies on academic honesty. You will be required to sign a statement indicating that you understand these policies. Although you may exchange ideas with other students, everything you turn in must be your own work. Copying assignments, or parts of assignments, is not permitted!
This schedule is approximate. I may change it during the term. I won't always follow the textbook exactly. Instead, I'll use it as outside reading to supplement the lectures.
|   | April 8   | Chapter 2, 3   | Abstract data types. Unsorted lists. Sorted lists.   |
|   | April 22   | Chapter 4   | Stacks and queues.   |
|   | April 29   | Chapter 5   | Linked data structures.   |
|   | May 13   | Chapter 6   | Midterm examination. Linked data structures.   |
|   | May 20   | Chapter 7, 8   | Recursion. Trees. Binary search trees.   |
|   | June 3   | Chapter 8, 10   | Binary Search Trees. Sorting and searching.   |
|   | June 17   |   | Final examination.   |