Data structures and algorithms made easy in java : data structure and algorithmic puzzles / Narasimha Karumanchi

By:

Karumanchi, Narasimha

Publication details: India : CareerMonk Publications, c2018Edition: 2nd editionDescription: 449 [1] pages : illustratons ; 28 cmISBN:

9788192107554

Subject(s):

DDC classification:

005.1 23

Summary: Introduction.--Recursion and backtracking.--Linked lists.--Stacks.--Queues.--Trees.--Priority queues and Heaps.--Disjoint set ADT.--Graph algorithms.--Sorting.--Searching.--Selection algorithms [Medians].--Symbol tables.--Hashing.--String algorithms.--Algorithms design techniques.--Greedy algorithms.--Divide and conquer algorithms.--Dynamic programming.--Complexity classes.--Miscellaneous concepts.--References.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Call number	Copy number	Status	Date due	Barcode	Item holds
Book	Ayesha Abed Library General Stacks	Ayesha Abed Library General Stacks	005.1 KAR (Browse shelf(Opens below))	1	Checked out	08/07/2024	3010034033
Book	Ayesha Abed Library General Stacks	Ayesha Abed Library General Stacks	005.1 KAR (Browse shelf(Opens below))	2	Checked out	14/07/2024	3010034034

Total holds: 0

Browsing Ayesha Abed Library shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)

Previous								Next
Previous	005.1 JAC The unified software development process /	005.1 JOH Algorithms /	005.1 KAR Data structures and algorithms made easy in java :	005.1 KAR Data structures and algorithms made easy in java :	005.1 KER The practice of programming /	005.1 KLE Algorithm design /	005.1 KLE Algorithm design /	Next

Originally published in 2015, 435 pages.

Includes bibliographical references.

Introduction.--Recursion and backtracking.--Linked lists.--Stacks.--Queues.--Trees.--Priority queues and Heaps.--Disjoint set ADT.--Graph algorithms.--Sorting.--Searching.--Selection algorithms [Medians].--Symbol tables.--Hashing.--String algorithms.--Algorithms design techniques.--Greedy algorithms.--Divide and conquer algorithms.--Dynamic programming.--Complexity classes.--Miscellaneous concepts.--References.

BBS

There are no comments on this title.

to post a comment.