MARC details
| 000 -LEADER |
|---|
| fixed length control field |
09464nam a2200481 i 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250919002821.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
150324t20152015maua bi 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781284049190 (paperback) |
| Terms of availability |
RM577.96 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
1284049191 (paperback) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201506100901 |
| Level of effort used to assign nonsubject heading access points |
lan |
| Level of effort used to assign subject headings |
201506050859 |
| Level of effort used to assign classification |
lan |
| Level of effort used to assign subject headings |
201506050858 |
| Level of effort used to assign classification |
lan |
| Level of effort used to assign subject headings |
201506050858 |
| Level of effort used to assign classification |
lan |
| y |
03-24-2015 |
| z |
hamudah |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
DLC |
| Language of cataloging |
eng |
| Description conventions |
rda |
| Transcribing agency |
DLC |
| Modifying agency |
YDX |
| -- |
YDXCP |
| -- |
INU |
| -- |
OCLCF |
| -- |
NLGGC |
| -- |
CDX |
| -- |
UKM |
| Description conventions |
rda |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA9.58.N433 2015 |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA9.58 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
.N433 2015 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Neapolitan, Richard E., |
| Relator term |
author. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Foundations of algorithms / |
| Statement of responsibility, etc. |
Richard E. Neapolitan, PhD, Northwestern University. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Fifth edition. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
Burlington, MA : |
| Name of producer, publisher, distributor, manufacturer |
Jones & Bartlett Learning, |
| Date of production, publication, distribution, manufacture, or copyright notice |
[2015]. |
| 264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Date of production, publication, distribution, manufacture, or copyright notice |
© 2015. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvii, 676 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
unmediated |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
volume |
| Source |
rdacarrier |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references (pages 653-658) and index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
Machine generated contents note: |
| -- |
1. |
| Title |
Algorithms: Efficiency, Analysis, and Order -- |
| Miscellaneous information |
1.1. |
| Title |
Algorithms -- |
| Miscellaneous information |
1.2. |
| Title |
The Importance of Developing Efficient Algorithms -- |
| Miscellaneous information |
1.2.1. |
| Title |
Sequential Search Versus Binary Search -- |
| Miscellaneous information |
1.2.2. |
| Title |
The Fibonacci Sequence -- |
| Miscellaneous information |
1.3. |
| Title |
Analysis of Algorithms -- |
| Miscellaneous information |
1.3.1. |
| Title |
Complexity Analysis -- |
| Miscellaneous information |
1.3.2. |
| Title |
Applying the Theory -- |
| Miscellaneous information |
1.3.3. |
| Title |
Analysis of Correctness -- |
| Miscellaneous information |
1.4. |
| Title |
Order -- |
| Miscellaneous information |
1.4.1. |
| Title |
An Intuitive Introduction to Order -- |
| Miscellaneous information |
1.4.2. |
| Title |
A Rigorous Introduction to Order -- |
| Miscellaneous information |
1.4.3. |
| Title |
Using a Limit to Determine Order -- |
| Miscellaneous information |
1.5. |
| Title |
Outline of This Book -- |
| -- |
Exercises -- |
| Miscellaneous information |
2. |
| Title |
Divide-and-Conquer -- |
| Miscellaneous information |
2.1. |
| Title |
Binary Search -- |
| Miscellaneous information |
2.2. |
| Title |
Mergesort -- |
| Miscellaneous information |
2.3. |
| Title |
The Divide-and-Conquer Approach -- |
| Miscellaneous information |
2.4. |
| Title |
Quicksort (Partition Exchange Sort) -- |
| Miscellaneous information |
2.5. |
| Title |
Strassen's Matrix Multiplication Algorithm -- |
| Miscellaneous information |
2.6. |
| Title |
Arithmetic with Large Integers -- |
| Miscellaneous information |
2.6.1. |
| Title |
Representation of Large Integers: Addition and Other Linear-Time Operations. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
2.6.2. |
| Title |
Multiplication of Large Integers -- |
| Miscellaneous information |
2.7. |
| Title |
Determining Thresholds -- |
| Miscellaneous information |
2.8. |
| Title |
When Not to Use Divide-and-Conquer -- |
| -- |
Exercises -- |
| Miscellaneous information |
3. |
| Title |
Dynamic Programming -- |
| Miscellaneous information |
3.1. |
| Title |
The Binomial Coefficient -- |
| Miscellaneous information |
3.2. |
| Title |
Floyd's Algorithm for Shortest Paths -- |
| Miscellaneous information |
3.3. |
| Title |
Dynamic Programming and Optimization Problems -- |
| Miscellaneous information |
3.4. |
| Title |
Chained Matrix Multiplication -- |
| Miscellaneous information |
3.5. |
| Title |
Optimal Binary Search Trees -- |
| Miscellaneous information |
3.6. |
| Title |
The Traveling Salesperson Problem -- |
| Miscellaneous information |
3.7. |
| Title |
Sequence Alignment -- |
| -- |
Exercises -- |
| Miscellaneous information |
4. |
| Title |
The Greedy Approach -- |
| Miscellaneous information |
4.1. |
| Title |
Minimum Spanning Trees -- |
| Miscellaneous information |
4.1.1. |
| Title |
Prim's Algorithm -- |
| Miscellaneous information |
4.1.2. |
| Title |
Kruskal's Algorithm -- |
| Miscellaneous information |
4.1.3. |
| Title |
Comparing Prim's Algorithm with Kruskal's Algorithm -- |
| Miscellaneous information |
4.1.4. |
| Title |
Final Discussion -- |
| Miscellaneous information |
4.2. |
| Title |
Dijkstra's Algorithm for Single-Source Shortest Paths -- |
| Miscellaneous information |
4.3. |
| Title |
Scheduling -- |
| Miscellaneous information |
4.3.1. |
| Title |
Minimizing Total Time in the System -- |
| Miscellaneous information |
4.3.2. |
| Title |
Scheduling with Deadlines -- |
| Miscellaneous information |
4.4. |
| Title |
Huffman Code -- |
| Miscellaneous information |
4.4.1. |
| Title |
Prefix Codes -- |
| Miscellaneous information |
4.4.2. |
| Title |
Huffman's Algorithm -- |
| Miscellaneous information |
4.5. |
| Title |
The Greedy Approach versus Dynamic Programming: The Knapsack Problem. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
4.5.1. |
| Title |
A Greedy Approach to the 0-1 Knapsack Problem -- |
| Miscellaneous information |
4.5.2. |
| Title |
A Greedy Approach to the Fractional Knapsack Problem -- |
| Miscellaneous information |
4.5.3. |
| Title |
A Dynamic Programming Approach to the 0-1 Knapsack Problem -- |
| Miscellaneous information |
4.5.4. |
| Title |
A Refinement of the Dynamic Programming Algorithm for the 0-1 Knapsack Problem -- |
| -- |
Exercises -- |
| Miscellaneous information |
5. |
| Title |
Backtracking -- |
| Miscellaneous information |
5.1. |
| Title |
The Backtracking Technique -- |
| Miscellaneous information |
5.2. |
| Title |
The n-Queens Problem -- |
| Miscellaneous information |
5.3. |
| Title |
Using a Monte Carlo Algorithm to Estimate the Efficiency of a Backtracking Algorithm -- |
| Miscellaneous information |
5.4. |
| Title |
The Sum-of-Subsets Problem -- |
| Miscellaneous information |
5.5. |
| Title |
Graph Coloring -- |
| Miscellaneous information |
5.6. |
| Title |
The Hamiltonian Circuits Problem -- |
| Miscellaneous information |
5.7. |
| Title |
The 0-1 Knapsack Problem -- |
| Miscellaneous information |
5.7.1. |
| Title |
A Backtracking Algorithm for the 0-1 Knapsack Problem -- |
| Miscellaneous information |
5.7.2. |
| Title |
Comparing the Dynamic Programming Algorithm and the Backtracking Algorithm for the 0-1 Knapsack Problem -- |
| -- |
Exercises -- |
| Miscellaneous information |
6. |
| Title |
Branch-and-Bound -- |
| Miscellaneous information |
6.1. |
| Title |
Illustrating Branch-and-Bound with the 0-1 Knapsack Problem -- |
| Miscellaneous information |
6.1.1. |
| Title |
Breadth-First Search with Branch-and-Bound Pruning -- |
| Miscellaneous information |
6.1.2. |
| Title |
Best-First Search with Branch-and-Bound Pruning. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
6.2. |
| Title |
The Traveling Salesperson Problem -- |
| Miscellaneous information |
6.3. |
| Title |
Abductive Inference (Diagnosis) -- |
| -- |
Exercises -- |
| Miscellaneous information |
7. |
| Title |
Introduction to Computational Complexity: The Sorting Problem -- |
| Miscellaneous information |
7.1. |
| Title |
Computational Complexity -- |
| Miscellaneous information |
7.2. |
| Title |
Insertion Sort and Selection Sort -- |
| Miscellaneous information |
7.3. |
| Title |
Lower Bounds for Algorithms that Remove at Most One Inversion per Comparison -- |
| Miscellaneous information |
7.4. |
| Title |
Mergesort Revisited -- |
| Miscellaneous information |
7.5. |
| Title |
Quicksort Revisited -- |
| Miscellaneous information |
7.6. |
| Title |
Heapsort -- |
| Miscellaneous information |
7.6.1. |
| Title |
Heaps and Basic Heap Routines -- |
| Miscellaneous information |
7.6.2. |
| Title |
An Implementation of Heapsort -- |
| Miscellaneous information |
7.7. |
| Title |
Comparison of Mergesort, Quicksort, and Heapsort -- |
| Miscellaneous information |
7.8. |
| Title |
Lower Bounds for Sorting Only by Comparison of Keys -- |
| Miscellaneous information |
7.8.1. |
| Title |
Decision Trees for Sorting Algorithms -- |
| Miscellaneous information |
7.8.2. |
| Title |
Lower Bounds for Worst-Case Behavior -- |
| Miscellaneous information |
7.8.3. |
| Title |
Lower Bounds for Average-Case Behavior -- |
| Miscellaneous information |
7.9. |
| Title |
Sorting by Distribution (Radix Sort) -- |
| -- |
Exercises -- |
| Miscellaneous information |
8. |
| Title |
More Computational Complexity: The Searching Problem -- |
| Miscellaneous information |
8.1. |
| Title |
Lower Bounds for Searching Only by Comparisons of Keys -- |
| Miscellaneous information |
8.1.1. |
| Title |
Lower Bounds for Worst-Case Behavior. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
8.1.2. |
| Title |
Lower Bounds for Average-Case Behavior -- |
| Miscellaneous information |
8.2. |
| Title |
Interpolation Search -- |
| Miscellaneous information |
8.3. |
| Title |
Searching in Trees -- |
| Miscellaneous information |
8.3.1. |
| Title |
Binary Search Trees -- |
| Miscellaneous information |
8.3.2. |
| Title |
B-Trees -- |
| Miscellaneous information |
8.4. |
| Title |
Hashing -- |
| Miscellaneous information |
8.5. |
| Title |
The Selection Problem: Introduction to Adversary Arguments -- |
| Miscellaneous information |
8.5.1. |
| Title |
Finding the Largest Key -- |
| Miscellaneous information |
8.5.2. |
| Title |
Finding Both the Smallest and Largest Keys -- |
| Miscellaneous information |
8.5.3. |
| Title |
Finding the Second-Largest Key -- |
| Miscellaneous information |
8.5.4. |
| Title |
Finding the kth-Smallest Key -- |
| Miscellaneous information |
8.5.5. |
| Title |
A Probabilistic Algorithm for the Selection Problem -- |
| -- |
Exercises -- |
| Miscellaneous information |
9. |
| Title |
Computational Complexity and Intractability: An Introduction to the Theory of NP -- |
| Miscellaneous information |
9.1. |
| Title |
Intractability -- |
| Miscellaneous information |
9.2. |
| Title |
Input Size Revisited -- |
| Miscellaneous information |
9.3. |
| Title |
The Three General Problem Categories -- |
| Miscellaneous information |
9.3.1. |
| Title |
Problems for Which Polynomial-Time Algorithms Have Been Found -- |
| Miscellaneous information |
9.3.2. |
| Title |
Problems That Have Been Proven to Be Intractable -- |
| Miscellaneous information |
9.3.3. |
| Title |
Problems That Have Not Been Proven to Be Intractable but for Which Polynomial-Time Algorithms Have Never Been Found -- |
| Miscellaneous information |
9.4. |
| Title |
The Theory of NP |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
9.4.1. |
| Title |
The Sets P and NP -- |
| Miscellaneous information |
9.4.2. |
| Title |
NP-Complete Problems -- |
| Miscellaneous information |
9.4.3. |
| Title |
NP-Hard, NP-Easy, and NP-Equivalent Problems -- |
| Miscellaneous information |
9.5. |
| Title |
Handling NP-Hard Problems -- |
| Miscellaneous information |
9.5.1. |
| Title |
An Approximation Algorithm for the Traveling Salesperson Problem -- |
| Miscellaneous information |
9.5.2. |
| Title |
An Approximation Algorithm for the Bin-Packing Problem -- |
| -- |
Exercises -- |
| Miscellaneous information |
10. |
| Title |
Genetic Algorithms and Genetic Programming -- |
| Miscellaneous information |
10.1. |
| Title |
Genetics Review -- |
| Miscellaneous information |
10.2. |
| Title |
Genetic Algorithms -- |
| Miscellaneous information |
10.2.1. |
| Title |
Algorithm -- |
| Miscellaneous information |
10.2.2. |
| Title |
Illustrative Example -- |
| Miscellaneous information |
10.2.3. |
| Title |
The Traveling Salesperson Problem -- |
| Miscellaneous information |
10.3. |
| Title |
Genetic Programming -- |
| Miscellaneous information |
10.3.1. |
| Title |
Illustrative Example -- |
| Miscellaneous information |
10.3.2. |
| Title |
Artificial Ant -- |
| Miscellaneous information |
10.3.3. |
| Title |
Application to Financial Trading -- |
| Miscellaneous information |
10.4. |
| Title |
Discussion and Further Reading -- |
| -- |
Exercises -- |
| Miscellaneous information |
11. |
| Title |
Number-Theoretic Algorithms -- |
| Miscellaneous information |
11.1. |
| Title |
Number Theory Review -- |
| Miscellaneous information |
11.1.1. |
| Title |
Composite and Prime Numbers -- |
| Miscellaneous information |
11.1.2. |
| Title |
Greatest Common Divisor -- |
| Miscellaneous information |
11.1.3. |
| Title |
Prime Factorization -- |
| Miscellaneous information |
11.1.4. |
| Title |
Least Common Multiple -- |
| Miscellaneous information |
11.2. |
| Title |
Computing the Greatest Common Divisor. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
11.2.1. |
| Title |
Euclid's Algorithm -- |
| Miscellaneous information |
11.2.2. |
| Title |
An Extension to Euclid's Algorithm -- |
| Miscellaneous information |
11.3. |
| Title |
Modular Arithmetic Review -- |
| Miscellaneous information |
11.3.1. |
| Title |
Group Theory -- |
| Miscellaneous information |
11.3.2. |
| Title |
Congruency Modulo n -- |
| Miscellaneous information |
11.3.3. |
| Title |
Subgroups -- |
| Miscellaneous information |
11.4. |
| Title |
Solving Modular Linear Equations -- |
| Miscellaneous information |
11.5. |
| Title |
Computing Modular Powers -- |
| Miscellaneous information |
11.6. |
| Title |
Finding Large Prime Numbers -- |
| Miscellaneous information |
11.6.1. |
| Title |
Searching for a Large Prime -- |
| Miscellaneous information |
11.6.2. |
| Title |
Checking if a Number Is Prime -- |
| Miscellaneous information |
11.7. |
| Title |
The RSA Public-Key Cryptosystem -- |
| Miscellaneous information |
11.7.1. |
| Title |
Public-Key Cryptosystems -- |
| Miscellaneous information |
11.7.2. |
| Title |
The RSA Cryptosystem -- |
| -- |
Exercises -- |
| Miscellaneous information |
12. |
| Title |
Introduction to Parallel Algorithms -- |
| Miscellaneous information |
12.1. |
| Title |
Parallel Architectures -- |
| Miscellaneous information |
12.1.1. |
| Title |
Control Mechanism -- |
| Miscellaneous information |
12.1.2. |
| Title |
Address-Space Organization -- |
| Miscellaneous information |
12.1.3. |
| Title |
Interconnection Networks -- |
| Miscellaneous information |
12.2. |
| Title |
The PRAM Model -- |
| Miscellaneous information |
12.2.1. |
| Title |
Designing Algorithms for the CREW PRAM Model -- |
| Miscellaneous information |
12.2.2. |
| Title |
Designing Algorithms for the CRCW PRAM Model -- |
| -- |
Exercises -- |
| Miscellaneous information |
Appendix A |
| Title |
Review of Necessary Mathematics -- |
| Miscellaneous information |
A.1. |
| Title |
Notation -- |
| Miscellaneous information |
A.2. |
| Title |
Functions -- |
| Miscellaneous information |
A.3. |
| Title |
Mathematical Induction. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Miscellaneous information |
A.4. |
| Title |
Theorems and Lemmas -- |
| Miscellaneous information |
A.5. |
| Title |
Logarithms -- |
| Miscellaneous information |
A.5.1. |
| Title |
Definition and Properties of Logarithms -- |
| Miscellaneous information |
A.5.2. |
| Title |
The Natural Logarithm -- |
| Miscellaneous information |
A.6. |
| Title |
Sets -- |
| Miscellaneous information |
A.7. |
| Title |
Permutations and Combinations -- |
| Miscellaneous information |
A.8. |
| Title |
Probability -- |
| Miscellaneous information |
A.8.1. |
| Title |
Randomness -- |
| Miscellaneous information |
A.8.2. |
| Title |
The Expected Value -- |
| -- |
Exercises -- |
| Miscellaneous information |
Appendix B |
| Title |
Solving Recurrence Equations: With Applications to Analysis of Recursive Algorithms -- |
| Miscellaneous information |
B.1. |
| Title |
Solving Recurrences Using Induction -- |
| Miscellaneous information |
B.2. |
| Title |
Solving Recurrences Using the Characteristic Equation -- |
| Miscellaneous information |
B.2.1. |
| Title |
Homogeneous Linear Recurrences -- |
| Miscellaneous information |
B.2.2. |
| Title |
Nonhomogeneous Linear Recurrences -- |
| Miscellaneous information |
B.2.3. |
| Title |
Change of Variables (Domain Transformations) -- |
| Miscellaneous information |
B.3. |
| Title |
Solving Recurrences by Substitution -- |
| Miscellaneous information |
B.4. |
| Title |
Extending Results for n, a Power of a Positive Constant b, to n in General -- |
| Miscellaneous information |
B.5. |
| Title |
Proofs of Theorems -- |
| -- |
Exercises -- |
| Miscellaneous information |
Appendix C |
| Title |
Data Structures for Disjoint Sets. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Constructive mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computational complexity. |
| 907 ## - LOCAL DATA ELEMENT G, LDG (RLIN) |
|---|
| a |
.b16104183 |
| b |
2019-11-12 |
| c |
2019-11-12 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
AM |
| Suppress in OPAC |
No |
| Call number prefix |
QA9.58.N433 2015 |
| 914 ## - VTLS Number |
|---|
| VTLS Number |
vtls003581935 |
| 990 ## - EQUIVALENCES OR CROSS-REFERENCES [LOCAL, CANADA] |
|---|
| Link information for 9XX fields |
rab |
| 991 ## - LOCAL NOTE (NAMA FAKULTI/INSTITUT/PUSAT) |
|---|
| a |
Fakulti Sains dan Teknologi |
| 998 ## - LOCAL CONTROL INFORMATION (RLIN) |
|---|
| Library |
PERPUSTAKAAN TUN SERI LANANG |
| Operator's initials, OID (RLIN) |
2015-11-03 |
| Cataloger's initials, CIN (RLIN) |
m |
| Material Type (Sierra) |
Printed Books |
| Language |
English |
| Country |
|
| -- |
0 |
| -- |
.b16104183 |
