02053nam a22002417a 450000500170000000800410001702000180005804000070007604100080008310000190009124500630011025000070017326000270018030000250020736500680023252014010030065000300170165000100173165000280174165000170176965000110178665000140179720251030151209.0251030b        |||||||| |||| 00| 0 eng d  a9789357055048  cAL  aeng  aDaniel Liang Y  aIntroduction to JAVA programming and data structures Ed 12  a12  aChennaibPearsonc2025  a1240pbPBc25.5X20cm  2Computer Science Engineeringa4224b1088.00 c₹d1360.00e20%  aIntroduction to Java Programming and Data Structures seamlessly integrates programming, data structures, and algorithms into one text. With a fundamentals-first approach, the text builds a strong foundation of basic programming concepts and techniques before teaching students object-oriented programming and advanced Java programming.
Liang explains programming in a problem-driven way that focuses on problem solving rather than syntax, illustrating basic concepts by example and providing a large number of exercises with various levels of difficulty for students to practice. The 12th Edition is completely revised in every detail to enhance clarity, presentation, content, examples, and exercises.
Features –
NEW: Both Comparable and Comparator are used to compare elements in Heap, Priority-Queue, BST, and AVLTree. This is consistent with the Java API and is more useful and flexible.
NEW: String matching algorithms are introduced in Chapter 22: Developing Efficient Algorithms.
UPDATED: Java 9, 10, 11 and FX11 are covered to keep the text up to date with current technologies. Examples are improved and simplified.
UPDATED: Lambda expressions are used in more examples and exercises in the data structures chapters to simplify coding.
UPDATED: Programming Exercises are grouped by sections to provide students with opportunities to apply the new skills they have learned on their own.  aSingle Dimensional Arrays  aloops  aMathematical Functions   aPolymorphism  aJavaFX  aAVL Trees