图书介绍
C++程序设计 程序设计和面向对象设计入门 第3版PDF|Epub|txt|kindle电子书版本网盘下载
![C++程序设计 程序设计和面向对象设计入门 第3版](https://www.shukui.net/cover/19/31495559.jpg)
- James P.Cohoon著;Jack W.Davidson著 著
- 出版社: 北京:清华大学出版社
- ISBN:7900637508
- 出版时间:2002
- 标注页数:953页
- 文件大小:85MB
- 文件页数:981页
- 主题词:
PDF下载
下载说明
C++程序设计 程序设计和面向对象设计入门 第3版PDF格式电子书版下载
下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台)。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用!后期资源热门了。安装了迅雷也可以迅雷进行下载!
(文件页数 要大于 标注页数,上中下等多册电子书除外)
注意:本站所有压缩包均有解压码: 点击下载压缩包解压工具
图书目录
Preface,v1
Chapter11
Computing and the object-oriented design methodology1
1.1 Basic computing terminology2
Self-check questions13
1.2 Software18
1.3 Engineering software24
1.4 Object-oriented design32
Self-check questions40
1.5 Points to remember41
1.6 To delve further43
1.7 Exercises44
Chapter 249
C++: The fundamentals49
2.1 Program organization50
2.2 A first program50
2.3 A second program52
2.4 Comments53
Self-check questions56
2.5 Assigning a value56
2.6 Fundamental C++ objects57
2.7 Constants61
Self-check questions69
2.8 Names69
2.9 Definitions73
Self-check questions76
2.10 Expressions77
Self-check questions87
2.10 Output statements88
2.12 Computing average velocity91
Self-check questions93
2.13 Points to remember95
2.14 Exercises98
Modifying objects103
Chapter 3103
3.1 Assignment104
3.2 Const definitions108
3.3 Input statements109
Self-check questions111
3.4 Computing the number of molecules in a hydrocarbon112
3.5 Compound assignment115
3.6 Increment and decrement117
Self-check questions119
3.7 Estimating yearly savings of change120
3.8 The string class122
Self-check questions128
3.9 Ezwindows130
3.10 Mowing lawns134
Self-check questions141
3.11 Points to remember141
3.12 Exercises146
Control constructs153
Chapter 4153
4.1 Boolean algebra154
4.2 A Boolean type156
Self-check questions161
4.3 Conditional execution using the if statement164
Self-check questions173
4.4 Conditional execution using the switch statement176
4.5 Computing a requested expression179
4.6 Validating a date181
Self-check questions188
4.7 Iteration using the while statement189
4.8 Simple string and character processing195
Self-check questions203
4.9 Iteration using the for construct204
4.10 Simple data visualization212
4.11 Solving the lazy hobo riddle214
4.12 Iteration using the do construct215
Self-check questions217
4.13 Points to remember218
4.14 Exercises222
Chapter 5233
Function basics233
5.1 Function basics234
5.2 The preprocessor243
Self-check questions246
5.3 Using software libraries246
5.4 The iostream library248
5.5 The iomanip library251
5.6 The fstream library258
5.7 Random numbers263
5.8 The assert library268
Self-check questions269
5.9 Points to remember272
5.10 To delve further275
5.11 Exercises275
Programmer-defined functions281
Chapter6281
6.1 Basics282
6.2 A tasty problem285
6.3 Some useful functions290
6.4 Integrating a quadratic polynomial293
6.5 The local scope296
6.6 The global scope299
Self-check questions301
6.7 Reference parameters304
6.8 Passing objects by reference312
6.9 Validating telephone access codes314
Self-check questions317
6.10 Constant parameters319
6.11 Default parameters321
6.12 Casting of function parameters323
6.13 Function overloading324
Self-check questions326
6.14 Recursive functions328
Self-check questions332
6.15 Displaying a price-interval stock chart333
6.16 Points to Remember342
6.17 To delve further345
6.18 Exercises345
Chapter7363
The class construct and object-oriented design363
7.1 Introducing a programmer-defined data type364
7.2 The RectangleShape class366
Self-check questions374
7.3 Using the RectangleShape class375
7.4 Constructors379
Self-check questions380
7.5 Building a kaleidoscope382
7.6 Object-oriented analysis and design387
7.7 Points to remember397
7.8 To delve further399
7.9 Exercises400
Chapter 8405
Implementing abstract data types405
8.1 Introducing abstract data types406
8.2 Rational ADT basics406
8.3 Rational interface description413
Self-check questions421
8.4 Implementing the rational class423
8.5 Copy construction, member assignment, and destruction430
Self-check questions435
8.6 ADT for pseudorandom integers437
8.7 Red-yellow-green game444
8.8 Points to remember461
8.9 Exercises465
Chapter 9471
Lists471
9.1 Named collections472
9.2 One-dimensional arrays472
Self-check questions483
9.3 Arrays as parameters485
9.4 Sorting488
Self-check questions493
9.5 Container classes494
9.6 Class vector497
9.7 QuickSort511
9.8 Binary searching516
9.9 String class revisited518
Self-check questions520
9.10 Find that word-exploring a two-dimensional list521
9.11 Maze runner525
9.12 Multidimensional arrays549
Self-check questions552
9.13 Points to remember553
9.14 Exercises558
The EzWindows API:a detailed examination565
Chapter 10565
10.1 Application programmer interfaces566
10.2 A simple window class567
10.3 The bitmap class577
10.4 Mouse events579
10.5 Bitmaps and mouse events583
10.6 Timer events586
10.7 Alert messages589
Self-check questions590
10.8 Simon says591
10.9 Points to remember607
10.10 Exercises608
Chapter11615
Pointers and dynamic memory615
11.1 Lvalues and rvalues616
11.2 Pointer basics616
Self-check questions626
11.3 Constant pointers and pointers to constants629
11.4 Arrays and pointers630
11.5 Character string processing633
11.6 Program command-line parameters637
Self-check questions639
11.7 Pointers to functions641
Self-check questions644
11.8 Dynamic objects645
11.9 A simple ADT for representing lists of integer values651
Self-check questions660
11.10 Points to remember661
11.11 Exercises665
Chapter12673
Testing and debugging673
12.1 Testing674
Self-check questions682
Self-check questions693
12.2 Debugging693
Self-check questions704
12.3 Points to remember705
12.4 To Delve Further705
12.5 Exercises706
Chapter13707
Inheritance707
13.1 Object-oriented design using inheritance708
13.2 Reuse via inheritance709
13.3 A hierarchy of shapes711
Self-check questions725
13.4 Protected members and inberitance727
13.5 Controlling inheritance730
Self-check questions732
13.6 Multiple inheritance735
Self-check questions743
13.7 A prettier kaleidoscope743
13.8 Points to remember756
13.9 Exercises759
Templates and polymorphism765
Chapter14765
14.1 Generic actions and types766
14.2 Function templates766
14.3 Class templates769
14.4 A simple list class using a class template770
Self-check questions778
14.5 Sequential lists779
14.6 Polymorphism801
Self-check questions801
14.7 Virtual function nuances804
14.8 Abstract base classes807
14.9 Virtual multiple inheritance810
Self-check questions812
14.10 Points to remember815
14.11 Exercises817
Chapter823
Software project-Bug Hunt!823
15.2 Base class Bug824
15.1 Bug hunt824
15.3 Class GameController839
15.4 Bug hunt842
Self-check questions843
15.5 Points to remember844
15.6 Exercises847
Appendix A849
Tables849
A.1 ASCII character set850
A.2 Operator precedence851
AppendixB853
Standard libraries853
B.1 Library naming and access854
B.2 Iostream library854
B.3 Stdlib library856
B.4 Math library856
B.5 Time library857
B.6 Cstring library858
B.7 Algorithm library860
Appendix C865
Standard classes865
C.1 Container Classes866
C.2 Class string871
Appendix D875
Advanced topics875
D.1 Namespaces876
D.2 Exception handling881
D.3 Friends888
Appendix E891
EzWindows API reference manual891
E.1 Enumerated types892
E.2 Coordinate system892
E.3 Class Position894
E.4 Class SimpleWindow894
E.6 Class RaySegment898
E.5 Class WindowObject898
E.7 Class Shape900
E.8 Class EllipseShape901
E.9 Class CircleShape902
E.10 Class RectangleShape902
E.11 Class TriangleShape904
E.12 Class SquareShape904
E.13 Class Label905
E.14 Class BitMap907
E.15 Class Randomlnt908
E.16 Miscellaneous functions909
Appendix F911
Projects and makefiles911
F.1 Project and makefile fundamentals912
F.2 Borland C++ IDE912
F.3 Microsoft Visual C++IDE920
F.4 UNIX Makefiles926
Index,933