基本信息
- 原书名：Introduction to Java Programming, Comprehensive (8th Edition)
- 原出版社： Prentice Hall
内容简介
书籍
计算机书籍
《Java语言程序设计：基础篇（英文版第8版）》是Java语言的经典教材，多年来畅销不衰。本书全面整合了Java 6的特性，采用“基础优先，问题驱动”的教学方式，循序渐进地介绍了程序设计基础、解决问题的方法、面向对象程序设计、图形用户界面设计、异常处理、I/O和递归等内容。此外，本书还全面且深入地覆盖了一些高级主题，包括算法和数据结构、多线程、网络、国际化、高级GUI等内容。
《Java语言程序设计：基础篇（英文版第8版）》影印版由《Java语言程序设计 基础篇》和《Java语言程序设计 进阶篇》组成。基础篇对应原书的第1～20章，进阶篇对应原书的第21～37章。
《Java语言程序设计：基础篇（英文版第8版）》特点
基础篇介绍基础内容，进阶篇介绍高级内容，便于教师按需选择理想的教材。
全面整合了Java6的特性，对全书的内容进行了修订和更新，以反映Java程序设计方面的最新技术发展。
对面向对象程序设计进行了深入论述，包含GUI程序设计的基础和扩展实例。
提供的大量实例中都包括了对问题求解的详细步骤，很多实例都是随着Java技术的引入不断地进行增强，这种循序渐进的讲解方式更易于学生学习。
较上一版增加了大量难易程度不同的习题，同时在作者的网站http://www.cs.armstrong.edu/liang/intro8e/index.html 中还提供了很多自测题。
为满足对Web设计有浓厚兴趣的同学，本版在配套网站上增加了第38～48章的内容，以提供更多的相关信息。
计算机书籍
《Java语言程序设计：基础篇（英文版第8版）》是Java语言的经典教材，多年来畅销不衰。本书全面整合了Java 6的特性，采用“基础优先，问题驱动”的教学方式，循序渐进地介绍了程序设计基础、解决问题的方法、面向对象程序设计、图形用户界面设计、异常处理、I/O和递归等内容。此外，本书还全面且深入地覆盖了一些高级主题，包括算法和数据结构、多线程、网络、国际化、高级GUI等内容。
《Java语言程序设计：基础篇（英文版第8版）》影印版由《Java语言程序设计 基础篇》和《Java语言程序设计 进阶篇》组成。基础篇对应原书的第1～20章，进阶篇对应原书的第21～37章。
《Java语言程序设计：基础篇（英文版第8版）》特点
基础篇介绍基础内容，进阶篇介绍高级内容，便于教师按需选择理想的教材。
全面整合了Java6的特性，对全书的内容进行了修订和更新，以反映Java程序设计方面的最新技术发展。
对面向对象程序设计进行了深入论述，包含GUI程序设计的基础和扩展实例。
提供的大量实例中都包括了对问题求解的详细步骤，很多实例都是随着Java技术的引入不断地进行增强，这种循序渐进的讲解方式更易于学生学习。
较上一版增加了大量难易程度不同的习题，同时在作者的网站http://www.cs.armstrong.edu/liang/intro8e/index.html 中还提供了很多自测题。
为满足对Web设计有浓厚兴趣的同学，本版在配套网站上增加了第38～48章的内容，以提供更多的相关信息。
作译者
Y. Daniel Liang 普度大学终身教授，阿姆斯特朗亚特兰大州立大学计算机科学系教授。他所编写的Java教程在美国大学Java课程中采用率极高，同时他还兼任Prentice Hall Java系列丛书的编辑。
目录
《Java语言程序设计：基础篇（英文版.第8版）》
Chapter 1 Introduction to Computers,Programs,and Java
Chapter 2 Elementary Programming
Chapter 3 Selections
Chapter 4 Loops
Chapter 5 Methods
Chapter 6 Single-Dimensional Arrays
Chapter 7 Multidimensional Arrays
Chapter 8 Objects and Classes
Chapter 9 Strings and Text I/O
Chapter 10 Thinking in Objects
Chapter 11 Inheritance and Polymorphism
Chapter 12 Gui Basics
Chapter 13 Exception Handling
Chapter 14 Abstract Classes and Interfaces
Chapter 15 Graphics
Chapter 16 Event-Driven Programming
Chapter 17 Creating Graphical User Interfaces
Chapter 18 Applets and Multimedia
Chapter 19 Binary I/O
Chapter 1 Introduction to Computers,Programs,and Java
Chapter 2 Elementary Programming
Chapter 3 Selections
Chapter 4 Loops
Chapter 5 Methods
Chapter 6 Single-Dimensional Arrays
Chapter 7 Multidimensional Arrays
Chapter 8 Objects and Classes
Chapter 9 Strings and Text I/O
Chapter 10 Thinking in Objects
Chapter 11 Inheritance and Polymorphism
Chapter 12 Gui Basics
Chapter 13 Exception Handling
Chapter 14 Abstract Classes and Interfaces
Chapter 15 Graphics
Chapter 16 Event-Driven Programming
Chapter 17 Creating Graphical User Interfaces
Chapter 18 Applets and Multimedia
Chapter 19 Binary I/O
前言
This book uses the fundamentals-first approach and teaches programming concepts and tech- niques in a problem-driven way.
The fundamentals-first approach introduces basic programming concepts and techniques before objects and classes. My own experience, confirmed by the experiences of many colleagues, demonstrates that new programmers in order to succeed must learn basic logic and fundamental programming techniques such as loops and stepwise refinement. The fundamentai concepts and techniques of loops, methods, and arrays are the foundation for programming. Building the foundation prepares students to learn object-oriented programming, GUI, database, and Web programming.
Problem-driven means focused on problem solving rather than syntax. We make introductory programming interesting by using interesting problems. The central thread of early chapters is on problem solving. Appropriate syntax and library are introduced to support the writing of a program for solving the problems. To support the teaching of programming in a problemdriven way, the book provides a wide variety of problems at various levels of difficulty to motivate students. In order to appeal to students in all majors, the problems cover many application areas in math, science, business, financials, gaming, animation, and multimedia.
Two Versions
This comprehensive version covers fundamentals of programming, object-oriented programming, GUI programming, algorithms and data structures, concurrency, networking, internationalization, advanced GUI, database, and Web programming. It is designed to prepare students to become proficient Java progranuners. A brief version (Introduction to Java Programming, Brief Version, Eighth Edition) is available for a first course on programming, commonly known as CS1. The brief version contains the first 20 chapters of the comprehensive version.
What's New in This Edition?
This edition substantially improves Introduction to Java Programming, Seventh Edition. The major improvements are as follows:
This edition is completely revised in every detail to enhance clarity, presentation, content, examples, and exercises.
In the examples and exercises, which are provided to motivate and stimulate student inter est in programming, one-fifth of the problems are new.
In the previous edition, console input was covered at the end of Chapter 2. The new edition introduces console input early in Chapter 2 so that students can write interactive programs early.
The hand trace box is added for many programs to help novice students to read and trace programs.
Single-dimensional arrays and multidimensional arrays are covered in two chapters to give instructors the flexibility to cover multidimensional arrays later.
The case study for the Sudokn problem has been moved to the Companion Website. A more pedagogically effective simple version of the Sudoku problem is presented instead.
The design of the API for Java GUI programming is an excellent example of how the object-oriented principle is applied. Students learn better with concrete and visual examples.
So, basic GUI now precedes the introduction of abstract classes and interfaces. The instructor, however, can still choose to cover abstract classes and interfaces before GUI.
Exception handling is covered before abstract classes and interfaces so that students can build robust programs early. The instructor can still choose to cover exception handling later.
Chapter 12, "Object-Oriented Design and Patterns;' in the previous edition has been replaced by spreading the design guidelines and patterns into several chapters so that these topics can be covered in appropriate context.
The chapter on sorting now follows right after the chapter on algorithm efficiency, so that students can immediately apply algorithm efficiency to sorting algorithms.
A brand-new bonus Chapter 44 covers Java 2D.
The coverage on data structures is expanded with new bonus chapters on AVL trees, splay trees, 2-4 trees, B-trees, and red-black trees, and hashing. So the book can be used for a full data structures course.
The fundamentals-first approach introduces basic programming concepts and techniques before objects and classes. My own experience, confirmed by the experiences of many colleagues, demonstrates that new programmers in order to succeed must learn basic logic and fundamental programming techniques such as loops and stepwise refinement. The fundamentai concepts and techniques of loops, methods, and arrays are the foundation for programming. Building the foundation prepares students to learn object-oriented programming, GUI, database, and Web programming.
Problem-driven means focused on problem solving rather than syntax. We make introductory programming interesting by using interesting problems. The central thread of early chapters is on problem solving. Appropriate syntax and library are introduced to support the writing of a program for solving the problems. To support the teaching of programming in a problemdriven way, the book provides a wide variety of problems at various levels of difficulty to motivate students. In order to appeal to students in all majors, the problems cover many application areas in math, science, business, financials, gaming, animation, and multimedia.
Two Versions
This comprehensive version covers fundamentals of programming, object-oriented programming, GUI programming, algorithms and data structures, concurrency, networking, internationalization, advanced GUI, database, and Web programming. It is designed to prepare students to become proficient Java progranuners. A brief version (Introduction to Java Programming, Brief Version, Eighth Edition) is available for a first course on programming, commonly known as CS1. The brief version contains the first 20 chapters of the comprehensive version.
What's New in This Edition?
This edition substantially improves Introduction to Java Programming, Seventh Edition. The major improvements are as follows:
This edition is completely revised in every detail to enhance clarity, presentation, content, examples, and exercises.
In the examples and exercises, which are provided to motivate and stimulate student inter est in programming, one-fifth of the problems are new.
In the previous edition, console input was covered at the end of Chapter 2. The new edition introduces console input early in Chapter 2 so that students can write interactive programs early.
The hand trace box is added for many programs to help novice students to read and trace programs.
Single-dimensional arrays and multidimensional arrays are covered in two chapters to give instructors the flexibility to cover multidimensional arrays later.
The case study for the Sudokn problem has been moved to the Companion Website. A more pedagogically effective simple version of the Sudoku problem is presented instead.
The design of the API for Java GUI programming is an excellent example of how the object-oriented principle is applied. Students learn better with concrete and visual examples.
So, basic GUI now precedes the introduction of abstract classes and interfaces. The instructor, however, can still choose to cover abstract classes and interfaces before GUI.
Exception handling is covered before abstract classes and interfaces so that students can build robust programs early. The instructor can still choose to cover exception handling later.
Chapter 12, "Object-Oriented Design and Patterns;' in the previous edition has been replaced by spreading the design guidelines and patterns into several chapters so that these topics can be covered in appropriate context.
The chapter on sorting now follows right after the chapter on algorithm efficiency, so that students can immediately apply algorithm efficiency to sorting algorithms.
A brand-new bonus Chapter 44 covers Java 2D.
The coverage on data structures is expanded with new bonus chapters on AVL trees, splay trees, 2-4 trees, B-trees, and red-black trees, and hashing. So the book can be used for a full data structures course.
