Data structures and algorithms analysis in C (Record no. 128)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05320nam a22002537a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | LSCPL |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20130906051227.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 130220t1997 ii ill.g |||| 001 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9788177583588 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NCL |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Edition number | 2nd ed. |
| Classification number | 005.73 |
| Item number | WEI-D 1997 263 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Weiss, Mark Allen |
| 9 (RLIN) | 320 |
| 245 1# - TITLE STATEMENT | |
| Title | Data structures and algorithms analysis in C |
| Statement of responsibility, etc. | / by Mark Allen Weiss |
| 246 ## - VARYING FORM OF TITLE | |
| Title proper/short title | Data structures & algorithms analysis in C |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New Delhi : |
| Name of publisher, distributor, etc. | Pearson Education Private Limited, |
| Date of publication, distribution, etc. | 1997c. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 527 p. |
| Other physical details | ill, : |
| Dimensions | 23 cm. |
| 500 ## - GENERAL NOTE | |
| General note | Index included |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | (All chapters, except Chapter 3, conclude with a Summary, Exercises and References.) 1. Introduction. What's the Book About? Mathematics Review. Exponents. Logarithms. Series. Modular Arithmetic. The P word. A Brief Introduction to Recursion. 2. Algorithm Analysis. Mathematical Background. Model. What to Analyze. Running Time Calculations. A Simple Example. General Rules. Solutions for the Maximum Subsequence Sum Problem. Logarithms in the Running Time. Checking Your Analysis. A Grain of Salt. 3. Lists, Stacks, and Queues. Abstract Data Types (ADTs). The List ADT. Simple Array Implementation of Lists. Linked Lists. Programming Details. Common Errors. Doubly Linked Lists. Circularly Linked Lists. Examples. Cursor Implementation of Linked Lists. The Stack ADT. Stack Model. Implementation of Stacks. Applications. The Queue ADT. Queue Model. Array Implementation of Queues. Applications of Queues. 4. Trees. Preliminaries. Implementation of Trees. Tree Traversals with an Application. Binary Trees. Implementation. Expression Trees. The Search Tree ADT-Binary Search Trees. MakeEmpty. Find. FindMin and FindMax. Insert. Delete. Average-Case Analysis. AVL Trees. Single Rotation. Double Rotation. Splay Trees. A Simple Idea (That Does Not Work). Splaying. Tree Traversals (Revisited). B-Trees. 5. Hashing. General Idea. Hash Function. Separate Chaining. Open Addressing. Linear Probing. Quadratic Probing. Double Hashing. Rehashing. Extendible Hashing. 6. Priority Queues (Heaps). Model. Simple Implementations. Binary Heaps. Structure Property. Heap Order Property. Basic Heap Operations. Other Heap Operations. Applications of Priority Queues. The Selection Problem. Event Simulation. d-Heaps. Leftist Heaps. Leftist Heap Property. Leftist Heap Operations. Skew Heaps. Binomial Queues. Binomial Queue Structure. Binomial Queue Operations. Implementations of Binomial Queues. 7. Sorting. Preliminaries. Insertion Sort. The Algorithm. Analysis of Insertion Sort. A Lower Bound for Simple Sorting Algorithms. Shellsort. Analysis of Insertion Sort. Heapsort. Analysis of Heapsort. Mergesort. Analysis of Mergesort. Quicksort. Picking the Pivot. Partitioning Strategy. Small Arrays. Actual Quicksort Routines. Analysis of Quicksort. A Linear-Expected-Time Algorithm for Selection. Sorting Large Structures. A General Lower Bound for Sorting. Decision Trees. Bucket Sort. External Sorting. Why We Need New Algorithms. Model for External Sorting. The Simple Algorithm. Multiway Merge. Polyphase Merge. Replacement Selection. 8. The Disjoint Set ADT. Equivalence Relations. The Dynamic Equivalence Problem. Basic Data Structure. Smart Union Algorithms. Path Compression. Worst Case for Union-by-Rank and Path Compression. Analysis of the Union/Find Algorithm. An Application. 9. Graph Algorithms. Definitions. Representation of Graphs. Topological Sort. Shortest-Path Algorithms. Unweighted Shortest Paths. Dijkstra's Algorithm. Graphs with Negative Edge Costs. Acyclic Graphs. All-Pairs Shortest Path. Network Flow Problems. A Simple Maximum-Flow Algorithm. Minimum Spanning Tree. Prim's Algorithm. Kruskal's Algorithm. Applications of Depth-First Search. Undirected Graphs. Biconnectivity. Euler Circuits. Directed Graphs. Finding Strong Components. Introduction to the NP-Completeness. Easy vs. Hard. The Class NP. NP-Complete Problems. 10. Algorithm Design Techniques. Greedy Algorithms. A Simple Scheduling Problem. Huffman Codes. Approximate Bin Packing. Divide and Conquer. Running Time of Divide and Conquer Algorithms. Closest-Points Problem. The Selection Problem. Theoretical Improvements for Arithmetic Problems. Dynamic Programming. Using a Table Instead of Recursion. Ordering Matrix Multiplications. Optimal Binary Search Tree. All-Pairs Shortest Path. Randomized Algorithms. Random Number Generators. Skip Lists. Primality Testing. Backtracking Algorithms. The Turnpike Reconstruction Problem. Games. 11. Amortized Analysis. An Unrelated Puzzle. Binomial Queues. Skew Heaps. Fibonacci Heaps. Cutting Nodes in Leftist Heaps. Lazy Merging for Binomial Queues. The Fibonacci Heap Operations. Proof of the Time Bound. Splay Trees. 12. Advanced Data Structures and Implementation. Top-Down Splay Trees. Red Black Trees. Bottom-Up Insertion. Top-Down Red Black Trees. Top-Down Deletion. Deterministic Skip Lists. AA-Trees. Treaps. k-d Trees. Pairing Heaps. Index. 0201498405T04062001 |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Using a C implementation, this book highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. It presents data structures |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms |
| 9 (RLIN) | 239 |
| 653 ## - INDEX TERM--UNCONTROLLED | |
| Uncontrolled term | Computer Science |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | Books |
| 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 | Cost, normal purchase price | Inventory number | Total Checkouts | Total Renewals | Full call number | Barcode | Date last seen | Date checked out | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Namal Library | Namal Library | Computer Science | 02/20/2013 | Allied book company | 446.25 | Bill No. 1415 | 3 | 1 | 005.73 WEI-D 1997 263 | 263 | 09/26/2022 | 06/03/2022 | 07/18/2013 | Books |