|
![]() |
|||
|
||||
OverviewFor Computer Science courses in Java Programming REVEL™ for Liang Java delivers a digital immersive learning experience that seamlessly integrates author content and pedagogy with dynamic and interactive coding activities and assignable/gradable homework. Animated code listings, LiveExamples, and videos bring course concepts to life for your students. 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. Full Product DetailsAuthor: Y. Liang , Y. Daniel LiangPublisher: Pearson Education (US) Imprint: Pearson Edition: 12th edition Dimensions: Width: 1.00cm , Height: 1.00cm , Length: 1.00cm Weight: 0.001kg ISBN: 9780134167008ISBN 10: 0134167007 Pages: 1344 Publication Date: 07 July 2015 Audience: College/higher education , Tertiary & Higher Education Format: Undefined Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of Contents1 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’ Bonus Web Chapters (Accessible from the Supplement Material under the TOC for REVEL book) Chapter 30 Multithreading and Parallel Programming Chapter 31 Networking Chapter 32 Java Database Programming Chapter 33 JavaServer Faces Chapter 34 Advanced JavaFX Chapter 35 Advanced Java Database Programming Chapter 36 Internationalization Chapter 37 Servlets Chapter 38 JavaServer Pages Chapter 39 Web Services Chapter 40 2-4 Trees and B-Trees Chapter 41 Red-Black Trees Chapter 42 Testing Using JUnit Chapter 43 Aggregate Operations for Collection StreamsReviewsAuthor InformationDr. 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. Tab Content 6Author Website:Countries AvailableAll regions |