Overview

This 5-day, lecture-and-lab course includes pointers, pointer arithmetic, function pointers, strings, optimizing memory use, improving execution performance, formatted I/O, structures, unions, enumerations, bit manipulation and file processing. The course offers extensive hands-on laboratory experience. Solutions are provided for laboratory exercises. The course includes approximately 60% lecture and 40% laboratory exercises. 

Prerequisites

• C101—Introduction to C for Non-Programmers: Part 1, or equivalent programming experience

Introduction

Review of C syntax and concepts presented in the following chapters of 

C How to Program, 6/e 

as part of the course C101—Introduction to C for Non-Programmers: Part 1.

 

• Chapter 2—Introduction to C Programming
• Chapter 3—Structured Program Development in C
• Chapter 4—C Program Control
• Chapter 5—C Functions
• Chapter 6—C Arrays

C Pointers

• Pointer Variable Definitions and Initialization
• Pointer Operators
• Passing Arguments to Functions by Reference
• Using the const Qualifier with Pointers
• Bubble Sort Using Call-by-Reference
• sizeof Operator
• Pointer Expressions and Pointer Arithmetic
• Relationship between Pointers and Arrays
• Arrays of Pointers
• Case Study: Card Shuffling and Dealing Simulation
• Pointers to Functions

C Characters and Strings

• Fundamentals of Strings and Characters
• Character-Handling Library
• String-Conversion Functions
• Standard Input/Output Library Functions
• String-Manipulation Functions of the String-Handling Library
• Comparison Functions of the String-Handling Library
• Search Functions of the String-Handling Library
• Memory Functions of the String-Handling Library
• Other Functions of the String-Handling Library

C Formatted Input/Output

• Streams
• Formatting Output with printf
• Printing Integers
• Printing Floating-Point Numbers
• Printing Strings and Characters
• Other Conversion Specifiers
• Printing with Field Widths and Precision
• Using Flags in the printf Format Control String
• Printing Literals and Escape Sequences
• Reading Formatted Input with scanf

C Structures, Unions, Bit Manipulations and Enumerations

• Structure Definitions
• Initializing Structures
• Accessing Members of Structures
• Using Structures with Functions
• typedef
• Example: High-Performance Card Shuffling and Dealing Simulation
• Unions
• Bitwise Operators
• Bit Fields
• Enumeration Constants

C File Processing

• Data Hierarchy
• Files and Streams
• Creating a Sequential-Access File
• Reading Data from a Sequential-Access File
• Random-Access Files
• Creating a Random-Access File
• Writing Data Randomly to a Random-Access File
• Reading Data from a Random-Access File
• Case Study: Transaction-Processing Program

 

Price

• $12,995 lecture fee for up to 20 students maximum. Add $1,000 for international or custom courses.
• Client purchases the books, at its own expense, directly from Pearson (the publisher) at the discounted Deitel rate.
  • Materials: C How to Program, 6/e (ISBN: 0132404168)
• Instructor Travel Reimbursement (if travel is required).