Résumé
For courses in Java Programming.
A fundamentals-first introduction to basic programming concepts andtechniques
Introduction to Java Programming and Data Structures seamlessly integrates programming, data structures,and algorithms into one text. With a fundamentals-first approach, the textbuilds a strong foundation of basic programming concepts and techniques beforeteaching students object-oriented programming and advanced Java programming.Liang explains programming in a problem-driven way that focuses on problemsolving rather than syntax, illustrating basic concepts by example andproviding a large number of exercises with various levels of difficulty forstudents to practice. The 12th Edition is completely revised in everydetail to enhance clarity, presentation, content, examples, and exercises.1. Introduction to Computers, Programs, and JavaTM
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. Binary I/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 PriorityQueues
25. Binary Search Trees
26. AVL Trees
27. Hashing
28. Graphs and Applications
29. Weighted Graphs and Applications
30. Aggregate Operations for Collection Streams
Bonus Chapters 31-44 are available from the CompanionWebsite
31. Advanced JavaFX and FXML
32. Multithreading and Parallel Programming
33. Networking
34. Java Database Programming
35. Advanced Database Programming
36. Internationalization
37. Servlets
38. JavaServer Pages
39. JavaServer Faces
40. RMI
41. Web Services
42. 2-4 Trees and B-Trees
43. Red-Black Trees
44. Testing Using JUnit
APPENDIXES
A. Java Keywords and Reserved Words
B. The ASCII Character Set
C. Operator Precedence Chart
D. Java Modifiers
E. Special Floating-Point Values
F. Number Systems
G. Bitwise Operations
H. Regular Expressions
I. Enumerated Types
J. The Big-O, Big-Omega, and Big-Theta NotationsDr. Liang earnedhis Ph.D. in Computer Science from the University of Oklahoma in 1991, and hisM.S. and B.S. in Computer Science from Fudan University in Shanghai, China in1986 and 1983. Prior to joining Armstrong State University (now merged withGeorgia Southern University), he was an Associate Professor in computer scienceat Purdue University in Fort Wayne, Indiana, where he twice received theExcellence in Research award.
Dr. Liang is currently a Professor of Computer Science at GeorgiaSouthern University. He was trained in theoretical computer science. He haspublished in the SIAM Journal on Computing, Discrete Applied Mathematics, ActaInformatics, and Information Processing Letters. He is the author of more thanthirty books. His popular computer science texts are widely used in the world.
Dr. Liang was elected a Java Champion by Sun Microsystems (nowOracle) in 2005. He has given lectures on programming internationally.
![Introduction to Java Programming and Data Structures, Comprehensive Version [Global Edition]](http://servimg.eyrolles.com/static/media/2079/9781292402079_internet_w290.jpg)
