|Listed in category:
BUY 3, GET 1 FREE (add 4 to cart)See all eligible items and terms
Have one to sell?

Data Structures and Their Algorithms - Paperback By Lewis, Harry R. - GOOD

US $5.58
Condition:
Good
Last One / 3 sold
Breathe easy. Free shipping and returns.
Shipping:
Free Economy Shipping. See detailsfor shipping
Located in: Montgomery, Illinois, United States
Delivery:
Estimated between Thu, May 30 and Mon, Jun 3 to 43230
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
30 days returns. Seller pays for return shipping. See details- for more information about returns
Payments:
      
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

Shop with confidence

Top Rated Plus
Top rated seller, fast shipping, and free returns. Learn more- Top Rated Plus - opens in a new window or tab
eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:266343296833
Last updated on May 21, 2024 19:11:48 PDTView all revisionsView all revisions

Item specifics

Condition
Good: A book that has been read but is in good condition. Very minimal damage to the cover including ...
Brand
Unbranded
Book Title
Data Structures and Their Algorithms
MPN
Does not apply
ISBN
9780673397362
Publication Year
1997
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
Data Structures and Their Algorithms
Item Height
1.3in
Author
Harry R. Lewis, Larry Denenberg
Item Length
9.2in
Publisher
Pearson Education
Item Width
6.1in
Item Weight
26.2 Oz
Number of Pages
528 Pages

About this product

Product Information

This book in an all-inclusive presentation introduces the datastructures (and their algorithms) that comprise the foundationof software engineering. Designed to show students at the sophomorelevel the connection between a programming approach and mathematicaltheory, the text focuses on practical techniques for studentsto master data structures and efficient algorithm implementation.Other topics pertinent to programmers also receive coverage. Chapter-endingproblems and references give students a helpful review and solidifychapter concepts. 067339736XB04062001

Product Identifiers

Publisher
Pearson Education
ISBN-10
067339736x
ISBN-13
9780673397362
eBay Product ID (ePID)
10038789112

Product Key Features

Author
Harry R. Lewis, Larry Denenberg
Publication Name
Data Structures and Their Algorithms
Format
Trade Paperback
Language
English
Publication Year
1997
Type
Textbook
Number of Pages
528 Pages

Dimensions

Item Length
9.2in
Item Height
1.3in
Item Width
6.1in
Item Weight
26.2 Oz

Additional Product Features

Lc Classification Number
Qa76.9.D35l475 1991
Table of Content
I. INTRODUCTION PROGRAMMING AS AN ENGINEERING ACTIVITY. Computer Science Background. Memory and Data in Von Neuman Computers. Notation for Programs; Locatives. Abstract Data Types. Mathematical Background. Finite and Infinite Series. Logarithms, Powers, and Exponentials. Order Notation. Recurrence Relations. Naive Probability Theory. II. ALGORITHM ANALYSIS. Properties of an Algorithm. Effectiveness; Correctness. Termination; Efficiency. Program Complexity. Exact vs. Growth-Rate Analysis. Principles of Mathematical Analysis. Expected Case and Amortized Analysis. Algorithm Paradigms. Brute-Force and Exhaustive Search. Greedy Algorithms. Dynamic Programming. NP Completeness. III. LISTS. List Operations. Basic List Representations. Stack Representation in Contiguous Memory. Queue Representation in Contiguous Memory. Stack Representation in Linked Memory. Queue Representation in Linked Memory. Stacks and Recursions. List Representations for Traversals. Doubly Linked Lists. IV. TREES BASIC DEFINITIONS. Special Kinds of Trees. Tree Operations and Traversals. Tree Implementations. Representation of Binary Trees. Representation of Ordered Trees. Representation of Complete Binary Trees. Implementing Tree Traversals and Scans. Stack-Based Traversals. Link Inversion Traversal. Scanning a Tree in Constant Space. ThreadedTrees. Implementing Level-Order Traversal. Summary. V. ARRAYS AND STRINGS. Arrays as Abstract Data Types. Multidimensional Arrays. Contiguous Representation of Arrays. Constant Time Initialization. Sparse Arrays. List Representations. Hierarchical Tables. Arrays with Special Shapes. Representation of Strings. Huffman Encoding; Lempel Ziv Encoding. String Searching. The Knuth-Morris-Pratt Algorithm. The Boyer-Moore Algorithm. Fingerprinting and the Karp-Rabin Algorithm. VI. LIST AND TREE IMPLEMENTATION OF SETS. Sets and Dictionaries as Abstract Data Types. Unordered Lists. Ordered Lists. Binary Search; Interpolation Search; Skip Lists. Binary Search Trees. Insertion; Deletion. Static Binary Search Trees. Optimal Trees; Probability-Balanced. Trees; Median Split Trees. VII. TREE STRUCTURES FOR DYNAMIC DICTIONARIES. AVL Trees: Insertion; Deletion. 23 Trees and Btrees. 23 Trees; Red-Black Trees. (a,b)Trees and B Trees. Self-Adjusting Binary Search Trees. VIII. SETS OF DIGITAL DATA. Bit Vectors. Tries and Digital Search Trees. Hashing Techniques. Chaining Strategies; Open Addressing Strategies. Deletions; Extendable Hashing. Hashing Functions. Hashing by Division; Hashing by Multiplication. Perfect Hashing of Static Data; Universal Classes of Hash Functions. IX. SETS WITH SPECIAL OPERATIONS. Priority Queues. Balanced Tree Implementations. Heaps; Leftist Trees. Disjoint Sets with Union. Up-Trees; Path Compression. Range Searching: kdTrees for Multidimensional Searching. Quad Trees; Grid Files. X. MEMORY MANAGEMENT. The Problem of Memory Management. Records of a Single Size. Reference Counts; Mark and Sweep. Garbage Collection; Collecting by Copying. Final Cautions on Garbage Collection. Compaction of Records of Various Sizes. Managing A Pool of Blocks of Various Sizes. Allocation Strategies; Data Structures for Freeing; Buddy Systems. XI. SORTING. Kinds of Sorting Algorithms. Insertion and Shell Sort. Selection and Heap Sort. Quick Sort. The Information-Theoretic Lower Bound. Digital Sorting. Bucket Sort; Radix Sort; Radix Exchange Sort. External Sorting. Merge Sorts; Polyphase Merge Sort. Generating the Initial Runs. Finding the Median. XII. GRAPHS. Graphs and Their Representation. Trees. Graph Searching. Breadth-First Search; Depth-First Search. Greedy Algorithms on Graphs. Minimum Spanning Trees; Single-Source Least-Cost Paths. All Pairs Least-Cost Paths. Network Flow. Finding Maximum Flows. Implementing the Max Flow. Algorithm. Applications of Max Flow. XIII. ENGINEERING WITH DATA STRUCTURES. Locatives. 067339736XT04062001
Copyright Date
1991
Target Audience
College Audience
Topic
Programming / General, Programming / Algorithms, Software Development & Engineering / Systems Analysis & Design
Lccn
90-023290
Dewey Decimal
005.7/3
Dewey Edition
20
Genre
Computers

Item description from the seller

SecondSalecom

SecondSalecom

98.1% positive feedback
24.6M items sold
Joined Aug 2002

Detailed seller ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
5.0
Communication
5.0

Seller feedback (5,915,928)

0***9 (3062)- Feedback left by buyer.
Past year
Verified purchase
A+
See all feedback

Product ratings and reviews

5.0
1 product ratings
  • 1 users rated this 5 out of 5 stars
  • 0 users rated this 4 out of 5 stars
  • 0 users rated this 3 out of 5 stars
  • 0 users rated this 2 out of 5 stars
  • 0 users rated this 1 out of 5 stars
We have ratings, but no written reviews for this, yet. Be the first to write the review.