注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁出版圖書科學(xué)技術(shù)計算機/網(wǎng)絡(luò)計算機科學(xué)理論與基礎(chǔ)知識計算機科學(xué)導(dǎo)論(第5版)

計算機科學(xué)導(dǎo)論(第5版)

計算機科學(xué)導(dǎo)論(第5版)

定 價:¥59.50

作 者: (美)施奈德 等著
出版社: 清華大學(xué)出版社
叢編項:
標(biāo) 簽: 計算機理論

ISBN: 9787302232964 出版時間: 2010-09-01 包裝: 平裝
開本: 大16開 頁數(shù): 695 字?jǐn)?shù):  

內(nèi)容簡介

  隨著計算機應(yīng)用的普及,“計算機科學(xué)導(dǎo)論”課程不再是教授學(xué)生使用字處理器、數(shù)據(jù)庫、電子表格、演示軟件和電子郵件了,也不是只限于諸如Web頁面設(shè)計和交互式圖形的“娛樂”應(yīng)用,而是還應(yīng)包含諸如算法、硬件設(shè)計、計算機組織結(jié)構(gòu)、系統(tǒng)軟件、語言模型、計算理論以及計算機社會與倫理問題等知識。對這些核心知識的介紹,將向?qū)W生展示整個計算機領(lǐng)域的豐富和華美。它不僅使得學(xué)生可以高效地使用計算機和軟件,而且還可以鑒賞計算機和軟件的創(chuàng)建和實現(xiàn)背后的基本思想。本書就是針對“計算機科學(xué)導(dǎo)論”課的這種改革而編寫的。本書全面地介紹了該學(xué)科的內(nèi)容,無需讀者有計算機科學(xué)、程序設(shè)計或數(shù)學(xué)等背景知識。本書不僅適合用作計算機及相關(guān)專業(yè)學(xué)生的課程,也非常適合用作高中計算機科學(xué)課程的教材。

作者簡介

暫缺《計算機科學(xué)導(dǎo)論(第5版)》作者簡介

圖書目錄

Chapter 1 An Introduction to Computer Science
1.1 Introduction
Special Interest Box: In the Beginning...
1.2 The Definition of Computer Science
Speciol Interest Box: Abu Ja' far Muhammad ibn Musa A[-Khowarizmi
(a.d. 780-850?)
1.3 Algorithms
1.3.1 The Formal Definition of an Algorithm
1.3.2 The Importance of ALgorithmic Problem Solving
PRACTICE PROBLEMS
1.4 A Brief History of Computing
1.4.1 The Early Period: Up to 1940
Special Interest Box: The Original \Technophobia\
Special Interest Box: CharLes Babbage (1791-1871) Ada Augusta
Byron, Countess of Love[ace (1815-1852)
1.4.2 The Birth of Computers: 1940-1950
Special Interest Box: John Von Neumann (1903-1957)
Special Interest Box= And the Verdict Is..,
1.4.3 The Modern Era: 1950 to the Present
Special Interest Box: Good Evening, This Is Walter Cronkite
Spedal Interest Box: The WorLd's First Microcomputer
1.5 Organization of the Text
EXERCISES
CHALLENGE WORK
Level1 The Algorithmic Foundations of Computer Science
Chapter 2 ALgorithm Discovery and Design
2.1 Introduction
2.2 Representing Algorithms
2.2.1 Pseudocode
2.2.2 Sequential Operations
PRACTICE PROBLEMS
2.2.3 Conditional and Iterative Operations
Special Interest Box: From LittLe Primitives Mighty ALgorithms
Do Grow
PRACTICE PROBLEMS
2.3 ExampLes of ALgorithmic ProbLem Solving
2.3.1 ExampLe 1: Go Forth and Multiply
PRACTICE PROBLEMS
2.3.2 ExampLe 2: Looking, Looking, Looking
2.3.3 ExampLe 3: Big, Bigger, Biggest
PRACTICE PROBLEMS
2.3.4 Example 4: Meeting Your Match
PRACTICE PROBLEMS
2.4 ConcLusion
EXERCISES
CHALLENGE WORK
Chapter 3 The Efficiency of ALgorithms
3.1 Introduction
3.2 Attributes of ALgorithms
PRACTICE PROBLEMS
3.3 Measuring Efficiency
3.3.1 Sequential Search
3.3.2 Order of Magnitude--Order n
Special Interest Box: FLipping Pancakes
PRACTICE PROBLEM
3.3.3 SeLection Sort
PRACTICE PROBLEM
3.3.4 Order of Magnitude--Order n2
Special Interest Box: The Tortoise and the Hare
PRACTICE PROBLEM
3.4 AnaLysis of ALgorithms
3.4.1 Data CLeanup ALgorithms
PRACTICE PROBLEMS
3.4.2 Binary Search
PRACTICE PROBLEMS
3.4.3 Pattern Hatching
3.4.4 Summary
PRACTICE PROBLEM
3.5 When Things Get Out of Hand
PRACTICE PROBLEMS
3.6 Summary of Level 1
……
Level2 The Hardware World
Level3 The Virtual Machine
Level4 The Software World
Level5 Applications
Level6 Social Issues in Computing

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) m.ranfinancial.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網(wǎng)安備 42010302001612號