Algorithms, Programming, PASCAL
Wadsworth Publishing Co Inc
Published on 31. January 1998
Book
Paperback/Softback
650 pages
978-0-534-06678-9 (ISBN)
Description
This text presents problem-solving techniques and rules of abstract programming in detail before language syntax. Part One gives students a solid foundation in conceptual problem-solving, language independent program design skills and algorithmic thinking. Part Two introduces the Pascal language as the vehicle for applying these concepts. Although Pascal is covered fully and effectively, the emphasis throughout is on programming and problem solving. Other features include: an entire chapter of algorithmic examples to demonstrate problems at a variety of levels of complexity; tracing exercises and examples in each Pascal chapter to show how algorithms form the basis for each program; debugging and Common Errors sections to aid the novice programmer; numerous practice exercises graded by level of difficulty; and case studies to show real-life applications. This book should be of interest to degree and diploma students on courses in Pascal programming.
This text presents problem-solving techniques and rules of abstract programming in detail before language syntax. Part One gives students a solid foundation in conceptual problem-solving, language independent program design skills and algorithmic thinking. Part Two introduces the Pascal language as the vehicle for applying these concepts. Although Pascal is covered fully and effectively, the emphasis throughout is on programming and problem solving. Other features include: an entire chapter of algorithmic examples to demonstrate problems at a variety of levels of complexity; tracing exercises and examples in each Pascal chapter to show how algorithms form the basis for each program; debugging and Common Errors sections to aid the novice programmer; numerous practice exercises graded by level of difficulty; and case studies to show real-life applications. This book should be of interest to degree and diploma students on courses in Pascal programming.
This text presents problem-solving techniques and rules of abstract programming in detail before language syntax. Part One gives students a solid foundation in conceptual problem-solving, language independent program design skills and algorithmic thinking. Part Two introduces the Pascal language as the vehicle for applying these concepts. Although Pascal is covered fully and effectively, the emphasis throughout is on programming and problem solving. Other features include: an entire chapter of algorithmic examples to demonstrate problems at a variety of levels of complexity; tracing exercises and examples in each Pascal chapter to show how algorithms form the basis for each program; debugging and Common Errors sections to aid the novice programmer; numerous practice exercises graded by level of difficulty; and case studies to show real-life applications. This book should be of interest to degree and diploma students on courses in Pascal programming.
More details
Language
English
Place of publication
Belmont, CA
United States
Publishing group
Cengage Learning, Inc
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 230 mm
Width: 190 mm
Weight
1204 gr
ISBN-13
978-0-534-06678-9 (9780534066789)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Content
Part One: Introduction: computers and problem solving. Problem definition. Pieces of algorithms. Recursive algorithms. Designing the algorithm. Case studies of algorithms. Some fundamental algorithms. More fundamental algorithms involving lists. Comparing and analyzing algorithms. The concept of data. Part Two: Introduction to Pascal programming. Structure of a Pascal program. Producing output from a program. Constants and variables. Input data from a keyboard. Procedures and the flow of data. Choosing alternatives. Arithmetic with integers. Indefinite iteration. Conditional expressions and Boolean variables. Definite iteration. Reals. Defining ordinal types. Functions. One-dimensional arrays. Multi-dimensional arrays. Arrays of arrays. Records. Sets. Files. Pointers and dynamic data. Other dynamic data structures. Other topics.