Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

1-1 The Pascal Version of “Hello World!”
Syntax and Conventions
1-2 Displaying Output: WRITELN, WRITE
1-3 Working with Numbers
Real Division: /
Integer Division: DIV
Remainder of the Integer Division: MOD
Operator Precedence in Arithmetic Expressions
1-4 Variables
Variable Declaration
The Assignment Statement
1-5 Constants
1-6 Type Conversion: ROUND, TRUNC
1-8 Formatting Output
Summary
2-1 Overview of Data Types
2-2 Numeric Types
Numeric Types in Turbo Pascal
2-3 Arithmetic Functions
The Power Function
Application: Grocery Store
2-4 The CHAR Type
Standard Functions for Characters
Strings in Standard Pascal
2-5 The STRING Type
Declaration of a String
The Length of a String
2-6 The BOOLEAN Type
Simple Boolean Expressions
Compound Boolean Expressions
Truth Tables
Turbo Pascal Logical Operators
Precedence of Pascal Operators
3-1 Making Decisions
3-2 The Simple Decision: IF-THEN
Application: Pascal Credit Card
Using BEGIN-END Blocks
3-3 The IF-THEN-ELSE Construct
Application: A Character Tester
3-5 Nested Conditions
Tips on the IF-ELSE Puzzles
Application: A Vending Machine
Application: Number of Days in a Month
3-7 Unconditional Branching: GOTO
Infinite Loops
4-1 Loops
g The FOR loop
4-2 The FOR Loop
Application: Powers of Two
Application: The Average
4-3 Stepping Up and Stepping Down
Application: The Factorial
4-4 Nested Loops
4-5 The WHILE Loop
4-6 The REPEAT Loop
Application: Prime Numbers
5-1 Classification of Data Types in Pascal
5-2 Ordinal Data Types
Enumerations
Subranges
Restrictions on Using Enumerations and Subranges
5-3 The TYPE Section
Renaming Types
Naming User-Defined Types
5-4 Arrays
5-5 One-Dimensional Arrays
Application: Scores of One Student
Application: Displaying Tabulated Results
Application: Prime Numbers—Version 2
Declaration of Arrays in the Type Section
Application: Sorting an Array
5-6 Multidimensional Arrays
Application: Scores of Students
Array Initialization
6-1 Standard Input and Output Files
6-2 Tips on Output Statements
6-3 Tips on Input Statements
Application: Scrambling Letters
6-4 Reading a Line of Text: EOLN
Application: Character Counter
6-5 Reading a File of Text: EOF
Application: Frequency Counter
6-6 String Manipulation
Tips on String Input/Output
Application: Sorting Names
6-7 String Functions and Procedures
Table 6-1: String functions and procedures
LENGTH
CONCAT
COPY
INSERT
DELETE
7-1 Programs and Subprograms
7-2 Procedures
7-3 Procedure Definition
Passing Parameters to Procedures
Actual and Formal Parameters
Passing Parameters by Value and by Reference
7-4 Returning Values from Procedures: VAR
7-5 Global and Local Variables
Application: Sorting Procedure
7-6 Functions
Application: The Fibonacci Sequence
7-7 Tips on the Scope of Variables
7-8 Recursive Functions and Procedures
Exercises
g The SET data type
8-1 The SET Data Type
8-2 Declaration and Assignment: SET OF
Declaration Examples
8-3 Rules of Using Sets
8-4 Set Operators and Expressions
Union: +
Intersection: *
Difference: –
Tips on Using Set Operators
Relational Operators
Application: Text Analyzer
8-5 Records
Record Declaration
Accessing Record Fields
8-6 The WITH Statement
8-7 Nesting Records
9-1 The FILE Type
9-2 TEXT Files
The File Variable
File Parameters
Opening a File for Input: RESET
Closing the File: CLOSE
The EOF and EOLN Functions
Application: Disk-File Text Analyzer
9-4 Displaying TEXT Files
Reading a TEXT File as a Set of Strings
9-5 Creating a File: REWRITE
The Output Procedures: WRITE, WRITELN
Application: Employee File
Application: Payroll
9-6 Files of Other Types: FILE OF
Application: Payroll System
Appending a File
9-7 Using the File Buffer Variable: GET and PUT
10-1 Variant Records
10-2 Application: Enhanced Payroll System
Remarks
10-3 Deleting Records from the File
10-4 Updating Records
10-5 Enhance the Program Modularity
Suggestions
11-1 Dynamic Memory Allocation
11-2 Pointers
11-3 Pointer Operations
Assignment
Comparison
11-4 Pointers to Records
11-5 Passing Pointers as Parameters
List Declaration
Building a List
11-7 Storing Lists in Files
Application: Building a List of Records
11-9 Searching Lists
11-10 Deleting Nodes from Lists
11-11 Arranging Nodes in Sequential Order
Inserting Nodes
Searching an Ordered List
Application: The Final Linked List Database
g Sorting algorithms
12-1 Sorting Algorithms
12-2 Bubble Sort—Enhanced Version
The Swap Procedure
The Bubble Sort Procedure
The Bubble Sort Program
12-3 Quicksort Algorithm
The Divide and Conquer Procedure
The QuickSort Procedure
The QuickSort Program
12-4 Searching Algorithms
12-5 Linear Search
12-6 Binary Search
The BinarySearch Procedure
The Binary Search Program
12-7 Binary Search Trees
The Binary Tree Structure
Searching the Tree
Traversing the Tree
12-8 Programming Binary Trees
Tree Declaration
Building a Binary Search Tree
Testing the Tree
12-9 Application: Building and Printing a Binary Tree
12-10 Application: Sorting Data Files Using Binary Trees
The Search Function
The Search Program
The Next Step
0 of .
Results for:
P. 1
Learn Pascal

# Learn Pascal

Ratings: (0)|Views: 2,949|Likes:
Learn Pascal
Learn Pascal

See more
See less

10/07/2013

pdf

text

original