大葉大學圖書館 |

登入

回首頁

Basic concepts in data structures[el...

Klein, Shmuel Tomi.

Basic concepts in data structures[electronic resource] /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	005.73
書名/作者:	Basic concepts in data structures/ Shmuel Tomi Klein.
作者:	Klein, Shmuel Tomi.
出版者:	Cambridge : : Cambridge University Press,, 2016.
面頁冊數:	xii, 215 p. : : ill., digital ;; 24 cm.
標題:	Data structures (Computer science)
ISBN:	9781316676226
ISBN:	9781107161276
ISBN:	9781316613849
摘要、提要註:	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.
電子資源:	https://doi.org/10.1017/CBO9781316676226

Basic concepts in data structures[electronic resource] /
Klein, Shmuel Tomi.

Basic concepts in data structures[electronic resource] /Shmuel Tomi Klein. - Cambridge :Cambridge University Press,2016. - xii, 215 p. :ill., digital ;24 cm.

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.

ISBN: 9781316676226Subjects--Topical Terms:

417983
Data structures (Computer science)

LC Class. No.: QA76.9.D35 / K558 2016

Dewey Class. No.: 005.73

Basic concepts in data structures[electronic resource] /
LDR:01816nmm a2200253 a 4500 001 491827
003 UkCbUP
005 20191005162420.0
006 m d
007 cr nn 008maaau
008 210201s2016 enk o 1 0 eng d
020 $a 9781316676226 $q (electronic bk.)
020 $a 9781107161276 $q (hardback)
020 $a 9781316613849 $q (paperback)
035 $a CR9781316676226
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA76.9.D35 $b K558 2016
082 0 4 $a 005.73 $2 23
090 $a QA76.9.D35 $b K64 2016
100 1 $a Klein, Shmuel Tomi. $3 711593
245 1 0 $a Basic concepts in data structures $h [electronic resource] / $c Shmuel Tomi Klein.
260 $a Cambridge : $b Cambridge University Press, $c 2016.
300 $a xii, 215 p. : $b ill., digital ; $c 24 cm.
520 $a 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.
650 0 $a Data structures (Computer science) $3 417983
856 4 0 $u https://doi.org/10.1017/CBO9781316676226

筆 0 讀者評論

多媒體

多媒體檔案
https://doi.org/10.1017/CBO9781316676226

評論

新增評論分享你的心得

Export

取書館別