Kelley-Pohl parts to be studied

This list is taken from the index of the book Pohl, I., and A. Kelley, (1998) A Book on C: 4th Edition, Addison/Wesley.

The listed chapters are the ones that are relevant for module A of the course "Fondamenti di Informatica e Laboratorio".

Other chapters might be of interest for module B of the same course.

Chapter 1
An Overview of C
1.1 Programming and Preparation
1.2 Program Output
1.3 Variables, Expressions, and Assignment
1.4 The Use of #define and #include
1.5 The Use of printf() and scanf()
1.6 Flow of Control
1.7 Functions
Call-by-Value
1.8 Arrays, Strings, and Pointers
1.9 Files

Summary
Exercises

Chapter 2: lexical Elements, Operators, and the C System

2.1 Characters and lexical Elements
2.2 Syntax Rules
2.3 Comments
2.4 Keywords
2.5 Identifiers
2.6 Constants
2.7 String Constants
2.8 Operators and Punctuators
2.9 Precedence and Associativity of Operators
2.10 Increment and Decrement Operators
2.11 Assignment Operators
2.12 An Example: Computing Powers of 2
2.13 The C System
The Preprocessor
The Standard library
Summary
Exercises

Chapter 3: The Fundamental Data Types
3.1 Declarations, Expressions, and Assignment
3.2 The Fundamental Data Types
3.3 Characters and the Data Type char
3.4 The Data Type int
3.5 The Integral Types short, long, and unsigned
3.6 The Floating Types
3.7 The Use of typedef
3.8 The sizeof Operator
3.11 Conversions and Casts
The Integral Promotions
The Usual Arithmetic Conversions
Casts
Summary
Exercises


Chapter 4 Flow of control
4.1 Relational, Equality, and logical Operators
4.2 Relational Operators and Expressions
4.3 Equality Operators and Expressions
4.4 logical Operators and Expressions
Short-circuit Evaluation
4.5 The Compound Statement
4.6 The Expression and Empty Statement
4.7 The if and the if-else Statements
4.8 The whi1e Statement
4.9 The for Statement
4.10 An Example: Boolean Variables
4.11 The Comma Operator
4.12 The do Statement
4.13 An Example: Fibonacci Numbers
Summary
Exercises


Chapter 5 Functions
5.1 Function Definition
5.2 The return Statement
5.3 Function Prototypes
5.4 An Example: Creating a Table of Powers
5.5 Function Declarations from the Compiler's Viewpoint
(skip "Limitations")
5.6 An Alternate Style for Function Definition Order
5.7 Function Invocation and Call-by-Value


5.8 Developing a Large Program
5.10 Scope Rules
5.14 Recursion
Efficiency Considerations
An Example: The Towers of Hanoi
Summary
Exercises



Chapter 6
Arrays, Pointers, and Strings
6.1 One-dimensional Arrays
6.2 Pointers
6.3 Call-by-Reference
6.4 The Relationship Between Arrays and Pointers
6.6 Arrays as Function Arguments
6.10 Strings
6.11 String-Handling Functions in the Standard Library
6.12 Multidimensional Arrays
Two-dimensional Arrays
The Storage Mapping Function
Formal Parameter Declarations
Three-dimensional Arrays
Initialization
The Use of typedef

6.14 Arguments to main
6.19 The Type Qualifier const
Summary
Exercises

Chapter 7 Bitwise Operators and Enumeration Types
7.5 Enumeration Types


Chapter 8 The Preprocessor
8.1 The Use of #include

Chapter 9 Structures and Unions
9.1 Structures
9.2 Accessing Members of a Structure
9.3 Operator Precedence and Associativity: A Final Look
9.4 Using Structures with Functions
9.5 Initialization of Structures
9.6 An Example: Playing Poker
9.7 Unions


Chapter 11
Input/Output and the Operating System
11.1 The Output Function printf
11.2 The Input Function scanf
11.3 The Functions fprintf, fscanf
11.4 The Functions fopen and fclose
11.7 Accessing a File Randomly