C How to Program: With Case Studies in Applications and Systems Programming, Global Edition, 9th edition

Published by Pearson (December 17, 2024) © 2025

  • Paul Deitel Deitel & Associates, Inc.
  • Harvey M. Deitel Deitel & Associates, Inc.

eTextbook in Pearson+

£29.99
due today
undefined
Products list
£29.99
Instant access

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

Table of contents

  • PART 1: (Introductory) Programming Fundamentals Quickstart
  • 1. Introduction to Computers and C: Test-Driving Microsoft Visual Studio, Apple Xcode, GNU gcc, and GNU gcc in a Docker container
  • 2. Intro to C Programming: Input, Output, Types, Arithmetic, Decision Making
  • 3. Structured Program Development: Algorithmic Development, Problem Solving, if, if/else, while
  • 4. Program Control: for, do/while, switch, break, continue, Logical Operators
  • 5. Functions: Custom Functions, Simulation, Random-Number Generation, Enumerations, Function Call and Return Mechanism, Recursion, Recursive Factorial, Recursive Fibonacci
  • PART 2: (Intermediate) Arrays, Pointers, and Strings
  • 6. Arrays: One- and Two-Dimensional Arrays, Passing Arrays to Functions, Searching, Sorting
  • 7. Pointers: Pointers operators and, Pass-By-Value vs. Pass-By-Reference, Array and Pointer Relationship
  • 8. Characters and Strings: C Standard Library String- and Character-Processing Functions
  • PART 3: (Intermediate) Formatted Input/Output, Structures, and File Processing
  • 9. Formatted Input/Output: scanf and printf formatting
  • 10. Structures, Unions, Bit Manipulation and Enumerations: Creating Custom Types with structs and unions, Bitwise Operators, Named Constants
  • 11. File Processing: Streams, Text and Binary Files, CSV Files, Sequential and Random-Access Files
  • PART 4: (Advanced) Algorithms and Data Structures
  • 12. Data Structures: Dynamic Memory Allocation and Deallocation, Lists, Stacks, Queues, Binary Trees
  • 13. Computer-Science Thinking: Sorting Algorithms and Big O Insertion Sort, Selection Sort, Merge Sort, Additional Algorithms including Quicksort in the Exercises
  • PART 5: (Advanced) Preprocessor and Other Topics
  • 14. Preprocessor: #include, Conditional Compilation, Macros with Arguments, Assertions
  • 15. Other Topics: Variable-Length Argument Lists, Command-line Arguments, Multiple-Source-Pile Programs, extern, exit/atexit, calloc/realloc, goto, Numeric Literal Suffixes, Signal Handling

Need help?Get in touch