Data Abstraction and Problem Solving with Java: Walls and Mirrors

International Edition

Häftad, Engelska, 2011

1 339 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This edition of Data Abstraction and Problem Solving with Java: Walls and Mirrors employs the analogies of Walls (data abstraction) and Mirrors (recursion) to teach Java programming design solutions, in a way that beginning students find accessible. The book has a student-friendly pedagogical approach that carefully accounts for the strengths and weaknesses of the Java language. With this book, students will gain a solid foundation in data abstraction, object-oriented programming, and other problem-solving techniques.

Produktinformation

Utgivningsdatum2011-02-23
Mått202 x 60 x 244 mm
Vikt1 800 g
FormatHäftad
SpråkEngelska
Antal sidor960
Upplaga3
FörlagPearson Education
ISBN9780273751205

Tillhör följande kategorier

Programmeringsböcker inom Data och it
Webbprogrammering inom Data och it

Preface xvChapter Dependency Chart xviiiPART ONE Problem-Solving Techniques 11 Review of Java Fundamentals 31.1 Language Basics 4Comments 4Identifiers and Keywords 4Variables 4Primitive Data Types 5References 6Literal Constants 6Named Constants 7Assignments and Expressions 8Arrays 111.2 Selection Statements 14The if Statement 15The switch Statement 161.3 Iteration Statements 17The while Statement 17The for Statement 18The do Statement 211.4 Program Structure 21Packages 22Classes 23Data Fields 24Methods 26How to Access Members of an Object 30Class Inheritance 301.5 Useful Java Classes 32The Object Class 32The Array Class 34String Classes 351.6 Java Exceptions 40Catching Exceptions 40Throwing Exceptions 471.7 Text Input and Output 49Input 49Output 51The Console Class 541.8 File Input and Output 56Text Files 58Object Serialization 66Summary 69 Cautions 72 Self-Test Exercises 72Exercises 73 Programming Problems 782 Principles of Programming and Software Engineering 812.1 Problem Solving and Software Engineering 82What Is Problem Solving? 82The Life Cycle of Software 83What Is a Good Solution? 932.2 Achieving an Object-Oriented Design 95Abstraction and Information Hiding 96Object-Oriented Design 98Functional Decomposition 100General Design Guidelines 101Modeling Object-Oriented Designs Using UML 102Advantages of an Object-Oriented Approach 1062.3 A Summary of Key Issues in Programming 107Modularity 107Modifiability 109Ease of Use 111Fail-Safe Programming 112Style 118Debugging 122Summary 125 Cautions 126 Self-Test Exercises 126Exercises 127 Programming Problems 1323 Recursion: The Mirrors 1373.1 Recursive Solutions 138A Recursive Valued Method: The Factorial of n 141A Recursive void Method: Writing a String Backward 1483.2 Counting Things 159Multiplying Rabbits (The Fibonacci Sequence) 159Organizing a Parade 161Mr. Spock’s Dilemma (Choosing k out of n Things) 1643.3 Searching an Array 166Finding the Largest Item in an Array 167Binary Search 168Finding the k th Smallest Item in an Array 1723.4 Organizing Data 176The Towers of Hanoi 1763.5 Recursion and Efficiency 180Summary 187 Cautions 187 Self-Test Exercises 188Exercises 189 Programming Problems 1954 Data Abstraction: The Walls 1974.1 Abstract Data Types 1984.2 Specifying ADTs 203The ADT List 204The ADT Sorted List 209Designing an ADT 211Axioms (Optional) 2154.3 Implementing ADTs 218Java Classes Revisited 219Java Interfaces 221Java Packages 224An Array-Based Implementation of the ADT List 226Summary 233 Cautions 233 Self-Test Exercises 234Exercises 235 Programming Problems 2385 Linked Lists 2415.1 Preliminaries 242Object References 242Resizeable Arrays 248Reference-Based Linked Lists 2495.2 Programming with Linked Lists 253Displaying the Contents of a Linked List 253Deleting a Specified Node from a Linked List 255Inserting a Node into a Specified Position of a Linked List 258A Reference-Based Implementation of the ADT List 264Comparing Array-Based and Reference-Based Implementations 268Passing a Linked List to a Method 271Processing Linked Lists Recursively 2715.3 Variations of the Linked List 277Tail References 277Circular Linked Lists 278Dummy Head Nodes 280Doubly Linked Lists 2805.4 Application: Maintaining an Inventory 2845.5 The Java Collections Framework 290Generics 291Iterators 292The Java Collection’s Framework List Interface 295Summary 298 Cautions 300 Self-Test Exe