Fundamentals of sequential and parallel algorithms / (Record no. 30025)

000 -LEADER
fixed length control field 01867cam a2200265 a 4500
001 - CONTROL NUMBER
control field vtls002865960
003 - CONTROL NUMBER IDENTIFIER
control field MY-SjTCS
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200306154541.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110218s1997 maua 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0534946747
039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE]
Level of rules in bibliographic description 201906191157
Level of effort used to assign nonsubject heading access points shuhada
Level of effort used to assign subject headings 201102181417
Level of effort used to assign classification VLOAD
-- 200407271958
-- VLOAD
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Item number BER
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Berman, Kenneth A.
9 (RLIN) 213367
245 10 - TITLE STATEMENT
Title Fundamentals of sequential and parallel algorithms /
Statement of responsibility, etc. Kenneth A. Berman and Jerome L. Paul.
246 30 - VARYING FORM OF TITLE
Title proper/short title Sequential and parallel algorithms
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Boston, Mass. :
Name of publisher, distributor, etc. PWS Pub.,
Date of publication, distribution, etc. c1997.
300 ## - PHYSICAL DESCRIPTION
Extent xxiii, 744 p. :
Other physical details ill. ;
Dimensions 25 cm.
500 ## - GENERAL NOTE
General note Includes index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Preface. - Pseudocode Conventions for Sequential Algorithms. - 1. Introduction and Preliminaries. - 2. Elementary Data Structures. - 3. Design and Analysis of Sequential Algorithms. - 4. Sequential Sorting Algorithms and Their Analysis. - 5. Introduction to Parallel Algorithms and Architectures. - 6. Parallel Sorting. - 7. Induction, Correctness Proofs, and Recurrence Relations. - 8. Graphs, Diagraphs, and Sets. - 9. Probability and Average Complexity of Algorithms. - 10. Introduction to Lower Bound Theory. - 11. Parallel Prefix, Matrix Multiplication, and Pointer Jumping. - 12. The Greedy Method. - 13. Divide and Conquer. - 14. Dynamic Programming. - 15. Backtracking and Branch-and-Bound. - 16. Heuristic Search: A*-Search, Game Trees. - 17. The Dictionary Problem: Hashing and Balanced Trees. - 18. Probabilistic Algorithms. - 19. Graph Algorithms. - 20. NP-Complete Problems and the Class NC. - Index.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms.
9 (RLIN) 5494
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Parallel processing (Electronic computers)
9 (RLIN) 6746
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Sequential processing (Computer science)
9 (RLIN) 213368
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Paul, Jerome L.
9 (RLIN) 213369
920 ## - Programme
Programme CIT(DIP) : 546030
999 ## - SYSTEM CONTROL NUMBERS (KOHA)
Koha biblionumber 30025
Koha biblioitemnumber 30025
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Permanent Location Current Location Date acquired Total Checkouts Barcode Date last seen Date last checked out Copy number Koha item type Public note
          Please fill up online form at https://taylorslibrary.taylors.edu.my/services/external_storage1 Taylor's Library-TU TU External Storage-LCS 2004-07-27   1000117035 2019-12-05 2010-04-30 1 Main Collection SOCIT, 546030