Data Structures and Algorithm Analysis in Java pdf epub mobi txt 電子書下載2025

☆☆☆☆☆

Mark Allen Weiss is Professor and Associate Director for the School of Computing and Information Sciences at Florida International University. He is also currently serving as both Director of Undergraduate Studies and Director of Graduate Studies. He received his Bachelor’s Degree in Electrical Engineering from the Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987 and was promoted to Professor in 1996. His interests include data structures, algorithms, and education. He is most well-known for his highly-acclaimed Data Structures textbooks, which have been used for a generation by roughly a million students.

Professor Weiss is the author of numerous publications in top-rated journals and was recipient of the University’s Excellence in Research Award in 1994. In 1996 at FIU he was the first in the world to teach Data Structures using the Java programming language, which is now the de facto standard. From 1997-2004 he served as a member of the Advanced Placement Computer Science Development Committee, chairing the committee from 2000-2004. The committee designed the curriculum and wrote the AP exams that were taken by 20,000 high school students annually.

In addition to his Research Award in 1994, Professor Weiss is also the recipient of the University’s Excellence in Teaching Award in 1999 and the School of Computing and Information Science Excellence in Teaching Award (2005) and Excellence in Service Award (2007).

出版者:Pearson

作者:Mark A. Weiss

出品人:

頁數:640

译者:

出版時間:2011-11-18

價格:GBP 129.99

裝幀:Hardcover

isbn號碼:9780132576277

叢書系列:

圖書標籤:

JAVA
數據結構
算法
計算機
Structures
編程
Data
Algorithms

下載連結在頁面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製連結

想要找書就要到小哈圖書下載中心

qciss.net

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP -completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.

具體描述

讀後感

評分☆☆☆☆☆

本书适合作为高级数据结构(CS7)课程或是研究生第一年算法课程的教材。学生应该具有中等程度的程学设计知识，还要具有离散数学的某些知识。

評分☆☆☆☆☆

英文原版 3.4.2节： Since there are a few options for implementation, it is probably worth a comment or two in the code, if you don't use the size field. 该书的中文翻译是：由于实现的方法有多种选择，因此如果你不使用表示大小的域，那就很有可能有必要进行一些讨...

評分☆☆☆☆☆

原著其实还可以比较适合工程人员速成但是翻译实在让人费解，举个例子树的根或者是一片树叶，或者其儿子数在2和M之间。这个别扭劲...... 还让人误解树的根在2和M之间或者一片树叶在2和M之间或者其儿子在2和M之间，这无法理解啊.... 其实想表达的是树的根要么是叶子...

評分☆☆☆☆☆

这种程度的书确实很少能见到了。它不在简单的地方无谓的浪费笔墨，恰到好处的把初学者带入算法和数据结构的世界。它基本上涉及了数据结构基础的“方方面面”。很难想象这书的厚度，居然能讲这么多内容（你看看算法导论有多厚就知道我在说什么了）。它在内容上并不乏深度...

用戶評價

评分☆☆☆☆☆

入門絕佳教材，把各種數據結構很清晰的用圖示和步驟呈現齣來，至少從概念來說，講明白瞭

评分☆☆☆☆☆

教科書

评分☆☆☆☆☆

好讀，對數據結構的介紹比算法導論詳細，有implementation

评分☆☆☆☆☆

我覺得裏麵給的code都不太對，至少AVL姐按照他給的implement不齣來。。。。。還有CS課本裏的proof怎麼跟數學的proof讀著像兩種不同的genre???

评分☆☆☆☆☆

是一本好書，但是自己隻是粗略的看瞭一遍，也嘗試實現瞭裏麵的就給常見的算法。課後習題大部分都沒有做，難度比較大，後麵要花時間做一些課後題。如名字所示，裏麵有很多對算法進行的數學分析。每一章最後的Reference也是不錯的資源，也需要花時間看瞭。所以現在自己其實不算看完一遍這本書，隻是翻瞭一遍，離看完還需要很長時間以及實踐。