Overview

This 5-day, lecture-and-lab course for programmers who don’t know C, teaches fundamental C concepts such as control structures (if, if…else, switch, while, do…while, for), data types, operators, input/output, functions (user-defined and library), arrays, 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. Approximately 60% lecture and 40% laboratory exercises. 

Prerequisites

• Programming experience in a high-level programming language

Introduction to C Programming

• A Simple C Program: Printing a Line of Text
• Another Simple C Program: Adding Two Integers
• Memory Concepts
• Arithmetic in C
• Decision Making: Equality and Relational Operators

Structured Program Development in C

• Algorithms
• Pseudocode
• Control Structures
• The if Selection Statement
• The if…else Selection Statement
• The while Repetition Statement
• Formulating Algorithms Case Study 1: Counter-Controlled Repetition
• Formulating Algorithms with Top-Down, Stepwise Refinement
• Case Study 2: Sentinel-Controlled Repetition               
  • Formulating Algorithms with Top-Down, Stepwise Refinement
• Case Study 3: Nested Control Structures        
  • Assignment Operators
  • Increment and Decrement Operators

Program Control

• Repetition Essentials
• Counter-Controlled Repetition
• for Repetition Statement
• for Statement: Notes and Observations
• Examples Using the for Statement
• switch Multiple-Selection Statement
• do…while Repetition Statement
• break and continue Statements
• Logical Operators
• Confusing Equality (==) and Assignment (=) Operators
• Structured Programming Summary

Functions

• Program Modules in C
• Math Library Functions
• Functions
• Function Definitions
• Function Prototypes
• Function Call Stack and Activation Records
• Headers
• Calling Functions: Call-by-Value and Call-by-Reference
• Random Number Generation
• Example: A Game of Chance
• Storage Classes
• Scope Rules
• Recursion
• Example Using Recursion: Fibonacci Series
• Recursion vs. Iteration

Arrays

• Defining Arrays
• Array Examples
• Passing Arrays to Functions
• Sorting Arrays
• Case Study: Computing Mean, Median and Mode Using Arrays
• Searching Arrays
• Multiple-Subscripted Arrays

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

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

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

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

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).