Design and analysis of algorithm / (Record no. 8951)

MARC details
000 -LEADER
fixed length control field 02283nam a2200229Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field NULRC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250520100607.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250520s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788190856539
040 ## - CATALOGING SOURCE
Transcribing agency NULRC
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA 76.9.A43 .G69 2010
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Goyal, Sachin Dev.
Relator term author
245 #0 - TITLE STATEMENT
Title Design and analysis of algorithm /
Statement of responsibility, etc. Sachin Dev Goyal.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Bangalore, India :
Name of publisher, distributor, etc. University Science Press,
Date of publication, distribution, etc. c2010
300 ## - PHYSICAL DESCRIPTION
Extent xi, 445 pages :
Other physical details illustrations ;
Dimensions 24 cm.
365 ## - TRADE PRICE
Price amount USD22.38
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Chapter 1. Role of Algorithm -- Chapter 2. Growth of Functions -- Chapter 3. Recurrences -- Chapter 4. Heap Sort -- Chapter 5. Quick Sort -- Chapter 6. Sorting in Linear Time --Chapter 7. Medians and Order Statistics --Chapter 8. Elementary Data Structures -- Chapter 9. Hash Table -- Chapter 10. Binary Search Tree (BST) -- Chapter 11. Red-Black Trees -- Chapter 12. Augmenting Data Structures -- Chapter 13. Splay Trees -- Chapter 14. B-Trees -- Chapter 15. Binomial Heaps -- Chapter 16. Fibonacci Heaps -- Chapter 17. Data Structures for Disjoint Sets -- Chapter 18. Dynamic Programming -- Chapter 19. Greedy Algorithms -- Chapter 20. Amortized Analysis --Chapter 21. Branch and Bound -- Chapter 22. Backtracking -- Chapter 23. Elementary Graph Algorithms -- Chapter 24. Minimum Spanning Tree -- Chapter 25. Single-Source Shortest Paths -- Chapter 26. All Pairs Shortest Paths -- Chapter 27. Maximum Flow -- Chapter 28. Sorting Networks -- Chapter 29. Matrix Operations -- Chapter 30. Polynomials and the FFT -- Chapter 31. Number-Theoretic Algorithms -- Chapter 32. String Matching -- Chapter 33. Computational Geometry -- Chapter 34. NP-Completeness -- Chapter 35. Approximation Algorithm -- Model Question Paper -- Question Bank -- Previous Year Question Paper -- Index.
520 ## - SUMMARY, ETC.
Summary, etc. The motivate behind this book is to provide an introduction to the subject of Design and Analysis of Algorithm. Algorithm concepts have been presented in a simple and logical manner keeping the essence and flavour of rigour in fact. To familiarize the reader with the application of basic concepts, a selective sprinkling of illustrative examples is incorporated in the text.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element COMPUTER ALGORITHM
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification     Computer Science LRC - Main National University - Manila General Circulation 12/12/2013 Purchased - Amazon 22.38   GC QA 76.9.A43 .G69 2010 NULIB000006710 05/20/2025 c.1 05/20/2025 Books