REVEL for Liang Java -- Access Card

Designed for the way today's students read, think, and learn, REVEL is Pearson’s newest way of delivering our respected content. Fully digital and highly engaging, REVEL offers an immersive learning experience designed for the way today's students read, think, and learn. Enlivening course content with media interactives and assessments, REVEL empowers educators to increase engagement with the course, and to better connect with students.

Dr. Liang earned his Ph.D. in Computer Science from the University of Okalahoma in 1991, and an MS and BS in Computer Science from Fudan University in Shanghai, China, in 1986 and 1983. Prior to joining Armstrong, he was an associate professor in computer science at Purdue University in Fort Wayne, where he twice received the Excellence in Research award.

Dr. Liang was trained in theoretical computer science. He was active in graph algorithms from 1990 to 1995 and published more than ten papers in several established journals such as SIAM Journal on Computing, Discrete Applied Mathematics, Acta Informatics, and Information Processing Letters. Since 1996, he has devoted to writing texts and published more than thirty books with Prentice Hall. His popular computer science texts are widely adopted in the world.

Dr. Liang was elected a Java Champion in 2005 by Sun Microsystems. He has given lectures on Java internationally.

1 Introduction to Computers, Programs, and Java

2 Elementary Programming

3 Selections

4 Mathematical Functions, Characters, and Strings

5 Loops

6 Methods

7 Single-Dimensional Arrays

8 Multidimensional Arrays

9 Objects and Classes

10 Object-Oriented Thinking

11 Inheritance and Polymorphism

12 Exception Handling and Text I/O

13 Abstract Classes and Interfaces

14 JavaFX Basics

15 Event-Driven Programming and Animations

16 JavaFX UI Controls and Multimedia

17 BinaryI/O

18 Recursion

19 Generics

20 Lists, Stacks, Queues, and Priority Queues

21 Sets and Maps

22 Developing Efficient Algorithms

23 Sorting

24 Implementing Lists, Stacks, Queues, and Priority Queues

25 Binary Search Trees

26 AVL Trees

27 Hashing

28 Graphs and Applications

29 Weighted Graphs and Applications’

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.