INSTRUCTORS MANUAL - WITH SOLUTIONS FOR DATA ABSTRACTION AND PROBLEM...

INSTRUCTOR’S MANUAL

WITH SOLUTIONS FOR

DATA ABSTRACTION AND

PROBLEM SOLVING

WITH JAVA

WALLS AND MIRRORS

Third Edition Janet J. Prichard Frank M. Carrano 1 / 4

IM with Solutions to Accompany Data Abstraction and Problem Solving with Java: Walls and Mirrors, Second Edition 3 Copyright © 2006 Pearson Education Addison-Wesley. All rights reserved. 0-321-39014-8

INTRODUCTION

This instructor’s guide, which supplements Data Abstraction and Problem Solving with Java: Walls and

Mirrors, is organized as follows:

Three Possible Courses Based on Walls and Mirrors. We begin by offering suggestions for how to use Walls and Mirrors in your course. The book’s flexibility will allow you to use it in a variety of situations.

Solutions to Exercises. The solutions to the end-of-chapter exercises are included in this section.

Reminder: All Java code that appears in the book is available online. Please consult the preface of the book for further details.

• / 4

IM with Solutions to Accompany Data Abstraction and Problem Solving with Java: Walls and Mirrors, Second Edition 4 Copyright © 2006 Pearson Education Addison-Wesley. All rights reserved. 0-321-39014-8

THREE POSSIBLE COURSES BASED ON

WALLS AND MIRRORS

By appropriately choosing which parts of the book to emphasize, you can easily tailor the material to fit your particular curriculum. Although the suggested courses presented here cover material in the order in which it appears in the book, variations are possible. The book’s preface provides details about the orders in which you can cover chapters. With this flexibility in mind, here are three possible courses based on this book.

A Second Course in Computer Science

If your introductory course emphasizes structured programming and introduces recursion, students can review most of the first two chapters on their own. On the other hand, if the introductory course manages to cover only the basics of a programming language, you should devote a fair amount of class time to Chapters 2 and 3. If your students do not know Java, you may need to devote some class time to the coverage of Appendix A, which reviews Java.

The course should cover the material through Chapter 11, at least. You can select topics from Chapters 12 through 15, as time permits. You can cover many topics within these chapters in any order.

Possible Syllabus for a Second Course in Computer Science Week Topic Chapter

• Review of programming principles

Review of recursion 2 3

• Data abstraction 4
• Data abstraction 4 (Cont.)
• Linked lists 5
• Linked lists 5 (Cont.)
• Recursion 6
• Stacks 7
• Stacks

Queues

• (Cont.)

8

• Queues

Class relationships

• (Cont.)

9 10 Class relationships 9 (Cont.) 11 Efficiency and sorting 10 12 Efficiency and sorting Trees 10 (Cont.) 11 13 Trees 11 (Cont.) 14 Tables and priority queues 12 15-16 Selected advanced topics 13-15

• / 4

IM with Solutions to Accompany Data Abstraction and Problem Solving with Java: Walls and Mirrors, Second Edition 5 Copyright © 2006 Pearson Education Addison-Wesley. All rights reserved. 0-321-39014-8

Lower-Division Data Structures Courses

At many schools, the primary undergraduate data structures course comes early in the curriculum. You can use this book in such a course by giving high priority to the material in Chapter 4 and Chapters 7 through 15. This means that you should spend as little time as possible on Chapter 2, and you may even find it necessary to omit some of the material on recursion. You should assign projects, such as the ones suggested in Chapter 13, in which students implement 2-3 trees or hashing.

Possible Syllabus for a Lower-Division Data Structures Course Week Topic Chapter

• Review of programming principles

Review of recursion 2 3

• Data abstraction 4
• Linked lists 5
• Recursion 6
• Stacks 7
• Stacks

Queues

• (Cont.)

8

• Queues

Class relationships

• (Cont.)

9

• Efficiency and sorting 10
• Trees 11

10 Trees Tables 11 (Cont.) 12 11 Priority queues and heaps 12 (Cont.) 12 Balanced search trees 13 13 Hashing 13 (Cont.) 14 Multiple organizations Graphs 13 (Cont.) 14 15 Graphs External sorting 14 (Cont.) 15 16 External searching 15 (Cont.)

• / 4