A computer science tapestry : exploring programming and computer science with C++
Author(s)
Bibliographic Information
A computer science tapestry : exploring programming and computer science with C++
（McGraw-Hill computer science series）
McGraw-Hill, c2000
2nd ed
- : us : pbk
- : international ed
Available at 2 libraries
Note
Includes bibliographical references (p. 821-824) and index
Description and Table of Contents
- Volume
-
: international ed ISBN 9780071161787
Description
"A Computer Science Tapestry" is designed for use in a first course in computer science (CS1) that uses C++ as its programming language. This book covers basic concepts in programming, program design and computer science and gives students a good introduction to the C++ language. In the second edition, Astrachan has put more emphasis on object-oriented programming by introducing a graphics library and including a new chapter on object-oriented techniques. He has also added new case studies and "design tips."
Table of Contents
- Computer science and programming
- C++ programs - form and function
- design and implementation of simple programs
- control, functions, and classes
- iteration with programs and classes
- streams, iterators, and operators
- abstraction and information hiding
- arrays, data, and random access
- class design and implementation
- matrices and recursion
- sorting, searching, and templates
- dynamic data and pointers
- inheritance for object-oriented design and programming
- advanced topics - sets, trees and maps.
- Volume
-
: us : pbk ISBN 9780072322033
Description
Designed for use on an introductory C++ computer programming course, this text covers the basic concepts in program design and computer science, as well as giving a thorough grounding in C++ language. On completion students should be able to write and design their own programs.
Table of Contents
- Computer science programming. Part 1 Foundations of C++ programming: C++ programs - form and function
- C++ programs - input/process/output
- building programs and solving problems
- iteration with programs and classes. Part 2 Program and class construction: extending the foundation - sequential access - streams and iterators
- class design and implementation via simulation
- arrays, data, and random access.Part 3 Design, use, and analysis: building on the foundation -characters, strings, and streams - abstraction and information hiding
- recursion, scope, and lifetime
- sorting, algorithms, and matrices
- information hiding and dynamic data. Appendix: class declarations and implementations. Bibliography.
by "Nielsen BookData"