Algorithms, programming, Pascal / Barbara Li Santi, Lydia Mann and Fred Zlotnick.
Material type:
TextPublication details: Belmont, California : Wadsworth Publishing Company, c1987Description: xix, 716 pages : illustrations ; 23 cmISBN: - 053406678X
- QA 76.73.P2 .L53 1987
Books
| Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
National University - Manila | LRC - Main General Circulation | Computer Science | GC QA 76.73.P2 .L53 1987 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002909 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
|
No cover image available | No cover image available |
|
No cover image available | No cover image available | No cover image available | ||
| GC QA 76.73.J39 .U45 2012 Modern Javascript : develop and design / | GC QA 76.73.P2 .C35 1993 Turbo Pascal programming 101 / | GC QA 76.73.P2 .E58 1992 Turbo Pascal for Windows bible / | GC QA 76.73.P2 .L53 1987 Algorithms, programming, Pascal / | GC QA 76.73.P2 .P67 1990 Stretching Turbo Pascal 5.5 / | GC QA 76.73.P2 .R55 1990 Advanced programming and data structures using PASCAL / | GC QA 76.73.P2 .S25 1991 c.1 Structures and abstractions : an introduction to computer science with Pascal / |
Includes index.
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.
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.
There are no comments on this title.