Oh! Pascal!: With Macintosh Program Disk / Edition 3

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

Feedback rating:

(8)

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.

Acceptable
New York, NY 1993 Trade paperback 3rd ed. Fair. Trade paperback (US). Glued binding.

Ships from: Pueblo West, CO

Usually ships in 1-2 business days

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

Overview

Welcome to the third edition of Oh! Pascal! Like its predecessors, Oh! Pascal! is an introduction to problem solving and programming. It requires absolutely no background in computing and remains, I hope, interesting enough to be read before the lecture instead of just before the exam. I had a lot of fun putting Oh! Pascal! together, and I think that you'll like working with it over the next few months.
Read More Show Less

Product Details

  • ISBN-13: 9780393963991
  • Publisher: Norton, W. W. & Company, Inc.
  • Publication date: 4/28/1993
  • Edition description: 3rd ed
  • Edition number: 3
  • Pages: 704
  • Product dimensions: 7.70 (w) x 10.02 (h) x 0.89 (d)

Table of Contents

Preface
Read Me First: A Look at Hardware and Software
Read Me Second: Studying a Program
Ch. 1 Input and Output, Storage and Change 1
1-2 Values and Variables 3
1-2 I/O Procedures and Arguments 9
1-3 Assignments and Expressions 19
1-4 Program Engineering Notes: Bugs and Beyond 30
Ch. 2 Subprograms: Reusable Solutions 43
2-1 Writing New Procedures 44
2-2 The Standard Functions 66
2-3 Declaring New Functions 72
2-4 Program Engineering Notes: Nailing Parameters 79
Ch. 3 Program Design 93
3-1 Planning and Design 94
3-2 Subprograms and Abstraction 101
3-3 Subprogram Nitty-Gritty 106
3-4 Program Engineering Notes: House of Style 112
Ch. 4 Looping and Control: the for Statement 117
4-1 Strictly Pascal 120
4-2 Standard Practices and Examples 125
4-3 Program Engineering Notes: Learning Doubt 137
Ch. 5 Making Choices: the if and case Statements 147
5-1 Strictly Pascal 148
5-2 Standard Practices and Examples 159
5-3 Program Engineering: Over-Engineering Software 172
Ch. 6 Conditional Loops: while and repeat 189
6-1 Strictly Pascal 190
6-2 Standard Practices: Loop Specification 200
6-3 Extended Examples: Mathematical Processing 213
6-4 Program Engineering Notes: Let's Get Robust 220
Ch. 7 Text Processing: a Detour 231
7-1 Strictly Pascal 232
7-2 Standard Practices: Streams and Filters 240
7-3 Program Engineering Notes: KISS 251
Ch. 8 Creating Values: Enumerations and Subranges 259
8-1 Creating New Values 262
8-2 Type Compatibility Rules 271
8-3 Program Engineering Notes: Saving States 273
Ch. 9 The array Type 281
9-1 Strictly Pascal 282
9-2 Standard Practices: Basic Array Loop Bounds 300
9-3 Extended Examples: Data Abstraction 309
9-4 Program Engineering Notes: Tools for Inspection 326
Ch. 10 Sorting and Searching: an Excursion into Algorithms 343
10-1 Searching 344
10-2 Sorting 355
10-3 Dijkstra's Dutch National Flag 362
10-4 Complexity and Performance 368
Ch. 11 The record Type 377
11-1 Strictly Pascal 378
11-2 Extended Examples: More Data Abstraction 387
11-3 Program Engineering Notes: Self-Describing Data 402
Ch. 12 Software Engineering 413
12-1 In the Small: Defensive Programming 414
12-2 In the Large: the Life Cycle 418
12-3 Program Correctness 427
Ch. 13 The file Type 435
13-1 Strictly Pascal 436
13-2 Standard Practices and Examples 443
13-3 Binary Files 453
13-4 Program Engineering Notes 459
Ch. 14 The set Type 471
14-1 Strictly Pascal 472
14-2 Standard Practices and Examples 477
Ch. 15 The Pointer Types 491
15-1 Strictly Pascal 492
15-2 Standard Practices: Basic Link Operations 506
15-3 Extended Examples: Stacks and Queues 522
15-4 Program Engineering Notes 537
Ch. 16 Recursive Programming 547
16-1 Recursive Procedures and Functions 548
16-2 Recursive Array Programming 560
16-3 Recursion and Pointers 571
Appendix A: A Few Details A1
Appendix B: Useful Procedures A14
Appendix C: Real Arithmetic A20
Appendix D: Pascal Pages A26
Index to Programs A45
Appendix E: About Software on the Diskette A49
Index A55
Software Installation
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)