Foundations of algorithms / (Record no. 7208)

MARC details
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120628s2011 mau b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2009040309
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780763782504
035 ## - SYSTEM CONTROL NUMBER
System control number (Sirsi) u8308
040 ## - CATALOGING SOURCE
Original cataloging agency EG-CaNU
Transcribing agency EG-CaNU
Modifying agency EG-CaNU
042 ## - AUTHENTICATION CODE
Authentication code ncode
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Edition number 22
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Neapolitan, Richard E.
9 (RLIN) 3676
245 10 - TITLE STATEMENT
Title Foundations of algorithms /
Statement of responsibility, etc. Richard Neapoltian and Kumarss Naimipour.
250 ## - EDITION STATEMENT
Edition statement 4th ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Sudbury, Mass. :
Name of publisher, distributor, etc. Jones and Bartlett Publishers,
Date of publication, distribution, etc. c2011.
300 ## - PHYSICAL DESCRIPTION
Extent xv, 627 p. L
Other physical details ill. ;
Dimensions 24 cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references (p. [609]-613) and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Algorithms: efficiency, analysis, and order -- Divide-and-conquer -- Dynamic programming -- The greedy approach -- Backtracking -- Branch-and-bound -- Introduction to computational complexity : the sorting problem -- More computational complexity : the searching problem -- Computational complexity and intractability : an introduction to the theory of NP -- Number-theoretic algorithms -- Introduction to parallel algorithms.
520 ## - SUMMARY, ETC.
Summary, etc. Foundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.
596 ## -
-- 1
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 15282
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Constructive mathematics.
9 (RLIN) 3678
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational complexity.
9 (RLIN) 993
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Naimipour, Kumarss.
9 (RLIN) 3679
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Neapolitan, Richard E.
Title of a work Foundations of algorithms using C++ pseudocode.
9 (RLIN) 3676
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Source of acquisition Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Dewey Decimal Classification     Main library Main library General Stacks 01/26/2020 ARAOA-P   518.1 / NE.F 2011 011764 11/24/2019 1 11/24/2019 Books