《計算機學科專業基礎綜合考研輔導與試題精解（2010版）》是2009年10月1日清華大學出版社出版的圖書，作者是丁金濱、杜曄、陳輝。
基本介紹
- 書名：計算機學科專業基礎綜合考研輔導與試題精解（2010版）
- 作者：丁金濱、杜曄、陳輝
- ISBN：9787302212171
- 定價：55元
- 出版社：清華大學出版社
- 出版時間：2009年10月1日
內容簡介,圖書目錄,
內容簡介
《全國碩士研究生入學統一考試計算機學科專業基礎綜合（2010年版）》是專門針對計算機專業研究生入學考試的特點和需求量身打造的，書中融合了編者多年的教學輔導經驗，完全針對考研大綱的要求，知識點覆蓋全面，文字通俗易懂，簡潔精煉，是複習備考不可缺少的學習資料。從去年全國計算機專業課統考以來，市面上出現了一些有關專業課統考的複習用書，但並非特別適合考生使用，大部分輔導用書由於編寫時間極短，覆蓋知識點不全，難易程度控制不到位，不僅沒能起到總結歸納的作用，反而浪費考生的複習時間，影響複習效果
本書在編寫過程中，注重吸取目前市面上專業複習用書出現的一些問題，特別針對當前國內大學生學習水平和複習時間，給出考生複習計算機專業課的目標、考點精解、例題精析和習題、參考答案等。使得本書無論是在知識面的覆蓋上，還是在題目的難易程度上都儘量與考試一致。使考生高效率的複習知識點，提高對知識的認識水平，總結和歸納套用技巧。因此，學生完全可以放心選擇本書作為計算機專業的複習全書
圖書目錄
第1部分數據結構
第1章線性表············································2
1.1複習提示··················································2
1.1.1複習目標和要求·································2
1.1.2命題方向提示·····································3
1.2知識點精講···············································3
1.2.1數據結構的基本概念和線性結構······3
1.2.2順序表的類型和定義·························3
1.2.3線性表的順序表示和實現··················4
1.2.4線性表的鏈式表示和實現··················6
1.2.5遞歸概念及算法實現·························8
1.3例題精析··················································8
1.4習題························································15
1.5習題解答················································18
第2章棧、佇列和數組·····························21
2.1複習提示················································21
2.1.1複習目標和要求·······························21
2.1.2命題方向提示···································22
2.2知識點精講·············································22
2.2.1棧和佇列的基本概念·······················22
2.2.2順序棧和鏈棧及其套用···················23
2.2.3鏈隊、順序隊和循環佇列················27
2.2.4對稱矩陣···········································29
2.2.5特殊矩陣的壓縮存儲·······················29
2.3例題精析················································31
2.4習題························································37
2.5習題答案················································40
第3章樹與二叉樹····································45
3.1複習提示················································45
3.1.1複習目標和要求·······························45
3.1.2命題方向提示···································46
3.2知識點精講·············································46
3.2.1樹和二叉樹的定義和主要特徵········46
3.2.2二叉樹的順序存儲結構
和鏈式存儲結構································48
3.2.3二叉樹的遍歷····································49
3.2.4線索二叉樹的基本概念和構造········50
3.2.5排序二叉樹和平衡二叉樹················53
3.2.6樹的存儲結構和森林························53
3.2.7樹和森林的遍歷································55
3.2.8樹的套用：哈夫曼樹
和哈夫曼編碼···································56
3.3例題精析················································58
3.4習題························································65
3.5習題答案················································69
第4章圖···················································78
4.1複習提示················································78
4.1.1複習目標和要求································78
4.1.2命題方向提示····································79
4.2知識點精講············································79
4.2.1圖的概念和基本術語························79
4.2.2圖的存儲結構和操作························80
4.2.3圖的遍歷············································82
4.2.4最小生成樹和生成森林····················83
4.2.5最短路徑············································84
4.2.6拓撲排序············································85
4.2.7關鍵路徑············································86
4.3例題精析················································87
4.4習題························································93
4.5習題答案················································96
第5章查找·············································100
5.1複習提示···············································100
5.1.1複習目標和要求······························100
5.1.2命題方向提示··································101
5.2知識點精講···········································101
目錄
VI
5.2.1查找的基本概念·····························101
5.2.2順序查找法·····································102
5.2.3折半查找法·····································103
5.2.4動態查找法·····································103
5.2.5B-樹和B+樹···································106
5.2.6哈希表·············································107
5.3例題精析··············································110
5.4習題······················································114
5.5習題答案··············································116
第6章內部排序······································120
6.1複習提示··············································120
6.1.1複習目標和要求·····························120
6.1.2命題方向提示·································121
6.2知識點精講···········································121
6.2.1排序的基本概念······························121
6.2.2插入排序··········································122
6.2.3交換排序··········································123
6.2.4選擇排序··········································124
6.2.5歸併排序··········································127
6.2.6基數排序··········································128
6.2.7對各種排序算法的比較··················129
6.3例題精析···············································130
6.4習題·······················································133
6.5習題答案···············································137
