skip to content
Basic concepts in data structures Preview this item
ClosePreview this item
Checking...

Basic concepts in data structures

Author: Shmuel T Klein
Publisher: Cambridge ; New York, NY : Cambridge University Press, [2016]
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a problem efficiently rather than technical implementation details. The text includes  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Shmuel T Klein
ISBN: 9781107161276 1107161274 9781316613849 1316613844
OCLC Number: 953597748
Description: xii, 220 pages : illustrations ; 24 cm
Contents: Machine generated contents note: 1. Why Data Structures? A Motivating Example --
1.1. Boyer and Moore's Algorithm --
1.2. Bad-Character Heuristic --
1.3. Good-Suffix Heuristic --
Exercises --
2. Linear Lists --
2.1. Managing Data Storage --
2.2. Queues --
2.3. Stacks --
2.4. Other Linear Lists --
Exercises --
3. Graphs --
3.1. Extending the Relationships between Records --
3.2. Graph Representations --
3.3. Graph Exploration --
3.4. Usefulness of Graphs --
Exercises --
4. Trees --
4.1. Allowing Multiple Successors --
4.2. General versus Binary Trees --
4.3. Binary Trees: Properties and Examples --
4.4. Binary Search Trees --
Exercises --
5. AVL Trees --
5.1. Bounding the Depth of Trees --
5.2. Depth of AVL Trees --
5.3. Insertions into AVL Trees --
5.4. Deletions from AVL Trees --
5.5. Alternatives --
Exercises --
6. B-Trees --
6.1. Higher-Order Search Trees --
6.2. Definition of B-Trees --
6.3. Insertion into B-Trees --
6.4. Deletions from B-Trees --
6.5. Variants --
Exercises --
7. Heaps --
7.1. Priority Queues --
7.2. Definition and Updates --
7.3. Array Implementation of Heaps --
7.4. Construction of Heaps --
7.5. Heapsort --
Exercises --
8. Sets --
8.1. Representing a Set by a Bitmap --
8.2. Union-Find --
Exercises --
9. Hash Tables --
9.1. Calculating instead of Comparing --
9.2. Hash Functions --
9.3. Handling Collisions --
9.4. Analysis of Uniform Hashing --
9.5. Deletions from Hash Tables --
9.6. Concluding Remarks --
Exercises --
10. Sorting --
10.1. Sequence of Sorting Algorithms --
10.2. Lower Bound on the Worst Case --
10.3. Lower Bound on the Average --
10.4. Quicksort --
10.5. Finding the kth Largest Element --
Exercises --
11. Codes --
11.1. Representing the Data --
11.2. Compression Codes --
11.3. Universal Codes --
11.4. Error Correcting Codes --
11.5. Cryptographic Codes --
Exercises.
Responsibility: Shmuel Tomi Klein, Bar-Ilan University, Israel.

Abstract:

This concise text offers an accessible, conceptual presentation for students in any quantitative field.  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

User lists with this item (1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/953597748> # Basic concepts in data structures
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "953597748" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
   schema:about <http://dewey.info/class/005.73/e23/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/3926121680#Topic/data_structures_computer_science> ; # Data structures (Computer science)
   schema:author <http://experiment.worldcat.org/entity/work/data/3926121680#Person/klein_shmuel_t> ; # Shmuel T. Klein
   schema:bookFormat bgn:PrintBook ;
   schema:copyrightYear "2016" ;
   schema:datePublished "2016" ;
   schema:description "Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a problem efficiently rather than technical implementation details. The text includes pseudocode and covers all the most common data structures, such as queues, stacks, trees, heaps, and hash tables, along with the basics of searching, sorting, and coding. This book can supplement any undergraduate algorithms or discrete math course and will also be accessible to students and researchers in other quantitative disciplines. No prerequisites beyond introductory programming and basic mathematics are required, and the accessible, conceptual presentation will appeal to undergraduates in many quantitative fields. Carefully designed problem sets with selected solutions will allow students to test their understanding.--"@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/3926121680> ;
   schema:inLanguage "en" ;
   schema:name "Basic concepts in data structures"@en ;
   schema:productID "953597748" ;
   schema:workExample <http://worldcat.org/isbn/9781316613849> ;
   schema:workExample <http://worldcat.org/isbn/9781107161276> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/953597748> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/3926121680#Person/klein_shmuel_t> # Shmuel T. Klein
    a schema:Person ;
   schema:familyName "Klein" ;
   schema:givenName "Shmuel T." ;
   schema:name "Shmuel T. Klein" ;
    .

<http://experiment.worldcat.org/entity/work/data/3926121680#Topic/data_structures_computer_science> # Data structures (Computer science)
    a schema:Intangible ;
   schema:name "Data structures (Computer science)"@en ;
    .

<http://worldcat.org/isbn/9781107161276>
    a schema:ProductModel ;
   schema:isbn "1107161274" ;
   schema:isbn "9781107161276" ;
    .

<http://worldcat.org/isbn/9781316613849>
    a schema:ProductModel ;
   schema:isbn "1316613844" ;
   schema:isbn "9781316613849" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.