National Science Library of Georgia

Image from Google Jackets

Basic concepts in data structures / Shmuel Tomi Klein, Bar-Ilan University, Israel.

By: Material type: TextTextPublisher: Cambridge : Cambridge University Press, 2016Description: 1 online resource (xii, 215 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781316676226 (ebook)
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 005.7/3 23
LOC classification:
  • QA76.9.D35 K558 2016
Online resources: 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 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Title from publisher's bibliographic system (viewed on 02 Dec 2016).

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.

There are no comments on this title.

to post a comment.
Copyright © 2023 Sciencelib.ge All rights reserved.