Problem solving and program design in C / Jeri R. Hanly, Elliot B. Koffman.
Material type:
TextPublication details: Boston : Pearson Addison Wesley, c2007.Edition: 5th edDescription: xviii, 920 p. : ill. ; 24 cmISBN: - 0321464648
- 9780321464644
- 005.133 22
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Books
|
Main library General Stacks | 005.133 / HA.P 2007 (Browse shelf(Opens below)) | 1 | Available | 000536 |
Browsing Main library shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005.133 / GO.S 1994 Schaum's outline of theory and problems of programming with Pascal ; | 005.133 / GR.D 2007 Data structures in Java : | 005.133 / HA.C 1997 C interfaces and implementations : | 005.133 / HA.P 2007 Problem solving and program design in C / | 005.133 / HA.P1990 Problem solving and program design in C / | 005.133 / HO.I 2006 Ivor Horton's beginning Visual C++ 2005 / | 005.133 / JA.M 2008 Model-based software testing and analysis with C# / |
Includes index.
1. Overview of Computers and Programming -- 2. Overview of C -- 3. Top-Down Design with Functions -- 4. Selection Structures: if and switch Statements -- 5. Repetition and Loop Statements -- 6. Modular Programming -- 7. Simple Data Types -- 8. Arrays -- 9. Strings -- 10. Recursion -- 11. Structure and Union Types -- 12. Text and Binary File Processing -- 13. Programming in the Large -- 14. Dynamic Data Structures -- 15. Multiprocessing Using Processes and Threads -- 16. On to C++
Problem Solving and Program Design in C is one of the best-selling introductory programming textbook using the C programming language for beginning programmers. It embraces a balanced approach to program development and an introduction to ANSI C. and provides a gradual introduction to pointers and covers programming with functions early in the text. In later chapters, students learn to implement fundamental data structures such as lists, stacks, queues, and trees in a language that fosters their understanding of stack- and heap-dynamic memory allocation and programmer-controlled pointers. To enhance students learning experience it offers the right amount of pedagogical features that include end-of-section and chapter exercises, examples and case studies, syntax and program style display boxes, error discussions and end-of-chapter projects.
1
There are no comments on this title.