Home > Store

C for Programmers with an Introduction to C11

Register your product to gain access to bonus material or receive a coupon.

C for Programmers with an Introduction to C11

eBook (Watermarked)

  • Your Price: $36.79
  • List Price: $45.99
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.


  • Copyright 2013
  • Dimensions: 7" x 9-1/8"
  • Edition: 1st
  • eBook (Watermarked)
  • ISBN-10: 0-13-346209-9
  • ISBN-13: 978-0-13-346209-8

The professional programmer’s Deitel® guide to procedural programming in C through 130 working code examples

Written for programmers with a background in high-level language programming, this book applies the Deitel signature live-code approach to teaching the C language and the C Standard Library. The book presents the concepts in the context of fully tested programs, complete with syntax shading, code highlighting, code walkthroughs and program outputs. The book features approximately 5,000 lines of proven C code and hundreds of savvy tips that will help you build robust applications.

Start with an introduction to C, then rapidly move on to more advanced topics, including building custom data structures, the Standard Library, select features of the new C11 standard such as multithreading to help you write high-performance applications for today’s multicore systems, and secure C programming sections that show you how to write software that is more robust and less vulnerable. You’ll enjoy the Deitels’ classic treatment of procedural programming. When you’re finished, you’ll have everything you need to start building industrial-strength C applications.

Practical, example-rich coverage of:

  • C programming fundamentals
  • Compiling and debugging with GNU gcc and gdb, and Visual C++®
  • Key new C11 standard features: Type generic expressions, anonymous structures and unions, memory alignment, enhanced Unicode® support, _Static_assert, quick_exit and at_quick_exit, _Noreturn function specifier, C11 headers
  • C11 multithreading for enhanced performance on today’s multicore systems
  • Secure C Programming sections
  • Data structures, searching and sorting
  • Order of evaluation issues, preprocessor
  • Designated initializers, compound literals, bool type, complex numbers, variable-length arrays, restricted pointers, type generic math, inline functions, and more.

Visit www.deitel.com

Sample Content

Table of Contents

Preface xv

Chapter 1: Introduction 1

1.1 Introduction 2

1.2 The C Programming Language 2

1.3 CStandard Library 4

1.4 C++ and Other C-Based Languages 4

1.5 Typical C Program Development Environment 5

1.6 Test-Driving a C Application in Windows, Linux and Mac OS X 8

1.7 Operating Systems 16

Chapter 2: Introduction to C Programming 19

2.1 Introduction 20

2.2 ASimple C Program: Printing a Line of Text 20

2.3 Another Simple C Program: Adding Two Integers 24

2.4 Arithmetic in C 27

2.5 Decision Making: Equality and Relational Operators 31

2.6 Secure C Programming 35

Chapter 3: Control Statements: Part I 37

3.1 Introduction 38

3.2 Control Structures 38

3.3 The if Selection Statement 40

3.4 The if…else Selection Statement 40

3.5 The while Repetition Statement 43

3.6 Class Average with Counter-Controlled Repetition 44

3.7 Class Average with Sentinel-Controlled Repetition 46

3.8 Nested Control Statements 49

3.9 Assignment Operators 51

3.10 Increment and Decrement Operators 52

3.11 Secure C Programming 55

Chapter 4: Control Statements: Part II 57

4.1 Introduction 58

4.2 Repetition Essentials 58

4.3 Counter-Controlled Repetition 59

4.4 for Repetition Statement 60

4.5 for Statement: Notes and Observations 63

4.6 Examples Using the for Statement 64

4.7 switch Multiple-Selection Statement 67

4.8 do…while Repetition Statement 73

4.9 break and continue Statements 75

4.10 Logical Operators 77

4.11 Confusing Equality (==) and Assignment (=) Operators 80

4.12 Secure C Programming 81

Chapter 5: Functions 83

5.1 Introduction 84

5.2 Program Modules in C 84

5.3 Math Library Functions 85

5.4 Functions 86

5.5 Function Definitions 87

5.6 Function Prototypes: A Deeper Look 91

5.7 Function Call Stack and Stack Frames 94

5.8 Headers 97

5.9 Passing Arguments By Value and By Reference 98

5.10 Random Number Generation 99

5.11 Example: A Game of Chance 104

5.12 Storage Classes 107

5.13 Scope Rules 109

5.14 Recursion 112

5.15 Example Using Recursion: Fibonacci Series 116

5.16 Recursion vs. Iteration 119

5.17 Secure C Programming 121

Chapter 6: Arrays 122

6.1 Introduction 123

6.2 Arrays 123

6.3 Defining Arrays 124

6.4 Array Examples 125

6.5 Passing Arrays to Functions 138

6.6 Sorting Arrays 142

6.7 Case Study: Computing Mean, Median and Mode Using Arrays 144

6.8 Searching Arrays 149

6.9 Multidimensional Arrays 155

6.10 Variable-Length Arrays 162

6.11 Secure C Programming 165

Chapter 7: Pointers 167

7.1 Introduction 168

7.2 Pointer Variable Definitions and Initialization 168

7.3 Pointer Operators 169

7.4 Passing Arguments to Functions by Reference 172

7.5 Using the const Qualifier with Pointers 176

7.6 Bubble Sort Using Pass-by-Reference 182

7.7 sizeof Operator 185

7.8 Pointer Expressions and Pointer Arithmetic 188

7.9 Relationship between Pointers and Arrays 190

7.10 Arrays of Pointers 194

7.11 Case Study: Card Shuffling and Dealing Simulation 195

7.12 Pointers to Functions 199

7.13 Secure C Programming 204

Chapter 8: Characters and Strings 205

8.1 Introduction 206

8.2 Fundamentals of Strings and Characters 206

8.3 Character-Handling Library 208

8.4 String-Conversion Functions 213

8.5 Standard Input/Output Library Functions 217

8.6 String-Manipulation Functions of the String-Handling Library 221

8.7 Comparison Functions of the String-Handling Library 224

8.8 Search Functions of the String-Handling Library 225

8.9 Memory Functions of the String-Handling Library 231

8.10 Other Functions of the String-Handling Library 236

8.11 Secure C Programming 237

Chapter 9: Formatted Input/Output 238

9.1 Introduction 239

9.2 Streams 239

9.3 Formatting Output with printf 239

9.4 Printing Integers 240

9.5 Printing Floating-Point Numbers 241

9.6 Printing Strings and Characters 243

9.7 Other Conversion Specifiers 244

9.8 Printing with Field Widths and Precision 245

9.9 Using Flags in the printf Format Control String 247

9.10 Printing Literals and Escape Sequences 250

9.11 Reading Formatted Input with scanf 251

9.12 Secure C Programming 257

Chapter 10: Structures, Unions, Bit Manipulation and Enumerations 258

10.1 Introduction 259

10.2 Structure Definitions 259

10.3 Initializing Structures 262

10.4 Accessing Structure Members 262

10.5 Using Structures with Functions 264

10.6 typedef 264

10.7 Example: High-Performance Card Shuffling and Dealing Simulation 265

10.8 Unions 268

10.9 Bitwise Operators 270

10.10 Bit Fields 279

10.11 Enumeration Constants 282

10.12 Secure C Programming 284

Chapter 11: File Processing 285

11.1 Introduction 286

11.2 Files and Streams 286

11.3 Creating a Sequential-Access File 287

11.4 Reading Data from a Sequential-Access File 292

11.5 Random-Access Files 296

11.6 Creating a Random-Access File 297

11.7 Writing Data Randomly to a Random-Access File 299

11.8 Reading Data from a Random-Access File 302

11.9 Case Study: Transaction-Processing Program 303

11.10 Secure C Programming 309

Chapter 12: Data Structures 311

12.1 Introduction 312

12.2 Self-Referential Structures 312

12.3 Dynamic Memory Allocation 313

12.4 Linked Lists 314

12.5 Stacks 323

12.6 Queues 329

12.7 Trees 335

12.8 Secure C Programming 340

Chapter 13: Preprocessor 342

13.1 Introduction 343

13.2 #include Preprocessor Directive 343

13.3 #define Preprocessor Directive: Symbolic Constants 344

13.4 #define Preprocessor Directive: Macros 344

13.5 Conditional Compilation 346

13.6 #error and #pragma Preprocessor Directives 347

13.7 # and ## Operators 348

13.8 Line Numbers 348

13.9 Predefined Symbolic Constants 348

13.10 Assertions 349

13.11 Secure C Programming 349

Chapter 14: Other Topics 351

14.1 Introduction 352

14.2 Redirecting I/O 352

14.3 Variable-Length Argument Lists 353

14.4 Using Command-Line Arguments 355

14.5 Notes on Compiling Multiple-Source-File Programs 356

14.6 Program Termination with exit and atexit 358

14.7 Suffixes for Integer and Floating-Point Literals 359

14.8 Signal Handling 360

14.9 Dynamic Memory Allocation: Functions calloc and realloc 362

14.10 Unconditional Branching with goto 363

Appendix A: Operator Precedence Chart 365


Appendix B: ASCII Character Set 367


Appendix C: Number Systems 368

C.1 Introduction 369

C.2 Abbreviating Binary Numbers as Octal and Hexadecimal Numbers 372

C.3 Converting Octal and Hexadecimal Numbers to Binary Numbers 373

C.4 Converting from Binary, Octal or Hexadecimal to Decimal 373

C.5 Converting from Decimal to Binary, Octal or Hexadecimal 374

C.6 Negative Binary Numbers: Two’s Complement Notation 376

Appendix D: Sorting: A Deeper Look 378

D.1 Introduction 379

D.2 Big O Notation 379

D.3 Selection Sort 380

D.4 Insertion Sort 384

D.5 Merge Sort 387

Appendix E: Additional Features of the C Standard 394

E.1 Introduction 395

E.2 Support for C99 396

E.3 C99 Headers 396

E.4 Mixing Declarations and Executable Code 397

E.5 Declaring a Variable in a for Statement Header 397

E.6 Designated Initializers and Compound Literals 398

E.7 Type bool 401

E.8 Implicit int in Function Declarations 402

E.9 Complex Numbers 403

E.10 Variable-Length Arrays 404

E.11 Additions to the Preprocessor 407

E.12 Other C99 Features 408

E.13 New Features in the C11 Standard 411

E.14 Web Resources 422

Appendix F: Using the Visual Studio Debugger 425

F.1 Introduction 426

F.2 Breakpoints and the Continue Command 426

F.3 Locals and Watch Windows 430

F.4 Controlling Execution Using the Step Into, Step Over, Step Out and Continue Commands 432

F.5 Autos Window 434

Appendix G: Using the GNU Debugger 436

G.1 Introduction 437

G.2 Breakpoints and the run, stop, continue and print Commands 437

G.3 print and set Commands 442

G.4 Controlling Execution Using the step, finish and next Commands 444

G.5 watch Command 446

Index 449


Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020