Normal view MARC view ISBD view

Design & Analysis of Algorithms (Record no. 2471)

MARC details
000 -LEADER
fixed length control field	02111nam a22002177a 4500
003 - CONTROL NUMBER IDENTIFIER
control field	OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field	20200224104710.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	200118b \|\|\|\|\| \|\|\|\| 00\| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number	978-93-82609-43-8
028 ## - PUBLISHER NUMBER
Source	Allied Informatics, Jaipur
Bill Number	7084
Bill Date	13/01/2020
Purchase Year	2019-20
040 ## - CATALOGING SOURCE
Original cataloging agency	BSDU
Language of cataloging	English
Transcribing agency	BSDU
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number	005.1
Item number	SHA
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name	Sharma,Gajendra
245 ## - TITLE STATEMENT
Title	Design & Analysis of Algorithms
250 ## - EDITION STATEMENT
Remainder of edition statement	4th
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc.	New Delhi
Name of publisher, distributor, etc.	Khanna Book Publishing Co (P) Ltd.
Date of publication, distribution, etc.	2019
300 ## - PHYSICAL DESCRIPTION
Extent	656
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note	Contents<br/><br/>Chapter 1: Introduction<br/><br/>Chapter 2: Growth of Functions<br/><br/>Chapter 3: Summations<br/><br/>Chapter 4: Recurrences<br/><br/>Chapter 5: Sets Relations and Functions<br/><br/>Chapter 6: Probability<br/><br/>Chapter 7: Heaps and Heapsort <br/><br/>Chapter 8: Quicksort<br/><br/>Chapter 9: Sorting in Linear Time<br/><br/>Chapter 10: Medians and Order Statistics<br/><br/>Chapter 11: Elementary Data Structures<br/><br/>Chapter 12: Hashing<br/><br/>Chapter 13: BS Trees<br/><br/>Chapter 14: Optimal Binary Search Trees<br/><br/>Chapter 15: AVL Trees And Splaying<br/><br/>Chapter 16: RB-Trees<br/><br/>Chapter 17: Augmenting Data Structure<br/><br/>Chapter 18: Dynamic Programming<br/><br/>Chapter 19: Greedy Algorithms<br/><br/>Chapter 20: Amortized Analysis<br/><br/>Chapter 21: B. Trees-External Searching<br/><br/>Chapter 22: Binomial Trees and Binomial Heaps<br/><br/>Chapter 23: Fibonacci Heaps<br/><br/>Chapter 24: Data Structure for Disjoint Sets<br/><br/>Chapter 25: Elementary Graph Algorithms<br/><br/>Chapter 26: Back Tracking<br/><br/>Chapter 27: Branch and Bound<br/><br/>Chapter 28: Minimum Spanning Tree<br/><br/>Chapter 29: Single-Source Shortest Paths<br/><br/>Chapter 30: All Pair Shortest Paths<br/><br/>Chapter 31: Network Flow<br/><br/>Chapter 32: Sorting Networks<br/><br/>Chapter 33: Arithmetic Circuits<br/><br/>Chapter 34: Algorithms for Parallel Computers<br/><br/>Chapter 35: Matrix Operation<br/><br/>Chapter 36: Polynomials and FFT<br/><br/>Chapter 37: Number-Theoretic Algorithms<br/><br/>Chapter 38: String Matching<br/><br/>Chapter 39: Computational Geometry<br/><br/>Chapter 40: NP-Completeness<br/><br/>Chapter 41: Non-Deterministic Algorithms<br/><br/>Chapter 42: Approximation Algorithms<br/><br/>Chapter 43: Program<br/><br/>Exam Papers
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	Books

Holdings
Withdrawn status	Lost status	Source of classification or shelving scheme	Damaged status	Not for loan	Home library	Current library	Shelving location	Date acquired	Cost, normal purchase price	Total Checkouts	Full call number	Barcode	Date last seen	Cost, replacement price	Price effective from	Koha item type
		Dewey Decimal Classification			BSDU Knowledge Resource Center, Jaipur	BSDU Knowledge Resource Center, Jaipur	General Stacks	01/18/2020	425.00		005.1 SHA	018025	02/12/2020	425.00	01/18/2020	Books