{"product_id":"data-structures-and-algorithms-in-java-2-e","title":"Data Structures and Algorithms in Java, 2\/e","description":"\u003cp\u003e\u003cem\u003eData Structures and Algorithms in Java, Second Edition\u003c\/em\u003e is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book even more useful.\u003c\/p\u003e\u003ch3\u003eAbout the Author\u003c\/h3\u003e\u003cp\u003e\u003cb\u003eRobert Lafore\u003c\/b\u003e has degrees in Electrical Engineering and Mathematics, has worked as a systems analyst for the Lawrence Berkeley Laboratory, founded his own software company, and is a best-selling writer in the field of computer programming. Some of his current titles are C++ Interactive Course and Object-Oriented Programming in C++. Earlier best-selling titles include Assembly Language Primer for the IBM PC and XT and (back at the beginning of the computer revolution) Soul of CP\/M.\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003ch3\u003eTable of Contents\u003c\/h3\u003e\u003cp\u003e\u003cstrong\u003eIntroduction.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eWhat's New in the Second Edition. What This Book Is About. What's Different About This Book. Who This Book Is For. What You Need to Know Before You Read This Book. The Software You Need to Use This Book. How This Book Is Organized. Enjoy Yourself!\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e1. Overview.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eWhat Are Data Structures and Algorithms Good For? Overview of Data Structures. Overview of Algorithms. Some Definitions. Object-Oriented Programming. Software Engineering. Java for C++ Programmers. Java Library Data Structures. Summary. Questions.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e2. Arrays.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eThe Array Workshop Applet. The Basics of Arrays in Java. Dividing a Program into Classes. Class Interfaces. The Ordered Workshop Applet. Java Code for an Ordered Array. Logarithms. Storing Objects. Big O Notation. Whay Not Use Arrays for Everything. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e3. Simple Sorting.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eHow Would You Do It. Bubble Sort. Selection Sort. Insertion Sort. Sorting Objects. Comparing the Simple Sorts. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e4. Stacks and Queues.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eA Different Kind of Structure. Stacks. Queues. Priority Queues. Parsing Arithmetic Expressions. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e5. Linked Lists.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eLinks. The LinkList Workshop Applet. A Simple Linked List. Finding and Deleting Specified Links. Double-Ended Lists. Linked-List Efficiency. Abstract Data Types. Sorted Lists. Doubly Linked Lists. Iterators. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e6. Recursion.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eTriangular Numbers. Factorials. Anagrams. A Recursive Binary Search. The Towers of Hanoi. Mergesort. Eliminating Recursion. Some Interesting Recursive Applications. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e7. Advanced Sorting.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eShellsort. Paartitioning. Quicksort. Radix Sort. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e8. Binary Trees.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eWhy Use Binary Trees? Tree Terminology. An Analogy. How Do Binary Search Trees Work. Finding a Node. Inserting a Node. Traversing the Tree. Finding Maximum and Minimum Values. Deleting a Node. The Efficiency of Binary Trees. Trees Represented as Arrays. Duplicate Keys. The Complete tree.java Program. The Huffman Code. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e9. Red-Black Trees.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eOur Approach to the Discussion. Balanced and Unbalanced Trees. Using the RBTree Workshop Applet. Experimenting with the Workshop Applet. Rotations. Inserting a New Node. Deletion. The Efficiency of Red-Black Trees. Red-Black Tree Implementation. Other Balanced Trees. Summary. Questions. Experiments.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e10. 2-3-4 Trees and External Storage.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eIntroduction to 2-3-4 Trees. The Tree234 Workshop Applet. Java Code for a 2-3-4 Tree. 2-3-4 Trees and Red-Black Trees. Efficiency of 2-3-4 Trees. 2-3 Trees. External Storage. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e11. Hash Tables.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eIntroduction to Hashing. Open Addressing. Separate Chaining. Hash Functions. Hashing Efficiency. Hashing and External Storage. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e12. Heaps.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eIntroduction to Heaps. The Heap Workshop Applet. Java Code fo Heaps. A Tree-based Heap. Heapsort. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e13. Graphs.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eIntroduction to Graphs. Searches. Minimum Spanning Trees. Topological Sorting with Directed Graphs. Connectivity in Directed Graphs. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e14. Weighted Graphs.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eMinimum Spanning Tree with Weighted Graphs. The Shortest-Path Problem. The All-Pairs Shortest-Path Problem. Efficiency. Intractable Problems. Summary. Questions. Experiments. Programming Projects.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e15. When to Use What.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eGeneral-Purpose Data Structures. Special-Purpose Data Structures. Sorting. Graphs. External Storage. Onward.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAppendix A. Running the Workshop Applets and Example Programs.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eThe Workshop Applets. The Example Programs. The Sun Microsystem's Software Development Kit. Multiple Class Files. Other Development Systems.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAppendix B. Further Reading.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eData Structures and Algorithms. Object-Oriented Programming Languages. Object-Oriented Design (OOD) and Software Engineering.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAppendix C. Answers to Questions.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003eChapter 1, Overview. Chapter 2, Arrays. Chapter 3, Simple Sorting. Chapter 4, Stacks and Queues. Chapter 5, Linked Lists. Chapter 6, Recursion. Chapter 7, Advanced Sorting. Chapter 8, Binary Trees. Chapter 9, Red-Black Trees. Chapter 10, 2-3-4 Trees and External Storage. Hash Tables. Heaps. Graphs. Weighted Graphs.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eIndex.\u003c\/strong\u003e\u003c\/p\u003e","brand":"Pearson Education","offers":[{"title":"Default Title","offer_id":50506552967238,"sku":"9780135562109","price":5860.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0754\/2797\/1142\/files\/ShowCover_apj4-sq.jpg?v=1790331215","url":"https:\/\/cb-india.com\/products\/data-structures-and-algorithms-in-java-2-e","provider":"Computer Bookshop (India) Pvt Ltd","version":"1.0","type":"link"}