Introduction to Computer Science with C++ / Edition 2

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 98%)
Other sellers (Hardcover)
  • All (16) from $1.99   
  • New (3) from $125.00   
  • Used (13) from $1.99   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$125.00
Seller since 2014

Feedback rating:

(181)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$299.99
Seller since 2007

Feedback rating:

(17)

Condition: New
MULTIPLE NEW COPIES AVAILABLE : DESCRIPTION: 1032 Pages: Course Technology; 2 edition (February 11, 2000) : This is the only C++ textbook on the market that provides complete ... coverage of CS1 and CS2 in one volume. This book focuses on traditional CS1 and CS2 topics, while developing object-oriented programs. The software life cycle is emphasized throughout, with numerous case studies of varying size and complexity. The first third of the book covers program design with calculation, functions, control structures, and the use of objects. Beginning in Chapter 8, the next third of the book covers user-defined classes, inheritance, polymorphism, arrays, complexity analysis, and the development of abstract data types (called ADTs). The last third of the book covers several standard ADTs - table, list, stack, queue, tree, and graph - including discussions of different implementations, applications, and the complexity of each ADT. Additional topics include recursion and advance sorting and searching techniques. Read more Show Less

Ships from: Phoenix, AZ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$400.00
Seller since 2014

Feedback rating:

(4)

Condition: New
053436893X NO PO BOX please. Shrink-wrapped. Shipped by courier. Need a code or CD? Double check ISBN. Publishers offer new books WITH & WITHOUT access codes. Buy NEW for valid ... textbook access code if applicable to your book. Any questions, please contact me. Thanks -Rod Read more Show Less

Ships from: Houston, TX

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

This is the only C++ textbook on the market that provides complete coverage of CS1 and CS2 in one volume. This book focuses on traditional CS1 and CS2 topics, while developing object-oriented programs. The software life cycle is emphasized throughout, with numerous case studies of varying size and complexity. The first third of the book covers program design with calculation, functions, control structures, and the use of objects. Beginning in Chapter 8, the next third of the book covers user-defined classes, inheritance, polymorphism, arrays, complexity analysis, and the development of abstract data types (called ADTs). The last third of the book covers several standard ADTs - table, list, stack, queue, tree, and graph - including discussions of different implementations, applications, and the complexity of each ADT. Additional topics include recursion and advance sorting and searching techniques.

Read More Show Less

Editorial Reviews

Booknews
This textbook for a two-semester sequence focuses on the traditional computer science topics, while addressing the skills required to develop object-oriented programs. The second edition introduces the use of AP classes for strings, vectors and matrices, and inserts material on struts before the discussion of user-defined classes. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780534368937
  • Publisher: Course Technology, Inc.
  • Publication date: 2/1/2000
  • Edition description: 2ND BK&DK
  • Edition number: 2
  • Pages: 1032

Table of Contents

1. COMPUTER SCIENCE, COMPUTER ARCHITECTURE, AND COMPUTER LANGUAGES Computer Science: A Preview / Computer Architecture / Computer Languages 2. PROBLEM SOLVING FUNDAMENTALS: DATA TYPES AND OUTPUT Program Development: Top-Down Design / Writing Programs / Data Types and Output / Summary / Programming Problems and Projects 3. MORE PROBLEM SOLVING FUNDAMENTALS: CALCULATION AND INPUT Arithmetic in C++ / Using Variables / Input / String Variables / Using Constants / Library Functions / Type Compatibility and Type Conversion / Summary / Programming Problems and Projects 4. SUBPROGRAMS: FUNCTIONS FOR PROBLEM SOLVING Program Design / User-Defined Functions / Parameters / Functions as Subprograms / Scope of Identifiers / Programmer-Defined Libraries / Summary / Programming Problems and Projects 5. SELECTION STATEMENT Boolean Expressions / if Statements / if . . . else Statements / Nested and Extended if Statements / switch Statements / Assertions / Summary / Programming Problems and Projects 6. REPETITION STATEMENTS Classifying Loops / for Loops / while Loops / do . . . while Loops / Loop Verification / Nested Loops / Repetition and Selection / Summary / Programming Problems and Projects 7. FILES Streams and Stream Processing / Using Functions with Files / Character Input and Output / Summary / Programming Problems and Projects 8. BUILDING STRUCTURED DATA: STRUCTS AND CLASSES The Struct Data Type / Introduction to User-Defined Classes / Object-Oriented Programming and Software Maintenance / A Rational Number Case / Derived Classes and Inheritance / Summary / Programming Problems and Projects 9. ARRAYS Arrays / Using Arrays / Array Parameters and Functions / Sorting and Searching an Array / Two-Dimensional Arrays / Safe Arrays: Vectors / Strings / Safe Arrays: Matrices / Summary / Programming Problems and Projects 10. ALGORITHM ANALYSIS: SPACE AND TIME CONSIDERATIONS Designing Programs: A Look Back and a Look Ahead / Simple Sorting Algorithms / Which Sort Is Best? A Big-O Analysis / The Time/Space Trade-off: Pointer Sort and Radix Sort / Simple Search Algorithms / Summary / Programming Problems and Projects 11. DATA ABSTRACTION AND OBJECT-ORIENTED SOFTWARE ENGINEERING The Ordered Collection Abstract Data Type / Sorted Collection / The One-Key Table Abstract Data Type / The Two-Key Table Abstract Data Type / Revisiting the Analysis Phase of the Software Engineering Life Cycle / Revisiting the Design Phase of the Software Engineering Life Cycle / Revisiting the Implementation and Testing Phases of the Software Engineering Life Cycle / Summary / Programming Problems and Projects 12. LINKED LISTS The Need for Linked Lists / The Concept of a Linked List / Defining the Linked List ADT as a C++ Class / Pointers and the Management of Computer Memory / Using a Linked List to Implement a One-Key Table / Summary / Programming Problems and Projects 13. STACKS AND QUEUES The Stack Abstract Data Type and Its Implementation / An Application of Stacks: Parsing and Evaluating Arithmetic Expressions / The Queue Abstract Data Type: Its Use and Implementations / Summary / Programming Problems and Projects 14. RECURSION Controlling Simple Iteration with Recursion / Weaving More Complex Recursive Patterns / Recursion, Trial-and-Error Backtracking, and Generalized Nested Loops 15. BINARY TREES, GENERAL TREES, AND GRAPHS General Trees and Binary Trees as Abstract Data Types / Linked Implementation of a Binary Tree / Binary Search Tree Implementation of a One-Key Table / Linear Implementation of the Binary Tree Abstract Data Type / General Trees / Graphs and Networks: Bidirectional Trees / Summary / Programming Problems and Projects 16. MORE POWERFUL SORTING METHODS The Shell Sort Algorithm / The Quick Sort Algorithm / The Heap Sort Algorithm / The Merge Sort Algorithm / Summary / Programming Problems and Projects 17. MORE POWERFUL SEARCH METHODS Density-Dependent Search Techniques / Two Abstract Data Types Revisited / Indexed Search Techniques (Optional) / APPENDICES / A. Reversed Words / B. Some Useful Library Functions / C. Syntax Diagrams / D. The ASCII Character Set / E. The AP Classes / GLOSSARY / ANSWERS TO SELECTED EXERCISES / INDEX

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)