Data structures, algorithms, and applications in Java
著者
書誌事項
Data structures, algorithms, and applications in Java
(McGraw-Hill international editions, . Mathematics and statistics series)
McGraw-Hill, 2000
大学図書館所蔵 全1件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Sahni's DATA STRUCTURES,ALGORITHMS, and APPLICATIONS in JAVA is designed to be used in a second course in computer science (CS2). Using Java, this book provides comprehensive coverage of the fundamental data structures, making it an excellent choice for a CS2 course. The author has made this book student-friendly through intuitive discussion, real-world, applications and a gentle introduction. Sahni is unique in providing several real-world applications for each data structure presented in the book. These applications come from such areas as Sorting, compression and coding, and image processing. These applications give students a flavor for the sorts of things they will be able to do with the data structures that they are learning. Almost 1,000 exercises in this text serve to reinforce concepts and get students applying what they are learning. Sahni's text is also accompanied by a web site containing all the programs in the book, as well as sample data, generated output, solutions to selected exercises, and enhanced discussion of selected material in the text.
目次
1 Java Review 2 Performance Analysis of Programs 3 Asymptotic Notation 4 Performance Measurement of Programs 5 Linear Lists-Array Representation 6 Linear Lists-Linked Representation 7 Linear Lists-Simulated Pointers 8 Arrays and Matrices 9 Stacks 10 Queues 11 Skip Lists and Hashing 12 Binary and Other Trees 13 Priority Queues 14 Tournament Trees 15 Binary Search Trees 16 Balanced Search Trees 17 Graphs 18 The Greedy Method 19 Divide and Conquer 20 Dynamic Programming 21 Backtracking (ON WEBSITE) 22 Branch and Bound (ON WEBSITE)
「Nielsen BookData」 より