book

Intermediate C Programming, 2nd Edition

Name: Intermediate C Programming, 2nd Edition
ISBN: 9781003832744

by Yung-Hsiang Lu, George K. Thiruvathukal

February 2024

Intermediate to advanced

432 pages

11h 23m

English

CRC Press

Read now

Unlock full access

Cover Page
Half-Title Page
Title Page
Copyright Page
Contents
List of Figures
List of Tables
Foreword for the First Edition
Recommendations for the First Edition
Preface

Acknowledgments
Source Code
Author and Artist
I Storage: Memory and File
1 Program Execution
1.1 Compile1.2 Redirect Output1.3 Problems1.3.1 Replace String1.3.2 Keep Third Column1.3.3 Find String in a File1.3.4 Sort by a Column1.3.5 gcc Warnings1.3.6 du command1.3.7 Show End of a File
2 Stack Memory
2.1 Values and Addresses2.2 Stack2.3 The Call Stack2.3.1 The Return Location2.3.2 Function Arguments2.3.3 Local Variables2.3.4 Value Address2.3.5 Arrays2.3.6 Retrieving Addresses2.4 Visibility2.5 Examine the Call Stack with DDD2.6 Problems2.6.1 Draw Call Stack I2.6.2 Draw Call Stack II2.6.3 Addresses
3 Prevent, Detect, and Remove Bugs
3.1 Rules in Software Development3.2 Developing Software ≠ Coding3.2.1 Before Coding3.2.2 During Coding3.2.3 After Coding3.3 Post-Execution and Interactive Debugging3.4 Separate Testing Code from Production Code3.5 Use assert Correctly3.6 How to Comment Code
4 Pointers
4.1 Scope4.2 The Swap Function4.3 Pointers4.4 Self Test: Pointers4.5 The Swap Function Revisited4.6 Type Errors4.7 Arrays and Pointers4.8 Type Rules4.9 Pointer Arithmetic4.10 Sizes of Data Types4.11 Problems4.11.1 Swap Function 14.11.2 Swap Function 24.11.3 Swap Function 34.11.4 Swap Function 44.11.5 Swap Function 54.11.6 15,552 Variations4.11.7 Pointer and Array
5 Writing and Testing Programs
5.1 Distinct Array Elements5.1.1 main Function5.1.2 areDistinct Function5.1.3 Compiling and Linking5.2 Build and Test Program with Multiple Files5.2.1 make and Makefile5.2.2 Test using make5.2.3 Generate Test Cases5.3 Detect Invalid Memory Access5.4 Test Coverage5.5 Limit Core Size5.6 Remove Large Files5.7 Problems5.7.1 Array Index5.7.2 gcov5.7.3 Test Coverage
6 Strings
6.1 Array of Characters6.2 String Functions in C6.2.1 Copy: strcpy6.2.2 Copy: strdup6.2.3 Compare: strcmp6.2.4 Find Substrings: strstr6.2.5 Find Characters: strchr6.3 Understand argv6.4 Count Substrings6.5 Problems6.5.1 Compare Strings6.5.2 Count Substring-16.5.3 Count Substring-2
7 Heap Memory
7.1 Allocate Memory using malloc7.2 Stack and Heap Memory7.3 Functions that Return a Heap Address7.4 Two-Dimensional Arrays in C7.5 Pointers and Function Arguments7.6 Problems7.6.1 free7.6.2 malloc7.6.3 Address of Stack Memory
8 Programming Problems Using Heap Memory
8.1 Sort an Array8.1.1 Generate Test Input and Expected Output8.1.2 Sort Integers8.1.3 Makefile8.1.4 Use valgrind to Detect Memory Leaks8.1.5 Use gcc -fsanitize to Detect Memory Leaks8.2 Sort Using qsort8.2.1 qsort8.2.2 The Comparison Function8.2.3 Execution Examples8.2.4 Sort Strings8.3 Problems8.3.1 Bubble Sort8.3.2 Selection Sort8.3.3 Comparison in qsort
9 Reading and Writing Files
9.1 Read from Files9.2 Write to Files9.3 Read and Write Strings
10 Programming Problems Using File
10.1 Sort a File of Integers10.2 Count the Occurrences of Characters10.3 Count the Occurrences of a Word10.4 Problems10.4.1 Determine Palindrome10.4.2 Compare Two Files10.4.3 fscanf and ftell
11 Array Index, Security, and Trends
11.1 Array Index11.2 Modify Program Behavior11.3 Trends in Programming Languages
12 Version Control
12.1 Version Control Overview12.2 git and github.com12.3 Create a Repository on github12.4 Sample Repository12.5 Use git and github.com12.6 Problems12.6.1 git commit and git push12.6.2 Revert to an earlier version12.6.3 When to commit?12.6.4 When to clone?12.6.5 Recover deleted file
II Recursion
13 Concept
13.1 Select Balls with Restrictions13.1.1 Balls of Two Colors13.1.2 Balls of Three Colors13.2 One-Way Streets13.3 The Tower of Hanoi13.4 Calculate Integer Partitions13.4.1 Count the Number of “1”s13.4.2 Odd Numbers Only13.4.3 Increasing Values13.4.4 Alternating Odd and Even Numbers13.5 Problems13.5.1 Parentheses13.5.2 Ball Selection13.5.3 Partition using Odd and Even Numbers
14 Recursive C Functions
14.1 Select Balls with Restrictions14.2 One-Way Streets14.3 The Tower of Hanoi14.4 Integer Partition14.5 Factorial14.6 Fibonacci Numbers14.7 Performance Profiling with gprof14.8 Problems14.8.1 Count Number of Calls: Original Definition14.8.2 Count Number of Calls: Efficient Recursion14.8.3 Parentheses14.8.4 Fibonacci Numbers
15 Integer Partition
15.1 Print Partitions15.2 Stack and Heap Memory15.3 Trace Recursive Function Calls15.4 Generate Partitions with Restrictions15.4.1 Using Odd Numbers Only15.4.2 Using Sequences of Increasing Numbers15.4.3 Using Alternating Odd and Even Numbers15.5 Problems15.5.1 Even Numbers Only15.5.2 Decreasing Values15.5.3 Error in partition15.5.4 Error in partition15.5.5 Error in partition
16 Programming Problems Using Recursion
16.1 Binary Search16.2 Quick Sort16.3 Permutations and Combinations16.4 Stack Sort16.5 An Incorrect Recursive Function16.6 Problems16.6.1 Shuffle Cards - 116.6.2 Shuffle Cards - 216.6.3 Shuffle Cards - 3
III Structure
17 Programmer-Defined Data Types
17.1 Struct and Object17.2 Objects as Arguments17.3 Objects and Pointers17.4 Constructors and Destructors17.5 Structures within Structures17.6 Binary Files and Objects17.7 Problems17.7.1 Structure and Pointer17.7.2 Structure and Attributes' Sizes17.7.3 Alternative Ways to Assign Attributes
18 Programming Problems Using Structure
18.1 Sort a Person Database18.2 Packing Decimal Digits18.3 Binary File and Pointer18.4 Problems18.4.1 Number Systems18.4.2 Structure with Pointer-118.4.3 Structure with Pointer-2
19 Linked Lists
19.1 Dynamic Data Structure19.2 Linked Lists19.3 Insert Data19.4 Search a Linked List19.5 Delete a Node from a Linked List19.6 Print a Linked List19.7 Destroy a Linked List
20 Programming Problems Using Linked List
20.1 Queues20.2 Sort Numbers20.3 Sparse Arrays20.4 Reversing a Linked List20.5 Doubly Linked List
21 Binary Search Trees
21.1 Binary Tree21.2 Binary Search Tree21.3 Insert Data into a Binary Search Tree21.4 Search a Binary Search Tree21.5 Print a Binary Tree21.6 Delete from a Binary Search Tree21.7 Destroy a Binary Tree21.8 Count the Different Shapes of a Binary Tree21.9 Problems21.9.1 Count Nodes21.9.2 Tree Height21.9.3 Check Binary Search Tree21.9.4 Ancestor-Offspring21.9.5 Build Binary Tree
22 Parallel Programming Using Threads
22.1 Parallel Programming22.2 POSIX Threads22.3 Subset Sum22.3.1 Sequential Solution22.3.2 Multiple-Threads Solution22.4 Interleave the Execution of Threads22.5 Thread Synchronization22.6 Amdahl's Law22.6.1 Speedup vs. Efficiency22.6.2 Understanding Amdahl's Law22.6.3 The Limit's of Amdahl's Law22.7 Problems22.7.1 Interleaving of Threads22.7.2 Interleaving of Threads
23 Unit Test
23.1 Google Test Framework23.2 Rational Numbers23.3 Rational Numbers and Operations23.3.1 Create Ratoinal Object23.3.2 Arithmetic Operations23.4 Use and Test Rational Numbers23.4.1 Use Rational Numbers23.4.2 Test Rational Numbers23.5 Testing Strategies
IV Applications
24 Find the Exit of a Maze
24.1 Maze File Format24.2 Strategy to Find Exit24.3 Implement the Strategy24.4 Problems24.4.1 Mark of Bricks24.4.2 Multiple Exits24.4.3 Order of Directions24.4.4 Change if Conditions
25 Sudoku
25.1 Sudoku Game25.2 Recursive Solution25.3 Implement the Solution25.4 Design Decisions25.5 Network Communication25.5.1 Server25.5.2 Client25.6 Problems25.6.1 Check Sudoku25.6.2 Transfer Large File
26 Image Processing
26.1 Structure for Image26.2 Image Pixels and Colors26.3 Color Filter26.4 Invert Colors26.5 Detect Edges26.6 Equalize Colors26.7 main Function26.8 Problems26.8.1 Color Histogram26.8.2 Color Space26.8.3 Gradient26.8.4 Vertical Mirror
27 Huffman Compression
27.1 Variable-Length Coding27.2 Compress27.2.1 Count and Sort Occurrences27.2.2 Build the Code Tree27.2.3 Create Code Book and Compress Data27.2.4 Describe the Coding Tree27.2.5 Use Bits27.3 Decompress27.4 Implementation27.4.1 Test Case Generator27.4.2 main Function27.4.3 Makefile27.4.4 Compression27.4.5 Decompression27.4.6 Compression Ratios27.5 Problems27.5.1 Compression Tree27.5.2 Compressed File27.5.3 Compressed File27.5.4 One-Letter Input27.5.5 Compressed File27.5.6 Number of Leaf Nodes27.5.7 Compression Ratio27.5.8 Tree Description27.5.9 Highest Possible Compression Ratio27.5.10 Lowest Possible Compression Ratio
Index
Epilogue: The Computer Engineer as Tool-User

Overview

Revised for a new second edition, Intermediate C Programming provides a stepping-stone for intermediate-level students to go from writing short programs to writing real programs well. It shows students how to identify and eliminate bugs, write clean code, share code with others, and use standard Linux-based tools.

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781003832744

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills