An edition of C How to Program
(2007)
C How to Program, 9/e
C How to Program with Case Studies Introducing Application Programming and Systems Programming
Ninth Edition
by Paul J. Deitel and Harvey M. Deitel
- 36 Want to read
- 6 Have read
Share
×Close
C How to Program is a user-friendly, code-intensive introduction to C programming with case studies introducing applications and system programming. Like other texts of the Deitels' How to Program series, the book's modular presentation serves as a detailed beginner source of information for college students looking to embark on a career in coding, or instructors and software-development professionals seeking to learn how to program with C. The signature Deitel live-code approach presents concepts in the context of 142 full-working programs rather than incomplete snips of code. This gives you a chance to run each program as you study it and see how your learning applies to real-world programming scenarios.
Current standards, contemporary practice, and hands-on learning opportunities are integrated throughout the 9th Edition. Over 340 new integrated Self-Check exercises with answers allow you to test your understanding of important concepts, and check your code, as you read. New and enhanced case studies and exercises use real-world data and focus on the latest ACM/IEEE computing curricula recommendations, highlighting security, data science, ethics, privacy, and performance concepts.
Publish Date
Jun 22, 2021
Publisher
Pearson
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Showing 9 featured editions. View all 25 editions?
| Edition | Availability |
|---|---|
1
C How to Program, 9/e: C How to Program with Case Studies Introducing Application Programming and Systems Programming
Jun 22, 2021, Pearson
paperback
- Ninth Edition
0137398395 9780137398393
|
aaaa
|
2
|
eeee
|
3
|
eeee
|
4
|
eeee
|
5
|
eeee
|
6
|
eeee
|
7
|
eeee
|
8
|
eeee
|
9
|
eeee
|
Book Details
First Sentence
"Welcome to C—one of the world’s most senior computer programming languages and, according to the Tiobe Index, the world’s most popular.1 You’re probably famil- iar with many of the powerful tasks computers perform. In this textbook, you’ll get intensive, hands-on experience writing C instructions that command computers to perform those and other tasks. Software (that is, the C instructions you write, which are also called code) controls hardware (that is, computers and related devices)."
Table of Contents
Preface. vii
Before You Begin. xviv
Chapter 1. Introduction to Computers and C
1.1. Introduction
1.2. Hardware and Software
1.2.1. Moore’s Law
1.2.2. Computer Organization
1.3. Data Hierarchy
1.4. Machine Languages, Assembly Languages and High-Level Languages
1.5. Operating Systems
1.6. The C Programming Language
1.7. The C Standard Library and Open-Source Libraries
1.8. Other Popular Programming Languages
1.9. Typical C Program-Development Environment
1.9.1. Phase 1: Creating a Program
1.9.2. Phases 2 and 3: Preprocessing and Compiling a C Program
1.9.3. Phase 4: Linking
1.9.4. Phase 5: Loading
1.9.5. Phase 6: Execution
1.9.6. Problems That May Occur at Execution Time
1.9.7. Standard Input, Standard Output and Standard Error Streams
1.10. Test-Driving a C Application in Windows, Linux and macOS
1.10.1. Visual Studio 2019 on Windows 10
1.10.2. Xcode on macOS
1.10.3. GNU gcc on Linux
1.10.4. GCC Docker Container
1.11. Internet, World Wide Web, the Cloud and IoT
1.11.1. The Internet: A Network of Networks
1.11.2. The World Wide Web
1.11.3. The Cloud
1.11.4. The Internet of Things
1.12. Software Technologies
1.13. How Big Is Big Data?
1.13.1. Big-Data Analytics
1.13.2. Data Science Use Cases
1.14. Case Study—A Big-Data Mobile Application
1.15. AI—at the Intersection of CS and Data Science
Chapter 2. Intro to C Programming
2.1. Introduction
2.2. Printing a Line of Text
2.3. Adding Two Integers
2.4. Memory Concepts
2.5. Arithmetic in C
2.6. Equality and Relational Operators
2.7. Secure C Programming
Chapter 3. Structured Program Development
3.1. Introduction
3.2. Algorithms
3.3. Pseudocode
3.4. Control Structures
3.5. if Statement
3.6. if…else Statement
3.7. while Statement
3.8. Case Study 1: Counter-Controlled Iteration
3.9. Case Study 2: Sentinel-Controlled Iteration
3.10. Case Study 3: Nested Control Statements
3.11. Assignment Operators
3.12. Increment and Decrement Operators
3.13. Secure C Programming
Chapter 4. Program Control
4.1. Introduction
4.2. Iteration Essentials
4.3. Counter-Controlled Iteration
4.4. for Iteration Statement
4.5. Examples Using the for Statement
4.6. switch Multiple-Selection Statement
4.7. do…while Iteration Statement
4.8. break and continue Statements
4.9. Logical Operators
4.10. Equality (==) vs Assignment (=)
4.11. Structured-Programming Summary
4.12. Secure C Programming
Chapter 5. Functions
5.1. Introduction
5.2. Modularizing Programs in C
5.3. Math Library Functions
5.4. Functions
5.5. Function Definitions
5.5.1. square Function
5.5.2. maximum Function
5.6. Function Prototypes
5.7. Function-Call Stack and Stack Frames
5.8. Headers
5.9. Passing Arguments by Value and Reference
5.10. Random-Number Generation
5.11. Casino Game Case Study
5.12. Storage Classes
5.13. Scope Rules
5.14. Recursion
5.15. Fibonacci Series
5.16. Recursion vs Iteration
5.17. Secure Random-Number Generation
Case Study. The Tortoise and the Hare
Chapter 6. Arrays
6.1. Introduction
6.2. Arrays
6.3. Defining Arrays
6.4. Array Examples
6.4.1. Loop Initialization
6.4.2. Initializer Lists
6.4.3. Symbolic Constants
6.4.4. Summing Elements
6.4.5. Survey Results
6.4.6. Bar Charts
6.4.7. 60,000,000 Dice Rolls
6.5. Character Arrays and Strings
6.5.1. String Initialization
6.5.2. Initializer List of Characters
6.5.3. Accessing Characters
6.5.4. Input into Character Array
6.5.5. Outputting Strings
6.5.6. Demonstrations
6.6. Static vs Automatic Local Arrays
6.7. Passing Arrays to Functions
6.8. Sorting Arrays
6.9. Survey Data Analysis Case Study
6.10. Searching Arrays
6.10.1. Linear Search
6.10.2. Binary Search
6.11. Multidimensional Arrays
6.11.1. Two-Dimensional Arrays
6.11.2. Initialization
6.11.3. Setting One Row
6.11.4. Totaling Elements
6.11.5. Manipulations
6.12. Variable-Length Arrays
6.13. Secure C Programming
Chapter 7. Pointers
7.1. Introduction
7.2. Pointer Definitions and Initialization
7.3. Pointer Operators
7.4. Pass by Reference
7.5. const with Pointers
7.5.1. Uppercase Conversion
7.5.2. Printing Character by Character
7.5.3. Modifying Constant Pointer
7.5.4. Constant Pointer to Constant Data
7.6. Bubble Sort with References
7.7. sizeof Operator
7.8. Pointer Arithmetic
7.9. Pointers and Arrays
7.10. Arrays of Pointers
7.11. Card Shuffling Case Study
7.12. Function Pointers
7.13. Secure C Programming
Chapter 8. Characters and Strings
8.1. Introduction
8.2. Fundamentals of Strings and Characters
8.3. Character-Handling Library
8.3.1. Functions isdigit, isalpha, isalnum and isxdigit
8.3.2. Functions islower, isupper, tolower and toupper
8.3.3. Functions isspace, iscntrl, ispunct, isprint and isgraph
8.4. String-Conversion Functions
8.4.1. Function strtod
8.4.2. Function strtol
8.4.3. Function strtoul
8.5. Standard Input/Output Library Functions
8.5.1. Functions fgets and putchar
8.5.2. Function getchar
8.5.3. Function sprintf
8.5.4. Function sscanf
8.6. String-Manipulation Functions
8.6.1. Functions strcpy and strncpy
8.6.2. Functions strcat and strncat
8.7. Comparison Functions
8.8. Search Functions
8.8.1. Function strchr
8.8.2. Function strcspn
8.8.3. Function strpbrk
8.8.4. Function strrchr
8.8.5. Function strspn
8.8.6. Function strstr
8.8.7. Function strtok
8.9. Memory Functions
8.9.1. Function memcpy
8.9.2. Function memmove
8.9.3. Function memcmp
8.9.4. Function memchr
8.9.5. Function memset
8.10. Other String-Handling Functions
8.10.1. Function strerror
8.10.2. Function strlen
8.11. Secure C Programming
Case Study. Public-Key Cryptography
Chapter 9. Formatted Input/Output
9.1. Introduction
9.2. Streams
9.3. Formatting Output with printf
9.4. Printing Integers
9.5. Printing Floating-Point Numbers
9.5.1. Conversion Specifiers e, E and f
9.5.2. Conversion Specifiers g and G
9.5.3. Demonstrating Floating-Point Conversion Specifiers
9.6. Printing Strings and Characters
9.7. Other Conversion Specifiers
9.8. Field Widths and Precision
9.8.1. Field Widths for Integers
9.8.2. Precision for Integers, Floating-Point Numbers and Strings
9.8.3. Combining Width and Precision
9.9. printf Format Flags
9.9.1. Alignment
9.9.2. + Flag
9.9.3. Space Flag
9.9.4. # Flag
9.9.5. 0 Flag
9.10. Literals and Escape Sequences
9.11. Formatted Input with scanf
9.11.1. scanf Syntax
9.11.2. scanf Conversion Specifiers
9.11.3. Reading Integers
9.11.4. Reading Floating-Point Numbers
9.11.5. Reading Characters and Strings
9.11.6. Scan Sets
9.11.7. Field Widths
9.11.8. Skipping Characters
9.12. Secure C Programming
Chapter 10. Structures, Unions, Bit Manipulation and Enumerations
10.1. Introduction
10.2. Structure Definitions
10.2.1. Self-Referential Structures
10.2.2. Defining Variables
10.2.3. Structure Tag Names
10.2.4. Structure Operations
10.3. Initializing Structures
10.4. Accessing Members (. and ->)
10.5. Structures with Functions
10.6. typedef
10.7. High-Performance Card Shuffling
10.8. Unions
10.8.1. union Declarations
10.8.2. Allowed Operations
10.8.3. Initializing unions
10.8.4. Demonstrating unions
10.9. Bitwise Operators
10.9.1. Displaying Bits
10.9.2. Generic displayBits
10.9.3. AND, OR, XOR, Complement
10.9.4. Shift Operators
10.9.5. Bitwise Assignment
10.10. Bit Fields
10.10.1. Defining Bit Fields
10.10.2. Representing Card Attributes
10.10.3. Unnamed Bit Fields
10.11. Enumeration Constants
10.12. Anonymous Structures and Unions
10.13. Secure C Programming
Chapter 11. File Processing
11.1. Introduction
11.2. Files and Streams
11.3. Creating a Sequential-Access File
11.3.1. Pointer to a FILE
11.3.2. Using fopen to Open a File
11.3.3. Using feof to Check for End-of-File
11.3.4. Using fprintf to Write to a File
11.3.5. Using fclose to Close a File
11.3.6. File-Open Modes
11.4. Reading Data from a Sequential-Access File
11.4.1. Resetting the File Position Pointer
11.4.2. Credit Inquiry Program
11.5. Random-Access Files
11.6. Creating a Random-Access File
11.7. Writing Data Randomly to a Random-Access File
11.7.1. Positioning with fseek
11.7.2. Error Checking
11.8. Reading Data from a Random-Access File
11.9. Case Study: Transaction-Processing System
11.10. Secure C Programming
Case Study. Intro to NLP—Who Wrote Shakespeare’s Works?
Case Study. Machine Learning with GNU Scientific Library
Case Study. Time Series and Simple Linear Regression
Case Study. Web Services and the Cloud—libcurl and OpenWeatherMap
Chapter 12. Data Structures
12.1. Introduction
12.2. Self-Referential Structures
12.3. Dynamic Memory Management
12.4. Linked Lists
12.4.1. Function insert
12.4.2. Function delete
12.4.3. Functions isEmpty and printList
12.5. Stacks
12.5.1. Function push
12.5.2. Function pop
12.5.3. Applications of Stacks
12.6. Queues
12.6.1. Function enqueue
12.6.2. Function dequeue
12.7. Trees
12.7.1. Function insertNode
12.7.2. Traversals: inOrder, preOrder, postOrder
12.7.3. Duplicate Elimination
12.7.4. Binary Tree Search
12.7.5. Other Binary Tree Operations
12.8. Secure C Programming
Special Section. Systems Software Case Study—Building Your Own Compiler
Chapter 13. Sorting Algorithms and Big O
13.1. Introduction
13.2. Efficiency of Algorithms: Big O
13.2.1. O(1) Algorithms
13.2.2. O(n) Algorithms
13.2.3. O(n²) Algorithms
13.3. Selection Sort
13.3.1. Implementation
13.3.2. Efficiency
13.4. Insertion Sort
13.4.1. Implementation
13.4.2. Efficiency
13.5. Case Study: Merge Sort
13.5.1. Implementation
13.5.2. Efficiency
13.5.3. Comparing Big O Notations
Chapter 14. Preprocessor
14.1. Introduction
14.2. #include Directive
14.3. #define: Symbolic Constants
14.4. #define: Macros
14.4.1. Macro with One Argument
14.4.2. Macro with Two Arguments
14.4.3. Macro Continuation Character
14.4.4. #undef Directive
14.4.5. Standard-Library Macros
14.4.6. Side Effects in Macros
14.5. Conditional Compilation
14.5.1. #if…#endif
14.5.2. Commenting Code with #if
14.5.3. Debug Code Compilation
14.6. #error and #pragma
14.7. # and ## Operators
14.8. Line Numbers
14.9. Predefined Symbolic Constants
14.10. Assertions
14.11. Secure C Programming
Chapter 15. Other Topics
15.1. Introduction
15.2. Variable-Length Argument Lists
15.3. Command-Line Arguments
15.4. Compiling Multiple-Source Programs
15.4.1. extern Declarations
15.4.2. Function Prototypes
15.4.3. Restricting Scope with static
15.5. exit and atexit
15.6. Literal Suffixes
15.7. Signal Handling
15.8. calloc and realloc
15.9. goto
Appendix A. Operator Precedence Chart
Appendix B. ASCII Character Set
Appendix C. Multithreading/Multicore and C18/C11/C99 Topics
C.1. Introduction
C.2. Headers Added in C99
C.3. Designated Initializers and Compound Literals
C.4. Type bool
C.5. Complex Numbers
C.6. Macros with Variable-Length Arguments
C.7. Other C99 Features
C.7.1. Compiler Resource Limits
C.7.2. restrict Keyword
C.7.3. Reliable Integer Division
C.7.4. Flexible Array Members
C.7.5. Type-Generic Math
C.7.6. Inline Functions
C.7.7. func Identifier
C.7.8. va_copy Macro
C.8. C11/C18 Features
C.8.1. C11/C18 Headers
C.8.2. quick_exit Function
C.8.3. Unicode Support
C.8.4. _Noreturn Specifier
C.8.5. Type-Generic Expressions
C.8.6. Annex L: Undefined Behavior
C.8.7. Memory Alignment Control
C.8.8. Static Assertions
C.8.9. Floating-Point Types
C.9. Multithreading Performance Case Study
C.9.1. Sequential Execution Example
C.9.2. Multithreaded Execution Example
C.9.3. Other Multithreading Features
Appendix D. Intro to Object-Oriented Programming Concepts
D.1. Introduction
D.2. OOP Languages
D.3. Automobile as an Object
D.4. Methods and Classes
D.5. Instantiation
D.6. Reuse
D.7. Messages and Method Calls
D.8. Attributes and Instance Variables
D.9. Inheritance
D.10. OOAD
Index. 751
Edition Notes
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?