Pascal Programming

Overview

The aim of this book is to help the reader acquire and develop the skill of computer programming in a block structured language and foster an understanding of the related topics of data structures and data processing. Pascal Programming can be regarded as a complete text on programming and data structures. The contents are sufficient to give confidence to any reader who is studying Computer Studies to GCE Advanced level, BTEC National and Higher National awards, first year undergraduate level and British Computer...
See more details below
This Paperback (2ND, REVISED) is Not Available through BN.com
Sending request ...

Overview

The aim of this book is to help the reader acquire and develop the skill of computer programming in a block structured language and foster an understanding of the related topics of data structures and data processing. Pascal Programming can be regarded as a complete text on programming and data structures. The contents are sufficient to give confidence to any reader who is studying Computer Studies to GCE Advanced level, BTEC National and Higher National awards, first year undergraduate level and British Computer Society Part One examinations.
Read More Show Less

Product Details

  • ISBN-13: 9780826454294
  • Publisher: Continuum International Publishing Group
  • Publication date: 1/28/2001
  • Series: Letts Higher Education List Ser.
  • Edition description: 2ND, REVISED
  • Edition number: 2
  • Pages: 128
  • Product dimensions: 7.50 (w) x 9.80 (h) x 1.03 (d)

Table of Contents

Preface vii
1 Computer Environment 1
1.1 Programs, Data and Results 2
1.2 A Digital Computer 2
1.3 A Computer Model 2
1.4 Input and Output Units 2
1.5 Secondary Storage Units 3
1.6 Computer Languages 4
1.7 Language Translation 5
1.8 Operating Environment 5
1.9 Program Development Environment 6
1.10 Summary 7
1.11 Questions 8
2 Data 11
2.1 Memory 12
2.2 Integers 12
2.3 Reals 13
2.4 Characters 14
2.5 Variables 15
2.6 Variable Declaration 17
2.7 Constant Declaration 17
2.8 Data Declaration 17
2.9 Summary 19
2.10 Questions 19
3 Instruction Sequence 21
3.1 Assignment 22
3.2 Operator Precedence 24
3.3 Input of Data 25
3.4 Output of Results 25
3.5 Formatted Output 26
3.6 Compound Statement 26
3.7 Worked Examples 28
3.8 Syntax Diagrams 30
3.9 Summary 31
3.10 Questions 32
4 Data Types 35
4.1 Integrity of Data 36
4.2 Subrange Types 36
4.3 Enumerated Types 40
4.4 Scalar List Functions 41
4.5 Summary 42
4.6 Questions 43
5 Selection 45
5.1 If..then 46
5.2 Boolean Expressions 47
5.3 Boolean Operators 48
5.4 If..then..else 49
5.5 Nested Selections 51
5.6 Multiple Selection - Case 54
5.7 Summary 58
5.8 Questions 58
6 Repetition 61
6.1 Repeat..Until 62
6.2 For..Do 63
6.3 While..Do 66
6.4 Worked Example 67
6.5 Input of numeric data 69
6.6 Input of character data 70
6.7 Summary 73
6.8 Questions 73
7 Procedures 75
7.1 Procedure Format 76
7.2 Program Structure 76
7.3 Local Variables 80
7.4 Parameters 82
7.5 Forward Reference 87
7.6 Summary 88
7.7 Questions 88
8 Program Development 91
8.1 Program Design 92
8.2 Stepwise Refinement 93
8.3 Coding 96
8.4 Comments 97
8.5 Complete Program 97
8.6 Desk Check 100
8.7 Syntax Errors 102
8.8 Run-time Errors 102
8.9 Summary 107
8.10 Questions 107
9 Mathematics 111
9.1 Implicit Functions 112
9.2 Explicit Functions 112
9.3 Graphical Output 114
9.4 Random Numbers 119
9.5 Sets 123
9.6 Set Theory in Data Validation 127
9.7 Summary 128
9.8 Questions 129
10 Arrays 131
10.1 Advantages of Structured Data 132
10.2 One-dimensional Array 135
10.3 Packed Arrays 137
10.4 Text Input 137
10.5 Two-dimensional Arrays 143
10.6 Multi-dimensional Arrays 149
10.7 Summary 154
10.8 Questions 155
11 Sorting and Searching 157
11.1 Introduction 158
11.2 Sorting 158
11.3 Records 163
11.4 Sorting an array of records 168
11.5 Searching 171
11.6 Summary 177
11.7 Questions 178
12 Recursion 179
12.1 Definition 180
12.2 Worked Examples 180
12.3 Binary Search 186
12.4 Quicksort 189
12.5 Summary 194
12.6 Questions 194
13 Text Files 195
13.1 Why use files? 196
13.2 Text Files 196
13.3 File Processing Activities 197
13.4 Single Input/Output Files 198
13.5 Multiple File Processing 200
13.6 Report Writing 204
13.7 Summary 207
13.8 Questions 208
14 Pointers 211
14.1 Introduction 212
14.2 Pointers 212
14.3 Linked Lists 215
14.4 Linked List Maintenance 221
14.5 Summary 231
14.6 Questions 231
15 Dynamic Structures 233
15.1 Queues 234
15.2 Stacks 236
15.3 Reverse Polish Notation 240
15.4 Binary Trees 244
15.5 Binary Tree Maintenance 253
15.6 Summary 255
15.7 Questions 257
16 Record Files 261
16.1 File Creation and Inspection 262
16.2 Appending Records 265
16.3 Sorting a File of Records 269
16.4 The Read Ahead Problem 271
16.5 File Buffer Variable 273
16.6 Two-way File Merge 275
16.7 Variant Records 279
16.8 File Update 280
16.9 Summary 284
16.10 Questions 285
17 Common Extensions 291
17.1 String Data Type 292
17.2 String Procedures and Functions 293
17.3 String Processing 295
17.4 Direct Access Files 297
17.5 External Procedures 300
17.6 Summary 302
17.7 Questions 302
18 Turbo Units 303
18.1 What is a Unit? 304
18.2 Random Number Function Revisited 305
18.3 Modular (Unit) Programming 306
18.4 Standard Units 307
18.5 Morse-Code Revisited 307
18.6 Programmer and Standard Units 310
18.7 Summary 315
18.8 Questions 316
19 Object-oriented programming (OOP) 317
19.1 Abstract Data Types 318
19.2 Classes and Objects 321
19.3 Inheritance 324
19.4 Static and Virtual Methods 328
19.5 Polymorphism 330
19.6 Extensibility 334
19.7 Dynamic Objects 335
19.8 Summary 339
19.9 Questions 340
20 Case Studies in OOP 341
20.1 Case Study One 342
20.2 Mini-Composer Specification 342
20.3 Unit Design 345
20.4 Unit Implementation 349
20.5 Program Design 357
20.6 Program Implementation 358
20.7 Extensions 361
20.8 Case Study Two 362
20.9 Database Package Specification 362
20.10 Unit Design 367
20.11 Unit Implementation 370
20.12 Program Design 377
20.13 Program Implementation 378
20.14 Extensions 383
20.15 Summary 384
Appendices 385
1. Answers to selected self-test questions 386
2. Syntax Diagrams 436
Bibliography 447
Index 448
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
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted April 7, 2004

    Good

    Very good book, but a little outdated. Has nice examples, and is very easy.

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

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