Description Problem Solving and Program Design in C is one of the best-selling introductory programming textbooks using the C programming language. It embraces a balanced approach to program development and an introduction to ANSI C. The book 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.
Features
Gradual introduction to pointers with a consistent emphasis on the connection between problem solving skills and effective software development.
Early coverage of functions, logical operators, and operators with side effects.
Inclusion of advanced programming topics in the “Multiprocessing Using Processes and Threads” chapter.
“On to C++” chapter provides an introduction to the C++ programming language.
End-of-section and end-of-chapter exercises, case studies and end-of-chapter projects offer practical learning opportunities at relevant points in the text.
A glossary provides quick access to important computing terms
New to This Edition
New Chapter 0 explains the various fields of study in CS, as well as the career paths available to those who major in CS-related disciplines.
Completely revised section on Hardware in chapter 1.
New and revised Case Studies
New and revised end-of chapter programming projects
Table of Contents 0. Computer Science as a Career Path 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++
Jeri Hanly is Emerita Lecturer in Computer Science at the University of Wyoming. She has also recently been on the faculty of the Computer Science Department at Loyola College in Maryland and Howard University.