C的应用：入门和提高（英文影印版）|大学计算机教育丛书（英文影印版）|Alice E.Fischer & David W.Eggert & Stephen M.Ross|清华大学出版社

【相关下载】

【二手书】
本产品共有 0 册二手书出售，最低价：￥.00 [查看]

推荐图书

	更锋利的C#代码——编写高... 作者:包善东　著
	PHP Web 2.0开发实战作者:（澳）泽瓦斯　著，苏金国　等译
	编程珠玑(第2版) 作者:（美）本特利（　Bentley,J.）　著；黄倩、钱丽艳　译
	JSF Web应用开发实战作者:李文兵赵恒编著
	Java程序设计教程作者:余永红等编著
	JSF Web应用开发实战作者:麻地河赵恒

用户购买本书还购买了

· 公司理财(第7版）（英文版）（10...

· 概率基础

· 博弈入门

· 并行计算导论（英文版）（第２版...

· More Exceptional C++(英文版)

· Exceptional C++(英文版)

· Exceptional C++ Style(英文版)

· C++数值算法（第二版英文版）

· C++程序设计语言（特别版）

· C++Primer:第三版

金书共建·What's this?

[分类共建] ·所有未分类图书查看
本书当前分类：
软件与程序设计 > C/Turbo C > C
我觉得本书应分到此类中：

[金书WIKI]
[ 编辑 ]当前页面使本书内容更加完善

[资源共建]
·提交本书书摘 ·提交本书相关资源

C的应用：入门和提高（英文影印版）

您想读这本书吗？
原书名：Applied C:An Introduction and More	原出版社：McGraw-Hill
作者： Alice E.Fischer & David W.Eggert & Stephen M.Ross	出版社：清华大学出版社
译者：	丛书名：大学计算机教育丛书（英文影印版）
出版日期：2001-5-1	上架日期：2005-10-8
ISBN：7302044805	页数：版次：1-1
开本：	装帧：

市场价：~~￥79.80~~

贵宾会员价：￥56.86
高级会员价：￥59.85
普通会员价：￥59.85

金书豆豆(What's this?)

种一个豆豆，书价我来定！

我要种一个豆豆

【您的购物车】

购买册数：


货到付款：北京、上海、天津、广州、深圳、湖北、河南、山西、陕西、山东、四川、重庆、浙江更多查看>>

[暂时缺货，正在进货您可以在此处进行缺货登记,到货后我们会及时通知您！]

| 大封面 | 封底 | 前言 | 内容简介 | 序言 | 目录 | 作者简介 | 译者简介 | 作者序 | 译者序 |

【读者评论】

内容简介
本书共分五大部分：第一部分引入了计算机和系统，程序和程序设计以及基本的程序设计概念；第二部分引入了对象，类型和表达式以及如何建立数和库，循环和决策；第三部分介绍基本数据类型；第四部分引入数据类型；第五部分引入高级技术如：动态数组、迭代、实时栈等。
本书是迄今为止第一本对C语言应用加以全面介绍的书籍，材料相当丰富，其中第五部分的高级技术在其他C语言书籍中很少提到。
本书作者既是机械工程系教授，又是计算机科学技术系教授，具有丰富的教学经验。在内容安排方面，作者非常注意由易到难，由浅入深，呈螺旋式上升；既考虑初学者的要求，又照顾到深造者的需要。本书无论是计算机专业还是非计算机专业的学生均是一本理想的教材。

目录
伸缩显示:

[弹出查看]

I INTRooucnoN
   l Computers and Systems
     l.l The Physical Computer
     l.2 The Operating System
     I.3 Languages
     l.4 What You Should Remember
     l.5 Exercises
   2 Programs and Pregramming
     2.1 What Is a Program?
     2.2 Problem Specification and Analysis
     2.3 The Development Environment
     2.4 Program Constnlction
     2.5 Program Execution and Testing
     2.6 What You Should Remember
     2.7 Exercises
   3 Fundamental Contepts
     3.l Parts of a Program
     3.2 The Simplest Program
     3.3 Variables, Input, Output, and Sequencing
     3.4 Simple Calculations
     3.5 The Flow ofControl
     3.6 Asking Qoestions: Conditional Statements
     3.7 Loops and Repetition
     3.8 An Application
     3.9 What You Should Remember
     3.1O Exercises
   II CONPUTATION
   4 Obieetsl lypesl and Expressions
     4. I Variables, Constants, and Literals
     4.2 Expressions and Parse Trees
     4.3 Arithmetic, Assignment, and Combination Operators
     4.4 Increment and Decrement Operators
     4.5 Relational Operators
     4.6 Logic Operators
     4.7 An Example: A Voltage Ramp
     4.8 Case Study: Using a Parse Tree to Debug
     4.9 What You Should Remember
     4.1O Exercises
   5 Using Funetions ond Libraries
     5.l Libraries
     5.2 Using Libraries
     5.3 Function Types
     5.4 User-Defined Functions
     5.5 Math Library Application: Roots of a Quadratic Equation
     5.6 What You Should Remember
     5.7 Exercises
   6 More Repetition and Deeision
     6.l New Loops
     6.2 Applications of Loops
     6.3 The nwitch Statement
     6.4 Counted Loop Application: Integration by Simpson's Rule
     6.5 Sentinel Loop Application: Interpolation (Optional Topic)
     6.6 What You Should Remember
     6. 7 Exercises
   III BASIC DATA TYPES
   7 Using Numeric lypes
     7.1 Integer Types
     7.2 Floating-Point Types in C
     7.3 Reading and Writing Numbers
     7.4 Integer Operations
     7.5 Mixing Types in ComputationR (Advanced Topic)
     7.6 Pseudo-Random Numbers
     7.7 Application: A Guessing Game
     7.8 What You Should Remember
     7.9 Exercises
   8 Ihe Trouble vvith Numbers
     8.l Floating-Point Comparisons
     8.2 Calculation Enors (Advanced Topic)
     8.3 Optional Application: Finding the Real Roon of an Equation
     8.4 What You Should Remember
     8.3 hxerclses
   9 Program Design
     9.l Modular Programs
     9.2 Communication Between Functions
     9.3 Declaration-Call Conespondence
     9.4 Data Modularity .
     9.5 Function Call Graphs
     9.6 Program Design and Construction
     9.7 What You Should Remember
     9.8 Exercises
   lO An Intreduetion to Arroys
     l0.l Anays
     1O.2 Using Anays
     1O.3 Parallel Arrays
     1O.4 Anay Arguments and Parameters
     1O.5 What You Should Remember
     1O.6 Exercises
   ll eharoeter Data ond Enumeratiens
     11.l Representation of Characters
     ll.2 Input and Output with Characters
     ll.3 Ooerations on Characters (Advanced Topic)
     ll.4 Character Application: An Improved Processing Loop
     11.5 Enumerated Types
     l1.6 What You Should Remember
     11.7 Exercises
   12 An Introduetion to Pointers
     12.l A First Look at Pointers
     12.2 Call by Address
     12.3 Application: The Bisection Method (Advanced Topic)
     12.4 What You Should Remember
     12.5 Exercises
   IV 5TRUCTUREO OJtTJt mPE5
   l3 Strings
     l3.1 String Representation
     13.2 String UO
     13.3 The String Library
     13.4 Anays of Strings
     13.5 String Processing Applications (Optional Topic)
     13.6 Application: A Gas Pressure Table
     13.7 What You Should Remember .
     13.8 Exercises
   l4 5truetures Types
     14.l Declarations
     14.2 Operations on Strnctures
     14.3 ADplication: Points in a Rectangle .
     14.4 A"p"plication: The Monte Carlo Method (Optional Topic)
     14.5 What You Should Remember
     14.6 Exercises
   15 5treoms ond Files
     15.1 Streams and Buffers
     15.2 Programmer-Defined Streams
     15.3 Stream Output
     15.4 Stream Input
     15.5 Eoors and Exceptions
     15.6 File Application: Random Selection Without Replacement
     15.7 Application: Measuring Torque (Optional Topic)
     15.8 What You Should Remember
     15.9 Exercises
   l6 Simple Arrey Algorithms
     l6.l Searching an Aoay Data Structure
     16.2 Application: Screening out Faulty Data (Optional Topic)
     16.3 SoHing by Selection
     16.4 What Yon Should Remember
     16.5 Exercises
   l7 Two-Dimensional Arrays 
     17.1 Nested Loops: Printing a Table
     17.2 Introduction to Two-Dimensional Anays
     17.3 Application: Transformation of 2D Point Coordinates
     17.4 Application: Image Processing
     17.5 What You Should Remember
     17.6 Exercises
   l8 Calculeting vrith Bits
     18.l Unsigned Numbers and Hexadecimal Notation
     18.2 Bitwise Operators
     18.3 Application: Simple Encryption and Decryption
     18.4 Bitfield Types
     18.5 What You Should Remember 
     18.6 Exercises
   V AOVANCfO TECHNI8UE5
   l9 Dynamic Arrays
     19.l Dynamic Memory Allocation
     19.2 Using Dynamic Arrays: A Simulation
     19.3 Dynamic Matrix: An Anay of Pointers (Advanced Topic)
     19.4 What You Should Remember
     19.5 Exercises
   20 Working with Poiners
     z0.l Pointers-Old and New Ideas
     20.2 Application: A Menu of Pointers to Functions (Advanced Topic)
     20.3 Using Pointers with Anays
     20.4 Insenion SOH
     20.5 What You Should Remember
     20.6 Exercises
   2l Reeursion
     21.l Storage Classes
     21.2 The Run-Time Stack (Advanced Topic)
     21.3 Iteration and Recursion
     21.4 A Simple Example of Recursion
     21.5 A More Complex Example: Binary Search
     21.6 Quicksort
     21.7 What You Should Remember 
     21.8 Exercises
   22 Making Programs Generol
     22.1 Command-Line Arguments
     22.2 Functions as Parameters
     22.3 What You Should Remember
     22.4 Exercises
   23 Modular Organization
     23.l Constructing a Modular Program
     23.2 Modular Application: Finding the Roots of an Equation
     23.3 What You Should Remember
     23.4 Exercises
   APPENDIXES
     A The ASCII Code
     8 The Precedenee of Operotors in C
     C Keywrds
     D Advoneed Aspeets of C Operotors
     D. l Assignment Combination Operators
     D.2 More on Lazy Evaluation and Skipping
     D.3 The Conditional Operator
     D.4 The Comma Operator
     D.5 Summary
     E Number Representotion and Conversien
     E.l Number Systems and Number Representation
     E.2 Signed and Unsigned Integers
     E.3 Representation of Real Numbers
     E.4 Base Conversion
     E.5 Self-Test Exercises
     F The tools Library
     F.1 Using the tools Library in a Program
     F.2 Ponability Command
     F.3 Functions Declared in tools.h and Defined in toole.c
     F.4 Process and Stream Management '
     F.5 Time and Date Functions
     F.6 Numeric Functions
     F.7 Strings and Menus
     G the Stondord C Environment
     G.l Built-in Facilities
     G.2 Standard Files of Constants
     G.3 The Standard Libraries and main ( )
     G.4 Libraries Not Explored
     H Glossary
     I Answers to Self-lest Exereises
     Index

伸缩显示:

[弹出查看]


	编辑荐语 [您可以向编辑推荐本书的亮点，采纳后奖励５－１０元优惠卷]（一个工作日内处理您的建议）

读者评论 w 查看本书所有书评

[发表您的书评，编辑将根据书评质量，予以相应的奖励]

(共0条)

关于我们 | 帮助 | 合作伙伴 | 我的帐户 | 图书馆 | 自考教材网 | 高校教材网
北京电话：010-68993821/88379639/88379641 邮箱：service@golden-book.com 传真：010-68990188
京ICP证060035号

专题 | 特价 | 书评 | 论坛 | 下载 | 新品 | 豆豆 | 鉴委会 | 共建 | 编辑博客 | 抢鲜预订 | 样章试读 | 名人签名 | 格子 | 播报

我的订单

关于配送

关于付款

售后服务

金书网