Introduction to computer organization and data structures / Harold S. Stone
Material type:
TextPublication details: New York : McGraw Hill Education, c1972Description: 315 pages ; 24 cmSubject(s): LOC classification: - QA 76.6 .S76 1972
Books
| Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
National University - Manila | LRC - Annex Relegation Room | Computer Science | GC QA 76.6 .S76 1972 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002447 |
Browsing LRC - Annex shelves, Shelving location: Relegation Room, 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 | No cover image available | ||
| GC QA 76.6 .M85 1974 Multiprocessors and parallel processing / | GC QA 76.6 .S34 1982 Schaum's outline of theory and problems of computer and programming / | GC QA 76.6 .S74 1981 Using structured design : how to make programs simple, changeable, flexible, and reusable / | GC QA 76.6 .S76 1972 Introduction to computer organization and data structures / | GC QA 76.6 .T74 1979 An Introduction to computer science : an algorithmic approach / | GC QA 76.6 .T74 1981 c.1 An introduction to computer science : an algorithmic approach / | GC QA 76.6 .T74 1981 c.2 An introduction to computer science : an algorithmic approach / |
Includes bibliographical references and index.
1. algorithms, turing machines, and programs -- 2. basic aspects of computer organization -- 3. IBM system/360 and system/370 computer organization -- 4. address modification and logical operators -- 5. assemblers -- 6. data structures -- 7. subroutines, coroutines and parameters -- 8. input/output operations -- 9. linked data structures -- 10. rooted trees, recursive programs, and push-down stack machines -- 11. sorting and searching.
The purpose of this text is to introduce the student to the most primitive actions of a computer and then show how the primitive actions can be put together to construct most of the complex actions that computers regularly perform.
There are no comments on this title.