圖書名稱:INTRODUCTION TO JAVA PROGRAMMING- COMPREHENSIVE VERSION 9/E (PIE)
內容簡介
Daniel Liang teaches concepts of problem-solving and object-oriented programming using a fundamentals-first approach. Beginning programmers learn critical problem-solving techniques then move on to grasp the key concepts of object-oriented, GUI programming, advanced GUI and Web programming using Java. For a 1-, 2-, or 3-semester CS1 course sequence.
目錄
Ch1: Introduction to Computers, Programs, and Java Ch2: Elementary Programming Ch3: Selections Ch4: Loops Ch5: Methods Ch6: Single-Dimensional Arrays Ch7: Multidimensional Arrays Ch8: Objects and Classes Ch9: Strings Ch10: Thinking in Objects Ch11: Inheritance and Polymorphism Ch12: GUI Basics Ch13: Graphics Ch14: Exception Handling and Text I/O Ch15: Abstract Classes and Interfaces Ch16: Event-Driven Programming Ch17: GUI Components Ch18: Applets and Multimedia Ch19: Binary I/O Ch20: Recursion Ch21: Generics Ch22: Lists, Stacks, Queues, and Priority Queues Ch23: Sets and Maps Ch24: Developing Efficient Algorithms Ch25: Sorting Ch26: Implementing Lists, Stacks, and Queues, and Priority Queues Ch27: Binary Search Trees Ch28: Hashing Ch29: AVL Trees Ch30: Graphs and Applications Ch31: Weighted Graphs and Applications Ch32: Multithreading and Parallel Programming Ch33: Networking Ch34: Java Database Programming Bonus Chapters 35—49 are available on the Companion Website Ch35: Internationalization Ch36: JavaBeans and Bean Events Ch37: Containers, Layout Managers, and Borders Ch38: Menus, Toolbars, and Dialogs Ch39: MVC and Swing Models Ch40: JTable and JTree Ch41: Advanced Database Programming Ch42: Servlets Ch43: JavaServer Pages Ch44: JavaServer Faces Ch45: Web Services Ch46: Remote Method Invocation Ch47: 2-4 Trees and B-Trees Ch48: Red-Black Trees Ch49: Java 2D Appendixes Appendix A Java Keywords Appendix B The ASCII Character Set Appendix C Operator Precedence Chart Appendix D Java Modifiers Appendix E Special Floating-Point Values Appendix F Number Systems Appendix G Bitwise Operations