計(jì)算機(jī)科學(xué)導(dǎo)論

內(nèi)容概要

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

作者簡介

作者：（美國）施奈德（G.Michael Schneider） （美國）Judith L.Gersting

書籍目錄

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 WORKLevel1 The Algorithmic Foundations of Computer ScienceChapter 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 WORKChapter 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 WorldLevel3 The Virtual MachineLevel4 The Software WorldLevel5 ApplicationsLevel6 Social Issues in Computing

章節(jié)摘錄

插圖：The discussions in Level 1 assume that our algorithms are executed bysomething called a "computing agent," an abstract concept for any entity thatcan effectively carry out the instructions in our solution. However, in Level 2（Chapters 4-5）, "The Hardware World," we want our algorithms to be executedby "real" computers to produce "real" results. Thus begins our discussion ofhardware, logic design, and computer organization. The initial discussionintroduces the basic building blocks of computer systems——binary numbers,Boolean logic, gates, and circuits. It then shows how these elementary conceptsare used to construct a real computer using the classic Von Neumann architec-ture, including processors, memory, buses, and input/output. It presents a typ-ical machine language instruction set and explains how the algorithms of Level1 can be represented in machine language and run on the Von Neumann hard-ware of Level 2, conceptually tying together these two areas. It ends with a dis-cussion of important new directions in hardware design——multicore andmassively parallel machines.By the end of Level 2 students have been introduced to some basic con-cepts in logic design and computer organization, and they understand andappreciate the enormous complexity of these areas. This complexity is themotivation for Level 3 （Chapters 6-8）, "The Virtual Machine." This sectiondescribes how system software produces a more friendly, user-orientedproblem-solving environment that hides many of the ugly hardware detailsjust described. Level 3 looks at the same problem discussed in Level 2,encoding and executing an algorithm, but shows how much easier this is ina virtual environment containing software tools like editors, translators, andloaders. This section also discusses the services and responsibilities of oper-ating systems and how operating systems have evolved. It investigates oneof the most important virtual environments in current use——a network ofcomputers. It shows how systems such as the Ethernet, Internet, and theWeb are created from computers linked together via transmission media and communications software.

編輯推薦

《計(jì)算機(jī)科學(xué)導(dǎo)論(第5版)(影印版)》是大學(xué)計(jì)算機(jī)教育國外著名教材系列。

圖書封面

圖書標(biāo)簽Tags

無

評(píng)論、評(píng)分、閱讀與下載

---

    計(jì)算機(jī)科學(xué)導(dǎo)論 PDF格式下載

---