Introduction to Computer Science
Programming, Problem Solving and Data Structures
3rd Edition
Published on 1. March 1995
Book
Hardback
1100 pages
978-0-314-04556-0 (ISBN)
Description
A comprehensive introduction to the CS1 and CS2 sequence, this text uses standard Pascal throughout, with a Turbo Pascal appendix page-referenced to specific examples. The text meets A.C.M. guidelines for CS1 and CS2, including complete coverage of structured programming and problem solving, as well as advanced programming techniques like using abstract data types, trees, stacks, and queues. Features patient development of procedures and parameters after loops and conditional statements.
More details
Edition
3rd Revised edition
Language
English
Place of publication
Eagan
United States
Publishing group
Cengage Learning, Inc
Target group
College/higher education
Edition type
Revised edition
Illustrations
400col.ill.
Dimensions
Height: 260 mm
Width: 220 mm
Weight
2792 gr
ISBN-13
978-0-314-04556-0 (9780314045560)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition
Douglas W. Nance | Thomas L. Naps
Introduction to Computer Science
Programming, Problem Solving and Data Structures
Book
01/1999
2nd Edition
West Publishing Co
€44.76
Article exhausted; check different version
Content
Computer science, computer architecture, and computer languages; writing your first programs; arithmetic variables, input, constants and standard functions; designing and writing complete programs; selection statements; repetition statements; subprograms - writing procedures and functions; subprograms - using procedures and functions; text files and enumerated data types; one-dimensional arrays; arrays of more than one dimension; records; more about files; sets; algorithm analysis - space and time considerations; data - from abstraction to implementation; software engineering and the system life cycle; linked lists and pointers; stacks and queues; more about recursion; binary trees, general trees, and graphs; more powerful sorting methods; more powerful search methods.