000			02171nam a22002657a 4500
005			20251030151209.0
008			251030b |||||||| |||| 00| 0 eng d
020			_a9789357055048
040			_cAL
041			_aeng
100			_aDaniel Liang Y _9243260
245			_aIntroduction to JAVA programming and data structures Ed 12
250			_a12
260			_aChennai _bPearson _c2025
300			_a1240p _bPB _c25.5X20cm
365			_2Computer Science Engineering _a4224 _b1088.00 _c₹ _d1360.00 _e20%
520			_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.
650			_aSingle Dimensional Arrays _9243179
650			_aloops _9243180
650			_aMathematical Functions _9243181
650			_aPolymorphism _9243182
650			_aJavaFX _9243183
650			_aAVL Trees _9243184
942			_2ddc _cBK
999			_c240612 _d240612