Introduction to the design & analysis of algorithms / (Record no. 10572)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02996cam a22003854i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 16889879 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20201006145636.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 110726s2012 maua b 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER | |
| LC control number | 2011027089 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780273764113 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 027376411X |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)ocn743298766 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | DLC |
| Transcribing agency | DLC |
| Modifying agency | YDX |
| -- | YDXCP |
| -- | BWX |
| -- | DLC |
| -- | EG-NcFUE |
| Description conventions | rda |
| 042 ## - AUTHENTICATION CODE | |
| Authentication code | pcc |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.9.A43 |
| Item number | L48 2012 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Edition number | 23 |
| Item number | L.A.I |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Levitin, Anany. |
| 245 10 - TITLE STATEMENT | |
| Title | Introduction to the design & analysis of algorithms / |
| Statement of responsibility, etc | Anany Levitin. |
| 246 3# - VARYING FORM OF TITLE | |
| Title proper/short title | Introduction to the design and analysis of algorithms |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 3rd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc | Boston : |
| Name of publisher, distributor, etc | Pearson, |
| Date of publication, distribution, etc | c2012. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 589 p. : |
| Other physical details | ill. ; |
| Dimensions | 23 cm. |
| 336 ## - CONTENT TYPE | |
| Source | rdacontent |
| Content type term | text |
| 337 ## - MEDIA TYPE | |
| Source | rdamedia |
| Media type term | unmediated |
| 338 ## - CARRIER TYPE | |
| Source | rdacarrier |
| Carrier type term | volume |
| 500 ## - GENERAL NOTE | |
| General note | computer bookfair2016 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1Introduction 1<br/>1.1 What Is an Algorithm? 3<br/>Exercises 1.1 7<br/>1.2 Fundamentals of Algorithmic Problem Solving 9<br/>Understanding the Problem 9<br/>Ascertaining the Capabilities of the Computational Device 9<br/>Choosing between Exact and Approximate Problem Solving 11<br/>Algorithm Design Techniques 11<br/>Designing an Algorithm and Data Structures 12<br/>Methods of Specifying an Algorithm 12<br/>Proving an Algorithm’s Correctness 13<br/>Analyzing an Algorithm 14<br/>Coding an Algorithm 15<br/>Exercises 1.2 17<br/>1.3 Important Problem Types 18<br/>Sorting 19<br/>Searching 20<br/>String Processing 20<br/>Graph Problems 21<br/>Combinatorial Problems 21<br/>Geometric Problems 22<br/>Numerical Problems 22<br/>Exercises 1.3 23<br/>1.4 Fundamental Data Structures 25<br/>Linear Data Structures 25<br/>Graphs 28<br/>Trees 31<br/>Sets and Dictionaries 35<br/>Exercises 1.4 37<br/>Summary 38<br/><br/>2 Fundamentals of the Analysis of AlgorithmEfficiency 41<br/>2.1 The Analysis Framework 42<br/>Measuring an Input’s Size 43<br/>Units for Measuring Running Time 44<br/>Orders of Growth 45<br/>Worst-Case, Best-Case, and Average-Case Efficiencies 47<br/>Recapitulation of the Analysis Framework 50<br/>Exercises 2.1 50<br/>2.2 Asymptotic Notations and Basic Efficiency Classes 52<br/>Informal Introduction 52<br/>O-notation 53<br/>-notation 54<br/>-notation 55<br/>Useful Property Involving the Asymptotic Notations 55<br/>Using Limits for Comparing Orders of Growth 56<br/>Basic Efficiency Classes 58<br/>Exercises 2.2 58<br/>2.3 Mathematical Analysis of Nonrecursive Algorithms 61<br/>Exercises 2.3 67<br/>2.4 Mathematical Analysis of Recursive Algorithms 70<br/>Exercises 2.4 76<br/>2.5 Example: Computing the nth Fibonacci Number 80<br/>Exercises 2.5 83<br/>2.6 Empirical Analysis of Algorithms 84<br/>Exercises 2.6 89<br/>2.7 Algorithm Visualization 91<br/>Summary 94 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms. |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Materials specified | Abstract |
| Uniform Resource Identifier | <a href="http://repository.fue.edu.eg/xmlui/handle/123456789/3675">http://repository.fue.edu.eg/xmlui/handle/123456789/3675</a> |
| 906 ## - LOCAL DATA ELEMENT F, LDF (RLIN) | |
| a | 7 |
| b | cbc |
| c | orignew |
| d | 1 |
| e | ecip |
| f | 20 |
| g | y-gencatlg |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Books |
| Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Acquisition method | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Computers & Information Technology ( Computer Science ) | Main library | Main library | A1 | 15/02/2016 | Sphinx publishing | 222.00 | Purchase | 005.1 L.A.I | 00014261 | 18/02/2025 | 15/02/2016 | Books |