Design and analysis of algorithms (Record no. 756)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01351nam a22002177a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200923105730.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 190121b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9789350140918 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | 0 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.421 |
| Item number | RAJ |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Rajput, Vinod K. |
| 245 ## - TITLE STATEMENT | |
| Title | Design and analysis of algorithms |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | New Delhi : |
| Name of publisher, distributor, etc. | S. K. Kataria & Sons, |
| Date of publication, distribution, etc. | 2012. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Page number | 613 pages : |
| Other physical details | ill.; |
| Dimensions | 23 cm. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Title | Growth of Function |
| -- | Recurrence |
| -- | Sorting Algorithms |
| -- | Divide and Conquer |
| -- | Heapsort |
| -- | Quicksort |
| -- | Sorting in Linear Time |
| -- | Median and Order Statistics |
| -- | Red Black Tree |
| -- | Augmenting Data Structures |
| -- | Dynamic Programming |
| -- | Greedy Algorithms |
| -- | Amortized Analysis |
| -- | B-Tree |
| -- | Binomial Heaps |
| -- | Fibonacci Heaps |
| -- | Data Strutures for Disjoint Sets |
| -- | Backtracking |
| -- | Branch and Sounds |
| -- | Elementary Graph Algorithms |
| -- | Minimum Spanning Tree |
| -- | Single Source Shortest Paths |
| -- | All Pairs Shortest Path |
| -- | Maximum Flow |
| -- | Sorting Networks |
| -- | Matrix Operations |
| -- | Polynomials and the FFT |
| -- | Number Theoretic Algorithms |
| -- | String Matching |
| -- | NP-Completeness |
| -- | Approximation Algorithms |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This book provides a treatment of designing procedures of algorithms and how to analyze algorithms. The book is applicable for courses in data structures and algorithms. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Data structures (Computer science) |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Gratis, Gifts |
| 952 ## - LOCATION AND ITEM INFORMATION (KOHA) | |
| -- | 1630 |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Total Renewals | Full call number | Barcode | Date last seen | Date last checked out | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | IIITDM Kurnool | IIITDM Kurnool | General Stacks | 21.01.2019 | 7 | 6 | 004.421 RAJ | G000047 | 26.02.2024 | 21.12.2023 | 21.01.2019 | Gratis, Gifts |